Download data/lean/OAI/ArithmeticGeometry/Models/SpreadingOut/BoundedPolynomial.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.91 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/ArithmeticGeometry/Models/SpreadingOut/BoundedPolynomial.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/ArithmeticGeometry/Models/SpreadingOut/BoundedPolynomial.lean
-
curl -L -o BoundedPolynomial.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/ArithmeticGeometry/Models/SpreadingOut/BoundedPolynomial.lean
3.91 kB
| import Mathlib.Algebra.MvPolynomial.NoZeroDivisors | |
| import Mathlib.Algebra.MvPolynomial.Nilpotent | |
| import Mathlib.Data.Finsupp.Fintype | |
| /-! # Bounded Polynomial -/ | |
| namespace OAI.ArithmeticGeometry.Models.SpreadingOut.BoundedPolynomial.Construction | |
| noncomputable section | |
| /-! Finite coefficient coordinates for polynomials of bounded degree. -/ | |
| open _root_.MvPolynomial | |
| open scoped BigOperators | |
| universe u | |
| abbrev PolynomialBox (n d : β) := Fin n β Fin (d + 1) | |
| def polynomialBoxExponent {n d : β} (a : PolynomialBox n d) : Fin n ββ β := | |
| Finsupp.equivFunOnFinite.symm (fun i β¦ (a i).val) | |
| theorem polynomialBoxExponent_injective {n d : β} : | |
| Function.Injective ( n d) := by | |
| intro a b h | |
| funext i | |
| apply Fin.ext | |
| exact congrArg (fun f : Fin n ββ β β¦ f i) h | |
| @[simp] | |
| theorem polynomialBoxExponent_eq_iff {n d : β} (a b : PolynomialBox n d) : | |
| polynomialBoxExponent a = polynomialBoxExponent b β a = b := | |
| polynomialBoxExponent_injective.eq_iff | |
| def boundedPolynomial {R : Type u} [CommSemiring R] {n d : β} | |
| (a : PolynomialBox n d β R) : MvPolynomial (Fin n) R := | |
| β v, monomial (polynomialBoxExponent v) (a v) | |
| theorem boundedPolynomial_coeff {R : Type u} [CommSemiring R] {n d : β} | |
| (a : PolynomialBox n d β R) (v : PolynomialBox n d) : | |
| (boundedPolynomial a).coeff (polynomialBoxExponent v) = a v := by | |
| classical | |
| simp [boundedPolynomial, coeff_monomial] | |
| theorem boundedPolynomial_map {R S : Type u} [CommSemiring R] [CommSemiring S] | |
| {n d : β} (a : PolynomialBox n d β R) (f : R β+* S) : | |
| MvPolynomial.map f (boundedPolynomial a) = boundedPolynomial (fun v β¦ f (a v)) := by | |
| simp [boundedPolynomial] | |
| theorem support_in_polynomialBox {R : Type u} [CommSemiring R] {n d : β} | |
| (p : MvPolynomial (Fin n) R) (hp : p.totalDegree β€ d) | |
| {m : Fin n ββ β} (hm : m β p.support) : | |
| β v : PolynomialBox n d, polynomialBoxExponent v = m := by | |
| let v : PolynomialBox n d := fun i β¦ β¨m i, | |
| Nat.lt_succ_of_le ((le_degreeOf_of_mem_support i hm).trans ((degreeOf_le_totalDegree p i).trans hp))β© | |
| exact β¨v, by ext; rflβ© | |
| theorem boundedPolynomial_reconstruct {R : Type u} [CommSemiring R] {n d : β} | |
| (p : MvPolynomial (Fin n) R) (hp : p.totalDegree β€ d) : | |
| boundedPolynomial (fun v : PolynomialBox n d β¦ p.coeff (polynomialBoxExponent v)) = p := by | |
| classical | |
| ext m | |
| by_cases hm : β v : PolynomialBox n d, polynomialBoxExponent v = m | |
| Β· obtain β¨v, rflβ© := hm | |
| exact boundedPolynomial_coeff _ v | |
| Β· have hm' : m β p.support := fun h β¦ hm (support_in_polynomialBox p hp h) | |
| have hcoeff : p.coeff m = 0 := notMem_support_iff.mp hm' | |
| rw [hcoeff] | |
| have hne (v : PolynomialBox n d) : polynomialBoxExponent v β m := fun h β¦ hm β¨v, hβ© | |
| simp [boundedPolynomial, coeff_monomial, hne] | |
| theorem polynomial_not_isUnit_of_nonconstant_coefficient | |
| {k : Type u} [Field k] {n : β} {p : MvPolynomial (Fin n) k} | |
| {m : Fin n ββ β} (hm : m β 0) (hc : p.coeff m β 0) : Β¬ IsUnit p := by | |
| intro h | |
| exact hc (isNilpotent_iff_eq_zero.mp ((MvPolynomial.isUnit_iff.mp h).2 m hm)) | |
| theorem nonconstant_coefficient_of_nonunit | |
| {k : Type u} [Field k] {n : β} {p : MvPolynomial (Fin n) k} | |
| (hp : p β 0) (hu : Β¬ IsUnit p) : | |
| β m : Fin n ββ β, m β 0 β§ p.coeff m β 0 := by | |
| classical | |
| by_contra h | |
| have hc (m : Fin n ββ β) (hm : m β 0) : p.coeff m = 0 := by | |
| by_contra hc | |
| exact h β¨m, hm, hcβ© | |
| have he : p = C (p.coeff 0) := by | |
| ext m | |
| by_cases hm : m = 0 | |
| Β· subst m; simp | |
| Β· simp [coeff_C, Ne.symm hm, hc m hm] | |
| have hzero : p.coeff 0 β 0 := fun h β¦ hp (by simpa [h] using he) | |
| exact hu (MvPolynomial.isUnit_iff_eq_C_of_isReduced.mpr | |
| β¨p.coeff 0, isUnit_iff_ne_zero.mpr hzero, heβ©) | |
| end | |
| end OAI.ArithmeticGeometry.Models.SpreadingOut.BoundedPolynomial.Construction | |