riemann

The Lean code claims a proof of the Riemann Hypothesis. This site has not checked the claim yet. See what is checked.

Local Langlands existence, RecTExists

drafted

Statement

The statement RecTExists is true. That is: let EE be a number field, Ω\Omega an algebraic closure of EE, AA a valuation subring of Ω\Omega, ww a finite place of EE, and h : IsPlaceOver A w. Then there is a map rc:Irr(Ew)→WD(h)rc : \mathrm{Irr}(E_w) \to \mathrm{WD}(h) 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 rcrc in two stages. First it defines a map rr on cuspidal classes. Then it extends rr 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 a:Wh→Ew×a : W_h \to E_w^\times with IsLocalArtin h a. (artEx also says that aa 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 r:Irr(Ew)→WD(h)r : \mathrm{Irr}(E_w) \to \mathrm{WD}(h) with CuspT a ha r. The structure CuspT is a list of laws for rr 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 rr. The input Pr.exh proves LanglandsExhaustionGL: each x∈Irr(Ew)x \in \mathrm{Irr}(E_w) has a multisegment 𝔪\mathfrak{m} 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 rcrc with IsLExt r rc. That is: for each list of segments ll with IsL l x.rep, rc(x)=segSum(r,l). rc(x) = \mathrm{segSum}(r, l). The same theorem says that each such rcrc agrees with rr on cuspidal classes. The proof records this as hcusp: rc(x)=r(x)rc(x) = r(x) whenever xx is cuspidal. (Inside exists_isLExt, rc(x)rc(x) is defined as segSum(r,𝔪)\mathrm{segSum}(r, \mathfrak{m}) for a multisegment 𝔪\mathfrak{m} chosen by choice.)

Step 4. Two transfer lemmas. The theorem extDim gives, for each xx: rc(x)rc(x) has dimension nn; rc(x)rc(x) has the characteristic polynomials of the product over the supercuspidal support; ∣det⁡rc(x)(σ)∣=∣ω(a(σ))∣|\det rc(x)(\sigma)| = |\omega(a(\sigma))| for the central character ω\omega; and det⁡rc(x)(σ)=ω(a(σ))\det rc(x)(\sigma) = \omega(a(\sigma)) if xx is Good. The theorem extTw gives: rcrc commutes with the twists ∣det⁡∣s|\det|^s, and with twists by characters on Good classes.

Step 5. The twelve laws. The proof now gives rcrc, aa and ha, and fills the fields of LawsT.

  • dim, absCentral and central come from extDim.
  • nu is the first part of extTw.
  • one: a character is cuspidal (IrrGL.isCusp_ofChar). So rc(χ)=r(χ)rc(\chi) = r(\chi) by hcusp, and r(χ)r(\chi) is the class of χ∘a\chi \circ a by the law one of CuspT.
  • langlands: let ll be a list of segments with IsL l x.rep. By IsLExt, rc(x)=segSum(r,l)rc(x) = \mathrm{segSum}(r, l). The first element Δ0\Delta_0 of each segment is cuspidal, so r(Δ0)=rc(Δ0)r(\Delta_0) = rc(\Delta_0) by hcusp. So segSum(r,l)=segSum(rc,l)\mathrm{segSum}(r, l) = \mathrm{segSum}(rc, l), term by term.
  • cusp: for cuspidal xx, rc(x)=r(x)rc(x) = r(x) by hcusp, and r(x)r(x) is irreducible by the law irr of CuspT.
  • twist: rewrite rc(χ)rc(\chi) as the class of χ∘a\chi \circ a (as for one). Then use the second part of extTw.
  • dual, inj and depth are the theorems extDual, extInj and extDepth, applied to rr and rcrc.
  • type: the theorem typeIff says that TypeLaw h rc is equivalent to TypeAt x (rc x) for each xx. So it suffices to show TypeAt x (rc x). In TypeAt, xx is the class of a representation σ\sigma that inflates a cuspidal representation τ\tau of a finite group. Such σ\sigma is cuspidal, by IrrGL.isCusp_of and isCuspidal_of_inflates. So rc(x)=r(x)rc(x) = r(x) by hcusp, and the law type of CuspT gives 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 rr by cases. If xx is GoodCusp, then r(x)=r0(x)r(x) = r_0(x), where r0r_0 comes from goodMap. If xx is not GoodCusp, then r(x)r(x) is a class JnJ_n twisted by a real exponent e(x)e(x). Here JnJ_n comes from junkEx: it is an irreducible class of dimension n≥2n \geq 2 with ∣det⁡Jn(σ)∣=1|\det J_n(\sigma)| = 1, and (when Ew≅ℚgE_w \cong \mathbb{Q}_g) not a twist of a tame class. The exponent e(x)e(x) comes from expo. It is quasiCharExponent of the central character of xx, divided by nn. So for a cuspidal class that is not GoodCusp, the value rc(x)rc(x) in this proof depends only on nn 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 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.