The glossary
The Lean code uses long names. This page gives the names that a reader meets on the chapters and the steps, with what each one means. The name links to its declaration page, and the step links to the page that explains it.
Name spaces
A name space is the first part of a long name. It tells which part of the code a name belongs to.
CompanionTheory
CompanionTheory, namespace.
The declarations on real reductive groups, their discrete series and their Harish-Chandra modules.
In Math 2.0: Harish-Chandra module.
CrystallineSemistableComparison
CrystallineSemistableComparison, namespace.
The declarations that compare crystalline and semistable representations in p-adic Hodge theory.
In Math 2.0: p-adic Hodge theory.
DiscreteGroups
DiscreteGroups, namespace.
Declarations from the DiscreteGroups part of the library, on representations of groups over local and finite fields.
DiscreteGroups.sglob
DiscreteGroups.sglob, namespace, the meaning is not known yet.
Declarations from GlobalIrreducibility. The short name does not say its role.
DiscreteGroups.sglob.DzLc
DiscreteGroups.sglob.DzLc, namespace, the meaning is not known yet.
Lemmas on cuspidality of depth-zero representations, for example isCuspidal_of_inflates. The short name does not say its role.
Formalism
Formalism, namespace.
The definitions layer of the library. It is the second largest namespace.
Formalism.ConjugateSelfDual
Formalism.ConjugateSelfDual, namespace.
Basic notions for the Galois statements: the Galois group G, Qbar, IsPlaceOver and conjugate self-dual notions.
Formalism.HC
Formalism.HC, namespace, the meaning is not known yet.
Notions for characters and hosts, for example PChar and ZeroFreeAll. The short name does not say its role.
Formalism.L2
Formalism.L2, namespace, the meaning is not known yet.
A large namespace of lattice and counting notions. The short name does not say its role.
Formalism.L2.Host
Formalism.L2.Host, namespace.
Notions on unitary norms and Hecke characters, for example HChar.
Formalism.MainNotions
Formalism.MainNotions, namespace.
Main notions on families and bounds, for example Closed and LinkN.
Formalism.VW
Formalism.VW, namespace, the meaning is not known yet.
Four declarations on the step from zeta to the Riemann hypothesis: critLine, rh_of_every, rh_of_right and gammaFactor_ne_zero. The short name does not say its role.
GlobalTheory
GlobalTheory, namespace.
The largest namespace, with more than 540,000 declarations. Most come from AbelianVarietyTheory and AutomorphicSpectrum.
GlobalTheory.BigTop
GlobalTheory.BigTop, namespace, the meaning is not known yet.
Declarations on families, points and bounds for divisors. The short name does not say its role.
GlobalTheory.BigTop.Fun
GlobalTheory.BigTop.Fun, namespace.
Declarations on function conditions and grid fits, for example ConstantFunctionFits and Fld.
GlobalTheory.BigTop.Fun.Close
GlobalTheory.BigTop.Fun.Close, namespace.
Lemmas on closeness of fitted functions, for example fourier_coefficient_fit_of_join_alt.
GlobalTheory.ContraPair
GlobalTheory.ContraPair, namespace.
Declarations on polarized pairs and the relation DualIsConjBy.
GlobalTheory.CovTop
GlobalTheory.CovTop, namespace, the meaning is not known yet.
Declarations on covolume bounds, for example CovolumeBoundOfX. The short name does not say its role.
GlobalTheory.CuspRep
GlobalTheory.CuspRep, namespace.
Declarations on cuspidal automorphic representations, for example CuspSub.
In Math 2.0: Cusp form.
GlobalTheory.Fc
GlobalTheory.Fc, namespace, the meaning is not known yet.
Declarations on the third-place series, for example HypsAlt and DefiniteSideCondition. The short name does not say its role.
GlobalTheory.Fc.R1
GlobalTheory.Fc.R1, namespace, the meaning is not known yet.
Declarations on row statements, for example SlotNormCondition. The short name does not say its role.
GlobalTheory.Fc.RL
GlobalTheory.Fc.RL, namespace, the meaning is not known yet.
Declarations on linkage of rows, for example LinkedAt. The short name does not say its role.
GlobalTheory.Fc.S0
GlobalTheory.Fc.S0, namespace, the meaning is not known yet.
Declarations for the hypotheses node, for example NL, UnitaryGroupThirdPlaceHypotheses and OpenParameterStatements. The short name does not say its role.
GlobalTheory.Fc.S0.StageU
GlobalTheory.Fc.S0.StageU, namespace, the meaning is not known yet.
Two declarations for the final assembly of HypsAlt. The short name does not say its role.
GlobalTheory.Fc.StageOne
GlobalTheory.Fc.StageOne, namespace.
Two declarations for the first stage of the HypsAlt assembly.
GlobalTheory.FunPr
GlobalTheory.FunPr, namespace, the meaning is not known yet.
Two declarations, among them the record ThetaLocalInputs. The short name does not say its role.
GlobalTheory.GLq
GlobalTheory.GLq, namespace.
Declarations on over finite fields, for example Green.
GlobalTheory.Glob
GlobalTheory.Glob, namespace, the meaning is not known yet.
Declarations on global linkage of bundles. The short name does not say its role.
GlobalTheory.Glob.CovolRow
GlobalTheory.Glob.CovolRow, namespace.
Two declarations that link covolume bounds to rows.
GlobalTheory.GreenBridge
GlobalTheory.GreenBridge, namespace.
Declarations that connect published statements on regular characters to Green.
GlobalTheory.HeightCounting
GlobalTheory.HeightCounting, namespace.
Declarations on height counting.
GlobalTheory.HeightCounting.Up
GlobalTheory.HeightCounting.Up, namespace, the meaning is not known yet.
Declarations on extensions of parameters, for example extensionWithList. The short name Up does not say its role.
GlobalTheory.Hk3
GlobalTheory.Hk3, namespace, the meaning is not known yet.
Declarations on Howe duality, for example howeUnram_holds. The short name does not say its role.
In Math 2.0: Theta correspondence.
GlobalTheory.IndefiniteRowSideFullHecke
GlobalTheory.IndefiniteRowSideFullHecke, namespace.
A large namespace for the indefinite side of the theta argument with the full Hecke algebra.
GlobalTheory.IndefiniteRowSideFullHecke.LevelPlusSubgroup
GlobalTheory.IndefiniteRowSideFullHecke.LevelPlusSubgroup, namespace.
Declarations on separation of functionals, for example FunctionalsSeparate.
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels, namespace.
Declarations on tensor models of the Weil representation, for example ThetaIntegralsAgree and LocalMatching.
In Math 2.0: Weil representation.
GlobalTheory.LocGL
GlobalTheory.LocGL, namespace.
Declarations on smooth representations of over local fields, for example IrrGL.
GlobalTheory.LocLanglands
GlobalTheory.LocLanglands, namespace.
Declarations on local Langlands for , for example segSum and exists_isLExt.
In Math 2.0: Local Langlands conjectures.
GlobalTheory.Mem
GlobalTheory.Mem, namespace, the meaning is not known yet.
A large namespace of membership and parameter statements. The short name does not say its role.
GlobalTheory.Mem.LiteralAutomorphy
GlobalTheory.Mem.LiteralAutomorphy, namespace.
Declarations on grids and extensions for the literal automorphy branch.
GlobalTheory.Mem.Top
GlobalTheory.Mem.Top, namespace, the meaning is not known yet.
Declarations on evaluation conditions, for example EvLgG. The short name does not say its role.
GlobalTheory.Mem.Top.Bl
GlobalTheory.Mem.Top.Bl, namespace, the meaning is not known yet.
Declarations on parameters of dependence and geometry classes. The short name does not say its role.
GlobalTheory.NLink
GlobalTheory.NLink, namespace, the meaning is not known yet.
Declarations on linkage bounds, for example BoundAtTwoThreeFamilyFonAlt. The short name does not say its role.
GlobalTheory.Published
GlobalTheory.Published, namespace.
Named statements of published results. The proof takes them as fields of hypothesis records or proves them.
GlobalTheory.SmGL
GlobalTheory.SmGL, namespace.
Declarations on smooth representations of , for example twist.
GlobalTheory.T
GlobalTheory.T, namespace, the meaning is not known yet.
A flat bucket of about 48,000 theorems. The short name does not say its role.
GlobalTheory.WeilConv
GlobalTheory.WeilConv, namespace.
Three declarations on convergence of the Weil representation.
In Math 2.0: Weil representation.
GlobalTheory.WeilDeligne
GlobalTheory.WeilDeligne, namespace.
Declarations on Weil-Deligne representations, for example WD.
In Math 2.0: Weil group.
PositivityTheory
PositivityTheory, namespace.
Declarations from WeilBound on positivity and arithmetic intersection.
PositivityTheory.Pf1
PositivityTheory.Pf1, namespace, the meaning is not known yet.
Declarations with proofs of positivity statements. The short name does not say its role.
PositivityTheory.Pf1.HilbertSamuelMoriwaki
PositivityTheory.Pf1.HilbertSamuelMoriwaki, namespace.
Six declarations on the Hilbert-Samuel and Moriwaki statements.
SelfIntersectionVolumeEstimates
SelfIntersectionVolumeEstimates, namespace.
Twenty declarations on self-intersection and volume bounds, for example topCovolSlim2_use_alt_alt.
UpperTheory
UpperTheory, namespace.
The upper layer of the proof, from AutomorphicArithmetic. It holds EveryCharacter and the main branches.
UpperTheory.BaseChangeIdentities
UpperTheory.BaseChangeIdentities, namespace.
Declarations on base change from unitary groups to , for example baseChangeN.
UpperTheory.FinalTheorems
UpperTheory.FinalTheorems, namespace.
Three declarations at the top of the proof, for example everyCharacter.
UpperTheory.Gal
UpperTheory.Gal, namespace.
Declarations on Galois representations attached to automorphic representations.
In Math 2.0: Galois representation.
UpperTheory.Gal.Int
UpperTheory.Gal.Int, namespace, the meaning is not known yet.
Declarations that give the Galois row, for example recT and galoisLocalGlobalStrong_recParameter. The short name Int does not say its role.
UpperTheory.Gal.Int.Geo
UpperTheory.Gal.Int.Geo, namespace.
Declarations on the geometric input GeoOne.
UpperTheory.GalStar
UpperTheory.GalStar, namespace.
Declarations for the Galois row statements, for example Row0, Row0b and PropsB.
In Math 2.0: Galois representation.
UpperTheory.Lit
UpperTheory.Lit, namespace.
Results in the style of the literature, for example every_character_of_theta_integrals_local_matching.
UpperTheory.LiteratureTheorems
UpperTheory.LiteratureTheorems, namespace.
Named results, for example OpenLiteratureStatements and the theorems that take it.
UpperTheory.N
UpperTheory.N, namespace, the meaning is not known yet.
Declarations on linkage bounds from local Langlands, for example boundAtTwoThree_linked_of_recT. The short name does not say its role.
UpperTheory.One
UpperTheory.One, namespace, the meaning is not known yet.
Declarations that join the Galois row to the window, for example vwin_of_row. The short name does not say its role.
UpperTheory.One.Join
UpperTheory.One.Join, namespace.
Five declarations that join inputs into VWin.
UpperTheory.One.M
UpperTheory.One.M, namespace, the meaning is not known yet.
Declarations on rows, for example Row. The short name does not say its role.
UpperTheory.TP
UpperTheory.TP, namespace.
Declarations on theta lifts between unitary groups, for example TLiftK.
In Math 2.0: Theta correspondence.
UpperTheory.TP.K
UpperTheory.TP.K, namespace, the meaning is not known yet.
Five declarations, for example tLiftK. The short name does not say its role.
UpperTheory.Top
UpperTheory.Top, namespace.
Declarations at the top of the L-function argument, for example VWin and imprimitive.
UpperTheory.V
UpperTheory.V, namespace, the meaning is not known yet.
A large namespace for the window statement VWin.
UpperTheory.V.HV
UpperTheory.V.HV, namespace, the meaning is not known yet.
Declarations on heights and vanishing for VWin. The short name does not say its role.
UpperTheory.V.HV.Core
UpperTheory.V.HV.Core, namespace.
Three declarations, for example of_four_alt.
UpperTheory.V.HV.DescentVanishingReductions
UpperTheory.V.HV.DescentVanishingReductions, namespace.
Ten declarations on descent and vanishing, for example vwin_of_hypotheses_H_E_alt.
UpperTheory.Zero
UpperTheory.Zero, namespace, the meaning is not known yet.
Declarations that lead to local Langlands. The short name does not say its role.
UpperTheory.Zero.LLC
UpperTheory.Zero.LLC, namespace.
Declarations on local Langlands for , for example IsRecT, LawsT and recTExists.
In Math 2.0: Local Langlands conjectures.
UpperTheory.Zero.LLC.Pr
UpperTheory.Zero.LLC.Pr, namespace.
Eight theorems that prove published statements on representations of over local fields, for example exh and multi.
Names
DiscreteGroups.sglob.DzLc.isCuspidal_of_inflates
DiscreteGroups.sglob.DzLc.isCuspidal_of_inflates, theorem.
If a representation of , with , is inflated from a cuspidal representation of , then it is cuspidal.
In Math 2.0: Cuspidal representation.
Formalism.ConjugateSelfDual.G
Formalism.ConjugateSelfDual.G, abbrev.
The Galois group of over , written as the -algebra automorphisms of .
Formalism.ConjugateSelfDual.IsPlaceOver
Formalism.ConjugateSelfDual.IsPlaceOver, def.
The statement that the valuation subring of lies over the finite place of . It says that an integer of has valuation less than 1 for exactly when is in the prime ideal of .
Formalism.ConjugateSelfDual.Qbar
Formalism.ConjugateSelfDual.Qbar, abbrev.
An algebraic closure of .
In standard notation: .
Formalism.HC.PChar
Formalism.HC.PChar, structure.
A primitive Dirichlet character, with its modulus .
In Math 2.0: Dirichlet character.
Formalism.L2.Host.HChar
Formalism.L2.Host.HChar, abbrev.
The type of Hecke characters of a field, as a subtype.
In Math 2.0: Hecke character.
Formalism.MainNotions.Closed
Formalism.MainNotions.Closed, def.
The statement that holds for all small , for each family in the class whose constants are large enough. This is the "closed" of "closed bound".
In standard notation: .
Formalism.MainNotions.LinkN
Formalism.MainNotions.LinkN, def.
A bound on the sums etaSum for a family. There are and such that, for each and each index with ShaFinOdd, each lift obeys LinkN_at with the constant .
Formalism.VW.rh_of_every
Formalism.VW.rh_of_every, theorem.
Shows that UpperTheory.EveryCharacter implies the Riemann hypothesis. It uses the trivial character of modulus 1, whose L-function is , and then applies rh_of_right.
The step: The Riemann Hypothesis from EveryCharacter. In Math 2.0: Riemann hypothesis.
Formalism.VW.rh_of_right
Formalism.VW.rh_of_right, theorem.
If for all with , then the Riemann hypothesis holds. The proof uses the functional equation to move zeros from the left half of the strip to the right half.
The step: The Riemann Hypothesis from the right half-plane. In Math 2.0: Functional equation of the Riemann zeta function.
GlobalTheory.BigTop.Fun.Close.fourier_coefficient_fit_of_join_alt
GlobalTheory.BigTop.Fun.Close.fourier_coefficient_fit_of_join_alt, theorem.
Gets ConstantFunctionFits for Fld from seven inputs, among them ThetaLocalInputs, JoinOut, FunctionalsSeparate and LambdaLowerBound₂.
GlobalTheory.BigTop.Fun.ConstantFunctionFits
GlobalTheory.BigTop.Fun.ConstantFunctionFits, def.
The statement that there is such that, for each , a Closed statement on families holds. It says that, eventually at points with a grid for , the function condition holds for each .
GlobalTheory.BigTop.Fun.Fld
GlobalTheory.BigTop.Fun.Fld, def.
The function condition that ConstantFunctionFits uses. It says that there are and a choice of slope test data with a.OK.
GlobalTheory.ContraPair.PolarizedPair
GlobalTheory.ContraPair.PolarizedPair, structure.
The statement that is a polarized pair. The sign of at each infinite place is . Also, twisted by the inverse of composed with the norm has a nondegenerate invariant pairing with the complex conjugate of (DualIsConjBy).
GlobalTheory.CovTop.CovolumeBoundOfX
GlobalTheory.CovTop.CovolumeBoundOfX, def.
A covolume bound for families. It is Closed of a statement that, for some , a third-place bound holds eventually at all points for each .
GlobalTheory.CuspRep.CG.mk
GlobalTheory.CuspRep.CG.mk, def.
The class of a CuspSub in the quotient by isomorphism.
GlobalTheory.CuspRep.CuspSub
GlobalTheory.CuspRep.CuspSub, structure.
A nonzero irreducible stable subspace of cusp forms on over . It stands for a cuspidal automorphic representation.
In Math 2.0: Cusp form.
GlobalTheory.Fc.DefiniteSideCondition
GlobalTheory.Fc.DefiniteSideCondition, def.
A predicate on data , , , a bundle and two constants and , given as one long implication that ends in RowsU. It is the "definite side" of the theorem names.
GlobalTheory.Fc.HypsAlt
GlobalTheory.Fc.HypsAlt, structure.
A record of forty-six fields in Type 1. It holds a family class, a selection and many bounds and conditions on them. The trunk ends in one existence statement for this record.
GlobalTheory.Fc.R1.SlotNormCondition
GlobalTheory.Fc.R1.SlotNormCondition, def.
A row statement that applies a predicate N to the class D3 3 of each admissible selection.
GlobalTheory.Fc.RL.LinkedAt
GlobalTheory.Fc.RL.LinkedAt, def.
The statement that a row predicate holds for the bundle linkage of parameters p, with a large base condition.
GlobalTheory.Fc.S0.NL
GlobalTheory.Fc.S0.NL, def.
The predicate on family classes that HypsAlt uses: Closed of LinkN.
GlobalTheory.Fc.S0.OpenParameterStatements
GlobalTheory.Fc.S0.OpenParameterStatements, structure.
A record of twelve LinkedAt statements. The name says open, but the trunk proves them.
GlobalTheory.Fc.S0.RowRat
GlobalTheory.Fc.S0.RowRat, def.
A StepW statement from Start. At each step, it says that the row test RowTest holds when a list of conditions on the data holds.
GlobalTheory.Fc.S0.StageU.hypotheses_nonempty_of_unramified_exponents_alt
GlobalTheory.Fc.S0.StageU.hypotheses_nonempty_of_unramified_exponents_alt, theorem.
Shows that HypsAlt for NL and DefiniteSideCondition is nonempty. Its inputs are UnitaryGroupThirdPlaceHypotheses, RowRat, an EvLgG property and three LinkedAt statements.
GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses
GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses, structure.
A record of sixty Prop fields, each named after a published result on unitary groups and automorphic forms.
In Math 2.0: Unitary group.
GlobalTheory.Fc.S0.ontoX_and_lamLow_of_unitaryGroupHypotheses'
GlobalTheory.Fc.S0.ontoX_and_lamLow_of_unitaryGroupHypotheses', theorem.
Gets SurjectiveOntoX and LambdaLowerBound₂ from UnitaryGroupThirdPlaceHypotheses.
GlobalTheory.Fc.StageOne.rowFun_at_gridA_alt
GlobalTheory.Fc.StageOne.rowFun_at_gridA_alt, theorem.
Gets LinkedAt FunctionalCondition from five published inputs, ConstantFunctionFits and OpenParameterStatements.
GlobalTheory.FunPr.ThetaLocalInputs
GlobalTheory.FunPr.ThetaLocalInputs, structure.
A record of fifty-three Prop fields with names of published results, for example greenSeriesSt and linnik.
GlobalTheory.GLq.Green
GlobalTheory.GLq.Green, def.
A Green-type parametrization of cuspidal characters of . For each prime and , it gives a bijection from monic irreducible polynomials of degree with nonzero constant term to the cuspidal characters, with the expected degree.
In standard notation: .
GlobalTheory.Glob.CovolRow.linked_bundles_l3_of_open_alt
GlobalTheory.Glob.CovolRow.linked_bundles_l3_of_open_alt, theorem.
Gets LinkedAt for the third-place covolume series from CovolumeBoundOfX and OpenParameterStatements.
GlobalTheory.Glob.open_and_linked_of_stronger_extension_alt
GlobalTheory.Glob.open_and_linked_of_stronger_extension_alt, theorem.
Moves LinkedAt and OpenParameterStatements from an extension N to a stronger extension N'.
GlobalTheory.GreenBridge.green_of_regular
GlobalTheory.GreenBridge.green_of_regular, theorem.
Gets Green from the published statement GreenRegularCharacters.
GlobalTheory.HeightCounting.Up.extensionWithList
GlobalTheory.HeightCounting.Up.extensionWithList, def.
The extension extensionWithLaw with an extra ListPin datum.
GlobalTheory.HeightCounting.Up.extensionWithOrigin
GlobalTheory.HeightCounting.Up.extensionWithOrigin, def.
The extension extensionWithList with an extra OriginData datum.
GlobalTheory.Hk3.howeUnram_holds
GlobalTheory.Hk3.howeUnram_holds, theorem.
Proves HoweUnram, an unramified Howe duality statement.
In Math 2.0: Theta correspondence.
GlobalTheory.IndefiniteRowSideFullHecke.LevelPlusSubgroup.FunctionalsSeparate
GlobalTheory.IndefiniteRowSideFullHecke.LevelPlusSubgroup.FunctionalsSeparate, def.
A separation statement. For each there is such that, for the data at , each nonzero vector has a vector and a functional with Separates.
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.LocalMatching
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.LocalMatching, def.
The statement that each triple has matched local data.
In Math 2.0: Theta correspondence.
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.ThetaIntegralsAgree
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.ThetaIntegralsAgree, def.
A statement on theta integrals for each triple. It asks for decay and, for matched data, a constant and a coinvariant law, plus two recursion laws.
In Math 2.0: Theta correspondence.
GlobalTheory.LocGL.IrrGL
GlobalTheory.LocGL.IrrGL, abbrev.
The type of isomorphism classes of irreducible smooth representations of , for all together.
GlobalTheory.LocGL.IrrGL.isCusp_of
GlobalTheory.LocGL.IrrGL.isCusp_of, theorem.
The class of is cuspidal if and only if and is cuspidal.
In Math 2.0: Cuspidal representation.
GlobalTheory.LocGL.IrrGL.isCusp_ofChar
GlobalTheory.LocGL.IrrGL.isCusp_ofChar, theorem.
The class of a character of is cuspidal.
GlobalTheory.LocLanglands.exists_isLExt
GlobalTheory.LocLanglands.exists_isLExt, theorem.
From Langlands exhaustion and uniqueness of multisegments, extends each map r on cuspidal classes to a map rc on all irreducible classes. Each such extension agrees with r on cuspidal classes.
GlobalTheory.LocLanglands.segSum
GlobalTheory.LocLanglands.segSum, def.
The Langlands sum over a multisegment. For each segment it takes rc of the first cuspidal of , twists it by , and tensors it with the special representation .
In standard notation: .
GlobalTheory.Mem.LiteralAutomorphy.GridA
GlobalTheory.Mem.LiteralAutomorphy.GridA, def.
The grid condition GridAt at each stage tuple.
GlobalTheory.Mem.LiteralAutomorphy.evaluation_grid_of_join
GlobalTheory.Mem.LiteralAutomorphy.evaluation_grid_of_join, theorem.
Gets, from ten inputs, a constant such that EvLgG holds for GridA at each .
GlobalTheory.Mem.LiteralAutomorphy.extensionWithAtProperty
GlobalTheory.Mem.LiteralAutomorphy.extensionWithAtProperty, def.
An extension N with an extra proof of a property at the data.
GlobalTheory.Mem.LiteralAutomorphy.rowRatW_of_rowTest
GlobalTheory.Mem.LiteralAutomorphy.rowRatW_of_rowTest, theorem.
Gets RowRatW from AtDat of RowTest.
GlobalTheory.Mem.Top.Bl.SExt.none
GlobalTheory.Mem.Top.Bl.SExt.none, def.
The trivial extension datum. It is the constant type PUnit.
GlobalTheory.Mem.Top.Bl.anyGeometry
GlobalTheory.Mem.Top.Bl.anyGeometry, def.
The geometry predicate that is always true.
GlobalTheory.Mem.Top.Bl.geoCl
GlobalTheory.Mem.Top.Bl.geoCl, def.
The geometry class GeoCl of a predicate .
GlobalTheory.Mem.Top.Bl.parametersOfDependence
GlobalTheory.Mem.Top.Bl.parametersOfDependence, def.
The parameters of dependence. They come from extensionWithList with SExt.none and the geometry class of anyGeometry.
GlobalTheory.Mem.Top.EvLgG
GlobalTheory.Mem.Top.EvLgG, def.
The evaluation condition EvG for the large₂ property of the parameters.
GlobalTheory.NLink.BoundAtTwoThreeFamilyFonAlt
GlobalTheory.NLink.BoundAtTwoThreeFamilyFonAlt, def.
The statement that, for some and , BoundAtTwoThree holds for all and all data that satisfy SetupAlt.
GlobalTheory.SmGL.twist
GlobalTheory.SmGL.twist, def.
The twist of a representation by a character . It sends to .
GlobalTheory.T.open0_of_unitary_group_hypotheses
GlobalTheory.T.open0_of_unitary_group_hypotheses, theorem.
Gets OpenParameterStatements at the parameters of dependence from UnitaryGroupThirdPlaceHypotheses, for each RecTExists input and each .
GlobalTheory.T.test_vector_assembly_holds
GlobalTheory.T.test_vector_assembly_holds, theorem.
Gets AtDat of RowTest from nine inputs.
GlobalTheory.T.twisted_local_factors_match
GlobalTheory.T.twisted_local_factors_match, theorem.
Gets SquareSt.LocalMatching, the twisted version of LocalMatching, from HoweDualityReal, ThetaLocalInputs, ThetaIntegralsAgree and LocalMatching.
In Math 2.0: Theta correspondence.
GlobalTheory.T.twisted_square_theta_integrals_eq
GlobalTheory.T.twisted_square_theta_integrals_eq, theorem.
Gets SquareSt.ThetaIntegralsAgree, the twisted version of ThetaIntegralsAgree, from ThetaLocalInputs, ThetaIntegralsAgree and LocalMatching.
In Math 2.0: Theta correspondence.
GlobalTheory.WeilConv.twisted_weil_representation_convergence
GlobalTheory.WeilConv.twisted_weil_representation_convergence, theorem.
Gets WeilConvergence from SiegelSetUnitary. It takes ThetaLocalInputs as a second input but does not use it.
In Math 2.0: Weil representation.
GlobalTheory.WeilDeligne.WD
GlobalTheory.WeilDeligne.WD, def.
The type of isomorphism classes of Weil-Deligne representations. It is a quotient by isomorphism.
In Math 2.0: Weil group.
PositivityTheory.Pf1.HilbertSamuelMoriwaki.hsUse_outright
PositivityTheory.Pf1.HilbertSamuelMoriwaki.hsUse_outright, theorem.
Proves HSUse, a Hilbert-Samuel statement, without hypotheses.
PositivityTheory.Pf1.HilbertSamuelMoriwaki.moriwakiBig_outright
PositivityTheory.Pf1.HilbertSamuelMoriwaki.moriwakiBig_outright, theorem.
Proves MoriwakiBigStatement, a statement of Moriwaki on big arithmetic line bundles, without hypotheses.
SelfIntersectionVolumeEstimates.topCovolSlim2_use_alt_alt
SelfIntersectionVolumeEstimates.topCovolSlim2_use_alt_alt, theorem.
Gets CovolumeBoundOfX from fifteen named hypotheses. It depends on about 52,000 declarations.
UpperTheory.BaseChangeIdentities.baseChangeN
UpperTheory.BaseChangeIdentities.baseChangeN, theorem.
Proves BaseChangeIsobaricN, isobaric base change from unitary groups to .
In Math 2.0: Unitary group.
UpperTheory.EveryCharacter
UpperTheory.EveryCharacter, def.
The statement that no Dirichlet L-function has a zero with real part above . The only exception is the pole of the trivial character at . This is GRH for Dirichlet characters in half-plane form.
In standard notation: . The step: The statement EveryCharacter. In Math 2.0: Generalized Riemann hypothesis.
UpperTheory.FinalTheorems.everyCharacter
UpperTheory.FinalTheorems.everyCharacter, theorem.
Proves UpperTheory.EveryCharacter. It applies everyCharacter_of_row to the Galois row galoisLocalGlobalStrong_recParameter.
The step: EveryCharacter from the Galois row. In Math 2.0: Generalized Riemann hypothesis.
UpperTheory.FinalTheorems.everyCharacter_of_row
UpperTheory.FinalTheorems.everyCharacter_of_row, theorem.
Gets UpperTheory.EveryCharacter from the Galois row Row0b for IsRecT. It builds an OpenLiteratureStatements record from the row and recTExists, gets VWin from vwin_of_row, and then calls every_character_of_literature_of_vWin.
The step: EveryCharacter from Row0b. In Math 2.0: Generalized Riemann hypothesis.
UpperTheory.Gal.Int.Geo.geoOne_holds
UpperTheory.Gal.Int.Geo.geoOne_holds, theorem.
Proves GeoOne. GeoOne gives Galois representations for automorphic representations of definite unitary groups, with Frobenius, crystalline and Hodge-Tate conditions. The proof uses a holomorphic Lefschetz formula and depends on about 43,000 declarations.
In Math 2.0: Galois representation.
UpperTheory.Gal.Int.galoisLocalGlobalStrong_recParameter
UpperTheory.Gal.Int.galoisLocalGlobalStrong_recParameter, theorem.
Proves the Galois row Row0b for recT from the theta lift statement tLiftK. The name is misleading: it says Strong, but the conclusion is the weaker Row0b, not Row0.
The step: The Galois row holds. In Math 2.0: Galois representation.
UpperTheory.Gal.Int.galoisLocalGlobal_of_geometry_lift
UpperTheory.Gal.Int.galoisLocalGlobal_of_geometry_lift, theorem.
Gets the stronger row Row0 for recT from GeoOne and TLiftK.
In Math 2.0: Galois representation.
UpperTheory.Gal.Int.galoisRepresentations_of_thetaLift
UpperTheory.Gal.Int.galoisRepresentations_of_thetaLift, theorem.
Gets Row0b for recT from TLiftK. It uses geoOne_holds.
In Math 2.0: Galois representation.
UpperTheory.Gal.Int.recT
UpperTheory.Gal.Int.recT, def.
The reciprocity notion that Row0b uses in the trunk. It is IsRecT.
UpperTheory.GalStar.PropsB
UpperTheory.GalStar.PropsB, structure.
The list of properties that Row0b asks of a Galois representation . They are continuity, semisimplicity, local matching through Rc away from , Hodge-Tate weights from the infinitesimal character, a conjugate weight law, and a condition at the places above .
In Math 2.0: Galois representation.
UpperTheory.GalStar.Row0b
UpperTheory.GalStar.Row0b, def.
The Galois row statement for a notion Rc of local reciprocity map. For each CM field , prime , isomorphism and regular algebraic cuspidal with a polarizing Hecke character, it gives a Galois representation with the properties PropsB.
The step: The statement Row0b. In Math 2.0: Galois representation.
UpperTheory.Lit.every_character_of_theta_integrals_local_matching
UpperTheory.Lit.every_character_of_theta_integrals_local_matching, theorem.
Gets UpperTheory.EveryCharacter from seven inputs, among them ThetaIntegralsAgree (hA), LocalMatching (hM), RecTExists and VWin. The name is misleading: hA and hM go only into the HypsAlt record, not into the final argument.
The step: EveryCharacter from theta integrals and local matching. In Math 2.0: Generalized Riemann hypothesis.
UpperTheory.Lit.functionalsSeparate_of_howeUnram_of_siegelWeil
UpperTheory.Lit.functionalsSeparate_of_howeUnram_of_siegelWeil, theorem.
Gets FunctionalsSeparate from ThetaLocalInputs, HoweUnram and SiegelWeilUnitaryConvergent.
UpperTheory.Lit.nonempty_hyps_definite_side_of_closed_bound
UpperTheory.Lit.nonempty_hyps_definite_side_of_closed_bound, theorem.
Gets an element of HypsAlt for NL and DefiniteSideCondition from seven inputs. The seventh input is a closed bound: Closed applied to BoundAtTwoThreeFamilyFonAlt along the parameters of dependence.
The step: HypsAlt is nonempty from the closed bound.
UpperTheory.LiteratureTheorems.OpenImageCondition
UpperTheory.LiteratureTheorems.OpenImageCondition, structure.
A record with one field, the Galois row RowT. The name is misleading: it is not an open image condition. The proof never reads the field.
UpperTheory.LiteratureTheorems.OpenLiteratureStatements
UpperTheory.LiteratureTheorems.OpenLiteratureStatements, structure.
A record with three fields: two copies of the Galois row Row and one RecTExists. The name is misleading: the statements are not open, because the trunk proves all three fields.
The step: OpenLiteratureStatements.
UpperTheory.LiteratureTheorems.ar_degree_of_literature
UpperTheory.LiteratureTheorems.ar_degree_of_literature, theorem.
Proves ArDegree, an arithmetic degree statement. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.LiteratureTheorems.every_character_of_literature_of_vWin
UpperTheory.LiteratureTheorems.every_character_of_literature_of_vWin, theorem.
Gets UpperTheory.EveryCharacter from an OpenLiteratureStatements record O and VWin. It collects seven inputs and passes them to every_character_of_theta_integrals_local_matching.
The step: EveryCharacter from the literature and VWin. In Math 2.0: Generalized Riemann hypothesis.
UpperTheory.LiteratureTheorems.fargues_exact_of_literature
UpperTheory.LiteratureTheorems.fargues_exact_of_literature, theorem.
Proves FarguesExact, through UpperTheory.Lit.farguesExact. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.LiteratureTheorems.grothendieck_deformation_of_literature
UpperTheory.LiteratureTheorems.grothendieck_deformation_of_literature, theorem.
Proves GrothendieckDeformation. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.LiteratureTheorems.local_langlands_gl_recT_exists_of_literature
UpperTheory.LiteratureTheorems.local_langlands_gl_recT_exists_of_literature, theorem.
Gives RecTExists. The name is misleading: it does not use the literature. It passes twelve inputs to llOf_alt, which returns the first input, O.localLanglandsExists, and ignores the other eleven.
In Math 2.0: Local Langlands conjectures.
UpperTheory.LiteratureTheorems.nef_rr_of_literature
UpperTheory.LiteratureTheorems.nef_rr_of_literature, theorem.
Proves NefRR, a Riemann-Roch statement for nef bundles. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.LiteratureTheorems.poincare_lelong_inv_of_literature
UpperTheory.LiteratureTheorems.poincare_lelong_inv_of_literature, theorem.
Proves PoincareLelongInv, a Poincare-Lelong statement. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.LiteratureTheorems.point_separation_pair_of_literature
UpperTheory.LiteratureTheorems.point_separation_pair_of_literature, theorem.
Proves PointSeparationPair. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.LiteratureTheorems.principalisation_char_zero_of_literature
UpperTheory.LiteratureTheorems.principalisation_char_zero_of_literature, theorem.
Proves PrincipalisationCharZero, principalisation of ideals in characteristic zero. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.LiteratureTheorems.published_results_arithmetic
UpperTheory.LiteratureTheorems.published_results_arithmetic, theorem.
Builds the record PublishedHodgeBundleTheorems with its twenty-eight fields. It does not read O.
UpperTheory.LiteratureTheorems.published_results_eigen
UpperTheory.LiteratureTheorems.published_results_eigen, theorem.
Builds the record UnitaryGroupThirdPlaceHypotheses with its sixty fields. It reads O.
In Math 2.0: Unitary group.
UpperTheory.LiteratureTheorems.published_results_first
UpperTheory.LiteratureTheorems.published_results_first, theorem.
Builds the record ThetaLocalInputs with its fifty-three fields. It does not read O.
UpperTheory.LiteratureTheorems.resolution_char_zero_of_literature
UpperTheory.LiteratureTheorems.resolution_char_zero_of_literature, theorem.
Proves ResolutionCharZero, resolution of singularities in characteristic zero. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.LiteratureTheorems.semi_abelian_lie_seminegative_of_literature
UpperTheory.LiteratureTheorems.semi_abelian_lie_seminegative_of_literature, theorem.
Proves SemiAbelianLieSeminegative. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.LiteratureTheorems.siegel_toroidal_integral_of_literature
UpperTheory.LiteratureTheorems.siegel_toroidal_integral_of_literature, theorem.
Proves SiegelToroidalIntegral. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.LiteratureTheorems.theta_integrals_agree_and_local_matching_of_literature
UpperTheory.LiteratureTheorems.theta_integrals_agree_and_local_matching_of_literature, theorem.
Proves ThetaIntegralsAgree and LocalMatching through theoremK_head2. It does not read O.
In Math 2.0: Theta correspondence.
UpperTheory.LiteratureTheorems.toroidal_for_fan_ks_of_literature
UpperTheory.LiteratureTheorems.toroidal_for_fan_ks_of_literature, theorem.
Proves ToroidalForFanKS, a toroidal compactification statement. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.LiteratureTheorems.zarhin_statement
UpperTheory.LiteratureTheorems.zarhin_statement, theorem.
Proves ZarhinStatement, a statement of Zarhin type on Galois representations. It takes O but does not read it, because the proof is elsewhere.
UpperTheory.N.boundAtTwoThree_linked_of_recT
UpperTheory.N.boundAtTwoThree_linked_of_recT, theorem.
Gets, for each parameter p, LinkedAt of the closed bound Closed BoundAtTwoThreeFamilyFonAlt. It uses the NLink hypotheses.
UpperTheory.One.Join.automorphic_window_of_inputs
UpperTheory.One.Join.automorphic_window_of_inputs, theorem.
Gets VWin from an OpenImageCondition, isobaric base change BaseChangeIsobaricN and the row RowT.
In Math 2.0: Tate–Shafarevich group.
UpperTheory.One.M.Row
UpperTheory.One.M.Row, def.
A short name for Row0b with the reciprocity notion IsRecT.
In Math 2.0: Galois representation.
UpperTheory.One.vwin_of_row
UpperTheory.One.vwin_of_row, theorem.
Gets VWin from the Galois row Row0b for IsRecT. It applies automorphic_window_of_inputs to the row, baseChangeN and the row again.
The step: VWin from Row0b. In Math 2.0: Tate–Shafarevich group.
UpperTheory.TP.K.tLiftK
UpperTheory.TP.K.tLiftK, theorem.
Proves TLiftK. It is tLift_holds_k.
In Math 2.0: Theta correspondence.
UpperTheory.TP.TLiftK
UpperTheory.TP.TLiftK, def.
A theta lift statement between definite unitary groups. For a hermitian space of rank , a skew-hermitian space of large rank and an automorphic with given weights, it gives a lift .
In Math 2.0: Theta correspondence.
UpperTheory.Top.VWin
UpperTheory.Top.VWin, def.
The window statement VWinAt with constant 401, for every primitive Dirichlet character . It bounds weighted lengths of Tate-Shafarevich groups over the fields IsChiField.
The step: The window bound VWin. In Math 2.0: Tate–Shafarevich group.
UpperTheory.Top.VWinAt
UpperTheory.Top.VWinAt, def.
The window statement for one character . It applies for small , and to with .
In Math 2.0: Tate–Shafarevich group.
UpperTheory.Top.every_character_of_green_v_win
UpperTheory.Top.every_character_of_green_v_win, theorem.
Gets UpperTheory.EveryCharacter from Green, VWin and an element of HypsAlt. It applies imprimitive to zero_free_all_of_green_v_win.
The step: EveryCharacter from Green, VWin and HypsAlt. In Math 2.0: Generalized Riemann hypothesis.
UpperTheory.Top.imprimitive
UpperTheory.Top.imprimitive, theorem.
Gets the statement for all Dirichlet characters from ZeroFreeAll, which is about primitive characters only. It uses that an imprimitive L-function differs from the primitive one by finitely many Euler factors.
In Math 2.0: Euler product formula.
UpperTheory.Top.zeroFreeAll_of_topG
UpperTheory.Top.zeroFreeAll_of_topG, theorem.
Gets ZeroFreeAll from TopG, a number , and a host for each character. The proof bounds a weighted sum of von Mangoldt sums on windows and then uses FormB to exclude zeros.
In Math 2.0: Dirichlet L-function.
UpperTheory.Top.zero_free_all_of_green_v_win
UpperTheory.Top.zero_free_all_of_green_v_win, theorem.
Gets ZeroFreeAll from Green, VWin and an element of HypsAlt.
UpperTheory.V.HV.Core.of_four_alt
UpperTheory.V.HV.Core.of_four_alt, theorem.
Gets VWin from the rank-n literature input, LemmaK and four count statements.
UpperTheory.V.HV.DescentVanishingReductions.vwin_of_hypotheses_H_E_alt
UpperTheory.V.HV.DescentVanishingReductions.vwin_of_hypotheses_H_E_alt, theorem.
Gets VWin from HypothesesH'. It is the main fork of the window branch and depends on about 48,000 declarations.
UpperTheory.V.HV.vwin_of_counts
UpperTheory.V.HV.vwin_of_counts, theorem.
Gets VWin from Poitou-Tate duality, local finiteness, local Tate duality, LemmaK, ThmBab, ThmBcFree and five count statements.
UpperTheory.V.v_window_of_literal_automorphy_n
UpperTheory.V.v_window_of_literal_automorphy_n, theorem.
Gets VWin from LiteratureRankNHypothesis.
UpperTheory.Zero.LLC.IsRecT
UpperTheory.Zero.LLC.IsRecT, def.
The statement that rc is a local reciprocity map of the kind the proof needs. It says that there is a local Artin map such that rc obeys the laws LawsT for .
The step: The local condition IsRecT. In Math 2.0: Local Langlands conjectures.
UpperTheory.Zero.LLC.LawsT
UpperTheory.Zero.LLC.LawsT, structure.
Twelve laws for a map rc from irreducible representations of to Weil-Deligne classes. They include dimension, the Langlands sum over segments, twists, central character, duals, injectivity, depth and type, and some apply only to Good classes. The laws do not fix the local Langlands map uniquely and do not mention L-factors or -factors.
In Math 2.0: Local Langlands conjectures.
UpperTheory.Zero.LLC.Pr.exh
UpperTheory.Zero.LLC.Pr.exh, theorem.
Proves LanglandsExhaustionGL: each irreducible representation of comes from a multisegment. It uses PositivityTheory.Exh.langlandsExhaustionGL_holds.
In Math 2.0: Local Langlands conjectures.
UpperTheory.Zero.LLC.Pr.multi
UpperTheory.Zero.LLC.Pr.multi, theorem.
Proves LanglandsMultisegments: the multisegment of a representation is unique, with a statement about subquotients.
UpperTheory.Zero.LLC.RecTExists
UpperTheory.Zero.LLC.RecTExists, def.
The statement that each finite place of each number field has a map rc with IsRecT. It is an existence statement of local Langlands type.
The step: The statement RecTExists. In Math 2.0: Local Langlands conjectures.
UpperTheory.Zero.LLC.TypeAt
UpperTheory.Zero.LLC.TypeAt, def.
The type law at one representation . If and is inflated from a cuspidal representation of named by a regular character , then the Weil-Deligne class has the expected monodromy and inertia.
UpperTheory.Zero.LLC.artEx
UpperTheory.Zero.LLC.artEx, theorem.
Shows that there is exactly one local Artin map for a place. This is local class field theory in the form the proof needs.
UpperTheory.Zero.LLC.cuspEx
UpperTheory.Zero.LLC.cuspEx, theorem.
Gives a map on cuspidal classes that obeys the cuspidal laws CuspT. On cuspidal classes that are not GoodCusp the map uses placeholder values, so the laws there say little.
In Math 2.0: Cuspidal representation.
UpperTheory.Zero.LLC.extDepth
UpperTheory.Zero.LLC.extDepth, theorem.
For an extension rc, proves that a Good class of depth zero goes to a tame Weil-Deligne class.
UpperTheory.Zero.LLC.extDim
UpperTheory.Zero.LLC.extDim, theorem.
For an extension rc of a cuspidal map, proves the dimension law, the characteristic polynomial from the support, and the absolute determinant law. On Good classes it also proves the determinant equals the central character.
UpperTheory.Zero.LLC.extDual
UpperTheory.Zero.LLC.extDual, theorem.
For an extension rc, proves the dual law on Good classes.
UpperTheory.Zero.LLC.extInj
UpperTheory.Zero.LLC.extInj, theorem.
For an extension rc, proves injectivity on Good classes.
UpperTheory.Zero.LLC.extTw
UpperTheory.Zero.LLC.extTw, theorem.
For an extension rc, proves that rc commutes with twists by . On Good classes it also proves that rc commutes with twists by characters.
UpperTheory.Zero.LLC.recTExists
UpperTheory.Zero.LLC.recTExists, theorem.
Proves RecTExists. It builds rc from the local Artin map, a map on cuspidal classes, and its extension through Langlands multisegments, and then checks each law. On cuspidal classes that are not GoodCusp, the map takes placeholder values.
The step: Local Langlands existence, RecTExists. In Math 2.0: Local Langlands conjectures.
UpperTheory.Zero.LLC.typeIff
UpperTheory.Zero.LLC.typeIff, theorem.
Shows that the type law for rc is equivalent to TypeAt at every representation .
allChi
allChi, theorem.
States UpperTheory.EveryCharacter. It is a short name for UpperTheory.FinalTheorems.everyCharacter.
The step: EveryCharacter is true (allChi). In Math 2.0: Generalized Riemann hypothesis.
rhOfAll
rhOfAll, theorem.
Gets the Riemann hypothesis from the statement for every Dirichlet character. It applies Formalism.VW.rh_of_every to allChi.
The step: The Riemann Hypothesis from all characters. In Math 2.0: Riemann hypothesis.
riemannHypothesis
riemannHypothesis, theorem.
The final theorem of the proof. It states Mathlib's RiemannHypothesis and is proved as rhOfAll.
In standard notation: . The step: The Riemann Hypothesis. In Math 2.0: Riemann hypothesis.
The source of this page. Markdown. Something is wrong? Report it.