riemann

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

Green from regular characters

drafted

Statement

Assume GreenRegularCharacters. It says the following. Let gg be a prime, let d>0d > 0, and let KK be a field extension of ℤ/g\mathbb{Z}/g of degree dd. Write Gd=GLd(ℤ/g)G_d = \mathrm{GL}_d(\mathbb{Z}/g). A character θ:K×→ℂ×\theta : K^\times \to \mathbb{C}^\times is regular (IsRegularChar g d θ) when the characters θgi\theta^{g^i} for 0≤i<d0 \leq i < d are distinct. Then there is a map θ↦τθ\theta \mapsto \tau_\theta from characters of K×K^\times to functions Gd→ℂG_d \to \mathbb{C} such that:

  1. for each regular θ\theta, τθ\tau_\theta is cuspidal (IsCusp), τθ(1)=∏i=1d−1(gi−1)\tau_\theta(1) = \prod_{i=1}^{d-1}(g^i - 1), and for each y∈Gdy \in G_d with irreducible characteristic polynomial fyf_y and each z∈K×z \in K^\times with fy(z)=0f_y(z) = 0, τθ(y)=(−1)d−1∑i=0d−1θ(zgi)\tau_\theta(y) = (-1)^{d-1} \sum_{i=0}^{d-1} \theta(z^{g^i});
  2. for regular θ\theta and θ′\theta', τθ=τθ′\tau_\theta = \tau_{\theta'} if and only if θ′=θgi\theta' = \theta^{g^i} for some i<di < d;
  3. each cuspidal χ:Gd→ℂ\chi : G_d \to \mathbb{C} is τθ\tau_\theta for some regular θ\theta.

Then the statement Green holds.

Lean

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

The declaration is in Development/AbelianVarietyTheory/Proofs/InertiaEigenvalues/SumRangeEqRoots.lean, line 225. Its page has the full list of what it uses and what uses it, and a link to the source.

Proof

Fix a prime gg, a label datum LL, and d>0d > 0. Let K=𝔽gdK = \mathbb{F}_{g^d} (the Lean KK g d, the Mathlib GaloisField g d), and let e:K→𝔽‾ge : K \to \overline{\mathbb{F}}_g be a fixed embedding (emb g d). Apply the hypothesis to gg, dd and KK, with the fact [K:ℤ/g]=d[K : \mathbb{Z}/g] = d from GaloisField.finrank. This gives a map τG\tau^G and the three properties above, named h1h_1, h2h_2, h3h_3.

Two tools. For x∈𝔽‾gx \in \overline{\mathbb{F}}_g, the code defines a character th(x):K×→ℂ×\mathrm{th}(x) : K^\times \to \mathbb{C}^\times (th L hd x). If xgd−1=1x^{g^d - 1} = 1, it is the character that sends a fixed generator uu of K×K^\times with e(u)=γde(u) = \gamma_d to teich(x)\mathrm{teich}(x). Otherwise it is the trivial character. The lemmas on th\mathrm{th} are these. th_apply: th(x)(k)=θL,d(x,e(k))\mathrm{th}(x)(k) = \theta_{L,d}(x, e(k)). th_pow: th(xm)=th(x)m\mathrm{th}(x^m) = \mathrm{th}(x)^m. th_inj: th\mathrm{th} is injective on the xx with xgd−1=1x^{g^d-1} = 1. th_surj: each character of K×K^\times is th(x)\mathrm{th}(x) for some xx with xgd−1=1x^{g^d-1} = 1. regular_iff: for such xx, th(x)\mathrm{th}(x) is regular if and only if the elements xgix^{g^i}, 0≤i<d0 \leq i < d, are distinct. Also, for a polynomial PP, rootOf P is a chosen root of PP in 𝔽‾g\overline{\mathbb{F}}_g (and 11 if PP has no root).

Regularity. For each prime label PP of degree dd, the character th(rootOf P)\mathrm{th}(\mathrm{rootOf}\ P) is regular. The root x=rootOf Px = \mathrm{rootOf}\ P satisfies xgd−1=1x^{g^d - 1} = 1 (root_unit). By regular_iff, it is enough that the xgix^{g^i}, i<di < d, are distinct. This is pow_inj, since PP is irreducible of degree dd.

