riemann

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

Theta integrals and local matching

The Lean code takes a list of named inputs, two statements about theta integrals on unitary groups, a covolume bound, a local Langlands map and the statement VWin, and gets EveryCharacter from them. This page unfolds the two theta statements and follows the short branch that ends in L-function nonvanishing.

draft

Result

The trunk of the proof (see the map) reaches the theorem every_character_of_theta_integrals_local_matching from every_character_of_literature_of_vWin (see the literature inputs). The theorem has this form.

theorem every_character_of_theta_integrals_local_matching
    (P : GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses)
    (F : GlobalTheory.FunPr.ThetaLocalInputs)
    (hA : GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.ThetaIntegralsAgree)
    (hM : GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.LocalMatching)
    (hX : GlobalTheory.CovTop.CovolumeBoundOfX)
    (hL : UpperTheory.Zero.LLC.RecTExists) (hV : VWin) :
    UpperTheory.EveryCharacter

The conclusion EveryCharacter is this statement. Let N≥1N \geq 1, let χ\chi be a Dirichlet character modulo NN and let s∈ℂs \in \mathbb{C} with Re⁡(s)>12\operatorname{Re}(s) > \tfrac12. If χ≠1\chi \neq 1 or s≠1s \neq 1, then L(s,χ)≠0L(s, \chi) \neq 0. Here L(s,χ)L(s,\chi) is the Dirichlet L-function of Mathlib (DirichletCharacter.LFunction).

In words, the Lean code states: if seven inputs hold, then each Dirichlet L-function has no zero in the half-plane Re⁡(s)>12\operatorname{Re}(s) > \tfrac12. The seven inputs are two large bundles of named statements (P and F), two statements on theta integrals (hA and hM), a covolume bound (hX), the existence of a local Langlands type map (hL) and the statement VWin (see the VWin page). In the proof of the Riemann Hypothesis, all seven come from the previous step.

Idea

The proof of the theorem has two parts, and it is three lines of Lean.

The first part is the trunk. The theorem nonempty_hyps_definite_side_of_closed_bound uses all inputs except VWin, and builds one large structure HypsAlt. This structure has 46 fields. They are bounds and choices for families of objects that the code calls FamP. This part dominates 263,615 declarations. It is the subject of the next chapter.

The second part is the branch every_character_of_green_v_win. It takes three inputs: the statement Green (about cuspidal characters of GLd(𝔽g)\mathrm{GL}_d(\mathbb{F}_g)), the statement VWin, and the structure HypsAlt. From them it proves ZeroFreeAll, which is the same nonvanishing for primitive characters only. Then a short Mathlib argument removes the condition "primitive". This branch dominates 12,070 declarations.

The theta inputs hA and hM are not used in the branch. They go only into the trunk part. So the name of the theorem refers to the two inputs, and the work that uses them is in the next chapter. This page still unfolds them, because their statements are concrete. ThetaIntegralsAgree says that two theta integrals into the same unitary group are proportional, with one nonzero constant, when their test functions match. LocalMatching says that test functions can be matched: at each place there are quotient maps of the two local Weil representations onto one common irreducible space.

Before you read

You need these ideas.

Plan

  1. Define the theta integral IM(Φ)(h)I_M(\Phi)(h) for one Weil model MM, as the Lean code does.
  2. Unfold ThetaIntegralsAgree: convergence, one nonzero proportionality constant, and two recursion laws for that constant.
  3. Unfold LocalMatching: matched local quotient maps exist.
  4. Build HypsAlt from the inputs (next chapter).
  5. Get Green from GreenRegularCharacters, a field of P.
  6. In the branch, prove ZeroFreeAll from Green, VWin and HypsAlt.
  7. Remove the condition "primitive" with imprimitive.

The steps

Step 1. Theta integrals

All definitions are in the namespace GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels, in the file WeilTensorModels.lean.

