Green from regular characters
drafted
Statement
Assume GreenRegularCharacters. It says the following. Let be a prime, let , and let be a field extension of of degree . Write . A character is regular (IsRegularChar g d θ) when the characters for are distinct. Then there is a map from characters of to functions such that:
- for each regular , is cuspidal (
IsCusp), , and for each with irreducible characteristic polynomial and each with , ; - for regular and , if and only if for some ;
- each cuspidal is for some regular .
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 , a label datum , and . Let (the Lean KK g d, the Mathlib GaloisField g d), and let be a fixed embedding (emb g d). Apply the hypothesis to , and , with the fact from GaloisField.finrank. This gives a map and the three properties above, named , , .
Two tools. For , the code defines a character (th L hd x). If , it is the character that sends a fixed generator of with to . Otherwise it is the trivial character. The lemmas on are these. th_apply: . th_pow: . th_inj: is injective on the with . th_surj: each character of is for some with . regular_iff: for such , is regular if and only if the elements , , are distinct. Also, for a polynomial , rootOf P is a chosen root of in (and if has no root).
Regularity. For each prime label of degree , the character is regular. The root satisfies (root_unit). By regular_iff, it is enough that the , , are distinct. This is pow_inj, since is irreducible of degree .
The map. Define . The proof checks the three clauses of Green.
- Cuspidal, degree and values. Let be a prime label, and let . By , is cuspidal and has the right degree. For the value formula, let be a root of , let with irreducible characteristic polynomial , and let be a root of . The constant term of is not zero, because (
Matrix.det_eq_sign_charpoly_coeff). So is a prime label of degree , and . Byexists_emb_eq, there is with , and . Since is injective, . Now gives . Byth_apply, each term is . The roots of are the (rootsBar_eq), so for some . Bysum_range_eq_roots, both and equal the sum of over the roots of , with . BythetaOf_pow, . So the sum is , asIsCuspOfasks. - Injective. Let , be prime labels with . By , for some . By
th_powandth_inj, . This element is a root of (root_pow). So and are monic irreducible polynomials with a common root, and both equal its minimal polynomial (minpoly.eq_of_irreducible_of_monic). So . - Surjective. Let be cuspidal. By , for a regular . By
th_surj, with . Byregular_iff, the , , are distinct. Let be the minimal polynomial of over . It is irreducible. Since ,pow_eq_self_iffgives . If , then , against distinctness. So . Also because . So is a prime label. Its chosen root is for some (rootsBar_eq). Byth_pow, , and gives .
The steps on roots in (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 . 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 up to Frobenius conjugation. Green uses prime labels, that is, Frobenius orbits of elements of of degree . The label datum links the two through the map .
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 statement Green, the step for
GlobalTheory.GLq.Green.
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.