The map. Define τP=τG(th(rootOf P))\tau_P = \tau^G(\mathrm{th}(\mathrm{rootOf}\ P)). The proof checks the three clauses of Green.

  1. Cuspidal, degree and values. Let PP be a prime label, and let x0=rootOf Px_0 = \mathrm{rootOf}\ P. By h1h_1, τP\tau_P is cuspidal and has the right degree. For the value formula, let xx be a root of PP, let y∈Gdy \in G_d with irreducible characteristic polynomial ff, and let z∈𝔽‾gz \in \overline{\mathbb{F}}_g be a root of ff. The constant term of ff is not zero, because det⁡y≠0\det y \neq 0 (Matrix.det_eq_sign_charpoly_coeff). So ff is a prime label of degree dd, and zgd−1=1z^{g^d-1} = 1. By exists_emb_eq, there is k∈Kk \in K with e(k)=ze(k) = z, and k≠0k \neq 0. Since ee is injective, f(k)=0f(k) = 0. Now h1h_1 gives τP(y)=(−1)d−1∑i<dth(x0)(kgi)\tau_P(y) = (-1)^{d-1} \sum_{i<d} \mathrm{th}(x_0)(k^{g^i}). By th_apply, each term is θL,d(x0,zgi)\theta_{L,d}(x_0, z^{g^i}). The roots of PP are the x0gjx_0^{g^j} (rootsBar_eq), so x=x0gjx = x_0^{g^j} for some jj. By sum_range_eq_roots, both ∑i<dF(zgi)\sum_{i<d} F(z^{g^i}) and ∑i<dF((zgj)gi)\sum_{i<d} F((z^{g^j})^{g^i}) equal the sum of FF over the roots of ff, with F=θL,d(x0,⋅)F = \theta_{L,d}(x_0, \cdot). By thetaOf_pow, θL,d(x0,(zgj)gi)=θL,d(x0gj,zgi)\theta_{L,d}(x_0, (z^{g^j})^{g^i}) = \theta_{L,d}(x_0^{g^j}, z^{g^i}). So the sum is ∑i<dθL,d(x,zgi)\sum_{i<d} \theta_{L,d}(x, z^{g^i}), as IsCuspOf asks.
  2. Injective. Let PP, P′P' be prime labels with τP=τP′\tau_P = \tau_{P'}. By h2h_2, th(rootOf P′)=th(rootOf P)gi\mathrm{th}(\mathrm{rootOf}\ P') = \mathrm{th}(\mathrm{rootOf}\ P)^{g^i} for some ii. By th_pow and th_inj, rootOf P′=(rootOf P)gi\mathrm{rootOf}\ P' = (\mathrm{rootOf}\ P)^{g^i}. This element is a root of PP (root_pow). So PP and P′P' are monic irreducible polynomials with a common root, and both equal its minimal polynomial (minpoly.eq_of_irreducible_of_monic). So P=P′P = P'.
  3. Surjective. Let χ\chi be cuspidal. By h3h_3, χ=τG(θ)\chi = \tau^G(\theta) for a regular θ\theta. By th_surj, θ=th(x)\theta = \mathrm{th}(x) with xgd−1=1x^{g^d-1} = 1. By regular_iff, the xgix^{g^i}, i<di < d, are distinct. Let PP be the minimal polynomial of xx over ℤ/g\mathbb{Z}/g. It is irreducible. Since xgd=xx^{g^d} = x, pow_eq_self_iff gives deg⁡P∣d\deg P \mid d. If deg⁡P<d\deg P < d, then xgdeg⁡P=x=xg0x^{g^{\deg P}} = x = x^{g^0}, against distinctness. So deg⁡P=d\deg P = d. Also P(0)≠0P(0) \neq 0 because x≠0x \neq 0. So PP is a prime label. Its chosen root is rootOf P=xgj\mathrm{rootOf}\ P = x^{g^j} for some j<dj < d (rootsBar_eq). By th_pow, th(rootOf P)=θgj\mathrm{th}(\mathrm{rootOf}\ P) = \theta^{g^j}, and h2h_2 gives τG(θ)=τG(th(rootOf P))=τP\tau^G(\theta) = \tau^G(\mathrm{th}(\mathrm{rootOf}\ P)) = \tau_P.

The steps on roots in 𝔽‾g\overline{\mathbb{F}}_g (root_unit, root_pow, ne_zero_of, pow_self_of, unit_pow, mem_rootsBar_iff, rootOf_spec, emb_injective) are routine facts about finite fields.

Notes

The dependency list of the index has GlobalTheory.GLq.hc. The proof does not use this definition. The name hc in the proof is a local name for the cuspidality fact from h1h_1. The index matches it with the global name by mistake.

The two statements differ in how they index the characters. GreenRegularCharacters uses regular characters of K×K^\times up to Frobenius conjugation. Green uses prime labels, that is, Frobenius orbits of elements of 𝔽‾g\overline{\mathbb{F}}_g of degree dd. The label datum LL links the two through the map x↦th(x)x \mapsto \mathrm{th}(x).

The hypothesis GreenRegularCharacters is the field greenRegularCharacters of UnitaryGroupThirdPlaceHypotheses. The step EveryCharacter from theta integrals and local matching applies this theorem to that field.

Uses

The proof also uses these declarations in a routine way, for example to unfold a definition or to pass an argument on: GlobalTheory.GLq.Mt, GlobalTheory.GLq.hc, GlobalTheory.GreenBridge.KK, GlobalTheory.GreenBridge.emb_injective, GlobalTheory.GreenBridge.exists_emb_eq, GlobalTheory.GreenBridge.mem_rootsBar_iff, GlobalTheory.GreenBridge.ne_zero_of, GlobalTheory.GreenBridge.pow_self_of, GlobalTheory.GreenBridge.rootOf_spec, GlobalTheory.GreenBridge.root_pow, GlobalTheory.GreenBridge.root_unit, GlobalTheory.GreenBridge.unit_pow.

The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: GlobalTheory.GLq.IsPrimeLab, GlobalTheory.GLq.thetaOf, GlobalTheory.GreenBridge.pow_inj, GlobalTheory.GreenBridge.regular_iff, GlobalTheory.GreenBridge.rootOf, GlobalTheory.GreenBridge.sum_range_eq_roots, GlobalTheory.GreenBridge.th, GlobalTheory.GreenBridge.th_apply, GlobalTheory.GreenBridge.th_inj, GlobalTheory.GreenBridge.th_pow, GlobalTheory.GreenBridge.th_surj, GlobalTheory.GreenBridge.thetaOf_pow, GlobalTheory.GreenExists.pow_eq_self_iff, GlobalTheory.GreenExists.rootsBar_eq, GlobalTheory.Published.GreenRegularCharacters, GlobalTheory.Published.IsRegularChar.

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.