A space Spc F E n has a matrix J∈Mn(E)J \in M_n(E), an 𝒪E\mathcal{O}_E-lattice L⊂EnL \subset E^n, a matrix θw\theta_w at each infinite place ww, and a basis at each finite place. The group UA σ J is the adelic unitary group UJ(𝔸)={g:gTJ σ(g)=J}U_J(\mathbb{A}) = \{ g : g^{T} J \, \sigma(g) = J \} with entries in 𝔸F⊗FE\mathbb{A}_F \otimes_F E. A Model σ X W for spaces XX of size nn and WW of size dd has Darboux coordinates for the symplectic form on X⊗WX \otimes W, a vacuum vector at each finite place, a measure μ\mu on UX(𝔸)U_X(\mathbb{A}) and a set dom. A representation om of UX(𝔸)×UW(𝔸)U_X(\mathbb{A}) \times U_W(\mathbb{A}) acts on functions Φ\Phi on 𝔸Fn×d×2\mathbb{A}_F^{n \times d \times 2} (the Lean index set is Fin n × Fin d).

def theta (om : Rep σ X W) (Φ : (Fin n × Fin d → AF F) → ℂ) (g : UA σ X.J) (h : UA σ W.J) : ℂ :=
  thetaSum F (om (g, h) Φ)

def Model.I (M : Model σ X W) (om : Rep σ X W) (Φ : (Fin n × Fin d → AF F) → ℂ) (h : UA σ W.J) : ℂ :=
  ∫ g in M.dom, theta om Φ g h ∂M.μ

