riemann

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

Isobaric base change holds

drafted

Statement

The statement BaseChangeIsobaricN holds. The theorem has no hypotheses.

In words: let EE be a CM field such that EE is unramified over its maximal real subfield E+E^+ at every finite place. Let n≥1n \ge 1, and let π\pi be an irreducible automorphic representation of the unitary group Un(𝔸E)U_n(\mathbb{A}_E). Then π\pi has an isobaric base change to GLn\mathrm{GL}_n over EE, with pieces of sizes N1+⋯+Nc=nN_1 + \dots + N_c = n, in the sense of IsBaseChangeN.

Lean

theorem UpperTheory.BaseChangeIdentities.baseChangeN : PositivityTheory.Rg.BcN.BaseChangeIsobaricN

The declaration is in Development/AutomorphicArithmetic/Foundations/BaseChangeIdentities/DefiniteNHolds.lean, line 5. Its page has the full list of what it uses and what uses it, and a link to the source.

Proof

The proof applies baseChangeN_of to candFin.

  1. baseChangeN_of has one hypothesis hCF : CandFin and proves BaseChangeIsobaricN. Its proof applies PositivityTheory.Rg.BcB.Plug2.bci_of to three theorems of the code: frameEx_of_fin uSide hCF, frameBound and frameRead.
  2. candFin proves CandFin. Its proof applies CF.candFin_of to seven theorems of the code: FinStrict_holds, StrictProd_holds, StrictJoin_holds, CandParts_holds, LevOpen_holds, IsoInv_holds and AdmProd_holds.

CandFin is a finiteness statement on candidate data. For a CM field EE unramified over E+E^+, an automorphic representation π\pi of UnU_n as above, a finite set SS of places and a "frame" F₀ for π\pi and SS, it says three things about the candidates F₀.Cand: for a set T′T' of places that are not split over E+E^+ and lie outside the sets F₀.d₀.S₀ and F₀.d₀.Bad, and for each w∈T′w \in T', the pairs (ξa,ξb)(\xi_a, \xi_b) with JEig (by its name, Jacquet eigenvalues) of the candidates lie in a finite set ZZ; at each place of F₀.d₀.S₀, the local products of the candidates fall into finitely many classes Dl j with the same subquotients and the same dimension of fixed vectors; and there is a uniform bound m0m_0 on a dimension of fixed vectors. This page does not unfold Frame0, Cand or the other names.

Notes

baseChangeN is a theorem of the code, not a hypothesis. VWin from Row0b passes it as the argument bc. Three other theorems also use it, for example UpperTheory.LiteratureTheorems.base_change_isobaric and UpperTheory.V.SmallClassNumbers.litN.

Uses

The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: UpperTheory.BaseChangeIdentities.baseChangeN_of, UpperTheory.HeckeLevelFrameExistence.candFin.

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.