riemann

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

The unitary group hypotheses

To read this chapter you need places of number fields, the local Langlands correspondence for GLn\mathrm{GL}_n, cusp forms, and the names of the Howe duality, Siegel-Weil and doubling theorems.

The unitary hypotheses chapter is the last node of the trunk. It takes seven inputs: two records of named results on unitary groups, the two theta inputs, a covolume bound, a map of local Langlands type and a "closed bound". From them it proves that the record HypsAlt (defined below) has an element.

Read first

The new objects

  • UnitaryGroupThirdPlaceHypotheses and ThetaLocalInputs are records of sixty and fifty-three statements named after the literature. They are hypotheses, not proofs.
  • A family has a parameter ε\varepsilon, a threshold, an index set IxI_x for each xx, data D(x,i)D(x, i) and many constants. Closed 𝒞\mathcal{C} PP means: for all small ε\varepsilon, PP holds for each family in the class 𝒞\mathcal{C} whose constants are large enough.
  • HypsAlt has forty-six fields: a family class, a selection of bundles and many rows of bounds, most of them closed. Its last field asks NL, the bound LinkN in the closed sense, on a weighted count of twisted places.
  • DefiniteSideCondition is the predicate of the definite rows. It is a long implication that ends in a row statement and never mentions a definite form.
  • RecTExists says that at each finite place of each number field some map satisfies the laws of IsRecT. It is the existence half of a local Langlands correspondence for GLn\mathrm{GL}_n.
  • CovolumeBoundOfX is a closed bound on a normalised log covolume, for one fixed class of families.
  • The branches end in OpenParameterStatements (twelve row statements), SurjectiveOntoX with LambdaLowerBound₂, and AllRowsAlt (one row per field of HypsAlt).

The path through the chapter

The whole chapter is the step nonempty-hyps.

  1. The top node gets FunctionalsSeparate from Howe duality and a Siegel-Weil hypothesis. The Bessel seesaw chapter covers that proof.
  2. Branch 3 proves the twelve open parameter statements. Its multiplicity row alone uses fourteen named hypotheses.
  3. Branch 2 proves SurjectiveOntoX from twelve hypotheses, RecTExists among them, and LambdaLowerBound₂ from seven, among them the doubling method and formal degrees.
  4. Branch 1 turns the closed bound into NL, builds one row per field of HypsAlt, and joins the rows into an element. The service row comes from Artin reciprocity, an LpL^p row from a Siegel-Weil hypothesis.

The source of this page. Markdown. Something is wrong? Report it.