Here thetaSum is ∑ξΦ(ξ)\sum_{\xi} \Phi(\xi) over the rational points ξ∈Fn×d\xi \in F^{n \times d} (HilbertNinetyQuotientHomEqIff.lean#L107). So the theta function is θ(g,h;Φ)=∑ξ(ω(g,h)Φ)(ξ)\theta(g,h;\Phi) = \sum_{\xi} (\omega(g,h)\Phi)(\xi), and the theta integral is

IM(Φ)(h)=∫domθ(g,h;Φ) dμ(g). I_M(\Phi)(h) = \int_{\mathrm{dom}} \theta(g, h; \Phi) \, d\mu(g).

The predicate Model.IsGood asks that μ\mu is a Haar measure and that dom is a fundamental domain for UX(F)U_X(F) in UX(𝔸)U_X(\mathbb{A}). So IM(Φ)I_M(\Phi) is a function on UW(𝔸)U_W(\mathbb{A}). This is the usual global theta lift from UXU_X to UWU_W, written out by hand.

Step 2. The data of a triple

The two theta statements quantify over a "triple". The structure IsTriple B G X om om' (WeilTensorModels.lean#L388) has five parts.

  • B.IsGood: E/FE/F is a CM extension with conjugation σ\sigma, E/ℚE/\mathbb{Q} is Galois, E/FE/F is unramified, the additive character ψ\psi of 𝔸F\mathbb{A}_F is standard, and at each inert place vv the residue field has more than 3 elements and v∤2v \nmid 2.
  • G.IsGood: there are three spaces. VV is Hermitian of size aa and signature (a−p,p)(a-p, p). V′V' is Hermitian of size a′a' and signature (q,a′−q)(q, a'-q). WW is skew-Hermitian of size a+a′a+a' and signature (a+a′−p−q,p+q)(a+a'-p-q, p+q). The sizes satisfy a′<aa' < a, a+a′a + a' is even, 2(p+q)+1<a′2(p+q)+1 < a' and 2(p+q)+1<(a−a′)/22(p+q)+1 < (a-a')/2. Also a+a′<mα(w)−mβ(w)a + a' < m_\alpha(w) - m_\beta(w) at each infinite place ww, where mα,mβm_\alpha, m_\beta are the weights of two characters.
  • X.IsGood: α\alpha and β\beta are Hecke characters of 𝔸E×\mathbb{A}_E^\times with infinity types mα,mβm_\alpha, m_\beta, with given restrictions to 𝔸F×\mathbb{A}_F^\times, unramified outside a finite set TT of places, and with ν=α/β\nu = \alpha/\beta ramified at each place of TT.
  • weil, weil': om is a Weil representation of UV×UWU_V \times U_W with splitting characters (β,β/α)(\beta, \beta/\alpha), and om' is one of UV′×UWU_{V'} \times U_W with splitting characters (α,α/β)(\alpha, \alpha/\beta).

So a triple gives two theta lifts into the same group UWU_W: one from UVU_V with ω\omega, one from UV′U_{V'} with ω′\omega'.

Step 3. ThetaIntegralsAgree

def ThetaIntegralsAgree : Prop :=
  (∀ F E ... σ B a a' G X om om', IsTriple B G X om om' → Decay B G om om' ∧
      ∀ R Rf, IsMatched B G X om om' R Rf → OneConst B G X om om' R Rf ∧ Coinv B G X om om' Rf) ∧
  (∃ e₁ e₂ s : ℤˣ, ∀ F E ... σ, StepBeta σ e₁ e₂ s) ∧
  ∃ e₁ e₂ s : ℤˣ, ∀ F E ... σ, StepAlpha σ e₁ e₂ s

The statement is at WeilTensorModels.lean#L585. It has three parts.

The first part is about one triple. Decay says that g↦θ(g,h;Φ)g \mapsto \theta(g,h;\Phi) is integrable on dom for each adelic Schwartz function Φ\Phi. It says the same for ω′\omega' and each Φ′\Phi' in a subspace So, with a bound ∣θ(g,h;Φ′)∣ ht(g)N≤C ht(h)k|\theta(g,h;\Phi')| \, \mathrm{ht}(g)^N \leq C \, \mathrm{ht}(h)^k and moderate growth of IM′(Φ′)I_{M'}(\Phi'). OneConst says three things: some IM′(Φ′)I_{M'}(\Phi') is not zero, there is exactly one cc with IsConst c, and that cc is not zero. Here IsConst c means

IM(Φ)(h)=c⋅IM′(Φ′)(h)for all h and all matched pairs (Φ,Φ′). I_M(\Phi)(h) = c \cdot I_{M'}(\Phi')(h) \quad \text{for all } h \text{ and all matched pairs } (\Phi, \Phi').

Coinv says that at good places the kernels of the local maps are exactly the coinvariant spaces augAt, and that So is stable under ω′\omega'.

The second and third parts, StepBeta and StepAlpha (WeilTensorModels.lean#L559), are recursion laws for the constant cc. Take a geometry GG and a smaller geometry G1G_1 where one space is smaller by 2 (one hyperbolic plane HH split off). Then there is a C≠0C \neq 0 so that the constants cc and c1c_1 of the two triples satisfy a relation. In StepAlpha it is

c=C⋅stepFac(z)⋅LS0 ⁣(b+2−a′2,ν)⋅c1, c = C \cdot \mathrm{stepFac}(z) \cdot L^{S_0}\!\left(\tfrac{b+2-a'}{2}, \nu\right) \cdot c_1,

with z=1−b+2−a′2z = 1 - \tfrac{b+2-a'}{2}. In StepBeta the partial L-value LS0(a−b−22+1,ν)L^{S_0}(\tfrac{a-b-2}{2}+1, \nu) multiplies cc instead, and the step factor is inverted. Here LS0(s,ν)L^{S_0}(s,\nu) is the partial Euler product of ν\nu over the places of EE not above S0S_0 (charL). The factor stepFac (WeilTensorModels.lean#L552) is a product of values of ν\nu on two fractional ideals and, for each place v∈Tv \in T, a value of νv\nu_v times an epsilon factor built from a Gauss sum (eps, gauss).

Step 4. LocalMatching

def LocalMatching : Prop :=
  ∀ (F E : Type) ... (σ : E →ₐ[F] E) (B : Base F E) (a a' : ℕ)
    (G : Geo σ a a') (X : Chars F E) om om', IsTriple B G X om om' → ∃ R Rf, IsMatched B G X om om' R Rf

The statement is at WeilTensorModels.lean#L581. For each triple there are real maps R and finite maps Rf with IsMatched.

IsFinMaps asks, for each finite place vv, two linear maps pvp_v and pv′p'_v from the local Schwartz-Bruhat spaces of ωv\omega_v and ωv′\omega'_v onto one space Πv\Pi_v. The maps are onto. They kill the UV(Fv)U_V(F_v) and UV′(Fv)U_{V'}(F_v) coinvariants. They respect the action of UW(Fv)U_W(F_v): if pvφ=pv′φ′p_v\varphi = p'_v\varphi', then the same holds after hh acts on both. The space Πv\Pi_v is nontrivial and has no proper nonzero UW(Fv)U_W(F_v)-stable subspace. Outside TT the two vacuum vectors have the same nonzero image. At v∈Tv \in T the condition IsZetaAt relates the images to two explicit local integrals (bigP and smallP). IsRealMaps asks the same at the infinite places, with Lie algebra and maximal compact actions on the polynomial Fock space Pol.

So LocalMatching says: the local theta lifts of ωv\omega_v and ωv′\omega'_v to UW(Fv)U_W(F_v) have a common irreducible quotient, at every place, with matched spherical vectors. A pair (Φ,Φ′)(\Phi,\Phi') is matched (Match, PolMatch) when their pure tensor pieces have the same image in Π∞⊗⨂v∈T′Πv\Pi_\infty \otimes \bigotimes_{v \in T'} \Pi_v for some finite set T′⊇TT' \supseteq T, up to limits.

In the proof of the Riemann Hypothesis, both hA and hM come from theta_integrals_agree_and_local_matching_of_literature, which applies PositivityTheory.ThKR.theoremK_head2 to two statements named EisBL and SiegelWeilStd. That proof dominates 8,520 declarations. The names refer to Eisenstein series and the Siegel-Weil formula in the literature. This page does not unfold EisBL or SiegelWeilStd.

Step 5. The trunk part

The Lean statement is long. Here it is shortened: the part (...) stands for a condition SlotNormCondition on the family bound BoundAtTwoThreeFamilyFonAlt.

theorem nonempty_hyps_definite_side_of_closed_bound :
    UnitaryGroupThirdPlaceHypotheses → ThetaLocalInputs → ThetaIntegralsAgree → LocalMatching →
    CovolumeBoundOfX → ∀ (hL : RecTExists),
    (∀ cDep : ℝ, LinkedAt (parametersOfDependence hL cDep) (...)) →
    Nonempty (HypsAlt S0.NL DefiniteSideCondition)

The main proof passes P.nLink through boundAtTwoThree_linked_of_recT to supply the last hypothesis. The result is a term of HypsAlt N DefiniteSideCondition with N = S0.NL. By definition, S0.NL 𝒞 is Closed 𝒞 fun Fm _ => LinkN Fm (GeometricWeakTiesOfStrong.lean#L36). This is exactly the form that the branch asks for. In the proof, hA and hM go into test_vector_assembly_holds, fourier_coefficient_fit_of_join_alt, evaluation_grid_of_join, twisted_local_factors_match and twisted_square_theta_integrals_eq. The next chapter follows this proof.

Step 6. Green from regular characters

theorem green_of_regular (hG : GlobalTheory.Published.GreenRegularCharacters) : GlobalTheory.GLq.Green

GreenRegularCharacters is a field of P (GreenRegularCharacters.lean#L13). For a prime gg, an integer d>0d > 0 and a field KK of degree dd over 𝔽g\mathbb{F}_g, it gives a map θ↦τθ\theta \mapsto \tau_\theta from characters of K×K^\times to class functions on GLd(𝔽g)\mathrm{GL}_d(\mathbb{F}_g). For a regular θ\theta (the powers θgi\theta^{g^i}, 0≤i<d0 \le i < d, are distinct), τθ\tau_\theta is cuspidal, has degree ∏i=1d−1(gi−1)\prod_{i=1}^{d-1}(g^i - 1), and on an element yy with irreducible characteristic polynomial and a root zz it is (−1)d−1∑i<dθ(zgi)(-1)^{d-1}\sum_{i<d} \theta(z^{g^i}). Two regular characters give the same τ\tau exactly when they are Frobenius conjugate, and each cuspidal character is some τθ\tau_\theta. The name refers to Green's theorem on the characters of finite general linear groups. Green (LabelDatum.lean#L108) is the same kind of parametrisation, by "prime labels" (polynomials over ℤ/g\mathbb{Z}/g) in place of characters. The proof green_of_regular is in the file SumRangeEqRoots.lean#L225.

Step 7. The branch: ZeroFreeAll

theorem UpperTheory.Top.zero_free_all_of_green_v_win (hG : GlobalTheory.GLq.Green) (hV : UpperTheory.Top.VWin)
    (h : Nonempty (HypsAlt (fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm) DefiniteSideCondition)) :
    Formalism.HC.ZeroFreeAll :=
  h.elim fun h => UpperTheory.Top.zeroFreeAll_of_topG (la := 3 / 2) (by norm_num)
    (forall_goal_of_shape_of_hyps _ _ _ _ (shape_closed_link_n_of_green hG) trivial trivial h)
    fun ψ => UpperTheory.Top.supplyChi ψ (hV ψ)

A PChar is a primitive Dirichlet character ψ\psi of some conductor NN. ZeroFreeAll says: for each PChar ψ\psi and each ss with Re⁡(s)>12\operatorname{Re}(s) > \tfrac12, L(s,ψ)≠0L(s,\psi) \neq 0 (ExplicitFormulaErrorOfHostConditions.lean#L18). The statement has no exception at s=1s = 1. The trivial character modulo 1 is primitive, and its L-function is ζ\zeta, so at s=1s = 1 the statement says that riemannZeta 1 is not zero. Mathlib gives ζ\zeta a value at its pole by a convention, and the lemma riemannZeta_one says that this value is (γ−log⁡4π)/2(\gamma - \log 4\pi)/2, which is not zero. So the case s=1s = 1 is true, but only because of the convention. The proof has three pieces.

First, shape_closed_link_n_of_green (9,550 declarations) proves TopShapeAlt True True N TopG from Green. TopShapeAlt V NR N G is a long implication: if about 50 named conditions on a family class 𝒜\mathcal{A} hold (and VV, NRNR, and N(𝒜′)N(\mathcal{A}') for a derived class), then GG holds. The theorem forall_goal_of_shape_of_hyps feeds the 46 fields of HypsAlt into these slots. It is a direct pass of fields, with two small conversions. The result is TopG.

Second, TopG (ZeroFreeAllOfTopG.lean#L12) says: for each λ>1\lambda > 1 and each requirement GG, if suitable hosts exist on windows of scale λ\lambda (HostExW la G.req), and each family in the class G.cls la satisfies HypV, then the class is FamilyClassConnected. That means: for small ε\varepsilon there is a family Fm in the class whose members satisfy the inequality ChainTied for all large xx in its window set.

Third, supplyChi (1,462 declarations) turns VWinAt ψ 401 into HostExW (3/2) (GChi ψ).req. So VWin supplies the hosts for each ψ\psi, at λ=3/2\lambda = 3/2.

The theorem zeroFreeAll_of_topG (417 declarations) then ends the proof. For ψ\psi, it takes the level Level.cyc ψ, built from the subgroup generated by ψ\psi. The code defines

Gm(y)=Gz(y)+∑ψ′w(ψ′)Re⁡gψ′(y),Gz(y)=∑n≤yΛ(n)(yn−1)−ylog⁡y+(1+γ)y, G_m(y) = G_z(y) + \sum_{\psi'} w(\psi') \operatorname{Re} g_{\psi'}(y), \qquad G_z(y) = \sum_{n \le y} \Lambda(n)\Big(\frac{y}{n} - 1\Big) - y \log y + (1 + \gamma) y,

where the sum is over the nontrivial characters ψ′\psi' of the level, w(ψ′)w(\psi') is a weight, γ\gamma is Euler's constant, and gψ′(y)=∑n≤yΛ(n)ψ′(n)(y/n−1)+y⋅cψ′g_{\psi'}(y) = \sum_{n \le y} \Lambda(n)\psi'(n)(y/n - 1) + y \cdot c_{\psi'} with cψ′c_{\psi'} the constant logDerivativeAtOne. Two proved facts combine. level_gm_le_on_family_scales (300 declarations) says that on the windows of a family where ChainTied holds, Gm(x)≤x1/2+(eD+eL+7)εG_m(x) \le x^{1/2 + (e_D + e_L + 7)\varepsilon}. formB (95 declarations) gives FormB: if Gm(x)≤xθG_m(x) \le x^\theta for all x∈[Y,Yλ]x \in [Y, Y^\lambda], for arbitrarily large YY, then L(s,ψ′)≠0L(s,\psi') \ne 0 for Re⁡(s)>θ\operatorname{Re}(s) > \theta and all ψ′\psi' in the level. The lemma level_of_tiedWin takes ss with Re⁡(s)>12\operatorname{Re}(s) > \tfrac12, chooses ε\varepsilon so small that 12+(eD+eL+7)ε<Re⁡(s)\tfrac12 + (e_D+e_L+7)\varepsilon < \operatorname{Re}(s), and applies the two facts.

Step 8. Imprimitive characters

theorem UpperTheory.Top.imprimitive :
    ZeroFreeAll → ∀ (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N) (s : ℂ), 1 / 2 < s.re → (χ ≠ 1 ∨ s ≠ 1) →
      DirichletCharacter.LFunction χ s ≠ 0

This is the last step of the branch (Imprimitive.lean#L5). Let χ∗\chi^* be the primitive character that induces χ\chi. Mathlib gives

L(s,χ)=L(s,χ∗)∏p∣N(1−χ∗(p)p−s). L(s,\chi) = L(s,\chi^*) \prod_{p \mid N} \big(1 - \chi^*(p) p^{-s}\big).

The first factor is not zero by ZeroFreeAll. For each pp, ∣χ∗(p)p−s∣≤p−Re⁡(s)<1|\chi^*(p)p^{-s}| \le p^{-\operatorname{Re}(s)} < 1, so the factor 1−χ∗(p)p−s1 - \chi^*(p)p^{-s} is not zero. The condition χ≠1\chi \neq 1 or s≠1s \ne 1 is needed only for the Mathlib lemma LFunction_changeLevel. The theorem every_character_of_green_v_win is this step applied to zero_free_all_of_green_v_win.

Where it is in the code

Sizes are dominator sizes: the number of declarations that only this node reaches on the way down from the top. All paths are relative to lean/src.

Declaration Module (file) Size
UpperTheory.Lit.every_character_of_theta_integrals_local_matching ThirdPlaceSeries/SiegelEisensteinSecondTermHypotheses.lean 313,327
UpperTheory.Lit.nonempty_hyps_definite_side_of_closed_bound same file 263,615
UpperTheory.Top.every_character_of_green_v_win ThirdPlaceSeries/TopPlug.lean 12,070
UpperTheory.Top.zero_free_all_of_green_v_win ThirdPlaceSeries/TopPlug.lean 12,065
UpperTheory.Top.shape_closed_link_n_of_green ThirdPlaceSeries/TopShape.lean 9,550
UpperTheory.Top.supplyChi CharacterBoxes/SupplyChi.lean 1,462
UpperTheory.Top.zeroFreeAll_of_topG CharacterBoxes/ZeroFreeAllOfTopG.lean 417
UpperTheory.Top.imprimitive CharacterBoxes/Imprimitive.lean 1
UpperTheory.LiteratureTheorems.theta_integrals_agree_and_local_matching_of_literature ThirdPlaceSeries/EveryCharacterOfLiteratureOfVWin.lean 8,520
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.ThetaIntegralsAgree BlockTheory/DivisorBase/WeilTensorModels.lean definition
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.LocalMatching BlockTheory/DivisorBase/WeilTensorModels.lean definition

The ThirdPlaceSeries files are in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/. The CharacterBoxes files are in Development/AutomorphicArithmetic/. The full closure of the main theorem (all declarations it uses, shared or not) has 452,823 declarations. The closure of every_character_of_green_v_win has 50,160. Besides the two big children, the main theorem dominates some smaller nodes that both children reach, for example theorem_A_closed_form_holds (3,015) and globalLatticeIndexTheorem_of_lengthBoundAtPlaces (2,223).

Notes

  • The theorem is named after the theta inputs, but the branch every_character_of_green_v_win does not use them. They act only through HypsAlt, which the next chapter builds. This page does not show how OneConst, StepAlpha or StepBeta are used there.
  • UnitaryGroupThirdPlaceHypotheses has about 60 fields and ThetaLocalInputs has 53 fields. Most are named after published theorems (for example jacquetShalika, casselmanWallach, howeDualityReal). This page uses only greenRegularCharacters, nLink and litN by name. It does not check that each field matches the published theorem of the same name. See the literature inputs for where these fields come from.
  • This page does not unfold CovolumeBoundOfX past its first level. It says that for families in the class FamHyp, for small ε\varepsilon and large parameters, a condition named L3 holds.
  • RecTExists says that for each number field EE, each finite place ww and each choice of a place above ww in an algebraic closure, there is a map rc from irreducible representations of GLn(Ew)\mathrm{GL}_n(E_w) to Weil-Deligne representations that satisfies the laws LawsT (compatibility with twists, duals, central characters, cuspidal support, and more). This page does not list all the laws.
  • TopShapeAlt, HypsAlt, DefiniteSideCondition, ChainTied and LinkN are very long. This page names them and their role, and does not unfold their content.
  • ZeroFreeAll has no exception at s=1s = 1 for the trivial character modulo 1. EveryCharacter has this exception. This page does not check how the chain treats the point s=1s = 1 for the trivial character.
  • The site does not claim that the proof is correct. The Lean code states the results above. The trust report says what has been checked.

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