Lean source evidence
UpperTheory.LiteratureTheorems.local_langlands_gl_recT_exists_of_literature
Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/EveryCharacterOfLiteratureOfVWin.lean313theorem UpperTheory.LiteratureTheorems.local_langlands_gl_recT_exists_of_literature (O : _root_.UpperTheory.LiteratureTheorems.OpenLiteratureStatements) : _root_.UpperTheory.Zero.LLC.RecTExists :=
314 _root_.UpperTheory.One.M.New.llOf_alt (_root_.UpperTheory.LiteratureTheorems.local_langlands_recT_exists_of_literature O) (_root_.UpperTheory.LiteratureTheorems.local_converse_gl_of_literature O) (_root_.UpperTheory.LiteratureTheorems.depth_zero_induction_of_literature O) (_root_.UpperTheory.LiteratureTheorems.brauer_degree_zero_of_literature O) (_root_.UpperTheory.LiteratureTheorems.chevalley_units_of_literature O) (_root_.UpperTheory.LiteratureTheorems.global_artin_reciprocity_of_literature O) (_root_.UpperTheory.LiteratureTheorems.langlands_exhaustion_gl_of_literature O) (_root_.UpperTheory.LiteratureTheorems.langlands_multisegments_of_literature O) (_root_.UpperTheory.LiteratureTheorems.standard_cosocle_gl_of_literature O) (_root_.UpperTheory.LiteratureTheorems.zelevinsky_polynomial_ring_of_literature O) (_root_.UpperTheory.LiteratureTheorems.geometric_restriction_of_literature O) (_root_.UpperTheory.LiteratureTheorems.bernstein_zelevinsky_finiteness_of_literature O)
SelfIntersectionVolumeEstimates.topCovolSlim2_use_alt_alt
Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopCovolSlim2Use.lean16theorem 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)
UpperTheory.Zero.LLC.recTExists
Development/AutomorphicArithmetic/Foundations/LocalLanglands/LocalCentralUnits/RecTExists.lean20theorem 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
UpperTheory.LiteratureTheorems.theta_integrals_agree_and_local_matching_of_literature
Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/EveryCharacterOfLiteratureOfVWin.lean565theorem 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)
UpperTheory.Lit.nonempty_hyps_definite_side_of_closed_bound
Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/SiegelEisensteinSecondTermHypotheses.lean44theorem 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
UpperTheory.Top.zeroFreeAll_of_topG
Development/AutomorphicArithmetic/CharacterBoxes/ZeroFreeAllOfTopG.lean26theorem 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
UpperTheory.Top.zero_free_all_of_green_v_win
Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopPlug.lean12theorem 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 ψ)
UpperTheory.Top.imprimitive
Development/AutomorphicArithmetic/CharacterBoxes/Imprimitive.lean5theorem 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
UpperTheory.Top.every_character_of_green_v_win
Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopPlug.lean16theorem 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)
UpperTheory.Lit.every_character_of_theta_integrals_local_matching
Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/SiegelEisensteinSecondTermHypotheses.lean69theorem 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))
UpperTheory.LiteratureTheorems.every_character_of_literature_of_vWin
Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/EveryCharacterOfLiteratureOfVWin.lean810theorem 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
UpperTheory.FinalTheorems.everyCharacter_of_row
Development/AutomorphicArithmetic/CharacterBoxes/MainConclusion.lean7theorem 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)
Claim.factor_ne_zero
Development/AutomorphicArithmetic/CharacterBoxes/ClaimStrip.lean7theorem factor_ne_zero {M : ℕ} (ψ : DirichletCharacter ℂ M) {s : ℂ} (hs : 0 < s.re) (p : ℕ)
8 (hp : p.Prime) : (1 : ℂ) - ψ p * (p : ℂ) ^ (-s) ≠ 0 := by
9 intro h
10 have h1 : ψ p * (p : ℂ) ^ (-s) = 1 := by linear_combination -h
11 have hp1 : (1 : ℝ) < p := by exact_mod_cast hp.one_lt
12 have hpow : ‖(p : ℂ) ^ (-s)‖ < 1 := by
13 rw [Complex.norm_natCast_cpow_of_pos hp.pos, Complex.neg_re]
14 exact Real.rpow_lt_one_of_one_lt_of_neg hp1 (by linarith)
15 have hn : ‖ψ p * (p : ℂ) ^ (-s)‖ < 1 := by
16 rw [norm_mul]
17 calc ‖ψ p‖ * ‖(p : ℂ) ^ (-s)‖ ≤ 1 * ‖(p : ℂ) ^ (-s)‖ := by
18 gcongr; exact ψ.norm_le_one _
19 _ < 1 := by rw [one_mul]; exact hpow
20 rw [h1, norm_one] at hn
21 exact lt_irrefl _ hn
Claim.prim_zero
Development/AutomorphicArithmetic/CharacterBoxes/ClaimStrip.lean23theorem prim_zero {N : ℕ} [NeZero N] (χ : DirichletCharacter ℂ N) [NeZero χ.conductor] {s : ℂ}
24 (hs0 : 0 < s.re) (hs1 : s.re < 1) (h : DirichletCharacter.LFunction χ s = 0) :
25 DirichletCharacter.LFunction χ.primitiveCharacter s = 0 := by
26 have hs : s ≠ 1 := fun e => by rw [e, Complex.one_re] at hs1; exact lt_irrefl _ hs1
27 have key := DirichletCharacter.LFunction_changeLevel χ.conductor_dvd_level
28 χ.primitiveCharacter (Or.inr hs)
29 rw [χ.changeLevel_primitiveCharacter, h] at key
30 rcases mul_eq_zero.mp key.symm with h' | h'
31 · exact h'
32 · obtain ⟨p, hp, hp0⟩ := Finset.prod_eq_zero_iff.mp h'
33 exact absurd hp0 (factor_ne_zero _ hs0 p (Nat.prime_of_mem_primeFactors hp))
Claim.gamma_ne_zero
Development/AutomorphicArithmetic/CharacterBoxes/ClaimStrip.lean35theorem gamma_ne_zero {M : ℕ} [NeZero M] (φ : DirichletCharacter ℂ M) {t : ℂ} (ht : 0 < t.re) :
36 DirichletCharacter.gammaFactor φ t ≠ 0 := by
37 rcases φ.even_or_odd with hφ | hφ
38 · rw [hφ.gammaFactor_def]; exact Complex.Gammaℝ_ne_zero_of_re_pos ht
39 · rw [hφ.gammaFactor_def]
40 exact Complex.Gammaℝ_ne_zero_of_re_pos (by rw [Complex.add_re, Complex.one_re]; linarith)
Claim.prim_reflect
Development/AutomorphicArithmetic/CharacterBoxes/ClaimStrip.lean42theorem 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]
Claim.strip
Development/AutomorphicArithmetic/CharacterBoxes/ClaimStrip.lean59theorem strip (h : HalfPlane) : Strip := by
60 unfold HalfPlane at h
61 intro N _ χ s hs0 hs1 hz
62 have hs : s ≠ 1 := fun e => by rw [e, Complex.one_re] at hs1; exact lt_irrefl _ hs1
63 have hs0' : s ≠ 0 := fun e => by rw [e, Complex.zero_re] at hs0; exact lt_irrefl _ hs0
64 rcases lt_trichotomy s.re (1 / 2) with hlt | heq | hgt
65 · exfalso
66 haveI : NeZero χ.conductor := ⟨χ.conductor_ne_zero⟩
67 have hp := prim_zero χ hs0 hs1 hz
68 have hr := prim_reflect χ.primitiveCharacter χ.primitiveCharacter_isPrimitive hs0 hs1 hp
69 have ht : (1 : ℂ) - s ≠ 1 := fun e => hs0' (sub_eq_self.mp e)
70 exact h χ.conductor χ.primitiveCharacter⁻¹ (1 - s)
71 (by rw [Complex.sub_re, Complex.one_re]; linarith) (Or.inr ht) hr
72 · exact heq
73 · exact absurd hz (h N χ s hgt (Or.inr hs))
Claim.zeta
Development/AutomorphicArithmetic/CharacterBoxes/ClaimStrip.lean75theorem zeta (h : HalfPlane) : Zeta := by
76 intro s hz htriv hs1
77 have hs0 : s ≠ 0 := fun e => by rw [e, riemannZeta_zero] at hz; norm_num at hz
78 rcases lt_or_ge 0 s.re with hpos | hnpos
79 · rcases lt_or_ge s.re 1 with hlt1 | hge1
80 · have hL : DirichletCharacter.LFunction (1 : DirichletCharacter ℂ 1) s = 0 := by
81 rw [DirichletCharacter.LFunction_modOne_eq]; exact hz
82 exact strip h 1 1 s hpos hlt1 hL
83 · exact absurd hz (riemannZeta_ne_zero_of_one_le_re hge1)
84 · exfalso
85 have hG : Gammaℝ s ≠ 0 := by
86 intro hg
87 obtain ⟨n, hn⟩ := Complex.Gammaℝ_eq_zero_iff.mp hg
88 rcases n with _ | n
89 · exact hs0 (by simpa using hn)
90 · exact htriv ⟨n, by rw [hn]; push_cast; ring⟩
91 have hc : completedRiemannZeta s = 0 := by
92 rw [riemannZeta_def_of_ne_zero hs0, div_eq_zero_iff] at hz
93 exact hz.resolve_right hG
94 have h1s : 1 - s ≠ 0 := fun e => by
95 have := congrArg Complex.re e
96 rw [Complex.sub_re, Complex.one_re, Complex.zero_re] at this
97 linarith
98 have hz' : riemannZeta (1 - s) = 0 := by
99 rw [riemannZeta_def_of_ne_zero h1s, completedRiemannZeta_one_sub, hc, zero_div]
100 exact riemannZeta_ne_zero_of_one_le_re (by rw [Complex.sub_re, Complex.one_re]; linarith) hz'
Formalism.VW.gammaFactor_ne_zero
Formalism/GammaFactorNonvanishing/CritLine.lean6theorem 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)
Formalism.VW.critLine
Formalism/GammaFactorNonvanishing/CritLine.lean11theorem 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
Formalism.VW.rh_of_right
Formalism/GammaFactorNonvanishing/RhOfRight.lean5theorem 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
13 rw [riemannZeta_zero] at hs
14 norm_num at hs
15 have ht : 1 / 2 < (1 - s).re := by
16 rw [Complex.sub_re, Complex.one_re]
17 linarith
18 have h1 : (1 - s) ≠ 1 := by
19 intro h
20 apply hs0
21 linear_combination -h
22 have hnat : ∀ n : ℕ, (1 - s) ≠ -(n : ℂ) := by
23 intro n h
24 have hr := congrArg Complex.re h
25 rw [Complex.sub_re, Complex.one_re, Complex.neg_re, Complex.natCast_re] at hr
26 have : (0 : ℝ) ≤ n := n.cast_nonneg
27 linarith
28 have key := riemannZeta_one_sub hnat h1
29 rw [sub_sub_cancel, hs] at key
30 have hz' := hz (1 - s) ht h1
31 have h2pi : (2 : ℂ) * (2 * (Real.pi : ℂ)) ^ (-(1 - s)) ≠ 0 :=
32 mul_ne_zero two_ne_zero (Complex.cpow_ne_zero_iff.2 (Or.inl (mul_ne_zero two_ne_zero hpi)))
33 have hG : Complex.Gamma (1 - s) ≠ 0 := Complex.Gamma_ne_zero_of_re_pos (by linarith)
34 have hcos : Complex.cos ((Real.pi : ℂ) * (1 - s) / 2) ≠ 0 := by
35 rw [Ne, Complex.cos_eq_zero_iff]
36 rintro ⟨k, hk⟩
37 have h3 : ((1 - s) - (2 * (k : ℂ) + 1)) * (Real.pi : ℂ) = 0 := by
38 linear_combination 2 * hk
39 rcases mul_eq_zero.1 h3 with h | h
40 · have hsk : s = -2 * (k : ℂ) := by linear_combination -h
41 have hre : s.re = -2 * (k : ℝ) := by
42 rw [hsk, Complex.mul_re]
43 simp
44 rcases lt_trichotomy k 0 with hk0 | hk0 | hk0
45 · have : (k : ℝ) ≤ -1 := by exact_mod_cast (show k ≤ -1 by omega)
46 linarith
47 · apply hs0
48 rw [hsk, hk0]
49 simp
50 · apply htriv
51 refine ⟨(k - 1).toNat, ?_⟩
52 have hnk : ((k - 1).toNat : ℤ) = k - 1 := Int.toNat_of_nonneg (by omega)
53 have h' : (((k - 1).toNat : ℕ) : ℂ) = (k : ℂ) - 1 := by
54 have := congrArg (fun m : ℤ => (m : ℂ)) hnk
55 push_cast at this
56 exact this
57 rw [hsk, h']
58 ring
59 · exact hpi h
60 exact (mul_ne_zero (mul_ne_zero (mul_ne_zero h2pi hG) hcos) hz') key.symm
61 · exact heq
62 · exact absurd hs (hz s hgt hs1)
Formalism.VW.rh_of_every
Formalism/GammaFactorNonvanishing/CritLine.lean29theorem 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
critAll
Supplements/Kernels/MainTheorems.lean11theorem 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
riemannHypothesis
Main.lean4theorem riemannHypothesis : RiemannHypothesis := rhOfAll
riemannZeta_eq_zero_re
Main.lean6theorem riemannZeta_eq_zero_re : RiemannZetaZerosOnLine := rhOfAll
LFunction_ne_zero_of_half_lt_re
Main.lean8theorem LFunction_ne_zero_of_half_lt_re : DirichletLNonvanishingRightOfHalf := allChi
LFunction_eq_zero_re
Main.lean10theorem LFunction_eq_zero_re : DirichletLZerosOnLine := claimAll.2.1
LFunction_eq_zero_re_of_isPrimitive
Main.lean12theorem LFunction_eq_zero_re_of_isPrimitive : PrimitiveDirichletLZerosOnLine := critAll