Local Langlands existence, RecTExists
drafted
Statement
The statement RecTExists is true. That is: let be a number field, an algebraic closure of , a valuation subring of , a finite place of , and h : IsPlaceOver A w. Then there is a map that satisfies the local condition IsRecT.
Lean
theorem UpperTheory.Zero.LLC.recTExists : UpperTheory.Zero.LLC.RecTExists
The declaration is in Development/AutomorphicArithmetic/Foundations/LocalLanglands/LocalCentralUnits/RecTExists.lean, line 20. Its page has the full list of what it uses and what uses it, and a link to the source.
Proof
The proof builds in two stages. First it defines a map on cuspidal classes. Then it extends to all classes by the Langlands classification. After that it checks the twelve laws of LawsT one by one.
Step 1. The local Artin map. The theorem artEx gives a homomorphism with IsLocalArtin h a. (artEx also says that is unique. The proof drops the uniqueness.) Inside, artEx uses localArtinExists_holds and globalArtinReciprocity_holds.
Step 2. A map on cuspidal classes. The theorem cuspEx gives a map with CuspT a ha r. The structure CuspT is a list of laws for on cuspidal classes only. It has the fields irr, dim, one, nu, absCentral, twist, central, dual, inj, depth and type. The laws twist, central, dual, inj and depth hold only for GoodCusp classes.
Step 3. Extension by segments. The theorem exists_isLExt takes two inputs, Pr.exh and Pr.multi, and the map . The input Pr.exh proves LanglandsExhaustionGL: each has a multisegment with IsL 𝔪 x.rep. The input Pr.multi proves LanglandsMultisegments: this multisegment is unique, plus a statement on subquotients of products. From these, exists_isLExt gives a map with IsLExt r rc. That is: for each list of segments with IsL l x.rep,
The same theorem says that each such agrees with on cuspidal classes. The proof records this as hcusp: whenever is cuspidal. (Inside exists_isLExt, is defined as for a multisegment chosen by choice.)
Step 4. Two transfer lemmas. The theorem extDim gives, for each : has dimension ; has the characteristic polynomials of the product over the supercuspidal support; for the central character ; and if is Good. The theorem extTw gives: commutes with the twists , and with twists by characters on Good classes.
Step 5. The twelve laws. The proof now gives , and ha, and fills the fields of LawsT.
dim,absCentralandcentralcome fromextDim.nuis the first part ofextTw.one: a character is cuspidal (IrrGL.isCusp_ofChar). So byhcusp, and is the class of by the lawoneofCuspT.langlands: let be a list of segments withIsL l x.rep. ByIsLExt, . The first element of each segment is cuspidal, so byhcusp. So , term by term.cusp: for cuspidal , byhcusp, and is irreducible by the lawirrofCuspT.twist: rewrite as the class of (as forone). Then use the second part ofextTw.dual,injanddepthare the theoremsextDual,extInjandextDepth, applied to and .type: the theoremtypeIffsays thatTypeLaw h rcis equivalent toTypeAt x (rc x)for each . So it suffices to showTypeAt x (rc x). InTypeAt, is the class of a representation that inflates a cuspidal representation of a finite group. Such is cuspidal, byIrrGL.isCusp_ofandisCuspidal_of_inflates. So byhcusp, and the lawtypeofCuspTgives the result.
This proves IsRecT h rc.
Notes
The theorem cuspEx does not build the local Langlands correspondence on all cuspidal classes. Its proof defines by cases. If is GoodCusp, then , where comes from goodMap. If is not GoodCusp, then is a class twisted by a real exponent . Here comes from junkEx: it is an irreducible class of dimension with , and (when ) not a twist of a tame class. The exponent comes from expo. It is quasiCharExponent of the central character of , divided by . So for a cuspidal class that is not GoodCusp, the value in this proof depends only on and on this exponent. The name junkEx says the same: these values are placeholders. This is allowed because IsRecT asks very little on such classes (see the local condition IsRecT). It shows that IsRecT does not determine the local Langlands correspondence.
The direct inputs artEx, cuspEx, exists_isLExt, Pr.exh, Pr.multi, extDim, extTw, extDual, extInj and extDepth have no step pages yet. Pr.exh and Pr.multi are one-line proofs from PositivityTheory.Exh.langlandsExhaustionGL_holds and PositivityTheory.Exh.langlandsMultisegments_holds. Their statements live in a folder called PublishedTheorems. They are proved in the code, not assumed.
The theorem is used by EveryCharacter from Row0b, as a field of OpenLiteratureStatements. Many theorems of the Galois row and the window branch also use it, for example localGlobalCompatAtIwahoriFixed_of_unlinked.
Uses
- The statement RecTExists, the step for
UpperTheory.Zero.LLC.RecTExists. - The local condition IsRecT, the step for
UpperTheory.Zero.LLC.IsRecT.
The proof also uses these declarations in a routine way, for example to unfold a definition or to pass an argument on: GlobalTheory.LocGL.IrrGL, GlobalTheory.LocGL.IrrGL.isCusp_of, GlobalTheory.LocGL.IrrGL.isCusp_ofChar, GlobalTheory.LocLanglands.segSum, GlobalTheory.SmGL.twist, UpperTheory.Zero.LLC.TypeAt, UpperTheory.Zero.LLC.typeIff.
The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: UpperTheory.Zero.LLC.artEx, UpperTheory.Zero.LLC.cuspEx, GlobalTheory.LocLanglands.exists_isLExt, UpperTheory.Zero.LLC.Pr.exh, UpperTheory.Zero.LLC.Pr.multi, UpperTheory.Zero.LLC.extDim, UpperTheory.Zero.LLC.extTw, UpperTheory.Zero.LLC.extDual, UpperTheory.Zero.LLC.extInj, UpperTheory.Zero.LLC.extDepth, DiscreteGroups.sglob.DzLc.isCuspidal_of_inflates.
Used by
Status
Drafted. The text follows the Lean code, but no person has checked it against the code with the rules of spec 05.7 yet. If you check it, tell us.
A model wrote the first draft (writer@claude-opus-5-5). A person checks it before its status goes up.
The source of this page. Markdown. Something is wrong? Report it.