VERSION & SCOPE
A fixed source, a visible boundary.
The source was downloaded from Levent Alpöge’s website on 20 November 2026: fourteen numbered archive parts. The parts were joined in order and extracted locally. The original downloads and the full extracted tree remain separate from the website.
- Combined archive
- 239,275,554 bytes
- Extracted files
- 175,190 files; paths and lengths checked against the archive
- Lean toolchain
leanprover/lean4:v4.33.1- Mathlib revision
0df444a360eaa60ab8c11dca51a86af692955474- Selected snapshots
- 44 unchanged Lean files with SHA-256 fingerprints
- Formal verification here
- Lean build and axiom audit not performed
Combined archive SHA-256
9631b4f020199e580ba86178cb56c6e9b09f690c2369a80dc4334aa93f49c7fc
A fingerprint identifies this download. It is not an author signature or a proof-correctness certificate.
Open the provenance manifestOriginal archive: part 01Original archive: part 14
Compilation reports · 20 November 2026. Many people claim successful Lean compilation.
Read the source from either direction: begin with the exported claims and follow their inputs, or start with the small conditional deduction and see where its nonvanishing hypothesis is supplied. The full dependency graph is not reproduced here.
Main
The public target statements
Main exports the Riemann Hypothesis and the Dirichlet L-function statements. These declarations identify the claims; reading them alone does not verify their proofs.
1import Statements
2import Supplements.Kernels.MainTheoremsAll
3
4theorem riemannHypothesis : RiemannHypothesis := rhOfAll
5
6theorem riemannZeta_eq_zero_re : RiemannZetaZerosOnLine := rhOfAll
7
8theorem LFunction_ne_zero_of_half_lt_re : DirichletLNonvanishingRightOfHalf := allChi
9
10theorem LFunction_eq_zero_re : DirichletLZerosOnLine := claimAll.2.1
11
12theorem LFunction_eq_zero_re_of_isPrimitive : PrimitiveDirichletLZerosOnLine := critAll
Snapshot fingerprint
SHA-256: 017645ca448f2fd1f6fd5c4c2cb2c6e96e472725be13f6e180ca6e1574360939
The local snapshot has 433 bytes. Its contents are unchanged from the downloaded archive.
Statements
The propositions, with their quantifiers
The definitions distinguish nontrivial zeta zeros, nonvanishing to the right of the critical line, all Dirichlet characters in the open strip, and the primitive-character case.
1import Mathlib
2
3def RiemannZetaZerosOnLine : Prop :=
4 ∀ s : ℂ, riemannZeta s = 0 → (¬∃ n : ℕ, s = -2 * ((n : ℂ) + 1)) → s ≠ 1 → s.re = 1 / 2
5
6def DirichletLNonvanishingRightOfHalf : Prop :=
7 ∀ (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N) (s : ℂ),
8 1 / 2 < s.re → (χ ≠ 1 ∨ s ≠ 1) → DirichletCharacter.LFunction χ s ≠ 0
9
10def DirichletLZerosOnLine : Prop :=
11 ∀ (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N) (s : ℂ),
12 0 < s.re → s.re < 1 → DirichletCharacter.LFunction χ s = 0 → s.re = 1 / 2
13
14def PrimitiveDirichletLZerosOnLine : Prop :=
15 ∀ (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N), χ.IsPrimitive →
16 ∀ s : ℂ, 0 < s.re → s.re < 1 → DirichletCharacter.LFunction χ s = 0 → s.re = 1 / 2
Snapshot fingerprint
SHA-256: 79ef7ca776e42abe1f46caee13ea09bd19f1e2d0b1620d8d5d200258f33b47bf
The local snapshot has 783 bytes. Its contents are unchanged from the downloaded archive.
Development.AutomorphicArithmetic.CharacterBoxes.EveryCharacter
The input to the explained argument
UpperTheory.EveryCharacter is the universal nonvanishing proposition. The disjunction excludes the exceptional combination of a principal character and s = 1. This is an explicit hypothesis of the reflection argument.
1import Development.AbelianVarietyTheory.Proofs.GlobalInterpolation.ShapeOf
2import Development.AutomorphicArithmetic.CharacterBoxes.ShapeWin
3import Development.AutomorphicArithmetic.CharacterBoxes.SupplyChi
4import Development.AutomorphicArithmetic.CharacterBoxes.Imprimitive
5
6open Formalism.BasicNotions Formalism.MainNotions GlobalTheory.Fc
7
8theorem UpperTheory.Top.plugWin (hG : GlobalTheory.GLq.Green) (hV : UpperTheory.Top.VWin)
9 (h : Nonempty (Hyps (fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm) DRS)) : Formalism.HC.ZeroFreeAll :=
10 h.elim fun h => UpperTheory.Top.zeroFreeAll_of_topG (la := 3 / 2) (by norm_num)
11 (GlobalTheory.Fc.shape_of _ _ _ _ (UpperTheory.Top.shapeWin hG) trivial trivial h) fun ψ => UpperTheory.Top.supplyChi ψ (hV ψ)
12
13def UpperTheory.EveryCharacter : Prop :=
14 ∀ (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N) (s : ℂ), 1 / 2 < s.re → (χ ≠ 1 ∨ s ≠ 1) → DirichletCharacter.LFunction χ s ≠ 0
15
16theorem UpperTheory.Top.plugAll (hG : GlobalTheory.GLq.Green) (hV : UpperTheory.Top.VWin)
17 (h : Nonempty (Hyps (fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm) DRS)) : UpperTheory.EveryCharacter :=
18 UpperTheory.Top.imprimitive (UpperTheory.Top.plugWin hG hV h)
Snapshot fingerprint
SHA-256: 31f6e49936226cfc3d71b15685347bd2874db0aef384e5cf4fea7d09ba68dc71
The local snapshot has 1215 bytes. Its contents are unchanged from the downloaded archive.
Formalism.GammaFactorNonvanishing.CritLine
The critical-line deduction
The complete file is reproduced below. The gamma-factor lemma precedes critLine, which splits into the two sides of the critical line. Its left-side case applies the functional equation to the inverse character. The technical companion explains this deduction under its stated nonvanishing hypothesis.
1import Development.AutomorphicArithmetic.CharacterBoxes.EveryCharacter
2import Formalism.GammaFactorNonvanishing.RhOfRight
3
4open Complex DirichletCharacter
5
6theorem Formalism.VW.gammaFactor_ne_zero {N : ℕ} (χ : DirichletCharacter ℂ N) {s : ℂ} (hs : 0 < s.re) : gammaFactor χ s ≠ 0 := by
7 rcases χ.even_or_odd with h | h
8 · rw [h.gammaFactor_def]; exact Gammaℝ_ne_zero_of_re_pos hs
9 · rw [h.gammaFactor_def]; exact Gammaℝ_ne_zero_of_re_pos (by rw [add_re, one_re]; linarith)
10
11theorem Formalism.VW.critLine (h : UpperTheory.EveryCharacter) (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N) (hχ : χ.IsPrimitive) (s : ℂ)
12 (h0 : 0 < s.re) (h1 : s.re < 1) (hz : LFunction χ s = 0) : s.re = 1 / 2 := by
13 have hs0 : s ≠ 0 := fun e => by simp [e] at h0
14 have hs1 : s ≠ 1 := fun e => by simp [e] at h1
15 by_contra hne
16 rcases lt_or_gt_of_ne hne with hlt | hgt
17 · have hinv : χ⁻¹.IsPrimitive := by
18 rw [isPrimitive_def, conductor_inv]; exact hχ
19 have hc : completedLFunction χ s = 0 := by
20 rw [LFunction_eq_completed_div_gammaFactor χ s (Or.inl hs0)] at hz
21 exact (div_eq_zero_iff.1 hz).resolve_right (Formalism.VW.gammaFactor_ne_zero χ h0)
22 have hfe := hinv.completedLFunction_one_sub s
23 rw [inv_inv, hc, mul_zero] at hfe
24 have h2 : (1 - s) ≠ 0 := sub_ne_zero.2 hs1.symm
25 refine h N χ⁻¹ (1 - s) (by rw [sub_re, one_re]; linarith) (Or.inr fun e => hs0 (by linear_combination -e)) ?_
26 rw [LFunction_eq_completed_div_gammaFactor χ⁻¹ (1 - s) (Or.inl h2), hfe, zero_div]
27 · exact h N χ s hgt (Or.inr hs1) hz
28
29theorem Formalism.VW.rh_of_every (h : UpperTheory.EveryCharacter) : RiemannHypothesis :=
30 Formalism.VW.rh_of_right fun s hs hs1 => by
31 have := h 1 (1 : DirichletCharacter ℂ 1) s hs (Or.inr hs1)
32 rwa [LFunction_modOne_eq] at this
Snapshot fingerprint
SHA-256: 5b1552ac13442150f6900f37b9b44eff1491fad1bebe2ec07a959eecb9bcfe02
The local snapshot has 1825 bytes. Its contents are unchanged from the downloaded archive.
Supplements.Kernels.MainTheorems
Where the input and deduction are assembled
allChi supplies the nonvanishing input; critAll passes it into critLine. The zeta theorem uses rh_of_every, and claimAll also packages the broader strip statement. This small assembly file delegates its substantive arithmetic input to other modules.
1import Formalism.GammaFactorNonvanishing.CritLine
2import Development.AutomorphicArithmetic.CharacterBoxes.ClaimStrip
3import Development.AutomorphicArithmetic.CharacterBoxes.MainConclusion
4
5open Complex DirichletCharacter
6
7theorem allChi : UpperTheory.EveryCharacter := UpperTheory.FinalTheorems.everyCharacter
8
9theorem rhOfAll : RiemannHypothesis := Formalism.VW.rh_of_every allChi
10
11theorem critAll (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N) (hχ : χ.IsPrimitive) (s : ℂ)
12 (h0 : 0 < s.re) (h1 : s.re < 1) (hz : LFunction χ s = 0) : s.re = 1 / 2 :=
13 Formalism.VW.critLine allChi N χ hχ s h0 h1 hz
14
15theorem claimAll : Claim.HalfPlane ∧ Claim.Strip ∧ Claim.Zeta :=
16 ⟨allChi, Claim.strip allChi, Claim.zeta allChi⟩
Snapshot fingerprint
SHA-256: 1e734200b9b6a6d2a968743bd0c433d614bd6606cf538ac6d4f0ff70044dde53
The local snapshot has 740 bytes. Its contents are unchanged from the downloaded archive.
Development.AutomorphicArithmetic.CharacterBoxes.MainConclusion
The larger arithmetic argument begins here
everyCharacter connects the nonvanishing proposition to the literature/window and Galois input packages named in these imports. The expanded technical notes explain the main analytic, arithmetic and geometric dependencies behind this assembly. The full imported development has not been independently verified here.
1import Development.AutomorphicArithmetic.ThetaCorrespondence.ThetaPairLifts.ThirdPlaceSeries.EveryCharacterOfLiteratureOfVWin
2import Development.AutomorphicArithmetic.AutomorphicVarieties.ModularityArgument.ThresholdArguments.DenseThresholdCases.VwinOfRow
3import Development.AutomorphicArithmetic.Foundations.LocalLanglands.LocalCentralUnits.RecTExists
4import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.RowSrc
5import Development.AutomorphicArithmetic.CharacterBoxes.RiemannHypothesisOfEveryCharacter
6
7theorem UpperTheory.FinalTheorems.everyCharacter_of_row (h : UpperTheory.GalStar.Row0b fun h rc => UpperTheory.Zero.LLC.IsRecT h rc) : UpperTheory.EveryCharacter :=
8 UpperTheory.LiteratureTheorems.every_character_of_literature_of_vWin ⟨h, UpperTheory.Zero.LLC.recTExists, h⟩ (UpperTheory.One.vwin_of_row h)
9
10theorem UpperTheory.FinalTheorems.everyCharacter : UpperTheory.EveryCharacter :=
11 UpperTheory.FinalTheorems.everyCharacter_of_row UpperTheory.Gal.Int.galoisLocalGlobalStrong_recParameter
12
13theorem UpperTheory.FinalTheorems.riemannHypothesis : RiemannHypothesis :=
14 UpperTheory.riemannHypothesis_of_everyCharacter UpperTheory.FinalTheorems.everyCharacter
Snapshot fingerprint
SHA-256: a5f71e107087e37b2c598709795b0f56c0a6741cf1e8ab99ee1f97e2fce0fe34
The local snapshot has 1213 bytes. Its contents are unchanged from the downloaded archive.
Formalism.GammaFactorNonvanishing.RhOfRight
The separate zeta deduction
rh_of_right starts from zeta nonvanishing in the right half-plane. Its full source handles the trivial-zero exceptions and the zeta functional equation. The displayed opening identifies its exact hypothesis; the first edition explains the primitive Dirichlet argument in detail instead.
1import Mathlib
2
3open Complex
4
5theorem Formalism.VW.rh_of_right (hz : ∀ s : ℂ, 1 / 2 < s.re → s ≠ 1 → riemannZeta s ≠ 0) : RiemannHypothesis := by
6 unfold RiemannHypothesis
7 intro s hs htriv hs1
8 rcases lt_trichotomy s.re (1 / 2) with hlt | heq | hgt
9 · exfalso
10 have hpi : (Real.pi : ℂ) ≠ 0 := by exact_mod_cast Real.pi_ne_zero
11 have hs0 : s ≠ 0 := by
12 rintro rfl
Snapshot fingerprint
SHA-256: 7e2c0b519ee420192cad8fb281c2d2bfebae2ba553342fd579c81c2aa0bd3dc5
The local snapshot has 2459 bytes. Its contents are unchanged from the downloaded archive.
Development.AutomorphicArithmetic.CharacterBoxes.ClaimStrip
The extension to imprimitive characters
The full file first removes the extra Euler factors and reflects primitive zeros, then derives Claim.Strip. The displayed portion shows the primitive reflection step. The expanded notes also explain the related Euler-factor extension for nonvanishing; this file’s complete strip argument remains a separate source proof.
42theorem prim_reflect {M : ℕ} [NeZero M] (ψ : DirichletCharacter ℂ M) (hψ : ψ.IsPrimitive) {s : ℂ}
43 (hs0 : 0 < s.re) (hs1 : s.re < 1) (h : DirichletCharacter.LFunction ψ s = 0) :
44 DirichletCharacter.LFunction ψ⁻¹ (1 - s) = 0 := by
45 have hs0' : s ≠ 0 := fun e => by rw [e, Complex.zero_re] at hs0; exact lt_irrefl _ hs0
46 have ht0 : 0 < (1 - s).re := by rw [Complex.sub_re, Complex.one_re]; linarith
47 have ht0' : 1 - s ≠ 0 := fun e => by rw [e, Complex.zero_re] at ht0; exact lt_irrefl _ ht0
48 have hc : DirichletCharacter.completedLFunction ψ s = 0 := by
49 rw [DirichletCharacter.LFunction_eq_completed_div_gammaFactor ψ s (Or.inl hs0'),
50 div_eq_zero_iff] at h
51 exact h.resolve_right (gamma_ne_zero ψ hs0)
52 have hψ' : (ψ⁻¹).IsPrimitive := by
53 rw [DirichletCharacter.isPrimitive_def, DirichletCharacter.conductor_inv]; exact hψ
54 have fe := hψ'.completedLFunction_one_sub s
55 rw [inv_inv, hc, mul_zero] at fe
56 rw [DirichletCharacter.LFunction_eq_completed_div_gammaFactor ψ⁻¹ (1 - s) (Or.inl ht0'), fe,
57 zero_div]
Snapshot fingerprint
SHA-256: 74498552f19df4bd5b3c296ed247d25d40cabd1057647dd4db1ee7ba1c57ea03
The local snapshot has 5193 bytes. Its contents are unchanged from the downloaded archive.
Development.AutomorphicArithmetic.DedekindLFunctions.CharFamily
Smoothed character sums and the analytic window hypothesis
Defines ramp, Gchi, positive character families, their real weighted error Gm, and WindowHyp.
10def ramp (f : ℕ → ℂ) (y : ℝ) : ℂ :=
11 ∑ n ∈ Finset.range (⌊y⌋₊ + 1), (Λ n : ℂ) * f n * ((max (y / n - 1) 0 : ℝ) : ℂ)
12
13open Classical in
14
15def Gchi {N : ℕ} [NeZero N] (χ : DirichletCharacter ℂ N) (y : ℝ) : ℂ :=
16 if χ = 1 then
17 ramp (fun n => χ n) y - ((y * Real.log y : ℝ) : ℂ) + (((1 + Real.eulerMascheroniConstant) * y : ℝ) : ℂ)
18 else
19 ramp (fun n => χ n) y + (y : ℂ) * (deriv (DirichletCharacter.LFunction χ) 1 / DirichletCharacter.LFunction χ 1)
20
21def G (y : ℝ) : ℝ :=
22 (ramp (fun _ => 1) y).re - y * Real.log y + (1 + Real.eulerMascheroniConstant) * y
23
24structure CharFamily where
25 ι : Type
26 [fin : Fintype ι]
27 N : ι → ℕ
28 [nz : ∀ i, NeZero (N i)]
29 χ : ∀ i, DirichletCharacter ℂ (N i)
30 a : ι → ℝ
31 a_pos : ∀ i, 0 < a i
32 adm : ∀ i, N i = 1 ∨ χ i ≠ 1
33
34attribute [instance] CharFamily.fin CharFamily.nz
35
36def Gm (F : CharFamily) (y : ℝ) : ℝ := ∑ i, F.a i * (Gchi (F.χ i) y).re
37
38def ZeroFree (F : CharFamily) (θ : ℝ) : Prop :=
39 ∀ i, ∀ s : ℂ, θ < s.re → DirichletCharacter.LFunction (F.χ i) s ≠ 0
40
41def WindowHyp (F : CharFamily) (θ δ : ℝ) : Prop :=
42 ∀ η : ℝ, 0 < η → ∀ Y₀ : ℝ, ∃ Y : ℝ, Y₀ ≤ Y ∧ ∃ R : ℝ → ℝ,
43 MeasureTheory.IntegrableOn (fun y => R y * y ^ (-θ - 1)) (Set.Icc Y (Y ^ (1 + δ))) ∧
44 (∀ y ∈ Set.Icc Y (Y ^ (1 + δ)), 0 ≤ R y ∧ Gm F y ≤ R y) ∧
45 ∫ y in Set.Icc Y (Y ^ (1 + δ)), R y * y ^ (-θ - 1) ≤ Y ^ η
Snapshot fingerprint
SHA-256: ca0ca8acb80ff4ffc36896204650f9ca16167193a22c36a140402b27cfc8c336
1,636 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.PrimitiveCosets.CoreGm
From compatible arithmetic data to a near-square-root error bound
The core_gm statement gives the exact exponent 1/2 + (eD + eL + 7) eps; the final proof absorbs constants into x to the eps.
12theorem UpperTheory.Comparison₂.core_gm :
13 ∀ (Λ : Level) (eD eL K cHH eK C eps : ℝ), 0 < eps → ∃ x1 : ℝ, ∀ x ≥ x1, ∀ (φ : Frame) (H : HostAx φ) (TT : Finset φ.A),
14 EAtH Λ H.toHostRaw TT x eps C → CoreAtH H.toHostRaw TT eD eL K cHH eK eps x →
15 Λ.Gm x ≤ x ^ ((1 : ℝ) / 2 + (eD + eL + 7) * eps) := by
…
55 have hmain := hx₁ _ g1 φ.A m (arith H.toHostRaw) _ ell N TT T2 a w Dd.b Dd.b' Dd.k Dd.a η X' θ φ.A0
56 (keptA Λ H.toHostRaw) (hostFactsS φ H) hb ha hk w7 w8 hSz hThin hCost hRest hT2
57 (charsA Λ φ H TT _ _ C ell hx0 hE hell) (fun u hu => by
58 obtain ⟨v, rfl⟩ := hcov u hu
59 exact le_trans (Deduction.ch_top Dd tr Cc Xpp eK K _ ell N TT T2 a w eT eP hId hLed hWin hBN hLX' v)
60 (mul_le_mul_of_nonneg_right hExp hBr))
61 rw [gmA_eq Λ φ H TT _ _ C ell hE hell] at hmain
62 have hs := sigA_le Λ φ H TT _ _ C ell hx0 hE hell
63 have h1 : Dd.x ^ ((1 : ℝ) / 2 + Dd.ε) ≤ Dd.x ^ ((1 : ℝ) / 2 + (eD + eL + 3 + 3) * Dd.ε) :=
64 Real.rpow_le_rpow_of_exponent_le w1 (by nlinarith)
65 have h2 : Dd.x ^ ((1 : ℝ) / 2 + (eD + eL + 7) * Dd.ε)
66 = Dd.x ^ Dd.ε * Dd.x ^ ((1 : ℝ) / 2 + (eD + eL + 3 + 3) * Dd.ε) := by
67 rw [← Real.rpow_add hx0]
68 congr 1
69 ring
70 have h3 := mul_le_mul_of_nonneg_right (hx₃ _ g3)
71 (Real.rpow_nonneg hx0.le ((1 : ℝ) / 2 + (eD + eL + 3 + 3) * Dd.ε))
72 have h4 := mul_le_mul_of_nonneg_left h1 (show 0 ≤ 4 * (Λ.o : ℝ) by positivity)
73 rw [h2]
74 linarith
Snapshot fingerprint
SHA-256: 73abeaad38ed40bde0c2f974f53cae9d851e72d23ae389dea129b2bbddc58bc8
4,613 bytes, unchanged from the original archive.
Formalism.SharpRestriction.RamificationFrobenius.TotientGaloisClasses.TopWin
Quantified windows and the choice of epsilon
States the order of quantifiers for window families and proves nonvanishing by choosing epsilon after the candidate real part is fixed.
23def ChebyshevInequalityOnFamilyWindows {eps : ℝ} (Fm : Fam eps) (eD eL : ℝ) : Prop :=
24 ∃ K cHH eK CL x0 : ℝ, ∀ x ≥ x0, x ∈ (core Fm).Win → Tied Fm eD eL K cHH eK CL x
25
26def ChebyshevInequalityOnWindows (Λ : Level) : Prop :=
27 ∀ (eD eL eps : ℝ), 0 < eps → ∀ Fm : Fam eps, EFamC Λ (core Fm) → ChebyshevInequalityOnFamilyWindows @core @Tied Fm eD eL →
28 ∃ x1 : ℝ, ∀ x ≥ x1, x ∈ (core Fm).Win → Λ.Gm x ≤ x ^ ((1 : ℝ) / 2 + (eD + eL + 7) * eps)
29
30def ChebyshevInequalityAtWindowScale (la : ℝ) (Λ : Level) : Prop :=
31 ∃ eD eL ε₁ : ℝ, 0 < ε₁ ∧ ∀ eps : ℝ, 0 < eps → eps < ε₁ → ∃ Fm : Fam eps, EFamC Λ (core Fm) ∧
32 (core Fm).Windows la ∧ ChebyshevInequalityOnFamilyWindows @core @Tied Fm eD eL
…
59theorem exists_small_eps (C : ℝ) {δ ε₁ : ℝ} (hδ : 0 < δ) (h1 : 0 < ε₁) : ∃ ε : ℝ, 0 < ε ∧ ε < ε₁ ∧ C * ε ≤ δ := by
60 have hp : 0 < |C| + 1 := by positivity
61 have h0 : 0 < min (ε₁ / 2) (δ / (|C| + 1)) := lt_min (by linarith) (div_pos hδ hp)
62 refine ⟨_, h0, lt_of_le_of_lt (min_le_left _ _) (by linarith), ?_⟩
63 have a1 := mul_le_mul_of_nonneg_right (le_abs_self C) h0.le
64 have a2 : min (ε₁ / 2) (δ / (|C| + 1)) ≤ δ / (|C| + 1) := min_le_right _ _
65 rw [le_div_iff₀ hp] at a2
66 nlinarith
67
68theorem level_of_tiedWin {Λ : Level} {la : ℝ} (h112 : ChebyshevInequalityOnWindows @core @Tied Λ) (hB : Λ.FormBAt la)
69 (h : ChebyshevInequalityAtWindowScale @core @Tied la Λ) : Λ.ZeroFreeLevel := by
70 obtain ⟨eD, eL, ε₁, h1, h⟩ := h
71 intro ψ hψ s hs
72 have hm1 : min (s.re - 1 / 2) (1 / 2) ≤ s.re - 1 / 2 := min_le_left _ _
73 have hm2 : min (s.re - 1 / 2) (1 / 2) ≤ 1 / 2 := min_le_right _ _
74 have hm0 : 0 < min (s.re - 1 / 2) (1 / 2) := lt_min (by linarith) (by norm_num)
75 obtain ⟨ε, hε0, hεlt, hCe⟩ := exists_small_eps (eD + eL + 7) (half_pos hm0) h1
76 obtain ⟨Fm, hE, hW, hT⟩ := h ε hε0 hεlt
77 obtain ⟨x1, hx⟩ := h112 eD eL ε hε0 Fm hE hT
78 refine hB (1 / 2 + min (s.re - 1 / 2) (1 / 2) / 2) (by linarith) (by linarith)
79 (((windows_iff _ la).1 hW).mono (x0 := max x1 1) fun y hy hw => ?_) ψ hψ s (by linarith)
80 exact (hx y (le_of_max_le_left hy) hw).trans
81 (Real.rpow_le_rpow_of_exponent_le (le_of_max_le_right hy) (by linarith))
82
83theorem zeroFreeOn_of_tiedWin {Q : PChar → Prop}
84 (h : ∀ ψ, Q ψ → ∃ (Λ : Level) (la : ℝ), ψ ∈ Λ.KEPT ∧ 1 < la ∧ ChebyshevInequalityOnWindows @core @Tied Λ ∧ Λ.FormB ∧
85 ChebyshevInequalityAtWindowScale @core @Tied la Λ) : ZeroFreeOn Q :=
86 zeroFreeOn_of_levels fun ψ hψ => by
87 obtain ⟨Λ, la, a, b, c, d, e⟩ := h ψ hψ
88 exact ⟨Λ, a, level_of_tiedWin c (d la b) e⟩
89
90theorem zeroFreeOn_of_tiedWin_cyc {Q : PChar → Prop} {la : ℝ} (hla : 1 < la)
91 (h112 : ∀ ψ, Q ψ → ChebyshevInequalityOnWindows @core @Tied (Level.cyc ψ)) (hB : ∀ ψ, Q ψ → (Level.cyc ψ).FormB)
92 (h : ∀ ψ, Q ψ → ChebyshevInequalityAtWindowScale @core @Tied la (Level.cyc ψ)) : ZeroFreeOn Q :=
93 zeroFreeOn_of_tiedWin fun ψ hψ => ⟨_, la, Level.mem_cyc ψ, hla, h112 ψ hψ, hB ψ hψ, h ψ hψ⟩
Snapshot fingerprint
SHA-256: afbbf8ec0a8aca08b7935c6118c76eef06b2eee896805e7de277b9d4e09fc52b
8,117 bytes, unchanged from the original archive.
Formalism.SharpRestriction.RamificationFrobenius.TotientGaloisClasses.Window
Arbitrarily late power windows
HasWindows requires whole intervals [Y,Y^la] arbitrarily far out; FormBAt turns the one-sided bound there into nonvanishing.
7def HasWindows (S : Set ℝ) (la : ℝ) : Prop :=
8 ∀ y : ℝ, ∃ Y : ℝ, y ≤ Y ∧ ∀ x : ℝ, Y ≤ x → x ≤ Y ^ la → x ∈ S
9
10theorem HasWindows.mono {S S' : Set ℝ} {la x0 : ℝ} (h : HasWindows S la) (hS : ∀ x ≥ x0, x ∈ S → x ∈ S') :
11 HasWindows S' la := by
12 intro y
13 obtain ⟨Y, hyY, hY⟩ := h (max y x0)
14 exact ⟨Y, (le_max_left _ _).trans hyY,
15 fun x h1 h2 => hS x ((le_max_right _ _).trans (hyY.trans h1)) (hY x h1 h2)⟩
…
24def LandauWinAt (la : ℝ) : Prop :=
25 ∀ θ : ℝ, 0 < θ → θ < 1 → (∃ ψ ∈ Λ.KEPT, ∃ s : ℂ, θ < s.re ∧ DirichletCharacter.LFunction ψ.χ s = 0) →
26 ∃ Y0 : ℝ, ∀ Y ≥ Y0, ∃ y : ℝ, Y ≤ y ∧ y ≤ Y ^ la ∧ y ^ θ < Λ.Gm y
27
28def LandauWin : Prop := ∀ la : ℝ, 1 < la → Λ.LandauWinAt la
29
30def FormBAt (la : ℝ) : Prop :=
31 ∀ θ : ℝ, 0 < θ → θ < 1 → HasWindows {x | Λ.Gm x ≤ x ^ θ} la → Λ.ZeroFreeAbove θ
32
33def FormB : Prop := ∀ la : ℝ, 1 < la → Λ.FormBAt la
Snapshot fingerprint
SHA-256: 882989a78da888b0462d17f285e42e44970a3dee70c1dc8c667fb5a3f985c2f7
1,825 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.CharacterBoxes.ZeroFreeAllOfTopG
Assembling the character-specific nonvanishing input
Connects host-supplied families to the arithmetic window bound and the analytic FormB criterion for each cyclic character level.
12def TopG : Prop :=
13 ∀ (la : ℝ) (G : FReq), 1 < la → HostExW la G.req →
14 (∀ {eps : ℝ} (Fm : FamP eps), G.cls la Fm → HypV Fm.toFamCore) → FamilyClassConnected (G.cls la)
15
16theorem hypV_of_cls (ψ : PChar) (la : ℝ) {eps : ℝ} (Fm : FamP eps) (h : (GChi ψ).cls la Fm) : HypV Fm.toFamCore :=
17 ⟨Fm.x1 + 1, fun x hx i => (h.2 x (by linarith) i).2⟩
18
19theorem eFamC_of_cls (ψ : PChar) (la : ℝ) {eps : ℝ} (Fm : FamP eps) (h : (GChi ψ).cls la Fm) :
20 EFamC (Level.cyc ψ) Fm.toFamCore := by
21 refine ⟨4, Fm.x1 + 1, fun x hx i => ?_⟩
22 have h1 := (h.2 x (by linarith) i).1
23 rw [Fm.L_x x i (by linarith), Fm.L_eps x i] at h1
24 exact h1
25
26theorem zeroFreeAll_of_topG {la : ℝ} (hla : 1 < la) (h : TopG) (hS : ∀ ψ : PChar, HostExW la (GChi ψ).req) : ZeroFreeAll := by
27 have key : ZeroFreeOn fun _ => True :=
28 zeroFreeOn_of_tiedWin_cyc (Fam := FamP) (core := fun Fm => Fm.toFamCore) (Tied := fun Fm => ChainTied Fm) hla
29 (fun ψ _ => UpperTheory.Comparison₂.level_gm_le_on_family_scales _) (fun ψ _ => UpperTheory.Comparison₂.formB _) fun ψ _ => by
30 obtain ⟨eD, eL, ε₁, h1, h2⟩ := h la (GChi ψ) hla (hS ψ) (hypV_of_cls ψ la)
31 refine ⟨eD, eL, ε₁, h1, fun eps a b => ?_⟩
32 obtain ⟨Fm, c, d⟩ := h2 eps a b
33 exact ⟨Fm, eFamC_of_cls ψ la Fm c, c.1, d⟩
34 exact key
Snapshot fingerprint
SHA-256: 349d9eafe63952c2fa4ccb2055bef7de0144d442c552196183fe48f01958f033
1,791 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.PrimitiveCosets.LevelFamily
Identifying the arithmetic packet with an analytic character family
Positive weights and level_family identify the two Gm definitions and their nonvanishing conclusions.
9private noncomputable def UpperTheory.Comparison₂.level_family_wt (Λ : Level) (ψ : PChar) : ℝ :=
10 if ψ = PChar.one then 1 else Λ.wt ψ
11
12private theorem UpperTheory.Comparison₂.level_family_wt_pos (Λ : Level) (ψ : PChar) : 0 < UpperTheory.Comparison₂.level_family_wt Λ ψ := by
13 unfold UpperTheory.Comparison₂.level_family_wt Level.wt
14 split_ifs
15 · exact one_pos
16 · exact one_pos
17 · positivity
18
19private theorem UpperTheory.Comparison₂.level_family_adm (ψ : PChar) : ψ.N = 1 ∨ ψ.χ ≠ 1 := by
20 by_cases h : ψ.χ = 1
21 · left
22 have hp := ψ.prim
23 rw [DirichletCharacter.IsPrimitive, h, DirichletCharacter.conductor_one] at hp
24 exact hp.symm
25 · exact Or.inr h
…
41theorem UpperTheory.Comparison₂.level_family :
42 ∀ Λ : Level, ∃ F : Deduction.CharFamily, (∀ y, Deduction.Gm F y = Λ.Gm y) ∧ ∀ θ, Deduction.ZeroFree F θ ↔ Λ.ZeroFreeAbove θ := by
43 intro Λ
44 refine ⟨@Deduction.CharFamily.mk Λ.KEPT _ (fun i => i.1.N) (fun i => i.1.ne) (fun i => i.1.χ) (fun i => UpperTheory.Comparison₂.level_family_wt Λ i.1) (fun i => UpperTheory.Comparison₂.level_family_wt_pos Λ i.1) (fun i => UpperTheory.Comparison₂.level_family_adm i.1), fun y => ?_, fun θ => ?_⟩
45 · rw [← UpperTheory.Comparison₂.level_family_sum Λ y, Deduction.Gm]
46 exact Finset.sum_coe_sort Λ.KEPT (fun ψ => UpperTheory.Comparison₂.level_family_wt Λ ψ * (Deduction.Gchi ψ.χ y).re)
47 · simp only [Deduction.ZeroFree, Level.ZeroFreeAbove, PChar.ZeroFreeAbove]
48 constructor
49 · intro h ψ hψ s hs
50 exact h ⟨ψ, hψ⟩ s hs
51 · intro h i s hs
52 exact h i.1 i.2 s hs
Snapshot fingerprint
SHA-256: 99ab2af08664a9d1cf3afbe5113894d2b56bb64eb052a378f62d027d0f74354e
3,034 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.PrimitiveCosets.Imports
The Landau criterion for every arithmetic level
Applies the general analytic theorem with delta = la - 1 and C = 1 after identifying the level family.
8theorem UpperTheory.Comparison₂.formB :
9 ∀ Λ : Level, Λ.FormB := by
10 intro Λ la hla θ hθ0 hθ1 hW
11 obtain ⟨F, hG, hZ⟩ := UpperTheory.Comparison₂.level_family Λ
12 rw [← hZ]
13 refine Deduction.zeroFree_of_rpow_window F (δ := la - 1) (C := 1) hθ0 hθ1 (by linarith) fun Y₀ => ?_
14 obtain ⟨Y, hY, hx⟩ := hW Y₀
15 refine ⟨Y, hY, fun y hy => ?_⟩
16 have h1 : (1 : ℝ) + (la - 1) = la := by ring
17 rw [h1] at hy
18 rw [hG, one_mul]
19 exact hx y hy.1 hy.2
Snapshot fingerprint
SHA-256: 9d38c47879d3c02199f747433f009ba4cf6eb44d7480f031e5763a2ee271950e
1,122 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.ZeroFreeOfRpowWindow
Power bounds on late windows imply nonvanishing
The exact theorem takes 0 < theta < 1, delta > 0 and arbitrarily late window bounds Gm(y) <= C y^theta.
11theorem zeroFree_of_rpow_window (F : CharFamily) {θ δ C : ℝ} (hθ : 0 < θ) (hθ1 : θ < 1) (hδ : 0 < δ)
12 (h : ∀ Y₀ : ℝ, ∃ Y : ℝ, Y₀ ≤ Y ∧ ∀ y ∈ Set.Icc Y (Y ^ (1 + δ)), Gm F y ≤ C * y ^ θ) :
13 ZeroFree F θ :=
14 lemmaL F hθ hθ1 hδ (windowHyp_of_rpow F hδ h)
Snapshot fingerprint
SHA-256: 3252473ba2654b05e9d2ea0781ea91b4c7eadcca0def18b0f21d20212c2f0316
668 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.WindowHypOfRpow
Converting a power bound into an integral majorant
Chooses R(y) = |C| y^theta, whose weighted integral equals |C| delta log Y and is eventually at most Y^eta.
9theorem windowHyp_of_rpow_eventually (K η : ℝ) (hK : 0 ≤ K) (hη : 0 < η) :
10 ∃ Y₁ : ℝ, ∀ Y : ℝ, Y₁ ≤ Y → 1 ≤ Y ∧ K * Real.log Y ≤ Y ^ η := by
…
27theorem windowHyp_of_rpow (F : CharFamily) {θ δ C : ℝ} (hδ : 0 < δ)
28 (h : ∀ Y₀ : ℝ, ∃ Y : ℝ, Y₀ ≤ Y ∧ ∀ y ∈ Set.Icc Y (Y ^ (1 + δ)), Gm F y ≤ C * y ^ θ) :
29 WindowHyp F θ δ := by
30 intro η hη Y₀
31 obtain ⟨Y₁, hY₁⟩ := windowHyp_of_rpow_eventually (|C| * δ) η (by positivity) hη
32 obtain ⟨Y, hY, hb⟩ := h (max Y₀ Y₁)
33 obtain ⟨h1, hK⟩ := hY₁ Y (le_trans (le_max_right _ _) hY)
34 have hY0 : 0 < Y := by linarith
35 have hle : Y ≤ Y ^ (1 + δ) := by
36 calc Y = Y ^ (1 : ℝ) := (Real.rpow_one Y).symm
37 _ ≤ Y ^ (1 + δ) := Real.rpow_le_rpow_of_exponent_le h1 (by linarith)
38 have heq : Set.EqOn (fun y : ℝ => |C| * y ^ θ * y ^ (-θ - 1)) (fun y : ℝ => |C| * y⁻¹)
39 (Set.Icc Y (Y ^ (1 + δ))) := by
40 intro y hy
41 have hy0 : 0 < y := lt_of_lt_of_le hY0 hy.1
42 simp only
43 rw [mul_assoc, ← Real.rpow_add hy0, show θ + (-θ - 1) = -1 by ring, Real.rpow_neg_one]
44 refine ⟨Y, le_trans (le_max_left _ _) hY, fun y => |C| * y ^ θ, ?_, ?_, ?_⟩
…
48 · intro y hy
49 have hy0 : 0 < y := lt_of_lt_of_le hY0 hy.1
50 have hp : 0 ≤ y ^ θ := by positivity
51 exact ⟨by positivity, (hb y hy).trans (mul_le_mul_of_nonneg_right (le_abs_self C) hp)⟩
52 · rw [setIntegral_congr_fun measurableSet_Icc heq, integral_Icc_eq_integral_Ioc,
53 ← intervalIntegral.integral_of_le hle, intervalIntegral.integral_const_mul,
54 integral_inv_of_pos hY0 (lt_of_lt_of_le hY0 hle),
55 Real.log_div (lt_of_lt_of_le hY0 hle).ne' hY0.ne', Real.log_rpow hY0]
56 calc |C| * ((1 + δ) * Real.log Y - Real.log Y) = |C| * δ * Real.log Y := by ring
57 _ ≤ Y ^ η := hK
Snapshot fingerprint
SHA-256: f9238ed2d6c67f1cbe383a33cc3759c00bed31b97a10253fbee59279290c6a5c
2,999 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.DedekindLFunctions.LandauZeroFreeCriterion
The analytic continuation and pole contract
Defines the logarithmic-scale error, zero set, Laplace-transform continuation and nonzero pole residues, with positivity at real poles.
9def gm (F : CharFamily) (u : ℝ) : ℝ := Gm F (Real.exp u)
10
11def zeroSet (F : CharFamily) : Set ℂ :=
12 {ρ | 0 < ρ.re ∧ ∃ i, DirichletCharacter.LFunction (F.χ i) ρ = 0 ∨
13 DirichletCharacter.LFunction (F.χ i) ((starRingEnd ℂ) ρ) = 0}
14
15structure PoleData (g : ℝ → ℝ) (Φ : ℂ → ℂ) (Z : Set ℂ) : Prop where
16 meas : Measurable g
17 growth : ∃ C : ℝ, ∀ u : ℝ, 0 ≤ u → |g u| ≤ C * Real.exp (2 * u)
18 laplace : ∀ s : ℂ, 2 < s.re → Φ s = ∫ u in Ioi (0 : ℝ), (g u : ℂ) * cexp (-s * u)
19 pos : ∀ ρ ∈ Z, 0 < ρ.re
20 diff : DifferentiableOn ℂ Φ ({s : ℂ | 0 < s.re} \ Z)
21 iso : ∀ z : ℂ, 0 < z.re → ∀ᶠ w in 𝓝[≠] z, w ∉ Z
22 pole : ∀ ρ ∈ Z, ∃ c : ℂ, c ≠ 0 ∧ (ρ.im = 0 → 0 < c.re ∧ c.im = 0) ∧
23 ∃ h : ℂ → ℂ, AnalyticAt ℂ h ρ ∧ ∀ᶠ s in 𝓝[≠] ρ, Φ s = c / (s - ρ) + h s
24
25def WindowHypU (g : ℝ → ℝ) (θ δ : ℝ) : Prop :=
26 ∀ η : ℝ, 0 < η → ∀ U₀ : ℝ, ∃ U : ℝ, U₀ ≤ U ∧ ∃ R : ℝ → ℝ,
27 IntegrableOn (fun u => R u * Real.exp (-θ * u)) (Icc U ((1 + δ) * U)) ∧
28 (∀ u ∈ Icc U ((1 + δ) * U), 0 ≤ R u ∧ g u ≤ R u) ∧
29 ∫ u in Icc U ((1 + δ) * U), R u * Real.exp (-θ * u) ≤ Real.exp (η * U)
Snapshot fingerprint
SHA-256: d4c5a8ba961bb0e91121212b697217904bf0ba56c2e89c00435fb7ee416a22d7
2,678 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.poleData
Why zeros give uncancelled poles
Builds the transform from character and inverse-character contributions; positive weights and zero multiplicities make every residue nonzero.
22theorem poleData_abstract (g : ℂ → ℂ) (hg : Differentiable ℂ g) (h1 : g 1 ≠ 0) (k : ℂ) :
23 ∃ Φ : ℂ → ℂ,
24 (∀ s, s ≠ 1 → Φ s =
25 -(deriv g s / g s - s * (deriv g 1 / g 1) + k * (1 - s)) / (s * (s - 1))) ∧
26 (∀ ρ, ρ ≠ 0 → g ρ ≠ 0 → AnalyticAt ℂ Φ ρ) ∧
27 (∀ ρ, ρ ≠ 0 → ∃ m : ℕ, (m = 0 ↔ g ρ ≠ 0) ∧ ∃ h : ℂ → ℂ, AnalyticAt ℂ h ρ ∧
28 ∀ᶠ s in 𝓝[≠] ρ, Φ s = (m : ℂ) * (-1 / (ρ * (ρ - 1))) / (s - ρ) + h s) ∧
29 (∀ z, ∀ᶠ w in 𝓝[≠] z, g w ≠ 0) := by
…
248theorem poleData (F : CharFamily) : ∃ Φ : ℂ → ℂ, PoleData (gm F) Φ (zeroSet F) := by
249 classical
250 have adm' : ∀ i, F.N i = 1 ∨ (F.χ i)⁻¹ ≠ 1 := fun i => (F.adm i).imp id (fun h => inv_ne_one.mpr h)
251 choose Φ1 hΦ1int hΦ1an hΦ1pol hΦ1iso using fun i => poleData_char (F.χ i) (F.adm i)
252 choose Φ2 hΦ2int hΦ2an hΦ2pol hΦ2iso using fun i => poleData_char (F.χ i)⁻¹ (adm' i)
253 choose C hC using fun i => Gchi_growth (F.χ i)
254 have hZ : ∀ ρ, ρ ∈ zeroSet F ↔ 0 < ρ.re ∧ ∃ i, DirichletCharacter.LFunction (F.χ i) ρ = 0 ∨
255 DirichletCharacter.LFunction (F.χ i) ((starRingEnd ℂ) ρ) = 0 := by
256 intro ρ
257 rw [zeroSet.eq_1]
258 rfl
259 have hconj : ∀ i (w : ℂ), DirichletCharacter.LFunction (F.χ i) ((starRingEnd ℂ) w) = 0 ↔
260 DirichletCharacter.LFunction (F.χ i)⁻¹ w = 0 := fun i w => (poleData_inv_zero (F.χ i) w).symm
261 refine ⟨fun s => ∑ i, (F.a i : ℂ) / 2 * (Φ1 i s + Φ2 i s), ?_⟩
262 refine PoleData.mk ?_ ?_ ?_ ?_ ?_ ?_ ?_
…
336 · intro ρ hρ
337 obtain ⟨hρre, i0, hi0⟩ := (hZ ρ).1 hρ
338 have hρ0 : ρ ≠ 0 := fun h => by rw [h] at hρre; simp at hρre
339 have hρ1 : ρ ≠ 1 := by
340 intro h
341 rcases hi0 with h' | h'
342 · exact charFamily_LFunction_ne_zero_of_one_le_re F i0 ρ (by rw [h]; simp) h'
343 · exact charFamily_LFunction_ne_zero_of_one_le_re F i0 _ (by rw [h]; simp) h'
344 choose m1 hm1 h1 hh1an hh1ev using fun i => hΦ1pol i ρ hρ0
345 choose m2 hm2 h2 hh2an hh2ev using fun i => hΦ2pol i ρ hρ0
346 obtain ⟨S, hS⟩ : ∃ S : ℝ, S = ∑ i, F.a i / 2 * ((m1 i : ℝ) + m2 i) := ⟨_, rfl⟩
347 have hS0 : 0 < S := by
348 have hpos : 0 < F.a i0 / 2 * ((m1 i0 : ℝ) + m2 i0) := by
349 apply mul_pos (by linarith [F.a_pos i0])
350 have hm1n : (0:ℝ) ≤ m1 i0 := Nat.cast_nonneg _
351 have hm2n : (0:ℝ) ≤ m2 i0 := Nat.cast_nonneg _
352 rcases hi0 with h | h
353 · have hne : m1 i0 ≠ 0 := fun hm => ((hm1 i0).1 hm) h
354 have : (1:ℝ) ≤ m1 i0 := by exact_mod_cast Nat.one_le_iff_ne_zero.mpr hne
355 linarith
356 · have hne : m2 i0 ≠ 0 := fun hm => ((hm2 i0).1 hm) ((hconj i0 ρ).1 h)
357 have : (1:ℝ) ≤ m2 i0 := by exact_mod_cast Nat.one_le_iff_ne_zero.mpr hne
358 linarith
359 rw [hS]
360 calc 0 < F.a i0 / 2 * ((m1 i0 : ℝ) + m2 i0) := hpos
361 _ ≤ ∑ i, F.a i / 2 * ((m1 i : ℝ) + m2 i) :=
362 Finset.single_le_sum (f := fun i => F.a i / 2 * ((m1 i : ℝ) + m2 i))
363 (fun i _ => by have := F.a_pos i; positivity) (Finset.mem_univ i0)
364 refine ⟨(S : ℂ) * (-1 / (ρ * (ρ - 1))), ?_, ?_, ?_⟩
365 · have hr0 : (-1 / (ρ * (ρ - 1)) : ℂ) ≠ 0 :=
366 div_ne_zero (by norm_num) (mul_ne_zero hρ0 (sub_ne_zero.mpr hρ1))
367 exact mul_ne_zero (by exact_mod_cast hS0.ne') hr0
368 · intro him
369 have hρx : ρ = (ρ.re : ℂ) := by
370 apply Complex.ext <;> simp [him]
371 have hlt : ρ.re < 1 := by
372 by_contra hge
373 push_neg at hge
374 rcases hi0 with h' | h'
375 · exact charFamily_LFunction_ne_zero_of_one_le_re F i0 ρ hge h'
376 · exact charFamily_LFunction_ne_zero_of_one_le_re F i0 _ (by simpa using hge) h'
377 have hc : (S : ℂ) * (-1 / (ρ * (ρ - 1))) = ((S * (-1 / (ρ.re * (ρ.re - 1))) : ℝ) : ℂ) := by
378 push_cast
379 rw [← hρx]
380 rw [hc, Complex.ofReal_re, Complex.ofReal_im]
381 refine ⟨?_, rfl⟩
382 have hneg : ρ.re * (ρ.re - 1) < 0 := mul_neg_of_pos_of_neg hρre (by linarith)
383 exact mul_pos hS0 (div_pos_of_neg_of_neg (by norm_num) hneg)
Snapshot fingerprint
SHA-256: 78fb8ae795a01ad687440b035c377a9fde71088c726d1ac862ba0fd8bb1fc3c0
20,079 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.landauWindowIneq
Why one-sided control suffices
Uses |g| + g <= 2R on the window and estimates the tails to bound a transform coefficient norm plus a real coefficient.
27theorem landau_window_ineq {g R : ℝ → ℝ} (hg : Measurable g) {C₀ : ℝ}
28 (hC : ∀ u : ℝ, 0 ≤ u → |g u| ≤ C₀ * Real.exp (2 * u)) {σ θ U V : ℝ} (hσ : 2 < σ) (hθ : θ < σ) (hU : 0 < U)
29 (hR : IntegrableOn (fun u => R u * Real.exp (-θ * u)) (Icc U V))
30 (hR' : ∀ u ∈ Icc U V, 0 ≤ R u ∧ g u ≤ R u) (k : ℕ) (γ : ℝ) :
31 ‖∫ u in Ioi (0 : ℝ), (g u : ℂ) * (u : ℂ) ^ k * cexp (-((σ : ℂ) + γ * I) * u) / (k.factorial : ℂ)‖ ≤
32 2 * (1 / (σ - θ) ^ k) * (∫ u in Icc U V, R u * Real.exp (-θ * u)) -
33 (∫ u in Ioi (0 : ℝ), (g u : ℂ) * (u : ℂ) ^ k * cexp (-(σ : ℂ) * u) / (k.factorial : ℂ)).re +
34 2 * C₀ * ∫ u in Ioi (0 : ℝ) \ Icc U V, u ^ k * Real.exp ((2 - σ) * u) / (k.factorial : ℝ) := by
…
80 have hA : ∫ u in Icc U V, (|g u| * w u + g u * w u)
81 ≤ 2 * (1 / (σ - θ) ^ k) * (∫ u in Icc U V, R u * Real.exp (-θ * u)) := by
82 rw [← integral_const_mul]
83 refine setIntegral_mono_on (hI3.mono_set hsub) (hR.const_mul _) measurableSet_Icc fun u hu => ?_
84 have hu0 : 0 ≤ u := le_of_lt (hsub hu)
85 obtain ⟨h1, h2⟩ := hR' u hu
86 have h3 : |g u| + g u ≤ 2 * R u := by
87 rcases abs_cases (g u) with h | h <;> linarith [h.1]
88 have h4 : w u ≤ 1 / (σ - θ) ^ k * Real.exp (-θ * u) := by
89 have h5 := landau_kernel_max k (sub_pos.2 hθ) hu0
90 have h6 : w u = (u ^ k * Real.exp (-(σ - θ) * u) / (k.factorial : ℝ)) * Real.exp (-θ * u) := by
91 simp only [hw]
92 have : -σ * u = -(σ - θ) * u + -θ * u := by ring
93 rw [this, Real.exp_add]; ring
94 rw [h6]
95 exact mul_le_mul_of_nonneg_right h5 (Real.exp_pos _).le
96 calc |g u| * w u + g u * w u = (|g u| + g u) * w u := by ring
97 _ ≤ (2 * R u) * w u := mul_le_mul_of_nonneg_right h3 (hw0 u hu0)
98 _ ≤ (2 * R u) * (1 / (σ - θ) ^ k * Real.exp (-θ * u)) :=
99 mul_le_mul_of_nonneg_left h4 (by linarith)
100 _ = _ := by ring
Snapshot fingerprint
SHA-256: e3d5d760bcefe1242d4f5b0ced44fc055f1fa8dfe048a2222cf2c39ae812e59c
6,547 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.landauWindow
The windowed Landau pole-exclusion theorem
Late windows bound high derivatives; nearest-pole asymptotics and Cauchy estimates contradict the resulting geometric growth rates.
20theorem landau_window_contra {c d e E M C : ℝ} (hc : 0 < c) (hd : 0 < d) (hde : d < e) (heE : e ≤ E)
21 (H : ∀ η : ℝ, 0 < η → ∀ U₀ : ℝ, ∃ U : ℝ, U₀ ≤ U ∧ ∃ k : ℕ, U ≤ k ∧
22 c / d ^ k ≤ M / e ^ k + C * Real.exp (η * U) / E ^ k) : False := by
…
40theorem landau_window_key {g : ℝ → ℝ} {Φ : ℂ → ℂ} {Z : Set ℂ} (hP : PoleData g Φ Z) {θ δ : ℝ}
41 (hθ : 0 < θ) (hθ1 : θ < 1) (hδ : 0 < δ) (hW : WindowHypU g θ δ) :
42 ∃ σ : ℝ, 2 < σ ∧ ∃ C : ℝ, ∀ η : ℝ, 0 < η → ∀ U₀ : ℝ, ∃ U : ℝ, U₀ ≤ U ∧ ∃ k : ℕ, U ≤ k ∧ ∀ γ : ℝ,
43 ‖(-1) ^ k * iteratedDeriv k Φ ((σ : ℂ) + γ * I) / (k.factorial : ℂ)‖ +
44 ((-1) ^ k * iteratedDeriv k Φ (σ : ℂ) / (k.factorial : ℂ)).re ≤
45 C * Real.exp (η * U) / (σ - θ) ^ k := by
…
83theorem landau_window {g : ℝ → ℝ} {Φ : ℂ → ℂ} {Z : Set ℂ} (hP : PoleData g Φ Z) {θ δ : ℝ}
84 (hθ : 0 < θ) (hθ1 : θ < 1) (hδ : 0 < δ) (hW : WindowHypU g θ δ) : ∀ ρ ∈ Z, ρ.re ≤ θ := by
85 intro ρ₀ h₀
86 by_contra hρ₀
87 rw [not_le] at hρ₀
88 obtain ⟨σ, hσ, C, hkey⟩ := landau_window_key hP hθ hθ1 hδ hW
89 have hle : ∀ ρ ∈ Z, ρ.re < σ := fun ρ hρ => (landau_pole_re_le hP ρ hρ).trans_lt hσ
90 rcases landau_dichotomy hP.iso hle hθ (by linarith) h₀ hρ₀ with
91 ⟨D, hD, hfree, ρ₁, h₁, hρ₁⟩ | ⟨β, hβZ, hβ, r, hr1, hr2, huniq⟩
92 · obtain ⟨γ, ρ, hρ, r, hr1, hr2, huniq⟩ := landau_nearest hP.iso hle (by linarith : D < σ) h₁ hρ₁
93 obtain ⟨c, hc, -, hp⟩ := hP.pole ρ hρ
…
113 obtain ⟨M, hM⟩ := landau_pole_asym (r' := (d + r) / 2) hball hne hdiff hp (by linarith) (by linarith)
114 obtain ⟨M', hM'⟩ := landau_cauchy (r' := (d + r) / 2) hdiff' (by linarith) (by linarith)
115 refine landau_window_contra (c := ‖c‖ / d) (d := d) (e := (d + r) / 2) (E := σ - θ) (M := M + M') (C := C)
116 (div_pos (norm_pos_iff.2 hc) hd) hd (by linarith) (by linarith) fun η hη U₀ => ?_
…
134 · obtain ⟨c, -, hc, hp⟩ := hP.pole β hβZ
135 obtain ⟨hc1, hc2⟩ := hc (Complex.ofReal_im β)
136 have hd : 0 < σ - β := by
137 have := hle β hβZ
138 rw [Complex.ofReal_re] at this
139 linarith
140 have hne : (β : ℂ) ≠ (σ : ℂ) := by
141 intro h
142 have : β = σ := by exact_mod_cast h
143 linarith
144 have hball : (β : ℂ) ∈ Metric.ball (σ : ℂ) r := by
145 rw [Metric.mem_ball, dist_comm, dist_eq_norm, ← Complex.ofReal_sub, Complex.norm_real,
146 Real.norm_eq_abs, abs_of_pos hd]
147 exact hr1
148 have hdiff : DifferentiableOn ℂ Φ (Metric.ball (σ : ℂ) r \ {(β : ℂ)}) := by
149 refine hP.diff.mono ?_
150 rintro w ⟨hw, hw'⟩
151 exact ⟨landau_window_re_pos (by rw [Complex.ofReal_re]; linarith) hw,
152 fun hZ => hw' (huniq w hZ hw)⟩
153 obtain ⟨M, hM⟩ := landau_pole_asym (r' := (σ - β + r) / 2) hball hne hdiff hp (by linarith) (by linarith)
154 refine landau_window_contra (c := c.re / (σ - β)) (d := σ - β) (e := (σ - β + r) / 2) (E := σ - θ)
155 (M := M) (C := C) (div_pos hc1 hd) hd (by linarith) (by linarith) fun η hη U₀ => ?_
Snapshot fingerprint
SHA-256: 57f49606e6ffd8cab45672d8d4b9c7ded6c0b6b0d140821cc51b5baeb4f67ab5
9,681 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.lemmaL
Translating pole exclusion back to L-function nonvanishing
Combines poleData and landau_window, using established nonvanishing on Re(s) >= 1 separately.
13theorem lemmaL (F : CharFamily) {θ δ : ℝ} (hθ : 0 < θ) (hθ1 : θ < 1) (hδ : 0 < δ) (h : WindowHyp F θ δ) :
14 ZeroFree F θ := by
15 intro i s hs hzero
16 obtain ⟨Φ, hP⟩ := poleData F
17 have hZ := landau_window hP hθ hθ1 hδ (windowHypU_of_windowHyp F hδ h)
18 by_cases h1 : 1 ≤ s.re
19 · exact charFamily_LFunction_ne_zero_of_one_le_re F i s h1 hzero
20 · have hmem : s ∈ zeroSet F := ⟨by linarith, i, Or.inl hzero⟩
21 have := hZ s hmem
22 linarith
Snapshot fingerprint
SHA-256: 4ce94b876b46e0a3b038c4bfe9ade933c7225170bf07421109ee862fd5941e3d
1,053 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.CharacterBoxes.Imprimitive
Extending from primitive characters to every character
The inducing primitive L-function is nonzero, and every added Euler factor is nonzero because its subtracted term has norm less than one.
5theorem UpperTheory.Top.imprimitive :
6 ZeroFreeAll → ∀ (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N) (s : ℂ), 1 / 2 < s.re → (χ ≠ 1 ∨ s ≠ 1) →
7 DirichletCharacter.LFunction χ s ≠ 0 := by
8 intro h N _ χ s hs hχs
9 haveI : NeZero χ.conductor := (PChar.of χ).ne
10 have hL : DirichletCharacter.LFunction χ.primitiveCharacter s ≠ 0 := h (PChar.of χ) trivial s hs
11 have hχ' : χ.primitiveCharacter ≠ 1 ∨ s ≠ 1 := by
12 rcases hχs with hχ | hs1
13 · left
14 intro h1
15 apply hχ
16 rw [← χ.changeLevel_primitiveCharacter, h1, DirichletCharacter.changeLevel_one]
17 · exact Or.inr hs1
18 have hrw := DirichletCharacter.LFunction_changeLevel χ.conductor_dvd_level χ.primitiveCharacter hχ'
19 rw [χ.changeLevel_primitiveCharacter] at hrw
20 rw [hrw]
21 refine mul_ne_zero hL (Finset.prod_ne_zero_iff.mpr fun p hp => ?_)
22 have hp' := Nat.prime_of_mem_primeFactors hp
23 intro h0
24 have key : χ.primitiveCharacter p * (p : ℂ) ^ (-s) = 1 := by linear_combination -h0
25 have h1 : ‖χ.primitiveCharacter (p : ZMod χ.conductor)‖ ≤ 1 := DirichletCharacter.norm_le_one _ _
26 have h2 : ‖(p : ℂ) ^ (-s)‖ < 1 := by
27 rw [Complex.norm_natCast_cpow_of_pos hp'.pos, Complex.neg_re]
28 exact Real.rpow_lt_one_of_one_lt_of_neg (by exact_mod_cast hp'.one_lt) (by linarith)
29 have hn : ‖χ.primitiveCharacter p * (p : ℂ) ^ (-s)‖ < 1 := by
30 rw [norm_mul]
31 calc ‖χ.primitiveCharacter (p : ZMod χ.conductor)‖ * ‖(p : ℂ) ^ (-s)‖
32 ≤ 1 * ‖(p : ℂ) ^ (-s)‖ := by gcongr
33 _ < 1 := by simpa using h2
34 rw [key, norm_one] at hn
35 exact lt_irrefl _ hn
Snapshot fingerprint
SHA-256: 8de85415d0d139f23b2b50ba56c18ab3b3e29740f41e2d86eaf99b95765f512e
1,781 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.CharacterBoxes.ExistsPageN
The arithmetic window and its cohomology bound
Defines VVle, the character fields, admissible auxiliary primes, PageN, VAt and VWin. The bound controls weighted cohomology lengths throughout a suitably chosen interval.
12def VVle (E : Type) [Field E] [NumberField E] (t : ℕ) (B : ℝ) : Prop :=
13 ∀ (Ω : Type) [Field Ω] [Algebra E Ω] [IsAlgClosure E Ω] (ld : ∀ (p : ℕ) [Fact p.Prime], Formalism.GaloisCohomology.LData E Ω p),
14 (∀ (p : ℕ) [Fact p.Prime] (e : ℕ), 0 < e → e < t → Formalism.GaloisCohomology.shaLen (ld p) (e : ℤ) ≠ ⊤) ∧
15 ∀ S : Finset Nat.Primes,
16 ∑ l ∈ S, Real.log (l : ℕ) *
17 ∑ e ∈ Finset.Ico 1 t, ((@Formalism.GaloisCohomology.shaLen E Ω _ _ _ _ _ l ⟨l.2⟩ (@ld l ⟨l.2⟩) (e : ℤ)).toNat : ℝ) ≤ B
18
19def IsChiField (ψ : PChar) (e q d : ℕ) (E : Type) [Field E] [NumberField E] : Prop :=
20 ∃ (N : ℕ) (_ : NeZero N) (j : E →ₐ[ℚ] CyclotomicField N ℚ) (ζ : CyclotomicField N ℚ),
21 2 ^ (e + 2) ∣ N ∧ ψ.N ∣ N ∧ q ∣ N ∧ d ∣ N ∧ IsPrimitiveRoot ζ N ∧
22 ∀ (τ : CyclotomicField N ℚ ≃ₐ[ℚ] CyclotomicField N ℚ) (a : ℕ), τ ζ = ζ ^ a →
23 ((∀ x : E, τ (j x) = j x) ↔
24 (a ≡ 1 [MOD 2 ^ (e + 2)] ∨ a + 1 ≡ 0 [MOD 2 ^ (e + 2)]) ∧ ψ.val a = 1 ∧
25 jacobiSym (a : ℤ) q = 1 ∧ jacobiSym (a : ℤ) d = 1)
26
27structure WinPair (eps Y : ℝ) (q d : ℕ) : Prop where
28 q_prime : q.Prime
29 q_mod : q % 8 = 3
30 q_lo : Y ^ (eps / 5) / 2 < Real.log q
31 q_up : Real.log q ≤ Y ^ (eps / 5)
32 d_prime : d.Prime
33 d_mod : d % 16 = 7
34 d_lo : Y ^ (eps / 5) * Real.log Y ^ 2 / 2 < Real.log d
35 d_up : Real.log d ≤ Y ^ (eps / 5) * Real.log Y ^ 2
36 d_q : q ∣ d + 1
37 d_small : ∀ p : ℕ, p.Prime → p ≠ 2 → (p : ℝ) ≤ Y ^ (eps / 5) → p ∣ d + 1
38
39def PageN (eps x : ℝ) (e : ℕ) : Prop := x ^ (2 + 8 * eps) ≤ (2 : ℝ) ^ e ∧ (2 : ℝ) ^ e ≤ 2 * x ^ (2 + 8 * eps)
40
41def VAt (ψ : PChar) (eps Ct : ℝ) (q d e : ℕ) (x : ℝ) : Prop :=
42 ∀ (E : Type) [Field E] [NumberField E], IsChiField ψ e q d E → VVle E ⌊x ^ Ct⌋₊ (Real.sqrt (Real.exp (x ^ eps)))
43
44def VWinAt (ψ : PChar) (Ct : ℝ) : Prop :=
45 ∀ eps : ℝ, 0 < eps → eps < 1 / 52 → ∀ e : ℝ → ℕ, (∀ x ≥ (1 : ℝ), PageN eps x (e x)) →
46 ∃ J : ℝ, 1 ≤ J ∧ ∃ X0 : ℝ, ∀ X ≥ X0, ∀ q d : ℕ, WinPair eps (X ^ (1 / J)) q d →
47 ∃ Y : ℝ, X ^ (1 / J) ≤ Y ∧ Y ^ (2 : ℝ) ≤ X ∧ ∀ x : ℝ, Y ≤ x → x ≤ Y ^ (2 : ℝ) → VAt ψ eps Ct q d (e x) x
48
49def VWin : Prop := ∀ ψ : PChar, VWinAt ψ 401
Snapshot fingerprint
SHA-256: 732c3347fb02e410cf9af8831afdbba1d230fc522c3dbbccdb4b708e5dde73db
3,776 bytes, unchanged from the original archive.
Formalism.GaloisCohomology.Statement
The Galois cohomology module measured by shaLen
Defines local data over primes above l, the inverse cyclotomic twist of Q_l/Z_l, the Sha submodule of first cohomology, and its Z_l-module length.
13abbrev ZlSub : Submodule ℤ_[l] ℚ_[l] := LinearMap.range (Algebra.linearMap ℤ_[l] ℚ_[l])
14
15def QZ : Type := ℚ_[l] ⧸ ZlSub l
…
50def Above : Set (HeightOneSpectrum (𝓞 F)) := {v | ((l : ℕ) : 𝓞 F) ∈ v.asIdeal}
51
52variable (F Ω) in
53
54structure LData where
55
56 S : Finset (HeightOneSpectrum (𝓞 F))
57 hS : (S : Set (HeightOneSpectrum (𝓞 F))) = Above F l
58
59 A : S → ValuationSubring Ω
60 hA : ∀ v, IsPlaceOver (A v) v.1
61
62 chi : GS Ω (S : Set (HeightOneSpectrum (𝓞 F))) →* ℤ_[l]ˣ
63 hchi : chi.comp (toGS Ω _) = cycZ F Ω l
64
65variable {l}
66
67def qzTw (D : LData F Ω l) (e : ℤ) :
68 Representation ℤ_[l] (GS Ω (D.S : Set (HeightOneSpectrum (𝓞 F)))) (QZ l) :=
69 scalRep (QZ l) (D.chi ^ (-e))
70
71def zlTw (D : LData F Ω l) (n : ℤ) :
72 Representation ℤ_[l] (GS Ω (D.S : Set (HeightOneSpectrum (𝓞 F)))) ℤ_[l] :=
73 scalRep ℤ_[l] (D.chi ^ n)
74
75def Sha (D : LData F Ω l) (e : ℤ) : Submodule ℤ_[l] (H1 (qzTw D e)) :=
76 Sha1 (qzTw D e) (locFam D.S D.A) (continuous_locFam D.S D.A)
77
78def shaLen (D : LData F Ω l) (e : ℤ) : ℕ∞ := Module.length ℤ_[l] (Sha D e)
Snapshot fingerprint
SHA-256: 67dc5835eb4b337dfbbbf7f0accd1198b59793ae70f5af34421a7c35410d632c
8,427 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.AutomorphicVarieties.ModularityArgument.ThresholdArguments.DenseThresholdCases.VwinOfRow
From the Galois representation input to VWin
Passes the Row0b hypothesis, its OpenImageCondition wrapper and the imported base-change theorem to the automorphic window construction.
1import Development.AutomorphicArithmetic.AutomorphicVarieties.ModularityArgument.ThresholdArguments.DenseThresholdCases.TopMainZj
2import Development.AutomorphicArithmetic.Foundations.BaseChangeIdentities.DefiniteNHolds
3
4theorem UpperTheory.One.vwin_of_row (h : UpperTheory.GalStar.Row0b fun h rc => UpperTheory.Zero.LLC.IsRecT h rc) : UpperTheory.Top.VWin :=
5 UpperTheory.One.Join.automorphic_window_of_inputs (UpperTheory.LiteratureTheorems.OpenImageCondition.mk h) UpperTheory.BaseChangeIdentities.baseChangeN h
Snapshot fingerprint
SHA-256: d2df45a5cf337190ae6f885e8e43056ae4e804ae8da250a2ab0abd64b1ca7080
515 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.AutomorphicVarieties.ModularityArgument.ThresholdArguments.DenseThresholdCases.TopMainZj
Four families of input to the arithmetic window
Assembles local representation theory, automorphic/Galois statements, Galois cohomology and CM/abelian-variety statements into the literal automorphy theorem used for VWin.
18theorem UpperTheory.One.Join.local_inputs_from_literature (O : _root_.UpperTheory.LiteratureTheorems.OpenImageCondition) :
19 _root_.GlobalTheory.Mem.LiteralAutomorphy.LitLocAlt where
20 bz := (_root_.UpperTheory.LiteratureTheorems.bernstein_zelevinsky_finiteness_of_open O)
21 bern := (_root_.UpperTheory.LiteratureTheorems.bernstein_unitary_product_irreducible_of_open O)
22 geo := (_root_.UpperTheory.LiteratureTheorems.bernstein_zelevinsky_geometric_of_open O)
23 zel := (_root_.UpperTheory.LiteratureTheorems.zelevinsky_polynomial_ring_of_open O)
24 disj := (_root_.UpperTheory.LiteratureTheorems.totally_disjoint_product_irreducible_of_open O)
25 mp := (_root_.UpperTheory.LiteratureTheorems.moy_prasad_jacquet_iso_of_open O)
26 temp := (_root_.UpperTheory.LiteratureTheorems.tempered_product_of_square_integrable_of_open O)
27 seg := (_root_.UpperTheory.LiteratureTheorems.ess_square_integrable_segments_of_open O)
28 sq := (_root_.UpperTheory.LiteratureTheorems.square_integrable_segment_of_open O)
29 gen := (_root_.UpperTheory.LiteratureTheorems.generic_unlinked_gl_of_open O)
30 multi := (_root_.UpperTheory.LiteratureTheorems.langlands_multisegments_of_open O)
31 exh := (_root_.UpperTheory.LiteratureTheorems.langlands_exhaustion_gl_of_open O)
32 cos := (_root_.UpperTheory.LiteratureTheorems.standard_cosocle_gl_of_open O)
33 conv := (_root_.UpperTheory.LiteratureTheorems.local_converse_gl_of_open O)
34 dzi := (_root_.UpperTheory.LiteratureTheorems.depth_zero_induction_of_open O)
35 brauer := (_root_.UpperTheory.LiteratureTheorems.brauer_degree_zero_of_open O)
36 chev := (_root_.UpperTheory.LiteratureTheorems.chevalley_units_of_open O)
37 green := (_root_.UpperTheory.LiteratureTheorems.green_regular_characters_of_open O)
38theorem UpperTheory.One.Join.automorphic_inputs_from_literature (O : _root_.UpperTheory.LiteratureTheorems.OpenImageCondition) (bc : _root_.PositivityTheory.Rg.BcN.BaseChangeIsobaricN)
39 (gal : _root_.UpperTheory.V.Z.Win.RowT) : _root_.GlobalTheory.Mem.LiteralAutomorphy.LiteratureAutomorphyHypothesis where
40 decay := (_root_.UpperTheory.LiteratureTheorems.cusp_rapid_decay_of_open O)
41 hc := (_root_.UpperTheory.LiteratureTheorems.harish_chandra_finite_of_open O)
42 fin := (_root_.UpperTheory.LiteratureTheorems.automorphic_forms_finite_gl_of_open O)
43 js := (_root_.UpperTheory.LiteratureTheorems.jacquet_shalika_of_open O)
44 cusp := (_root_.UpperTheory.LiteratureTheorems.cuspidal_spectrum_gl_of_open O)
45 bc := bc
46 gk := (_root_.UpperTheory.LiteratureTheorems.gelfand_kazhdan_dual_of_open O)
47 gal := gal
48 pur := (_root_.UpperTheory.LiteratureTheorems.clozel_purity_of_open O)
49 coh := (_root_.UpperTheory.LiteratureTheorems.clozel_cohomological_of_open O)
50 art := (_root_.UpperTheory.LiteratureTheorems.global_artin_reciprocity_of_open O)
51 ray := (_root_.UpperTheory.LiteratureTheorems.ray_class_field_st_of_open O)
52 chA := (_root_.UpperTheory.LiteratureTheorems.hecke_ladic_character_above_of_open O)
53 chW := (_root_.UpperTheory.LiteratureTheorems.algebraic_character_wd_of_open O)
54 berger := (_root_.UpperTheory.LiteratureTheorems.de_rham_pot_semistable_of_open O)
55theorem UpperTheory.One.Join.v_window_of_depth_zero_residual_bc_cm (O : _root_.UpperTheory.LiteratureTheorems.OpenImageCondition)
56 (bc : _root_.PositivityTheory.Rg.BcN.BaseChangeIsobaricN) (gal : _root_.UpperTheory.V.Z.Win.RowT) (cm : _root_.GlobalTheory.Mem.LiteralAutomorphy.LiteratureCMHypothesis) :
57 UpperTheory.Top.VWin :=
58 _root_.UpperTheory.V.v_window_of_literal_automorphy_n ⟨_root_.UpperTheory.One.Join.local_inputs_from_literature O, _root_.UpperTheory.One.Join.automorphic_inputs_from_literature O bc gal, _root_.UpperTheory.LiteratureTheorems.galois_cohomology_from_literature O, cm⟩
59theorem UpperTheory.One.Join.cm_abelian_inputs_from_literature (O : _root_.UpperTheory.LiteratureTheorems.OpenImageCondition) : _root_.GlobalTheory.Mem.LiteralAutomorphy.LiteratureCMHypothesis where
60 gm := (_root_.UpperTheory.LiteratureTheorems.grothendieck_deformation_of_open O)
61 dr := (_root_.UpperTheory.LiteratureTheorems.abelian_de_rham_of_open O)
62 dual := (GlobalTheory.abelianDualCrystal_of_dual_of_smoothLift (_root_.UpperTheory.LiteratureTheorems.dual_abelian_scheme_of_open O) (GlobalTheory.SmoothLift.crystallineSmoothLift_of_relations))
63 per := (GlobalTheory.PeriodFamily.periodComparison_holds)
64 gmp := (GlobalTheory.GaussManinTop.main)
65 st := (UpperTheory.Lit.serreTateGoodReduction)
66 cm := (_root_.UpperTheory.LiteratureTheorems.elliptic_main_theorem_cm_of_open O)
67 hj := (_root_.UpperTheory.LiteratureTheorems.hilbert_class_field_j_of_open O)
68 dri := (_root_.UpperTheory.LiteratureTheorems.siegel_klingen_deligne_ribet_of_open O)
69 pz := (_root_.UpperTheory.LiteratureTheorems.partial_zeta_functional_equation_of_open O)
70 fe := (_root_.UpperTheory.LiteratureTheorems.hecke_tate_functional_equation_of_open O)
71theorem UpperTheory.One.Join.automorphic_window_of_inputs (O : _root_.UpperTheory.LiteratureTheorems.OpenImageCondition)
72 (bc : _root_.PositivityTheory.Rg.BcN.BaseChangeIsobaricN) (gal : _root_.UpperTheory.V.Z.Win.RowT) :
73 UpperTheory.Top.VWin :=
74 _root_.UpperTheory.One.Join.v_window_of_depth_zero_residual_bc_cm O bc gal (_root_.UpperTheory.One.Join.cm_abelian_inputs_from_literature O)
Snapshot fingerprint
SHA-256: f824d3f7873a493432bdfcbdc279fa82d70a6a9dbaac44c2a30316cada2eae3e
6,603 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.RowSrc
The Galois input supplied to MainConclusion
Supplies Row0b recT by applying galoisRepresentations_of_thetaLift to the imported theta-lifting theorem tLiftK.
1import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.ThetaParseval.ThetaKernels.TLiftK
2import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.GaloisRepresentationsOfThetaLift
3
4namespace UpperTheory.Gal.Int
5
6theorem galoisLocalGlobalStrong_recParameter : UpperTheory.GalStar.Row0b recT := galoisRepresentations_of_thetaLift UpperTheory.TP.K.tLiftK
7
8end UpperTheory.Gal.Int
Snapshot fingerprint
SHA-256: 0cfbca6cb7d1da543ee9d24c30faeeb3f68838f91c4f6c2c0e682e025c8b9a44
433 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.TypeConditions.WeightsConjBis
The exact Galois representation contract Row0b
Quantifies regular algebraic polarized cuspidal representations over CM fields and records continuous semisimple Galois representations, weight identities and restricted local comparison conditions.
15def IsQpBig {E : Type} [Field E] [NumberField E] (w : HeightOneSpectrum (𝓞 E)) (n : ℕ) : Prop :=
16 ∃ (g : ℕ) (_ : Fact g.Prime) (i : ℚ_[g] ≃+* w.adicCompletion E), Continuous i ∧ (n = 1 ∨ 16 * n ^ 2 < g)
…
26structure AwayB (x y : WD h) : Prop where
27 dim : x.lpDim = y.lpDim
28
29 tor : Tor y → y.mono0 → x = y
30
31 tame0 : IsQpBig w y.lpDim → TmW y → Sqf y → y.mono0 → x.mono0 ∧ ∀ g : ↥(Weil h), deg g = 0 → x.charPol g = y.charPol g
…
39structure AboveB (π : CuspSub E a) (ι : Qbar l ≃+* ℂ) (r : G E Ω →* GL (Fin a) (Qbar l))
40 (HT : (E →+* Qbar l) → Multiset ℤ) (P : LocPrime l) {w : HeightOneSpectrum (𝓞 E)} {A : ValuationSubring Ω}
41 (h : IsPlaceOver A w) {O : Type} [CommRing O] [Algebra ℤ_[l] O] [TopologicalSpace O]
42 (Bw : LocBridge l E Ω (Dec (F := E) A) O) (hj : Pst.Induces Bw) : Prop where
43 crys : ∀ σ, π.IsLocComp w σ → SmGL.IsSpherical σ.ρ → IsCrysAt P Bw (r.comp (Dec (F := E) A).subtype) ∧
44 IsdRAt P Bw (r.comp (Dec (F := E) A).subtype) ∧
45 ∀ (τ : E →+* Qbar l) (LL' : FinExt l) (τ' : ↥Bw.Kw.1 →ₐ[ℚ_[l]] ↥LL'.1), IsInduced Bw τ τ' →
46 IsJumpsAt P Bw (r.comp (Dec (F := E) A).subtype) τ (HT τ)
47
48 nice : ∀ σ, π.IsLocComp w σ → ∀ rc, Rc h rc → ((IsQpBig w a ∧ TmW (rc (algNorm σ)) ∧ Sqf (rc (algNorm σ))) ∨ Tor (rc (algNorm σ))) → (rc (algNorm σ)).mono0 →
49 IsdRAt P Bw (r.comp (Dec (F := E) A).subtype) ∧ IsPstAt P Bw (r.comp (Dec (F := E) A).subtype) ∧
50 (∀ (τ : E →+* Qbar l) (LL' : FinExt l) (τ' : ↥Bw.Kw.1 →ₐ[ℚ_[l]] ↥LL'.1), IsInduced Bw τ τ' →
51 IsJumpsAt P Bw (r.comp (Dec (F := E) A).subtype) τ (HT τ)) ∧
52 AwayB (wdAt P ι Bw h hj (r.comp (Dec (F := E) A).subtype)) (rc (algNorm σ))
53
54structure PropsB (π : CuspSub E a) (ι : Qbar l ≃+* ℂ)
55 (r : G E Ω →* GL (Fin a) (Qbar l)) (wt : ℤ) (HT : (E →+* Qbar l) → Multiset ℤ) : Prop where
56 cont : Continuous r
57 ss : IsSSRep r
58 away : ∀ (w : HeightOneSpectrum (𝓞 E)) (hl : ((l : ℕ) : 𝓞 E) ∉ w.asIdeal) (A : ValuationSubring Ω) (h : IsPlaceOver A w)
59 (rc : IrrGL (w.adicCompletion E) → WD h), Rc h rc → ∀ σ, π.IsLocComp w σ → AwayB (wdOf h hl ι r) (rc (algNorm σ))
60 weights : ∀ τ : E →+* Qbar l, (HT τ).map (fun n : ℤ => (n : ℂ)) =
61 ((CG.mk π).infChar (ι.toRingHom.comp τ)).map fun z => ((a : ℂ) - 1) / 2 - z
62 weights_conj : ∀ τ : E →+* Qbar l,
63 HT (τ.comp (IsCMField.complexConj E).toRingEquiv.toRingHom) = (HT τ).map (wt - ·)
64 above : ∀ (P : LocPrime l) (AI : LocAinf l P), Nonempty (LocTied l P AI) →
65 ∀ (w : HeightOneSpectrum (𝓞 E)) (A : ValuationSubring Ω) (h : IsPlaceOver A w)
66 (O : Type) [CommRing O] [Algebra ℤ_[l] O] [TopologicalSpace O]
67 (Bw : LocBridge l E Ω (Dec (F := E) A) O) (hj : Pst.Induces Bw), AboveB Rc π ι r HT P h Bw hj
68
69def Row0b : Prop :=
70 ∀ (E Ω : Type) [Field E] [NumberField E] [IsCMField E] [Field Ω] [Algebra E Ω] [IsAlgClosure E Ω]
71 (l : ℕ) [Fact l.Prime] (ι : Qbar l ≃+* ℂ) (a : ℕ), 1 ≤ a →
72 ∀ (π : CuspSub E a) (χ : HChar (maximalRealSubfield E)), (CG.mk π).IsRegAlg → GlobalTheory.ContraPair.PolarizedPair π χ →
73 ∃ (r : G E Ω →* GL (Fin a) (Qbar l)) (wt : ℤ) (HT : (E →+* Qbar l) → Multiset ℤ), PropsB Rc π ι r wt HT
…
84theorem Row0.row0b (H : Row0 Rc) : Row0b Rc := fun E Ω _ _ _ _ _ _ l _ ι a ha π χ hr hp => by
85 obtain ⟨r, wt, HT, k⟩ := H E Ω l ι a ha π χ hr hp
86 exact ⟨r, wt, HT, k.big Rc⟩
Snapshot fingerprint
SHA-256: e3020031e884beef2eff18275019b7213a16f3c721242e9a79891b5396955719
5,507 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.Development
Geometry, congruences and theta lifting feed the Galois theorem
Defines recT by IsRecT and joins geometric seeds, congruences, trace limits, crystalline input and local compatibility to obtain Row0 and then Row0b.
1import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.BaseChangeDescent.BcBackOffT
2import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.ClosedPhiFunctoriality.ClosedPhiHolds
3import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.CrystallineDescent.ToCoreK
4import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.CrystallineInputs.CoreAllOfRowStarCore
5import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.CongruenceOddLevel.CongFinOddOfLvLac
6import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.InertCharpoly.GaloisLocalGlobalOfLocalGlobalCompatibility
7import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.TraceLimits.LimFinOddOf
8import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.ZetaCharacterDivisibility.MainFin
9import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.TypeConditions.WeightsConjBis
10import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.WeightCharacters.LadicWeightEmbeddingOverPlace
11import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.SphericalGaloisCompatibility.GaloisCompatUnlinkedSupportOfSpherical
12import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.SphericalGaloisCompatibility.PAdicSplitting.LocalGlobalCompatAtIwahoriFixedOfUnlinked
…
18def recT : UpperTheory.GalStar.RecNotion := fun h rc => UpperTheory.Zero.LLC.IsRecT h rc
19
20theorem coreAll_of (seed : SeedFinOdd) (cong : CongFinOdd) (up : UpperTheory.TP.TLiftK) : GlobalTheory.RoadU.CoreAll :=
21 UpperTheory.Gal.Int.Inp.coreAll_of_core
22 (UpperTheory.Gal.Int.Core.toCoreK up UpperTheory.Gal.ClosedPhiFromClosedTrace.congPhi_holds UpperTheory.Gal.Desc.descOffT (UpperTheory.Gal.Lim.limFinOdd_of seed cong))
23
24theorem rest (h : GlobalTheory.RoadU.CoreAll) : UpperTheory.GalStar.Row0 recT :=
25 UpperTheory.Gal.Int.Row.galoisLocalGlobal_of_localGlobalCompatibility h (UpperTheory.Gal.ToralGalois.galoisCompat_unlinkedSupport_of_spherical h) (UpperTheory.Gal.ToralGalois.R2.localGlobalCompatAtIwahoriFixed_of_unlinked (UpperTheory.Gal.ToralGalois.galoisCompat_unlinkedSupport_of_spherical h))
26
27theorem galoisLocalGlobal_of_geometry_lift (geo : UpperTheory.Gal.Int.Geo.GeoOne) (up : UpperTheory.TP.TLiftK) : UpperTheory.GalStar.Row0 recT :=
28 rest (coreAll_of (UpperTheory.Gal.Int.Div.seedFinOdd_of_geoOne geo) (UpperTheory.Gal.Int.Cong.congFinOdd_of_ex UpperTheory.Gal.Wt.wtLacEx_holds) up)
29
30theorem galoisLocalGlobalStrong_of_geometry_lift (geo : UpperTheory.Gal.Int.Geo.GeoOne) (up : UpperTheory.TP.TLiftK) : UpperTheory.GalStar.Row0b recT :=
31 UpperTheory.GalStar.Row0.row0b recT (galoisLocalGlobal_of_geometry_lift geo up)
Snapshot fingerprint
SHA-256: b78ea71866812c4d1f3df65f1f3f3e702fa65ec2bb1ea61ca1a250b6fdd536bd
2,933 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.GaloisRepresentationsOfThetaLift
Joining geometric realization to a theta lift
Supplies the geometric realization theorem geoOne_holds to the construction that turns TLiftK into Row0b recT.
1import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.Development
2import Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.IntegralStructures.GeometricFlagBases.WeightOneGeometricRealization
3
4namespace UpperTheory.Gal.Int
5
6theorem galoisRepresentations_of_thetaLift (up : UpperTheory.TP.TLiftK) : UpperTheory.GalStar.Row0b recT := galoisLocalGlobalStrong_of_geometry_lift UpperTheory.Gal.Int.Geo.geoOne_holds up
7
8end UpperTheory.Gal.Int
Snapshot fingerprint
SHA-256: 3f72f1644a6214bb5b90a5e9bac5e33b0474d52eb22f2f1841d443ed342531c2
495 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.ThetaParseval.HalfIndexLattices.TLiftK
What the theta-lifting input actually asserts
For the specified CM fields, Hermitian/skew spaces, compatible characters and weight inequalities, asserts the existence of a lift to sufficiently large rank.
12def TLiftK : Prop :=
13 ∀ (E : Type) [Field E] [NumberField E] [IsCMField E] (B : Base (maximalRealSubfield E) E), W.GoodK (cj E) B →
14 ∀ (n : ℕ), 1 ≤ n → ∀ X : Spc (maximalRealSubfield E) E n, X.J = 1 → X.IsHerm (cj E) B n 0 →
15 ∃ d₀ : ℕ, ∀ d, d₀ ≤ d → ∀ (W : Spc (maximalRealSubfield E) E d) (δ : E), W.J = δ • (1 : Matrix (Fin d) (Fin d) E) →
16 W.IsSkew (cj E) B d 0 → ∀ (χX χW : Chr (maximalRealSubfield E) E) (mX mW : InfinitePlace (maximalRealSubfield E) → ℤ),
17 IsHecke (maximalRealSubfield E) E χX → IsHecke (maximalRealSubfield E) E χW →
18 ResEtaPow (Units.map (algebraMap (maximalRealSubfield E) (AF (maximalRealSubfield E))).toMonoidHom).range χX n →
19 ResEtaPow (Units.map (algebraMap (maximalRealSubfield E) (AF (maximalRealSubfield E))).toMonoidHom).range χW d →
20 HasExp B.emb χX mX → HasExp B.emb χW mW →
21 ∀ (U : Submodule ℂ (GlobalTheory.UnitaryBC.UA E n → ℂ)) (lam : InfinitePlace (maximalRealSubfield E) → DomWeight n),
22 GlobalTheory.UnitaryBC.IsAutRepU U → (∀ w, GlobalTheory.UnitaryBC.HasWeightAt U (B.emb w).1 (lam w)) →
23 (∀ w k, (d : ℤ) + mW w ≤ 2 * (lam w).w k) → ∃ U' : Submodule ℂ (GlobalTheory.UnitaryBC.UA E d → ℂ), IsLift B χX χW mX mW lam U U'
Snapshot fingerprint
SHA-256: 8a58c624cd91dbfb4d3e8b7735e232e1463dd51d0daa7a6174b99349b31d6fc5
1,971 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.Foundations.LocalLanglands.IsRecTOfIsRec
The local correspondence laws used by recT
Defines the Good cuspidal-support condition, the LawsT record for a map from irreducible GL representations to Weil-Deligne parameters, and universal local existence.
20def GoodCusp (y : IrrGL k) : Prop :=
21 y.1 = 1 ∨ ((∃ (g : ℕ) (_ : Fact g.Prime) (i : ℚ_[g] ≃+* k), Continuous i) ∧
22 ∃ (y₀ : IrrGL k) (χ : kˣ →* ℂˣ) (hχ : IsSmoothChar χ), GlobalTheory.PRep.fixed y₀.rep (GlobalTheory.SplitWeil.KOne k (Fin y₀.1)) ≠ ⊥ ∧ y = y₀.tw χ hχ)
23
24def Good (x : IrrGL k) : Prop := ∃ s, HasSupport x.rep s ∧ ∀ y ∈ s, GoodCusp y
…
55structure LawsT (a : Weil h →* (w.adicCompletion E)ˣ) (ha : IsLocalArtin h a)
56 (rc : IrrGL (w.adicCompletion E) → WD h) : Prop where
57 dim : ∀ x, (rc x).lpDim = x.1
58 one : ∀ χ hχ, rc (.ofChar χ hχ) = WD.lpOfChar h (χ.comp a) (ha.smooth hχ)
59 langlands : ∀ (l : List (Segment (w.adicCompletion E))) (x : IrrGL (w.adicCompletion E)),
60 IsL (l : Multiset (Segment (w.adicCompletion E))) x.rep → rc x = segSum rc l
61 cusp : ∀ x, x.IsCusp → IsIrrWD (rc x)
62 nu : ∀ x (s : ℝ), rc (x.nu s) = (rc x).lpTw s
63 absCentral : ∀ (x : IrrGL (w.adicCompletion E)) ω, HasCentralChar x.rep ω →
64 ∀ σ, ‖((rc x).eig σ).prod‖ = ‖(ω (a σ) : ℂ)‖
65 twist : ∀ x χ hχ, Good x → rc (x.tw χ hχ) = (rc x).lpChar (rc (.ofChar χ hχ))
66 central : ∀ (x : IrrGL (w.adicCompletion E)) ω, Good x → HasCentralChar x.rep ω →
67 ∀ σ, ((rc x).eig σ).prod = (ω (a σ) : ℂ)
68 dual : ∀ (n : ℕ) (π π' : IrrRep (GL (Fin n) (w.adicCompletion E))), Good (cls π) →
69 Nonempty (π'.ρ.Equiv (contra π.ρ)) → rc (cls π') = (rc (cls π)).lpDual
70 inj : ∀ x y, Good y → rc x = rc y → x = y
71 depth : ∀ x, Good x → GlobalTheory.PRep.fixed x.rep (GlobalTheory.SplitWeil.KOne (w.adicCompletion E) (Fin x.1)) ≠ ⊥ → IsTameWD (rc x)
72 type : TypeLaw h rc
73
74variable (h) in
75
76def IsRecT (rc : IrrGL (w.adicCompletion E) → WD h) : Prop := ∃ a ha, LawsT (h := h) a ha rc
77
78def RecTExists : Prop :=
79 ∀ (E Ω : Type) [Field E] [NumberField E] [Field Ω] [Algebra E Ω] [IsAlgClosure E Ω] (A : ValuationSubring Ω)
80 (w : HeightOneSpectrum (𝓞 E)) (h : IsPlaceOver A w), ∃ rc, IsRecT h rc
Snapshot fingerprint
SHA-256: 4054d69535a55b8df339dee1ed766d38cb271ae87ce6033a8e0195ac577d9931
6,283 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.Foundations.LocalLanglands.LocalCentralUnits.RecTExists
Assembling existence of the local correspondence
Chooses an Artin map and cuspidal parameters, extends them using Langlands multisegments, and fills the LawsT fields using imported extension theorems.
1import Development.AutomorphicArithmetic.Foundations.LocalLanglands.RecTTransport
2import Development.AutomorphicArithmetic.Foundations.LocalLanglands.Multi
3import Development.AbelianVarietyTheory.Proofs.InertiaEigenvalues.LanglandsExtensionUniqueOnCuspidal
4import Development.DiscreteGroups.GlobalIrreducibility.DzLCusp
5import Development.AutomorphicArithmetic.Foundations.LocalLanglands.LocalCentralUnits.ArtEx
6import Development.AutomorphicArithmetic.Foundations.LocalLanglands.LocalCentralUnits.CuspEx
7import Development.AutomorphicArithmetic.Foundations.LocalLanglands.LocalCentralUnits.ExtDim
8import Development.AutomorphicArithmetic.Foundations.LocalLanglands.LocalCentralUnits.RcTwOfSegments
9import Development.AutomorphicArithmetic.Foundations.LocalLanglands.LocalCentralUnits.ExtDual
10import Development.AutomorphicArithmetic.Foundations.LocalLanglands.LocalCentralUnits.ExtInj
11import Development.AutomorphicArithmetic.Foundations.LocalLanglands.LocalCentralUnits.ExtDepth
12import Development.AutomorphicArithmetic.Foundations.LocalLanglands.LocalCentralUnits.TypeIff
…
20theorem UpperTheory.Zero.LLC.recTExists :
21 UpperTheory.Zero.LLC.RecTExists := by
22 intro E Ω _ _ _ _ _ A w h
23 obtain ⟨a, ha, -⟩ := UpperTheory.Zero.LLC.artEx E Ω A w h
24 obtain ⟨r, hr⟩ := UpperTheory.Zero.LLC.cuspEx E Ω A w h a ha
25 obtain ⟨⟨rc, hrc⟩, hcu⟩ :=
26 GlobalTheory.LocLanglands.exists_isLExt UpperTheory.Zero.LLC.Pr.exh UpperTheory.Zero.LLC.Pr.multi E Ω A w h r
27 have hcusp : ∀ x : IrrGL (HeightOneSpectrum.adicCompletion E w), x.IsCusp → rc x = r x :=
28 hcu rc hrc
29 have hD := UpperTheory.Zero.LLC.extDim E Ω A w h a ha r rc hr hrc
30 have hT := UpperTheory.Zero.LLC.extTw E Ω A w h a ha r rc hr hrc
31 refine ⟨rc, a, ha, ?_⟩
32 refine
33 { dim := fun x => (hD x).1.1
34 one := fun χ hχ => (hcusp _ (IrrGL.isCusp_ofChar χ hχ)).trans (hr.one χ hχ)
35 langlands := ?_
36 cusp := ?_
37 nu := hT.1
38 absCentral := fun x ω hω σ => ((hD x).2 ω hω σ).1
39 twist := ?_
40 central := fun x ω hg hω σ => ((hD x).2 ω hω σ).2 hg
41 dual := UpperTheory.Zero.LLC.extDual E Ω A w h a ha r rc hr hrc
42 inj := UpperTheory.Zero.LLC.extInj E Ω A w h a ha r rc hr hrc
43 depth := fun x hg hx => UpperTheory.Zero.LLC.extDepth E Ω A w h a ha r rc hr hrc x hg hx
44 type := ?_ }
45 · intro l x hl
46 rw [hrc l x hl]
47 unfold GlobalTheory.LocLanglands.segSum
48 congr 1
49 refine List.map_congr_left ?_
50 intro Δ _
51 rw [hcusp _ Δ.isCusp_first]
52 · intro x hx
53 rw [hcusp x hx]
54 exact hr.irr x hx
55 · intro x χ hχ hg
56 rw [hcusp _ (IrrGL.isCusp_ofChar χ hχ), hr.one χ hχ]
57 exact hT.2 x χ hχ hg
58 · refine (UpperTheory.Zero.LLC.typeIff E Ω A w h rc).2 ?_
59 intro x
60 unfold UpperTheory.Zero.LLC.TypeAt
61 intro g _ i hi n hn D R hR θ hθ τ hτ hN σ hσ hinf
62 have hx : x.IsCusp := by
63 subst hσ
64 exact IrrGL.isCusp_of.2 ⟨hn, DiscreteGroups.sglob.DzLc.isCuspidal_of_inflates i hi τ hτ σ hinf⟩
65 rw [hcusp x hx]
66 exact hr.type x hx g i hi n hn D R hR θ hθ τ hτ hN σ hσ hinf
Snapshot fingerprint
SHA-256: 2411dd4cb455607d3f39761258ccde5c9e945443c421e69a626e4148a79824ab
3,557 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.ThetaCorrespondence.ThetaPairLifts.ThirdPlaceSeries.EveryCharacterOfLiteratureOfVWin
The literature record and the nonvanishing assembly
The three-field OpenLiteratureStatements record, construction of the dependency bundles, and the final EveryCharacter theorem.
215structure UpperTheory.LiteratureTheorems.OpenLiteratureStatements : Prop where
216 caraianiLocalGlobalDual : _root_.UpperTheory.One.M.Row
217 localLanglandsExists : _root_.UpperTheory.Zero.LLC.RecTExists
218 galoisRepOfPolarizedPairLit : _root_.UpperTheory.One.M.Row
219theorem UpperTheory.LiteratureTheorems.logDerivOne (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : GlobalTheory.Mem.An.LogDerOne :=
220 GlobalTheory.LogDerOneProof.logDerOne_holds
221theorem UpperTheory.LiteratureTheorems.ellipticMainTheoremCM' (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : GlobalTheory.Published.EllipticMainTheoremCM :=
222 PositivityTheory.Prw.ellipticMainTheoremCM_holds
223theorem UpperTheory.LiteratureTheorems.heckeTateFunctionalEquation' (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : GlobalTheory.Published.HeckeTateFunctionalEquation :=
224 GlobalTheory.Top.heckeTateFE
…
561theorem UpperTheory.LiteratureTheorems.eis_bl_of_literature (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : GlobalTheory.ThK.Dbl.EisBL :=
562 PositivityTheory.RgEis.Hd.eisBL
563theorem UpperTheory.LiteratureTheorems.siegel_weil_std_of_literature (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : GlobalTheory.ThK.Dbl.SiegelWeilStd :=
564 PositivityTheory.SiegelWeilFormula.Fin.siegelWeilStd
565theorem UpperTheory.LiteratureTheorems.theta_integrals_agree_and_local_matching_of_literature (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.ThetaIntegralsAgree ∧ GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.LocalMatching :=
566 PositivityTheory.ThKR.theoremK_head2 (_root_.UpperTheory.LiteratureTheorems.eis_bl_of_literature O) (_root_.UpperTheory.LiteratureTheorems.siegel_weil_std_of_literature O)
…
589theorem UpperTheory.LiteratureTheorems.literature_local (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : _root_.GlobalTheory.Mem.LiteralAutomorphy.LocalRepresentationTheoryHypothesesAlt where
590 bz := (_root_.UpperTheory.LiteratureTheorems.bernstein_zelevinsky_finiteness_of_literature O)
591 bern := (_root_.UpperTheory.LiteratureTheorems.bernstein_unitary_product_irreducible_of_literature O)
592 geo := (_root_.UpperTheory.LiteratureTheorems.geometric_restriction_of_literature O)
593 zel := (_root_.UpperTheory.LiteratureTheorems.zelevinsky_polynomial_ring_of_literature O)
594 disj := (_root_.UpperTheory.LiteratureTheorems.totally_disjoint_product_irreducible_of_literature O)
595 mp := (_root_.UpperTheory.LiteratureTheorems.moy_prasad_jacquet_iso_of_literature O)
596 temp := (_root_.UpperTheory.LiteratureTheorems.tempered_product_of_square_integrable_of_literature O)
597 seg := (_root_.UpperTheory.LiteratureTheorems.ess_square_integrable_segments_of_literature O)
598 sq := (_root_.UpperTheory.LiteratureTheorems.square_integrable_segment_of_literature O)
599 gen := (_root_.UpperTheory.LiteratureTheorems.generic_unlinked_gl_of_literature O)
600 multi := (_root_.UpperTheory.LiteratureTheorems.langlands_multisegments_of_literature O)
601 exh := (_root_.UpperTheory.LiteratureTheorems.langlands_exhaustion_gl_of_literature O)
602 cos := (_root_.UpperTheory.LiteratureTheorems.standard_cosocle_gl_of_literature O)
603 llc := (_root_.UpperTheory.LiteratureTheorems.local_langlands_recT_exists_of_literature O)
604 conv := (_root_.UpperTheory.LiteratureTheorems.local_converse_gl_of_literature O)
605 dzi := (_root_.UpperTheory.LiteratureTheorems.depth_zero_induction_of_literature O)
606 brauer := (_root_.UpperTheory.LiteratureTheorems.brauer_degree_zero_of_literature O)
607 chev := (_root_.UpperTheory.LiteratureTheorems.chevalley_units_of_literature O)
608 green := (_root_.UpperTheory.LiteratureTheorems.green_regular_characters_of_literature O)
609theorem UpperTheory.LiteratureTheorems.literature_automorphy (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : _root_.GlobalTheory.Mem.LiteralAutomorphy.GlobalAutomorphicGaloisHypotheses' where
610 decay := (_root_.UpperTheory.LiteratureTheorems.cusp_rapid_decay_of_literature O)
611 hc := (_root_.UpperTheory.LiteratureTheorems.harish_chandra_finite_of_literature O)
612 fin := (_root_.UpperTheory.LiteratureTheorems.automorphic_forms_finite_gl_of_literature O)
613 js := (_root_.UpperTheory.LiteratureTheorems.jacquet_shalika_of_literature O)
614 cusp := (_root_.UpperTheory.LiteratureTheorems.cuspidal_spectrum_gl_of_literature O)
615 bc := (_root_.UpperTheory.LiteratureTheorems.base_change_isobaric O)
616 gk := (_root_.UpperTheory.LiteratureTheorems.gelfand_kazhdan_dual_of_literature O)
617 gal := (_root_.UpperTheory.LiteratureTheorems.pair_u_of_literature O)
618 car := O.caraianiLocalGlobalDual
619 pur := (_root_.UpperTheory.LiteratureTheorems.clozel_purity_of_literature O)
620 coh := (_root_.UpperTheory.LiteratureTheorems.clozel_cohomological_of_literature O)
621 art := (_root_.UpperTheory.LiteratureTheorems.global_artin_reciprocity_of_literature O)
622 ray := (_root_.UpperTheory.LiteratureTheorems.ray_class_field_st_of_literature O)
623 chA := (_root_.UpperTheory.LiteratureTheorems.hecke_l_adic_character_above_of_literature O)
624 chW := (_root_.UpperTheory.LiteratureTheorems.algebraic_character_wd_of_literature O)
625 berger := (_root_.UpperTheory.LiteratureTheorems.de_rham_pot_semistable_of_literature O)
626theorem UpperTheory.LiteratureTheorems.literature_cohomology (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : GlobalTheory.Mem.LiteralAutomorphy.LitCoh where
627 pt := (_root_.UpperTheory.LiteratureTheorems.poitou_tate_normalised_of_literature O)
628 lf := (_root_.UpperTheory.LiteratureTheorems.local_finiteness_of_literature O)
629 lt := (_root_.UpperTheory.LiteratureTheorems.local_tate_duality_of_literature O)
630 le := (_root_.UpperTheory.LiteratureTheorems.localEulerChar_alt_alt O)
631 gf := (_root_.UpperTheory.LiteratureTheorems.global_finiteness_of_literature O)
632 ge := (_root_.UpperTheory.LiteratureTheorems.global_euler_char_of_literature O)
633 uo := (_root_.UpperTheory.LiteratureTheorems.unramified_orthogonality_of_literature O)
634 gw := (_root_.UpperTheory.LiteratureTheorems.greenberg_wiles_of_literature O)
635 lfK := (_root_.UpperTheory.LiteratureTheorems.local_finiteness_k_of_literature O)
636 ltK := (_root_.UpperTheory.LiteratureTheorems.local_tate_duality_k_of_literature O)
637 leK := (_root_.UpperTheory.LiteratureTheorems.local_euler_char_k_of_literature O)
638 bk := (_root_.UpperTheory.LiteratureTheorems.bloch_kato_local_of_literature O)
639theorem UpperTheory.LiteratureTheorems.literature_nonexistence (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : _root_.GlobalTheory.Mem.LiteralAutomorphy.NonEndoscopicHypothesesAlt where
640 loc := (_root_.UpperTheory.LiteratureTheorems.literature_local O)
641 aut := (_root_.UpperTheory.LiteratureTheorems.literature_automorphy O)
642 coh := (_root_.UpperTheory.LiteratureTheorems.literature_cohomology O)
643 join := (_root_.UpperTheory.LiteratureTheorems.join_out_of_literature O)
644 fe := (_root_.UpperTheory.LiteratureTheorems.heckeTateFunctionalEquation' O)
…
645theorem UpperTheory.LiteratureTheorems.published_results_analytic (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : GlobalTheory.NRows.GeometricGaloisRepCompatibility where
646 weil := (_root_.UpperTheory.LiteratureTheorems.weil_representation_unitary_pair_of_literature O)
647 ds := (_root_.UpperTheory.LiteratureTheorems.discrete_series_exists_of_literature O)
648 ana := (_root_.UpperTheory.LiteratureTheorems.harish_chandra_analyticity_of_literature O)
649 dsc := (_root_.UpperTheory.LiteratureTheorems.discrete_series_classification_of_literature O)
650 trc := (_root_.UpperTheory.LiteratureTheorems.cusp_trace_class_of_literature O)
651 dm := (_root_.UpperTheory.LiteratureTheorems.dixmier_malliavin_factorisation_of_literature O)
652 flath := (_root_.UpperTheory.LiteratureTheorems.flath_factorisation_of_literature O)
653 sw := (_root_.UpperTheory.LiteratureTheorems.weil_siegel_formula_unitary_of_literature O)
654 dbl := (_root_.UpperTheory.LiteratureTheorems.doubling_method O)
655 udbl := (_root_.UpperTheory.LiteratureTheorems.unramified_doubling_gl_of_literature O)
656 hl := (_root_.UpperTheory.LiteratureTheorems.hecke_l_partial_continuation_of_literature O)
657 ht := (_root_.UpperTheory.LiteratureTheorems.ht_card_of_literature O)
658theorem UpperTheory.LiteratureTheorems.published_results_local (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : GlobalTheory.NLink.Hypotheses₂ where
659 font := (_root_.UpperTheory.LiteratureTheorems.fontaine_bcris_of_literature O)
660 artin := (_root_.UpperTheory.LiteratureTheorems.global_artin_reciprocity_of_literature O)
661 bk := (_root_.UpperTheory.LiteratureTheorems.bloch_kato_local_of_literature O)
662 tate := (_root_.UpperTheory.LiteratureTheorems.local_tate_duality_k_of_literature O)
663 euler := (_root_.UpperTheory.LiteratureTheorems.local_euler_char_k_of_literature O)
664 fin := (_root_.UpperTheory.LiteratureTheorems.local_finiteness_k_of_literature O)
665 bs := (_root_.UpperTheory.LiteratureTheorems.bhatt_scholze_integral_of_literature O)
666theorem UpperTheory.LiteratureTheorems.published_results_eigen (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : _root_.GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses where
667 clozelCohomological := (_root_.UpperTheory.LiteratureTheorems.clozel_cohomological_of_literature O)
668 greenCuspidal := (_root_.UpperTheory.LiteratureTheorems.green_cuspidal_of_literature O)
669 heckeLAdicCharacter := (_root_.UpperTheory.LiteratureTheorems.hecke_l_adic_character_of_literature O)
670 chebotarevDegreeOne := (_root_.UpperTheory.LiteratureTheorems.chebotarev_degree_one_of_literature O)
671 galoisRepOfPolarizedCuspidal := (_root_.UpperTheory.LiteratureTheorems.cusp_u_of_literature O)
672 baseChangeDefiniteUnitary := (_root_.UpperTheory.LiteratureTheorems.base_change_definite_unitary_group_of_literature O)
673 bhattScholzeCrystallineLattices := (_root_.UpperTheory.LiteratureTheorems.bhatt_scholze_crystalline_lattices_of_literature O)
674 heckeLAdicCharacterAbove := (_root_.UpperTheory.LiteratureTheorems.hecke_l_adic_character_above_of_literature O)
675 cuspRapidDecay := (_root_.UpperTheory.LiteratureTheorems.cusp_rapid_decay_of_literature O)
676 weilSiegelFormulaUnitary := (_root_.UpperTheory.LiteratureTheorems.weil_siegel_formula_unitary_of_literature O)
677 siegelWeilUnitaryConvergent := (_root_.UpperTheory.LiteratureTheorems.siegel_weil_unitary_convergent_of_literature O)
678 doublingMethod := (_root_.UpperTheory.LiteratureTheorems.doubling_method O)
679 unramifiedDoublingGL := (_root_.UpperTheory.LiteratureTheorems.unramified_doubling_gl_of_literature O)
680 bernsteinZelevinskyFiniteness := (_root_.UpperTheory.LiteratureTheorems.bernstein_zelevinsky_finiteness_of_literature O)
…
727theorem UpperTheory.LiteratureTheorems.published_results_first (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : GlobalTheory.FunPr.ThetaLocalInputs where
728 greenSeriesSt := (_root_.UpperTheory.LiteratureTheorems.green_series_st_of_literature O)
729 linnik := (_root_.UpperTheory.LiteratureTheorems.linnik_of_literature O)
730 complexMultiplicationJSt := (_root_.UpperTheory.LiteratureTheorems.complex_multiplication_j_st_of_literature O)
731 cuspidalMirabolic := (_root_.UpperTheory.LiteratureTheorems.cuspidal_mirabolic_of_literature O)
732 weylBranching := (_root_.UpperTheory.LiteratureTheorems.weyl_branching_of_literature O)
733 bernsteinUnitaryProductIrreducible := (_root_.UpperTheory.LiteratureTheorems.bernstein_unitary_product_irreducible_of_literature O)
734 zelevinskyPolynomialRing := (_root_.UpperTheory.LiteratureTheorems.zelevinsky_polynomial_ring_of_literature O)
735 bernsteinZelevinskyFiniteness := (_root_.UpperTheory.LiteratureTheorems.bernstein_zelevinsky_finiteness_of_literature O)
736 cuspTraceClass := (_root_.UpperTheory.LiteratureTheorems.cusp_trace_class_of_literature O)
…
781theorem UpperTheory.LiteratureTheorems.published_results_arithmetic (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : GlobalTheory.CovTop.PublishedHodgeBundleTheorems where
782 p1 := (_root_.UpperTheory.LiteratureTheorems.toroidal_compactification_of_literature O)
783 p2 := (_root_.UpperTheory.LiteratureTheorems.vol_ge_of_literature O)
784 p3 := (_root_.UpperTheory.LiteratureTheorems.vol_nef_of_literature O)
785 p4 := (_root_.UpperTheory.LiteratureTheorems.ar_calc_of_literature O)
786 p5 := (_root_.UpperTheory.LiteratureTheorems.abelian_de_rham_of_literature O)
787 p8 := (_root_.UpperTheory.LiteratureTheorems.ray_class_field_st_of_literature O)
788 p12 := (_root_.UpperTheory.LiteratureTheorems.semistable_reduction_st_of_literature O)
789 p13 := (_root_.UpperTheory.LiteratureTheorems.strong_approx_su_of_literature O)
790 p14 := (_root_.UpperTheory.LiteratureTheorems.green_series_st_of_literature O)
791 p16 := (_root_.UpperTheory.LiteratureTheorems.good_chern_weil_of_literature O)
792 p19 := (_root_.UpperTheory.LiteratureTheorems.landherr_st_of_literature O)
793 p20 := (_root_.UpperTheory.LiteratureTheorems.hasse_norm_st_of_literature O)
794 p22 := (_root_.UpperTheory.LiteratureTheorems.semi_abelian_hom_extension_of_literature O)
795 p23 := (_root_.UpperTheory.LiteratureTheorems.induced_simple_lowest_alcove_of_literature O)
796 p25 := (_root_.UpperTheory.LiteratureTheorems.principal_polarisation_one_section_of_literature O)
797 p26 := (_root_.UpperTheory.LiteratureTheorems.ab_mul_n_st_of_literature O)
798 q1 := (_root_.UpperTheory.LiteratureTheorems.grothendieck_messing_of_literature O)
799 q4 := (_root_.UpperTheory.LiteratureTheorems.prismatic_dieudonne_hodge_of_literature O)
800 q6 := (_root_.UpperTheory.LiteratureTheorems.kawamata_viehweg_of_literature O)
801 q7 := (_root_.UpperTheory.LiteratureTheorems.nef_numerics_of_literature O)
802 q8 := (_root_.UpperTheory.LiteratureTheorems.l2_extension_log_canonical_of_literature O)
803 q9 := (_root_.UpperTheory.LiteratureTheorems.arith_hilbert_samuel_of_literature O)
804 q10 := (_root_.UpperTheory.LiteratureTheorems.chow_form_exists_of_literature O)
805 q11 := (_root_.UpperTheory.LiteratureTheorems.cycle_heights_of_literature O)
806 q13 := (_root_.UpperTheory.LiteratureTheorems.serre_holomorphic_sections_of_literature O)
807 q15 := (_root_.UpperTheory.LiteratureTheorems.nadel_vanishing_and_non_klt_divisor_of_literature O)
808 q16 := (_root_.UpperTheory.LiteratureTheorems.principalisation_of_literature O)
809 q18 := (_root_.UpperTheory.LiteratureTheorems.formal_algebraisation_of_literature O)
810theorem UpperTheory.LiteratureTheorems.every_character_of_literature_of_vWin (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) (hV : UpperTheory.Top.VWin) : UpperTheory.EveryCharacter :=
811 _root_.UpperTheory.Lit.every_character_of_theta_integrals_local_matching (_root_.UpperTheory.LiteratureTheorems.published_results_eigen O) (_root_.UpperTheory.LiteratureTheorems.published_results_first O) (_root_.UpperTheory.LiteratureTheorems.theta_integrals_agree_and_local_matching_of_literature O).1 (_root_.UpperTheory.LiteratureTheorems.theta_integrals_agree_and_local_matching_of_literature O).2
812 (_root_.SelfIntersectionVolumeEstimates.topCovolSlim2_use_alt_alt (_root_.UpperTheory.LiteratureTheorems.resolution_char_zero_of_literature O) (_root_.UpperTheory.LiteratureTheorems.principalisation_char_zero_of_literature O) (_root_.UpperTheory.LiteratureTheorems.poincare_lelong_inv_of_literature O) PositivityTheory.Pf1.HilbertSamuelMoriwaki.hsUse_outright PositivityTheory.Pf1.HilbertSamuelMoriwaki.moriwakiBig_outright (_root_.UpperTheory.LiteratureTheorems.fargues_exact_of_literature O) (_root_.UpperTheory.LiteratureTheorems.zarhin_statement O) (_root_.UpperTheory.LiteratureTheorems.nef_rr_of_literature O) (_root_.UpperTheory.LiteratureTheorems.siegel_toroidal_integral_of_literature O) (_root_.UpperTheory.LiteratureTheorems.toroidal_for_fan_ks_of_literature O) (_root_.UpperTheory.LiteratureTheorems.semi_abelian_lie_seminegative_of_literature O) (_root_.UpperTheory.LiteratureTheorems.point_separation_pair_of_literature O) (_root_.UpperTheory.LiteratureTheorems.ar_degree_of_literature O) (_root_.UpperTheory.LiteratureTheorems.published_results_arithmetic O) (_root_.UpperTheory.LiteratureTheorems.grothendieck_deformation_of_literature O))
813 (_root_.UpperTheory.LiteratureTheorems.local_langlands_gl_recT_exists_of_literature O) hV
Snapshot fingerprint
SHA-256: 246b74eeb03dae250c45b46c155b3590cb53c2bac86f5e35f4b74338db487068
97,393 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.ThetaCorrespondence.ThetaPairLifts.ThirdPlaceSeries.SiegelEisensteinSecondTermHypotheses
From matched theta integrals to a compatible hypothesis witness
Builds rational test vectors, a common evaluation grid, compatible functional and covolume conditions, and the final nonempty hypothesis record.
44theorem nonempty_hyps_definite_side_of_closed_bound : _root_.GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses → _root_.GlobalTheory.FunPr.ThetaLocalInputs → GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.ThetaIntegralsAgree → GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.LocalMatching → _root_.GlobalTheory.CovTop.CovolumeBoundOfX → ∀ (hL : _root_.UpperTheory.Zero.LLC.RecTExists), (∀ cDep : ℝ, _root_.GlobalTheory.Fc.RL.LinkedAt (_root_.GlobalTheory.Mem.Top.Bl.parametersOfDependence hL cDep) (fun Q L => _root_.GlobalTheory.Fc.R1.SlotNormCondition Q L fun 𝒞 => Formalism.MainNotions.Closed 𝒞 fun Fm _ => _root_.GlobalTheory.NLink.BoundAtTwoThreeFamilyFonAlt Fm)) → Nonempty (_root_.GlobalTheory.Fc.HypsAlt S0.NL _root_.GlobalTheory.Fc.DefiniteSideCondition) := by
45 intro P F hA hM hX hL hN
46 have C := P.litN
47 have hS : GlobalTheory.IndefiniteRowSideFullHecke.LevelPlusSubgroup.FunctionalsSeparate :=
48 _root_.UpperTheory.Lit.functionalsSeparate_of_howeUnram_of_siegelWeil F GlobalTheory.Hk3.howeUnram_holds P.siegelWeilUnitaryConvergent
49 have hRat : S0.RowRat := GlobalTheory.Mem.LiteralAutomorphy.rowRatW_of_rowTest (_root_.GlobalTheory.T.test_vector_assembly_holds F.siegelSetUnitary F.howeDualityReal
50 P.greenCuspidal F C.join C.fe hA hM hS)
51 have hFit : _root_.GlobalTheory.BigTop.Fun.ConstantFunctionFits @GlobalTheory.BigTop.Fun.Fld := _root_.GlobalTheory.BigTop.Fun.Close.fourier_coefficient_fit_of_join_alt F C.join C.fe hA hM hS (_root_.GlobalTheory.Fc.S0.ontoX_and_lamLow_of_unitaryGroupHypotheses' P).2
52 obtain ⟨CF1, hCF1⟩ := _root_.GlobalTheory.Mem.LiteralAutomorphy.evaluation_grid_of_join F.howeDualityReal hM F C.join C.fe hA
53 (_root_.GlobalTheory.WeilConv.twisted_weil_representation_convergence F.siegelSetUnitary F) (_root_.GlobalTheory.T.twisted_local_factors_match F.howeDualityReal F hA hM)
54 (_root_.GlobalTheory.T.twisted_square_theta_integrals_eq F hA hM) hS
55 obtain ⟨CF0, hCF0⟩ := _root_.GlobalTheory.Fc.StageOne.rowFun_at_gridA_alt P.discreteSeriesCover P.harishChandraModules P.cuspRapidDecay P.casselmanWallach
56 P.rayClassFieldSt hFit
57 have hEv : EvLgG (GridA (max CF0 CF1)) := hCF1 _ (le_max_right _ _)
58 have hOpen1 : _root_.GlobalTheory.Fc.S0.OpenParameterStatements (_root_.GlobalTheory.Mem.Top.Bl.parametersOfDependence hL (max CF0 CF1)) := _root_.GlobalTheory.T.open0_of_unitary_group_hypotheses P hL (max CF0 CF1)
59 have hMono := _root_.GlobalTheory.Glob.open_and_linked_of_stronger_extension_alt hL (_root_.GlobalTheory.HeightCounting.Up.extensionWithList hL (max CF0 CF1))
60 (_root_.GlobalTheory.Mem.LiteralAutomorphy.extensionWithAtProperty hL (_root_.GlobalTheory.HeightCounting.Up.extensionWithOrigin hL (max CF0 CF1)) (GridA (max CF0 CF1))) SExt.none (geoCl anyGeometry)
61 (fun _ _ _ _ _ _ _ _ _ _ _ _ _ x => ⟨x.1.1⟩)
62 have hOpenA := hMono.2 hOpen1
63 have hFun := hCF0 (max CF0 CF1) (le_max_left _ _) hL (_root_.GlobalTheory.HeightCounting.Up.extensionWithOrigin hL (max CF0 CF1)) SExt.none (geoCl anyGeometry)
64 (fun _ _ _ _ _ _ _ _ _ _ _ _ _ x => ⟨x.1⟩) hOpenA
65 have hL3 := _root_.GlobalTheory.Glob.CovolRow.linked_bundles_l3_of_open_alt P.discreteSeriesCover P.harishChandraModules P.cuspRapidDecay
66 P.casselmanWallach P.rayClassFieldSt hX hL (_root_.GlobalTheory.Mem.LiteralAutomorphy.extensionWithAtProperty hL (_root_.GlobalTheory.HeightCounting.Up.extensionWithOrigin hL (max CF0 CF1)) (GridA (max CF0 CF1)))
67 SExt.none (geoCl anyGeometry) (fun _ _ _ _ _ _ _ _ _ _ _ _ _ x => ⟨x.1.1.1⟩) hOpenA
68 exact _root_.GlobalTheory.Fc.S0.StageU.hypotheses_nonempty_of_unramified_exponents_alt P hRat hL (max CF0 CF1) (GridA (max CF0 CF1)) hEv (hN (max CF0 CF1)) hFun hL3
69theorem every_character_of_theta_integrals_local_matching (P : _root_.GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses) (F : _root_.GlobalTheory.FunPr.ThetaLocalInputs) (hA : GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.ThetaIntegralsAgree)
70 (hM : GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.LocalMatching) (hX : _root_.GlobalTheory.CovTop.CovolumeBoundOfX) (hL : _root_.UpperTheory.Zero.LLC.RecTExists) (hV : VWin) :
71 UpperTheory.EveryCharacter :=
72 _root_.UpperTheory.Top.every_character_of_green_v_win (GlobalTheory.GreenBridge.green_of_regular P.greenRegularCharacters) hV
73 (_root_.UpperTheory.Lit.nonempty_hyps_definite_side_of_closed_bound P F hA hM hX hL fun cDep => _root_.UpperTheory.N.boundAtTwoThree_linked_of_recT P.nLink (_root_.GlobalTheory.Mem.Top.Bl.parametersOfDependence hL cDep))
Snapshot fingerprint
SHA-256: e761e876e3236895eec1b67b5a2118846ddfcc6883eed367ac6cc78523da15f2
8,752 bytes, unchanged from the original archive.
Development.AbelianVarietyTheory.BlockTheory.DivisorBase.WeilTensorModels
What agreement of theta integrals actually asserts
Matching local and real models; convergence and decay; a unique nonzero proportionality constant; the quantified global agreement and local matching properties.
474def PolMatch (Φ : (Fin a × Fin (a + a') → AF F) → ℂ) (Φ' : (Fin a' × Fin (a + a') → AF F) → ℂ) : Prop :=
475 ∃ T : Finset (Pl F), X.T ⊆ T ∧ ∃ (m m' : ℕ) (f : Fin m → SInf F _) (φ : Fin m → ∀ v : Pl F, (_ → Fv F v) → ℂ)
476 (f' : Fin m' → SInf F _) (φ' : Fin m' → ∀ v : Pl F, (_ → Fv F v) → ℂ),
477 (∀ i, f i ∈ G.M.Pol B.ψ B.emb ∧ (∀ v, φ i v ∈ SB _) ∧ ∀ v ∉ T, φ i v = G.M.vac v) ∧
478 (∀ j, f' j ∈ G.M'.Pol B.ψ B.emb ∧ (∀ v, φ' j v ∈ SB _) ∧ ∀ v ∉ T, φ' j v = G.M'.vac v) ∧
479 Φ = ∑ i, pure (f i) (φ i) ∧ Φ' = ∑ j, pure (f' j) (φ' j) ∧
480 ∑ i, R.p (f i) ⊗ₜ[ℂ] (PiTensorProduct.tprod ℂ fun v : T => Rf.p v (φ i v)) =
481 ∑ j, R.p' (f' j) ⊗ₜ[ℂ] (PiTensorProduct.tprod ℂ fun v : T => Rf.p' v (φ' j v))
482
483def Match (Φ : (Fin a × Fin (a + a') → AF F) → ℂ) (Φ' : (Fin a' × Fin (a + a') → AF F) → ℂ) : Prop :=
484 Φ' ∈ G.M'.So B.ψ B.τ₁ ∧ ∃ (m m' : ℕ) (g : Fin m → (_ → Af F) → ℂ) (f : Fin m → SInf F _) (s : ℕ → Fin m → SInf F _)
485 (g' : Fin m' → (_ → Af F) → ℂ) (f' : Fin m' → SInf F _) (s' : ℕ → Fin m' → SInf F _),
486 (∀ i, g i ∈ SB _ ∧ Tendsto (s · i) atTop (𝓝 (f i))) ∧ (∀ j, g' j ∈ SB _ ∧ Tendsto (s' · j) atTop (𝓝 (f' j))) ∧
487 Φ = ∑ i, pureA F (f i) (g i) ∧ Φ' = ∑ j, pureA F (f' j) (g' j) ∧
488 ∀ k, ∑ j, pureA F (s' k j) (g' j) ∈ G.M'.So B.ψ B.τ₁ ∧
489 PolMatch B G X R Rf (∑ i, pureA F (s k i) (g i)) (∑ j, pureA F (s' k j) (g' j))
490
491def IsConst (c : ℂ) : Prop := ∀ Φ Φ', Match B G X R Rf Φ Φ' → ∀ h, G.M.I om Φ h = c * G.M'.I om' Φ' h
492
493structure IsMatched : Prop where
494 triple : IsTriple B G X om om'
495 real : IsRealMaps B G om om' R
496 fin : IsFinMaps B G X om om' Rf
497
498def Decay : Prop :=
499 (∀ Φ ∈ schA F _, G.M.Conv om Φ) ∧ ∀ Φ' ∈ G.M'.So B.ψ B.τ₁,
500 (∀ N : ℕ, ∃ (C : ℝ) (k : ℕ), ∀ g h, ‖theta om' Φ' g h‖ * (qht g : ℝ) ^ N ≤ C * (ht h : ℝ) ^ k) ∧
501 G.M'.Conv om' Φ' ∧ IsModerate ht (G.M'.I om' Φ')
502
503def OneConst : Prop :=
504 (∃ Φ' ∈ G.M'.So B.ψ B.τ₁, G.M'.I om' Φ' ≠ 0) ∧ (∃! c, IsConst B G X om om' R Rf c) ∧
505 ∀ c, IsConst B G X om om' R Rf c → c ≠ 0
506
507def Coinv : Prop :=
508 (∀ v, X.Good v → (∀ φ ∈ SB _, Rf.p v φ = 0 ↔ φ ∈ augAt om v) ∧ (∀ φ ∈ SB _, Rf.p' v φ = 0 ↔ φ ∈ augAt om' v) ∧
509 (∀ t : E →ₐ[F] Fv F v, ∀ ξ, ∃ φ ∈ G.M'.SoLoc B.ψ t, Rf.p' v φ = ξ) ∧
510 ∀ l : ((Fin a' × Fin (a + a') → Fv F v) → ℂ) →ₗ[ℂ] ℂ, augAt om' v ≤ LinearMap.ker l →
511 ∃ l₀ : Rf.Pi v →ₗ[ℂ] ℂ, ∀ φ ∈ SB _, l φ = l₀ (Rf.p' v φ)) ∧
…
581def LocalMatching : Prop :=
582 ∀ (F E : Type) [Field F] [NumberField F] [Field E] [NumberField E] [Algebra F E] (σ : E →ₐ[F] E) (B : Base F E) (a a' : ℕ)
583 (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
584
585def ThetaIntegralsAgree : Prop :=
586 (∀ (F E : Type) [Field F] [NumberField F] [Field E] [NumberField E] [Algebra F E] (σ : E →ₐ[F] E) (B : Base F E)
587 (a a' : ℕ) (G : Geo σ a a') (X : Chars F E) om om', IsTriple B G X om om' → Decay B G om om' ∧
588 ∀ 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) ∧
589 (∃ e₁ e₂ s : ℤˣ, ∀ (F E : Type) [Field F] [NumberField F] [Field E] [NumberField E] [Algebra F E] (σ : E →ₐ[F] E),
590 StepBeta σ e₁ e₂ s) ∧
591 ∃ e₁ e₂ s : ℤˣ, ∀ (F E : Type) [Field F] [NumberField F] [Field E] [NumberField E] [Algebra F E] (σ : E →ₐ[F] E),
592 StepAlpha σ e₁ e₂ s
Snapshot fingerprint
SHA-256: 62209e957e734a32e4a85feb546cb2e8e7e087475d54fe5575b8fa7b4bd80197
28,971 bytes, unchanged from the original archive.
Development.AbelianVarietyTheory.Definitions.Divisors.CovolXOfCovol
Concrete inequalities behind the geometric covolume estimate
Recursive log-covolume control, orthogonal truncation, an exponentially small bad subspace, a polynomial slope ceiling, and a lower bound for the core slope.
51def muCore : ℝ := slope_sq (nrmK p.fw i) (latTypeK p.fw p.F.lv2 i)
52
53def GramAt : Prop :=
54 HasGram (nrmR p.R.toRealDat i) ∧ (latAll p.R.toRealDat i).FG ∧ latGood p.R.toRealDat p.F.lv2 i ≠ ⊥ ∧
55 GoodW (p.T.U ((i : ℕ) + 1)) (xiR D) (p.T.V ((i : ℕ) + 1)) (p.T.dict ((i : ℕ) + 1)) (Gk p i)
56
57def RecAt : Prop :=
58 Formalism.DivisionValues.lcv ((p.S false).XW i) ((p.S false).M i) / ((p.S false).D : ℝ) ≤
59 -slope_sq (nrmR p.R.toRealDat i) (latGood p.R.toRealDat p.F.lv2 i)
60
61def CutAt : Prop :=
62 eGood p.R.toRealDat i ∘ₗ eGood p.R.toRealDat i = eGood p.R.toRealDat i ∧
63 (∀ σ x y, nrmR p.R.toRealDat i σ (eGood p.R.toRealDat i x + (y - eGood p.R.toRealDat i y)) ^ 2 =
64 nrmR p.R.toRealDat i σ (eGood p.R.toRealDat i x) ^ 2 + nrmR p.R.toRealDat i σ (y - eGood p.R.toRealDat i y) ^ 2) ∧
65 (∀ x ∈ latType p.R.toRealDat p.F.lv2 i,
66 ((Fintype.card p.P.Gp : ℕ) : D.what₂.LL) • eGood p.R.toRealDat i x ∈ latType p.R.toRealDat p.F.lv2 i) ∧
67 2 * Real.log (Fintype.card p.P.Gp : ℕ) ≤ L.sc.b
68
69def BadAt : Prop :=
70 (Formalism.HN.rkK (latBad p.R.toRealDat p.F.lv2 i) : ℝ) ≤
71 3 * Real.exp (-(L.sc.x ^ (L.sc.ez / 7))) * Formalism.HN.rkK (latType p.R.toRealDat p.F.lv2 i)
72
73def LamAt (A : ℝ) : Prop := slopeMax_sq (nrmR p.R.toRealDat i) (latAll p.R.toRealDat i) ≤ L.sc.x ^ A * L.sc.b
74
75def SizeAt (PP A : ℝ) : Prop :=
76 1 ≤ L.sc.b ∧ L.sc.b ≤ unitE p ∧ unitE p ≤ L.sc.x ^ A * L.sc.b ∧ |mainT p i| ≤ L.sc.x ^ A * L.sc.b ∧
77 |mainT p i| ≤ PP * kap p i ∧ L.sc.b ≤ PP * kap p i ∧
78 ((i : ℕ) + 1 < D.R.m → (∃ u1, Quo p i PP u1) ∧ ∀ u1, Quo p i PP u1 →
79 3 * dimFlag (dat p i) + 5 ≤ lenT p i PP ∧ 0 ≤ rhoB (dat p i) u1 ∧ rhoB (dat p i) u1 < 1 ∧ zed p i PP u1 < 1)
…
88def RatAt : Prop :=
89 latType p.R.toRealDat p.F.lv2 i = Submodule.span (𝓞 D.what₂.LL)
90 {y | y ∈ (p.R.toRealDat.FW i).MK ∧ y ∈ spType p.R.toRealDat p.F.lv2 i}
91
92def CoreAt (C : ℝ) : Prop :=
93 muCore p i - C * unitE p ≤
94 slope_sq (nrmR p.R.toRealDat i) (latType p.R.toRealDat p.F.lv2 i)
95
96def LowAt (C : ℝ) : Prop := -mainT p i - C * unitE p ≤ muCore p i
97
98def AnchorAt (C : ℝ) : Prop :=
99 |mainT p i - ∑ τ : Psi p.T.Q.H, (((dat p i).p : ℝ) - (dat p i).q) * anchor (dat p i) (wtA (p.κ i)) (p.κ i).n (D.R.k - 1) τ *
100 (ofRecord D L p.Del p.h0).logOm| ≤ C * unitE p ∧
101 (∑ τ : Psi p.T.Q.H, |(anchor (dat p i) (wtA (p.κ i)) (p.κ i).n (D.R.k - 1) τ : ℝ)|) * (dat p i).q * L.sc.L ≤ C * unitE p ∧
102 (D.R.f : ℝ) * D.R.r * D.R.nV * L.sc.L ≤ L.sc.b
Snapshot fingerprint
SHA-256: f40c762ed8c2b18311d604540c15613e4a5969b1395dcab59b2854584fb6d3ae
15,459 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.ThetaCorrespondence.ThetaPairLifts.ThirdPlaceSeries.LiftLambdaBound
The uniform covolume property required by the proof
Defines tied points, the eventual uniformity across all points and lift stages, and CovolumeBoundOfX.
17def RowsTAlt : Prop := p.PointConditions' ∧ RecTied D L
18def EventuallyAtAllPoints {eps : ℝ} (Fm : FamP eps) (Q : ∀ (x : ℝ) (hx : Fm.x1 < x) (ι : Fm.Ix x), Pt Fm x hx ι → Prop) : Prop :=
19 ∃ x0 : ℝ, ∀ (x : ℝ) (hx : Fm.x1 < x), x0 ≤ x → ∀ (ι : Fm.Ix x) (p : Pt Fm x hx ι), _root_.GlobalTheory.CovTop.RowsTAlt p → Q x hx ι p
20theorem EventuallyAtAllPoints.and {eps : ℝ} {Fm : FamP eps} {Q Q' : ∀ (x : ℝ) (hx : Fm.x1 < x) (ι : Fm.Ix x), Pt Fm x hx ι → Prop}
21 (h : _root_.GlobalTheory.CovTop.EventuallyAtAllPoints Fm Q) (h' : _root_.GlobalTheory.CovTop.EventuallyAtAllPoints Fm Q') : _root_.GlobalTheory.CovTop.EventuallyAtAllPoints Fm fun x hx ι p => Q x hx ι p ∧ Q' x hx ι p := by
22 obtain ⟨a, h⟩ := h
23 obtain ⟨b, h'⟩ := h'
24 exact ⟨max a b, fun x hx hle ι p hp =>
25 ⟨h x hx ((le_max_left _ _).trans hle) ι p hp, h' x hx ((le_max_right _ _).trans hle) ι p hp⟩⟩
26def LiftsCondition (Q : ∀ {eps : ℝ} (Fm : FamP eps) (x : ℝ) (hx : Fm.x1 < x) (ι : Fm.Ix x) (p : Pt Fm x hx ι) (i : Fin (Fm.D x ι).R.m)
27 (PP C : ℝ), Prop) : Prop :=
28 Closed FamHyp fun Fm _ => ∃ C : ℝ, 0 ≤ C ∧ _root_.GlobalTheory.CovTop.EventuallyAtAllPoints Fm fun x hx ι p => ∀ i, Q Fm x hx ι p i (Fm.parT x hx ι).PP C
29def CoversCondition (Q : ∀ {eps : ℝ} (Fm : FamP eps) (x : ℝ) (hx : Fm.x1 < x) (ι : Fm.Ix x) (p : Pt Fm x hx ι) (i : Fin (Fm.D x ι).R.m)
30 (_Y : Cov p i) (PP C : ℝ), Prop) : Prop :=
31 _root_.GlobalTheory.CovTop.LiftsCondition fun Fm x hx ι p i PP C => (i : ℕ) + 1 < (Fm.D x ι).R.m →
32 ∀ Y : Cov p i, GoodCov p i Y → Q Fm x hx ι p i Y PP C
33def GramCondition : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun _ _ _ _ p i _ _ => GramAt p i
34def LiftRecursive : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun _ _ _ _ p i _ _ => RecAt p i
35def LiftTruncation : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun _ _ _ _ p i _ _ => CutAt p i
36def LiftBadSet : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun _ _ _ _ p i _ _ => BadAt p i
37def LiftLambdaBound : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun _ _ _ _ p i _ C => LamAt p i C
38def SizeCondition : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun _ _ _ _ p i PP C => SizeAt p i PP C
39def MeasureCondition : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun _ _ _ _ p i _ C => MeasAt p i C
40def LiftRational : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun _ _ _ _ p i _ _ => RatAt p i
41def CoreBound' : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun _ _ _ _ p i _ C => CoreAt p i C
42def LiftLowBound : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun _ _ _ _ p i _ C => LowAt p i C
43def AnchorCondition : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun _ _ _ _ p i _ C => AnchorAt p i C
44def LowDefectCondition : Prop := _root_.GlobalTheory.CovTop.LiftsCondition fun Fm x _ ι p i _ C => (i : ℕ) + 1 = (Fm.D x ι).R.m → LowAt p i C
…
60def CovolumeBoundOfX : Prop := Closed FamHyp fun Fm CH =>
61 ∃ C0 : ℝ, 0 ≤ C0 ∧ _root_.GlobalTheory.CovTop.EventuallyAtAllPoints Fm fun _ _ _ p => ∀ C, C0 ≤ C → (p.S false).L3 (p.N C CH)
62def _root_.GlobalTheory.BigTop.CovolumeBound : Prop := Closed FamHyp fun Fm CH =>
63 ∃ C0 : ℝ, 0 ≤ C0 ∧ _root_.GlobalTheory.BigTop.EventuallyAtPoints Fm fun _ _ _ p => ∀ C, C0 ≤ C → (p.S false).L3 (p.N C CH)
Snapshot fingerprint
SHA-256: a73cbdc50b441874d719358771398f999f21e720ef899a99b66c09b9bf72272b
6,297 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.ThetaCorrespondence.ThetaPairLifts.ThirdPlaceSeries.TopCovolSlim2Use
Arithmetic geometry supplies the covolume bound
Uses resolution, principalisation, arithmetic Hilbert-Samuel, positivity, toroidal models and Hodge-bundle inputs to produce CovolumeBoundOfX.
16theorem topCovolSlim2_use_alt_alt : GlobalTheory.CompanionTheory.Hypotheses₂.ResolutionCharZero → GlobalTheory.CompanionTheory.Hypotheses₂.PrincipalisationCharZero → GlobalTheory.CompanionTheory.Hypotheses₂.PoincareLelongInv → PositivityTheory.MbHsUse.HSUse → ReciprocityTheory.ChartRestriction.G.ArakelovGeometry.MoriwakiBigStatement → HT.FarguesExact → GR.ZarhinStatement → Pub.NefRR → GlobalTheory.Published.SiegelToroidalIntegral → GlobalTheory.Published.ToroidalForFanKS → GlobalTheory.Published.SemiAbelianLieSeminegative → GlobalTheory.Published.PointSeparationPair → GlobalTheory.Published.ArDegree → _root_.GlobalTheory.CovTop.PublishedHodgeBundleTheorems → GlobalTheory.Published.GrothendieckDeformation → _root_.GlobalTheory.CovTop.CovolumeBoundOfX :=
17 fun h₁ h₂ hPL hU hBig hFar hZar hRR hS hK hN hSep hDeg hP hGD =>
18 have hX : GlobalTheory.CovTop.HypothesesX := ⟨hK, hN, GlobalTheory.GreenBridge.green_of_regular GlobalTheory.greenRegularCharacters_holds, hSep, _root_.FubiniStudyChowHeightFormula₂.fubiniStudy_chowHeight_formula hP⟩
19 have hF := PositivityTheory.Prw.toroidalChartsForFan_of hK
20 have hH : GlobalTheory.CovHt.HypothesesH := ⟨hS, hF, GlobalTheory.Published.toroidalCharts_of_siegel_of_forFan hS hF, hDeg⟩
21 _root_.SelfIntersectionVolumeEstimates.topCovolG_alt_alt ⟨_root_.ChowFormHeightComparison₂.chow_form_height_comparison, _root_.PositivityTheory.Xj7N.small_sections_injective (GlobalTheory.CompanionTheory.Ar.Rec.exists_nonvanishing_of_toroidal hH.sieg hX.ks)⟩ hX hP hH hGD ⟨hP.q6, hP.q8, hP.q13, hP.q7, hP.q10, GlobalTheory.Published.chowFormIntExists_holds, ChowFormCompatibility.chow_form_hyperplane_section, hP.q12⟩
22 (PositivityTheory.HtPt.Ah.deep_slim_use h₁ h₂ hPL hU hBig hFar hZar hRR)
Snapshot fingerprint
SHA-256: 545f4dbcc8b67e0d001951fcad7abaa8250d335a64a6950adf5ce69fee5f30a0
2,836 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.ThetaCorrespondence.ThetaPairLifts.ThirdPlaceSeries.TopCovolG
How covering estimates combine into the covolume theorem
Builds Gram and measure control, deep covers, height and degree estimates, a uniform slope lower bound, and the final covolume inequality.
39theorem topCovolG_alt_alt : _root_.SelfIntersectionVolumeEstimates.VolumeEstimateHypotheses → GlobalTheory.CovTop.HypothesesX → _root_.GlobalTheory.CovTop.PublishedHodgeBundleTheorems → GlobalTheory.CovHt.HypothesesH → GlobalTheory.Published.GrothendieckDeformation → GlobalTheory.HSCore.Quoted → GlobalTheory.CompanionTheory.Ar.Plug.DeepStR → _root_.GlobalTheory.CovTop.CovolumeBoundOfX :=
40 by
41 intro hSB hX hP hH hGD hQ hD
42 have hS := hH.sieg
43 have hK := hX.ks
44 have hN := hX.lie
45 have gram := _root_.GlobalTheory.T.covering_gram_of_prints hP
46 have size := _root_.GlobalTheory.T.cov_size_bound
47 have meas := _root_.GlobalTheory.T.covering_meas_of_prints hP
48 have anc := _root_.GlobalTheory.T.anchor_bound
49 have dex := _root_.GlobalTheory.T.covering_deepEx_of_prints hP
50 have dg := _root_.GlobalTheory.T.deepGood_of_toroidal_and_semiabelian hP hGD hQ hS hK hN
51 have fd := _root_.GlobalTheory.T.flatDeg_of_scholzeWeinstein_of_prints hP
52 have deg := _root_.GlobalTheory.T.coverDegree_of_grothendieck_deformation hX hP hS hK hGD hQ hN dg size fd
53 have sh := _root_.GlobalTheory.T.share_of_deep_good_size_flat_deg_cover_degree hX hP hS hK hGD hQ hN dg size fd deg
54 have ht := _root_.SelfIntersectionVolumeEstimates.height_lower_bound_general_alt hSB hX hGD hQ hP hH hD dg size deg fd
55 have hs := _root_.GlobalTheory.T.coverHeightSum_of_flatDeg_coverDegree_share hX hP hGD hQ hS hK hN dg size fd deg sh
56 have ul := _root_.GlobalTheory.T.uniform_lower_bound_of_sums' dg size deg sh ht hs (_root_.GlobalTheory.T.sum_c_of_deep_good dg)
57 have low := _root_.GlobalTheory.T.liftLowBound_of_cover_estimates size (_root_.GlobalTheory.T.lowDef_of_gram_of_anchor hP gram anc) dex dg (_root_.GlobalTheory.T.covering_ring_of_prints_gram_deepGood hP gram dg) (_root_.GlobalTheory.T.covering_maps_of_gram_deep_size_flatDeg hP hGD hQ hS hK hN gram dg size fd) (_root_.GlobalTheory.T.coverRank_of_coverDegree_and_share hX hP hGD hQ hS hK hN dg size fd deg sh) (_root_.GlobalTheory.T.covering_gmin_of_prints_gram_deep_size hP gram dg size) (_root_.GlobalTheory.T.flat_of_prints_deepGood_flatDeg_anchor hP dg fd anc) ul
58 exact _root_.GlobalTheory.T.covolX_of_truncation_badSet_lambda_lowBound gram (_root_.GlobalTheory.T.lift_recursion_of_gram_bound gram) (_root_.GlobalTheory.T.liftTruncation_of_prints hP) (_root_.GlobalTheory.T.liftBadSet_of_deep_size_flatDeg_share hX hP hGD hQ hS hK hN hX.green gram dex dg size fd deg sh) (_root_.GlobalTheory.T.liftLambdaBound_of_gram_meas hP gram meas) size (_root_.GlobalTheory.T.coreLe_of_gram_meas_liftRational gram meas (_root_.GlobalTheory.T.liftRational_of_prints hP)) low
Snapshot fingerprint
SHA-256: f29362501bf62b9b6a7eb933aa0bdf9065414ecca014cf4a9da2970d791b4928
6,400 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.ThetaCorrespondence.ThetaPairLifts.ThirdPlaceSeries.LinkedBundlesL3OfOpen
Transporting the geometric bound to the chosen automorphic families
Turns CovolumeBoundOfX into the linked third-place-series condition at the same extended parameters as the other inputs.
31theorem linked_bundles_l3_of_open_alt : GlobalTheory.Published.DiscreteSeriesCover → GlobalTheory.Published.HarishChandraModules → GlobalTheory.Published.CuspRapidDecay → GlobalTheory.Published.CasselmanWallach → GlobalTheory.NT.RayField → _root_.GlobalTheory.CovTop.CovolumeBoundOfX → ∀ (hL : _root_.UpperTheory.Zero.LLC.RecTExists) (N : _root_.GlobalTheory.Mem.Top.Bl.NormChoiceExtension hL) (S : SExt) (Γ : GeoP), (∀ K B f T w Z Wt p0 t nch n xd c, N K B f T w Z Wt p0 t nch n xd c → Nonempty (_root_.GlobalTheory.HeightCounting.Up.extensionWithLaw hL K B f T w Z Wt p0 t nch n xd c)) → _root_.GlobalTheory.Fc.S0.OpenParameterStatements (_root_.GlobalTheory.Mem.Top.Bl.parametersOfExtension N S Γ) → _root_.GlobalTheory.Fc.RL.LinkedAt (_root_.GlobalTheory.Mem.Top.Bl.parametersOfExtension N S Γ) _root_.GlobalTheory.Fc.S0.CovolumeBoundThirdPlaceSeries := by
32 intro hDS hHC hCR hCW hRay hCov hL N S Γ hN o
33 have hA := _root_.GlobalTheory.T.class_sum_divisor_all_alt hRay hL N S Γ hN o.hDivG
34 obtain ⟨R, hR, h⟩ := RowL.and (RowL.and (RowL.and (RowL.and o.hPA o.hDivG) o.good) o.geo) hA
35 refine ⟨R, hR, h.imp fun 𝒜 σ hsel H => ?_⟩
36 obtain ⟨⟨⟨⟨hpa, hdv⟩, hgd⟩, hgeo⟩, hall⟩ := H
37 choose τ hτ using fun {eps : ℝ} (Fm : FamP eps) (hc : 𝒜 Fm) x hx i => hgeo Fm hc x hx i
38 let τ' : _root_.GlobalTheory.Fc.CompatibleSelection σ := fun Fm hc x hx i => τ Fm hc x hx i
39 have hduty : ∀ (eps : ℝ) (Fm : FamP eps), 𝒜 Fm → GlobalTheory.EX.DQ.Duty7 Fm := fun _ Fm hc =>
40 let ⟨_, _, h7, _⟩ := hsel Fm hc
41 (DQ.familyClass_sevenDuties_and_stableLattices _ Fm h7).1
42 have hrows : Ind.EvW _root_.GlobalTheory.Fc.Ind.RowPointSummands 𝒜 (_root_.GlobalTheory.Fc.summandSelection σ τ') := _root_.GlobalTheory.Fc.Ind.evW_pRows_of_rows_alt hDS hHC hCR hCW 𝒜 (_root_.GlobalTheory.Fc.summandSelection σ τ') (fun Fm hc x hx i => hpa Fm hc x hx i)
43 (fun Fm hc x hx i => _root_.GlobalTheory.Fc.FourBoundsAtBundles.p_div_of_div3g _ (hdv Fm hc x hx i)) hgd
44 (fun Fm hc x hx i => ⟨(hτ Fm hc x hx i).2.1, (hτ Fm hc x hx i).2.2.1⟩)
45 exact _root_.GlobalTheory.Fc.Ind.eventual_L3_of_covolume_alt hCov 𝒜 (_root_.GlobalTheory.Fc.summandSelection σ τ') hduty hrows
46 (GlobalTheory.Fc.FourBoundsAtBundles.evW_of_atAll fun Fm hc x hx i => (hall Fm hc x hx i (τ Fm hc x hx i)).2.2.2.1)
Snapshot fingerprint
SHA-256: 38b99bb13cfbe01cb1752c03b08eed22db748be05a4f8f03dae70863eaecd467
5,296 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.ThetaCorrespondence.ThetaPairLifts.ThirdPlaceSeries.HypothesesNonemptyOfUnramifiedExponents
Building a complete compatible family of hypotheses
Combines large unramified-exponent bundles with Galois estimates, functional conditions and the covolume bound to construct HypsAlt.
41theorem hypotheses_nonempty_of_unramified_exponents_alt : _root_.GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses → S0.RowRat → ∀ (hL : _root_.UpperTheory.Zero.LLC.RecTExists) (cDep : ℝ) (A : GroupRetwisting.AtP), EvLgG A → _root_.GlobalTheory.Fc.RL.LinkedAt (_root_.GlobalTheory.Mem.Top.Bl.parametersOfDependence hL cDep) (fun Q L => _root_.GlobalTheory.Fc.R1.SlotNormCondition Q L fun 𝒞 => Formalism.MainNotions.Closed 𝒞 fun Fm _ => _root_.GlobalTheory.NLink.BoundAtTwoThreeFamilyFonAlt Fm) → _root_.GlobalTheory.Fc.RL.LinkedAt (_root_.GlobalTheory.Mem.Top.Bl.parametersOfExtension (_root_.GlobalTheory.Mem.LiteralAutomorphy.extensionWithAtProperty hL (_root_.GlobalTheory.HeightCounting.Up.extensionWithOrigin hL cDep) A) SExt.none (geoCl anyGeometry)) _root_.GlobalTheory.Fc.S0.FunctionalCondition → _root_.GlobalTheory.Fc.RL.LinkedAt (_root_.GlobalTheory.Mem.Top.Bl.parametersOfExtension (_root_.GlobalTheory.Mem.LiteralAutomorphy.extensionWithAtProperty hL (_root_.GlobalTheory.HeightCounting.Up.extensionWithOrigin hL cDep) A) SExt.none (geoCl anyGeometry)) _root_.GlobalTheory.Fc.S0.CovolumeBoundThirdPlaceSeries → Nonempty (_root_.GlobalTheory.Fc.HypsAlt S0.NL _root_.GlobalTheory.Fc.DefiniteSideCondition) := by
42 intro P hR hL cDep A hA hN hF hL3
43 obtain ⟨hP, hMem, hEx⟩ := _root_.GlobalTheory.T.large_unramified_exponent_bundles_exist_alt P hR hL cDep A hA
44 obtain ⟨_, prN, serN, _⟩ := _root_.GlobalTheory.T.hyps_e_third_layer_ser_n_of_geometric_galois P.litN P.toHypothesesX
45 have hOL := _root_.GlobalTheory.Fc.S0.ontoX_and_lamLow_of_unitaryGroupHypotheses' P
46 have hO := _root_.GlobalTheory.T.open0_of_unitary_group_hypotheses P hL cDep
47 have hNrow := _root_.UpperTheory.GalC.final_alt_alt P.nLink prN P.toHypothesesX serN P.depthZeroSupport'
48 P.localFiniteness P.localTateDuality P.localEulerChar hL cDep hN
49 have hmono := _root_.GlobalTheory.Glob.open_and_linked_of_stronger_extension_alt hL (_root_.GlobalTheory.HeightCounting.Up.extensionWithList hL cDep) (_root_.GlobalTheory.Mem.LiteralAutomorphy.extensionWithAtProperty hL (_root_.GlobalTheory.HeightCounting.Up.extensionWithOrigin hL cDep) A) SExt.none (geoCl anyGeometry)
50 (fun _ _ _ _ _ _ _ _ _ _ _ _ _ x => ⟨x.1.1⟩)
51 have hO' := hmono.2 hO
52 have hN' : _root_.GlobalTheory.Fc.RL.LinkedAt (_root_.GlobalTheory.Mem.Top.Bl.parametersOfExtension (_root_.GlobalTheory.Mem.LiteralAutomorphy.extensionWithAtProperty hL (_root_.GlobalTheory.HeightCounting.Up.extensionWithOrigin hL cDep) A) SExt.none (geoCl anyGeometry)) (fun Q L => _root_.GlobalTheory.Fc.R1.SlotNormCondition Q L S0.NL) :=
53 hmono.1 (fun 𝒜 _ => S0.NL (Cp.D3 3 𝒜)) hNrow
54 have hAll := _root_.GlobalTheory.Fc.AllAtMemberStage0.allRows_of_open0_alt P.globalArtinReciprocity P.siegelWeilUnitaryConvergent2 P.discreteSeriesCover
55 P.harishChandraModules P.cuspRapidDecay P.casselmanWallach P.discreteSeriesClassification hOL.1 hOL.2
56 hL _ _ _ S0.NL hO' hL3 hF hN'
57 exact _root_.GlobalTheory.Fc.nonempty_hyps_of_allRows_alt hP GlobalTheory.ThinScaleLiterature.litThin GlobalTheory.wuDecayOfGap GlobalTheory.rowsFinDim_link
58 GlobalTheory.rowsPos_typeP (GlobalTheory.rowNGP_of_siegelWeil P.siegelWeilUnitaryConvergent2)
59 (GlobalTheory.rowMainEqP_of_siegelWeil P.siegelWeilUnitaryConvergent2)
60 (GlobalTheory.VolRatioFromSiegelWeil.volumeRatio P.siegelWeilUnitaryConvergent2) GlobalTheory.genusMassAt_two
61 KPx _ _ _ S0.NL _root_.GlobalTheory.Fc.DefiniteSideCondition (fun _ => hMem) hEx hAll
Snapshot fingerprint
SHA-256: 80ebd1ee514d8a6a7967fe3e87c775148615416906038a046b27ea9436a2cc1f
7,404 bytes, unchanged from the original archive.
Development.AutomorphicArithmetic.ThetaCorrespondence.ThetaPairLifts.ThirdPlaceSeries.TopPlug
From compatible families and windows to EveryCharacter
Produces TopG from the hypothesis witness and Green input, supplies each character using VWin, then passes from ZeroFreeAll to EveryCharacter.
12theorem UpperTheory.Top.zero_free_all_of_green_v_win (hG : GlobalTheory.GLq.Green) (hV : UpperTheory.Top.VWin)
13 (h : Nonempty (_root_.GlobalTheory.Fc.HypsAlt (fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm) _root_.GlobalTheory.Fc.DefiniteSideCondition)) : Formalism.HC.ZeroFreeAll :=
14 h.elim fun h => UpperTheory.Top.zeroFreeAll_of_topG (la := 3 / 2) (by norm_num)
15 (_root_.GlobalTheory.Fc.forall_goal_of_shape_of_hyps _ _ _ _ (_root_.UpperTheory.Top.shape_closed_link_n_of_green hG) trivial trivial h) fun ψ => UpperTheory.Top.supplyChi ψ (hV ψ)
16theorem UpperTheory.Top.every_character_of_green_v_win (hG : GlobalTheory.GLq.Green) (hV : UpperTheory.Top.VWin)
17 (h : Nonempty (_root_.GlobalTheory.Fc.HypsAlt (fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm) _root_.GlobalTheory.Fc.DefiniteSideCondition)) : UpperTheory.EveryCharacter :=
18 UpperTheory.Top.imprimitive (_root_.UpperTheory.Top.zero_free_all_of_green_v_win hG hV h)
Snapshot fingerprint
SHA-256: 7d1d7972a4abe1284c5e4da9dd65a6eb605b06efb5e993b298fe5aaed88e9adf
1,667 bytes, unchanged from the original archive.