Download data/lean/OAI/NumberTheory/PiExponent/Geometry/CurveComponentRigidity.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.1 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/NumberTheory/PiExponent/Geometry/CurveComponentRigidity.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/NumberTheory/PiExponent/Geometry/CurveComponentRigidity.lean
-
curl -L -o CurveComponentRigidity.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/NumberTheory/PiExponent/Geometry/CurveComponentRigidity.lean
5.1 kB
| import OAI.NumberTheory.PiExponent.Approximation.GenericNormalRigidity | |
| import OAI.NumberTheory.PiExponent.Geometry.CurveContact | |
| import OAI.NumberTheory.PiExponent.Jets.PrimeNormalCotangent | |
| namespace OAI | |
| noncomputable section | |
| namespace PiExponent.CurveComponentRigidity | |
| open scoped BigOperators | |
| open PiExponentApprox NormalBasisRigidity | |
| theorem residueY_ne_zero {m : β} (Q : Ideal (FramePolynomial m)) [Q.IsPrime] | |
| (hY : MvPolynomial.X (0 : Fin (m + 1)) β Q) : | |
| primeResidueMap Q (MvPolynomial.X (0 : Fin (m + 1))) β 0 := by | |
| intro h | |
| exact hY (Ideal.algebraMap_residueField_eq_zero.mp h) | |
| def NormalProductComparison {m : β} (Q : Ideal (FramePolynomial m)) [Q.IsPrime] | |
| (hY : MvPolynomial.X (0 : Fin (m + 1)) β Q) | |
| (w cost : Fin (m + 1) β β) (M : β) : Prop := | |
| β A B : Finset (Fin (m + 1)), | |
| IsNormalBasis (K := Q.ResidueField) | |
| (fun j => (polynomialTangent (primeResidueMap Q) Q).mkQ | |
| (Pi.basisFun Q.ResidueField _ j)) A β | |
| IsNormalBasis (K := Q.ResidueField) | |
| (fun j => (polynomialTangent (primeResidueMap Q) Q).mkQ | |
| (frameBasis m (primeResidueMap Q (MvPolynomial.X 0)) (residueY_ne_zero Q hY) j)) B β | |
| (β j β A, w j) β€ M * β j β B, cost j | |
| def PersistentNormalComparison {m : β} (w cost : Fin (m + 1) β β) | |
| (M delta : β) (F : FramePolynomial m) (P : Ideal (FramePolynomial m)) | |
| (hY : MvPolynomial.X (0 : Fin (m + 1)) β P) : Prop := | |
| β r : β, r < m + 2 β β Q : Ideal (FramePolynomial m), β hQ : Q.IsPrime, | |
| β hQP : Q β€ P, | |
| Q β (frameDerivativeIdeal cost ((r : β) * delta) F).minimalPrimes β | |
| Q β (frameDerivativeIdeal cost (((r : β) + 1) * delta) F).minimalPrimes β | |
| 1 β€ Q.height β Q.height β€ m β | |
| (β p β frameDerivativeIdeal cost ((r : β) * delta) F, | |
| β word : List (Fin (m + 1)), frameWordCost cost word β€ delta β | |
| polynomialFrameWord m word p β Q) β | |
| @NormalProductComparison m Q hQ (fun h => hY (hQP h)) w cost M | |
| theorem coordinate_constant_of_persistent_comparison {m : β} | |
| (w cost : Fin (m + 1) β β) (M delta : β) | |
| (hcost : β i, 0 β€ cost i) (hdelta : 0 β€ delta) | |
| (F : FramePolynomial m) (hF : F β 0) | |
| (P : Ideal (FramePolynomial m)) (hP : P.IsPrime) (hheight : P.height β€ m) | |
| (hY : MvPolynomial.X (0 : Fin (m + 1)) β P) | |
| (hvanish : β word : List (Fin (m + 1)), | |
| frameWordCost cost word β€ ((m : β) + 2) * delta β polynomialFrameWord m word F β P) | |
| (hcomparison : PersistentNormalComparison w cost M delta F P hY) | |
| (hseparated : β A B : Finset (Fin (m + 1)), A.card = B.card β | |
| β i, i β 0 β i β A β i β B β | |
| (β j, i < j β (j β A β j β B)) β | |
| M * (β j β B, cost j) < β j β A, w j) : | |
| β c : β, MvPolynomial.X (0 : Fin (m + 1)) - MvPolynomial.C c β P := by | |
| obtain β¨r, hr, Q, hQr, hQnext, hQP, hQlo, hQhi, hpersistβ© := | |
| exists_persistent_frame_component cost hcost delta hdelta F hF P hP hheight hvanish | |
| let : Q.IsPrime := hQr.isPrime | |
| have hYQ : MvPolynomial.X (0 : Fin (m + 1)) β Q := fun h => hY (hQP h) | |
| have hFQ : F β Q := hQr.le | |
| (polynomial_mem_frameDerivativeIdeal cost ((r : β) * delta) F | |
| (mul_nonneg (Nat.cast_nonneg r) hdelta)) | |
| have hQ0 : Q β β₯ := by | |
| intro h | |
| exact hF (by simpa only [h, Ideal.mem_bot] using hFQ) | |
| have hcomp := hcomparison r hr Q inferInstance hQP hQr hQnext hQlo hQhi hpersist | |
| let : Algebra.EssFiniteType β Q.ResidueField := | |
| Algebra.EssFiniteType.comp β (FramePolynomial m) Q.ResidueField | |
| have hker (p : FramePolynomial m) : primeResidueMap Q p = 0 β p β Q := | |
| Ideal.algebraMap_residueField_eq_zero | |
| obtain β¨c, hcβ© := constant_zeroth_coordinate_of_generic_normal_separation | |
| (primeResidueMap Q) Q hker hQ0 (residueY_ne_zero Q hYQ) | |
| (weighted_normalBasis_exclusion _ _ w cost M hcomp hseparated) | |
| exact β¨c, hQP hcβ© | |
| theorem coordinate_eq_one_of_persistent_comparison {m : β} | |
| (w cost : Fin (m + 1) β β) (M delta : β) | |
| (hcost : β i, 0 β€ cost i) (hdelta : 0 β€ delta) | |
| (F : FramePolynomial m) (hF : F β 0) | |
| (P : Ideal (FramePolynomial m)) (hP : P.IsPrime) (hheight : P.height β€ m) | |
| (hY : MvPolynomial.X (0 : Fin (m + 1)) β P) | |
| (hvanish : β word : List (Fin (m + 1)), | |
| frameWordCost cost word β€ ((m : β) + 2) * delta β polynomialFrameWord m word F β P) | |
| (hcomparison : PersistentNormalComparison w cost M delta F P hY) | |
| (hseparated : β A B : Finset (Fin (m + 1)), A.card = B.card β | |
| β i, i β 0 β i β A β i β B β | |
| (β j, i < j β (j β A β j β B)) β | |
| M * (β j β B, cost j) < β j β A, w j) | |
| (a : Fin (m + 1) β β) (ha : a 0 = 1) | |
| (hcenter : β p β P, MvPolynomial.eval a p = 0) : | |
| MvPolynomial.X (0 : Fin (m + 1)) - 1 β P := | |
| constant_coordinate_eq_one_of_center P a ha hcenter | |
| (coordinate_constant_of_persistent_comparison w cost M delta hcost hdelta | |
| F hF P hP hheight hY hvanish hcomparison hseparated) | |
| end PiExponent.CurveComponentRigidity | |
| end | |
| end OAI | |