Download data/lean/OAI/Geometry/ComplexTorus/RiemannProjectivity/CoefficientRoot.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 8.68 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/ComplexTorus/RiemannProjectivity/CoefficientRoot.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Geometry/ComplexTorus/RiemannProjectivity/CoefficientRoot.lean
-
curl -L -o CoefficientRoot.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/ComplexTorus/RiemannProjectivity/CoefficientRoot.lean
8.68 kB
| import OAI.Geometry.ComplexTorus.RiemannProjectivity.BranchCoefficientsAt | |
| import Mathlib.Analysis.Polynomial.MahlerMeasure | |
| /-! # Coefficient Root -/ | |
| namespace OAI | |
| noncomputable section | |
| namespace Geometry.ComplexTorus.RiemannProjectivity.CoefficientRoot.Constructions.CoefficientGrowth | |
| /-! | |
| # RiemannProjectivity: growth bounds for projection coefficients | |
| The proper-cone norm estimate bounds every coordinate on a fiber. The | |
| product polynomial of a finite fiber therefore has polynomially bounded | |
| coefficients, with an explicit constant and degree. Repeated coordinate | |
| values remain separate factors, as required for symmetric coefficients. | |
| -/ | |
| open Set _root_.Polynomial | |
| open scoped BigOperators | |
| theorem norm_coeff_prod_X_sub_C_le {ΞΉ : Type*} [Fintype ΞΉ] | |
| (a : ΞΉ β β) (R : β) (ha : β i, βa iβ β€ R) (j : β) : | |
| β(β i, (Polynomial.X - Polynomial.C (a i))).coeff jβ β€ | |
| (Fintype.card ΞΉ).choose j * (max 1 R) ^ Fintype.card ΞΉ := by | |
| classical | |
| have hm : β s : Finset ΞΉ, | |
| (β i β s, (Polynomial.X - Polynomial.C (a i))).mahlerMeasure = | |
| β i β s, max 1 βa iβ := by | |
| intro s | |
| induction s using Finset.induction_on with | |
| | empty => simp | |
| | @insert i s hi ih => simp [Finset.prod_insert hi, Polynomial.mahlerMeasure_mul, ih, | |
| Polynomial.mahlerMeasure_X_sub_C] | |
| have hprod : (β i, max 1 βa iβ) β€ (max 1 R) ^ Fintype.card ΞΉ := by | |
| calc | |
| _ β€ β _ : ΞΉ, max 1 R := Finset.prod_le_prodβ | |
| (fun _ _ => le_trans zero_le_one (le_max_left _ _)) | |
| (fun i _ => max_le_max_left 1 (ha i)) | |
| _ = _ := by simp | |
| calc | |
| _ β€ (β i, (Polynomial.X - Polynomial.C (a i))).natDegree.choose j * | |
| (β i, (Polynomial.X - Polynomial.C (a i))).mahlerMeasure := | |
| Polynomial.norm_coeff_le_choose_mul_mahlerMeasure _ _ | |
| _ = (Fintype.card ΞΉ).choose j * β i, max 1 βa iβ := by simp only [hm, | |
| Polynomial.natDegree_finsetProd_X_sub_C_eq_card, Finset.card_univ] | |
| _ β€ _ := mul_le_mul_of_nonneg_left hprod (Nat.cast_nonneg _) | |
| variable {V W : Type*} [NormedAddCommGroup V] [NormedSpace β V] | |
| [NormedAddCommGroup W] | |
| /-- The linear bound on a fiber gives the polynomial-growth hypothesis | |
| needed for extension of each symmetric coefficient. -/ | |
| theorem coefficient_growth_from_fiber_bound {m : β} (b : Fin m β W β V) | |
| (l : V βL[β] β) (C : β) {U : Set W} | |
| (hb : β z β U, β i, βb i zβ β€ C * βzβ) (j : β) : | |
| β z β U, | |
| β(β i, (Polynomial.X - Polynomial.C (l (b i z)))).coeff jβ β€ | |
| ((m.choose j : β) * (max 1 (βlβ * C)) ^ m) * (max 1 βzβ) ^ m := by | |
| intro z hz | |
| have ha : β i, βl (b i z)β β€ βlβ * C * βzβ := fun i => | |
| (l.le_opNorm _).trans (by | |
| simpa only [mul_assoc] using mul_le_mul_of_nonneg_left (hb z hz i) (norm_nonneg l)) | |
| have hmax : max 1 (βlβ * C * βzβ) β€ max 1 (βlβ * C) * max 1 βzβ := by | |
| apply max_le | |
| Β· exact one_le_mul_of_one_le_of_one_le (le_max_left _ _) (le_max_left _ _) | |
| Β· exact mul_le_mul (le_max_right _ _) (le_max_right _ _) (norm_nonneg z) | |
| (le_trans zero_le_one (le_max_left _ _)) | |
| calc | |
| _ β€ (m.choose j : β) * (max 1 (βlβ * C * βzβ)) ^ m := by | |
| simpa only [Fintype.card_fin] using norm_coeff_prod_X_sub_C_le | |
| (fun i => l (b i z)) (βlβ * C * βzβ) ha j | |
| _ β€ (m.choose j : β) * (max 1 (βlβ * C) * max 1 βzβ) ^ m := by gcongr | |
| _ = _ := by rw [mul_pow, mul_assoc] | |
| variable [NormedSpace β W] {X : Type*} [TopologicalSpace X] [T2Space X] | |
| /-- Combine genuine local inverse branches with a uniform fiber bound. | |
| The same local polynomial has both holomorphic coefficients and the | |
| quantitative growth estimate. -/ | |
| theorem local_bounded_fiber_polynomial (a : X β V) {f : X β W} (hf : IsProperMap f) | |
| (C : β) (hbound : β x, βa xβ β€ C * βf xβ) | |
| {y : W} (hy : y β BranchCoefficientsAt.Constructions.BranchCoefficients.holomorphicRegularValues a f) | |
| (l : V βL[β] β) : | |
| β (m : β) (U : Set W) (P : W β Polynomial β), IsOpen U β§ y β U β§ | |
| (β j, DifferentiableOn β (fun z => (P z).coeff j) U) β§ | |
| (β z β U, β j, β(P z).coeff jβ β€ | |
| ((m.choose j : β) * (max 1 (βlβ * C)) ^ m) * (max 1 βzβ) ^ m) β§ | |
| β z β U, (P z).Monic β§ | |
| β c, (P z).eval c = 0 β β x, f x = z β§ l (a x) = c := by | |
| obtain β¨m, U, b, hU, hyU, hb, hbijβ© := BranchCoefficientsAt.Constructions.BranchCoefficients.finite_holomorphic_branches a hf hy | |
| have hp := BranchCoefficientsAt.Constructions.BranchCoefficients.polynomial_of_holomorphic_branches a f b hb | |
| (fun z hz => (hbij z hz).2) l | |
| refine β¨m, U, _, hU, hyU, hp.1, ?_, hp.2β© | |
| intro z hz j | |
| apply coefficient_growth_from_fiber_bound (fun i w => a (b i w)) l C ?_ j z hz | |
| intro w hw i | |
| have hfw : f (b i w) = w := ((hbij w hw).2 _).mpr β¨i, rflβ© | |
| simpa only [hfw] using hbound (b i w) | |
| end Geometry.ComplexTorus.RiemannProjectivity.CoefficientRoot.Constructions.CoefficientGrowth | |
| namespace Geometry.ComplexTorus.RiemannProjectivity.CoefficientRoot.Constructions.RootCoefficientBound | |
| /-! # RiemannProjectivity: coefficient bounds from bounded roots, including multiplicities -/ | |
| open _root_.Polynomial | |
| open scoped BigOperators | |
| theorem prod_max_norm_le (s : Multiset β) (R : β) (h : β z β s, βzβ β€ R) : | |
| (s.map (fun z => max 1 βzβ)).prod β€ (max 1 R) ^ s.card := by | |
| induction s using Multiset.induction_on with | |
| | empty => simp | |
| | @cons z s ih => | |
| have hz : βzβ β€ R := h z (Multiset.mem_cons_self _ _) | |
| have hs : β w β s, βwβ β€ R := fun w hw => h w (Multiset.mem_cons_of_mem hw) | |
| have hn : 0 β€ (s.map (fun w => max 1 βwβ)).prod := by | |
| apply Multiset.prod_nonneg | |
| intro a ha | |
| obtain β¨w, _, rflβ© := Multiset.mem_map.mp ha | |
| exact zero_le_one.trans (le_max_left _ _) | |
| simp only [Multiset.map_cons, Multiset.prod_cons, Multiset.card_cons, pow_succ] | |
| calc | |
| _ β€ max 1 R * (max 1 R) ^ s.card := | |
| mul_le_mul (max_le_max_left 1 hz) (ih hs) hn (zero_le_one.trans (le_max_left _ _)) | |
| _ = _ := mul_comm _ _ | |
| theorem norm_coeff_le {p : Polynomial β} (hp : p.Monic) {R : β} | |
| (hroot : β z : β, p.eval z = 0 β βzβ β€ R) (j : β) : | |
| βp.coeff jβ β€ (p.natDegree.choose j : β) * (max 1 R) ^ p.natDegree := by | |
| have hroots : β z β p.roots, βzβ β€ R := fun z hz => hroot z ((mem_roots hp.ne_zero).mp hz) | |
| have hb := prod_max_norm_le p.roots R hroots | |
| rw [β (IsAlgClosed.splits p).natDegree_eq_card_roots] at hb | |
| have hm : p.mahlerMeasure β€ (max 1 R) ^ p.natDegree := by | |
| rw [mahlerMeasure_eq_leadingCoeff_mul_prod_roots, hp.leadingCoeff, norm_one, one_mul] | |
| exact hb | |
| exact (norm_coeff_le_choose_mul_mahlerMeasure j p).trans | |
| (mul_le_mul_of_nonneg_left hm (Nat.cast_nonneg _)) | |
| end Geometry.ComplexTorus.RiemannProjectivity.CoefficientRoot.Constructions.RootCoefficientBound | |
| namespace Geometry.ComplexTorus.RiemannProjectivity.CoefficientRoot.Constructions.MonicFamily | |
| /-! # RiemannProjectivity: reconstructing a monic polynomial from its lower coefficients -/ | |
| open _root_.Polynomial | |
| open scoped BigOperators | |
| def ofCoefficients (k : β) (a : β β β) : β[X] := | |
| X ^ k + β j β Finset.range k, monomial j (a j) | |
| theorem coeff_ofCoefficients (k j : β) (a : β β β) : | |
| (ofCoefficients k a).coeff j = (if j = k then 1 else 0) + | |
| (if j < k then a j else 0) := by | |
| classical | |
| simp [ofCoefficients, coeff_monomial, coeff_X_pow, eq_comm] | |
| theorem monic_ofCoefficients (k : β) (a : β β β) : | |
| (ofCoefficients k a).Monic β§ (ofCoefficients k a).natDegree = k := by | |
| have hd : (ofCoefficients k a).natDegree β€ k := by | |
| apply natDegree_le_iff_coeff_eq_zero.mpr | |
| intro j hj | |
| simp [coeff_ofCoefficients, ne_of_gt hj, not_lt_of_ge (Nat.le_of_lt hj)] | |
| have hc : (ofCoefficients k a).coeff k = 1 := by simp [coeff_ofCoefficients] | |
| exact β¨monic_of_natDegree_le_of_coeff_eq_one k hd hc, | |
| le_antisymm hd (le_natDegree_of_ne_zero (by rw [hc]; exact one_ne_zero))β© | |
| theorem ofCoefficients_eq {p : β[X]} (hp : p.Monic) {k : β} (hd : p.natDegree = k) | |
| {a : β β β} (ha : β j < k, a j = p.coeff j) : ofCoefficients k a = p := by | |
| ext j | |
| rw [coeff_ofCoefficients] | |
| by_cases hj : j < k | |
| Β· simp [hj, ne_of_lt hj, ha j hj] | |
| Β· by_cases he : j = k | |
| Β· subst j | |
| simp [β hd, hp.coeff_natDegree] | |
| Β· have hk : p.natDegree < j := by omega | |
| simp [he, hj, coeff_eq_zero_of_natDegree_lt hk] | |
| end Geometry.ComplexTorus.RiemannProjectivity.CoefficientRoot.Constructions.MonicFamily | |
| end | |
| end OAI | |