Download data/lean/OAI/ArithmeticGeometry/Models/SpreadingOut/FactorizationPoints.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.07 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/ArithmeticGeometry/Models/SpreadingOut/FactorizationPoints.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/ArithmeticGeometry/Models/SpreadingOut/FactorizationPoints.lean
-
curl -L -o FactorizationPoints.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/ArithmeticGeometry/Models/SpreadingOut/FactorizationPoints.lean
5.07 kB
| import OAI.ArithmeticGeometry.Models.SpreadingOut.FactorizationAlgebra | |
| /-! # Factorization Points -/ | |
| namespace OAI.ArithmeticGeometry.Models.SpreadingOut.FactorizationPoints.Construction.PolynomialFactorization | |
| noncomputable section | |
| /-! Bounded nonconstant factorizations give points of the parameter algebra. -/ | |
| open _root_.MvPolynomial | |
| universe u | |
| def coefficientsOfFactors {R k : Type u} [CommRing R] [Field k] [Algebra R k] | |
| {n d : β} (q : Fin 2 β MvPolynomial (Fin n) k) (w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d) : | |
| FactorizationAlgebra.Construction.PolynomialFactorization.Coefficients R n d ββ[R] k := | |
| MvPolynomial.aeval (Sum.elim | |
| (fun v : Fin 2 Γ BoundedPolynomial.Construction.PolynomialBox n d β¦ (q v.1).coeff (BoundedPolynomial.Construction.polynomialBoxExponent v.2)) | |
| (fun i : Fin 2 β¦ ((q i).coeff (BoundedPolynomial.Construction.polynomialBoxExponent (w i)))β»ΒΉ)) | |
| theorem universalFactor_map_of_factors {R k : Type u} [CommRing R] [Field k] [Algebra R k] | |
| {n d : β} (q : Fin 2 β MvPolynomial (Fin n) k) (w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d) | |
| (hq : β i, (q i).totalDegree β€ d) (i : Fin 2) : | |
| MvPolynomial.map (coefficientsOfFactors (R := R) q w).toRingHom (FactorizationAlgebra.Construction.PolynomialFactorization.universalFactor R n d i) = q i := by | |
| rw [FactorizationAlgebra.Construction.PolynomialFactorization.universalFactor, BoundedPolynomial.Construction.boundedPolynomial_map] | |
| convert BoundedPolynomial.Construction.boundedPolynomial_reconstruct (q i) (hq i) using 1 | |
| congr 1 | |
| funext v | |
| exact aeval_X _ _ | |
| theorem factor_relations_vanish {R k : Type u} [CommRing R] [Field k] [Algebra R k] | |
| {n d : β} (p : MvPolynomial (Fin n) R) (q : Fin 2 β MvPolynomial (Fin n) k) | |
| (w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d) (hq : β i, (q i).totalDegree β€ d) | |
| (hprod : MvPolynomial.map (algebraMap R k) p = q 0 * q 1) | |
| (hw : β i, (q i).coeff (BoundedPolynomial.Construction.polynomialBoxExponent (w i)) β 0) | |
| {r : FactorizationAlgebra.Construction.PolynomialFactorization.Coefficients R n d} (hr : r β FactorizationAlgebra.Construction.PolynomialFactorization.relations p d w) : | |
| coefficientsOfFactors (R := R) q w r = 0 := by | |
| let Ο := coefficientsOfFactors (R := R) q w | |
| have hp : MvPolynomial.map Ο.toRingHom | |
| (MvPolynomial.map (algebraMap R (FactorizationAlgebra.Construction.PolynomialFactorization.Coefficients R n d)) p) = MvPolynomial.map (algebraMap R k) p := by | |
| rw [map_map] | |
| exact congrArg (fun f : R β+* k β¦ MvPolynomial.map f p) Ο.comp_algebraMap | |
| rcases hr with β¨m, rflβ© | β¨i, rflβ© | |
| Β· have he : MvPolynomial.map Ο.toRingHom (FactorizationAlgebra.Construction.PolynomialFactorization.discrepancy p d) = 0 := by | |
| rw [FactorizationAlgebra.Construction.PolynomialFactorization.discrepancy, map_sub, map_mul, hp, | |
| universalFactor_map_of_factors q w hq, universalFactor_map_of_factors q w hq, hprod, sub_self] | |
| have hc := congrArg (fun p : MvPolynomial (Fin n) k β¦ p.coeff m) he | |
| rw [coeff_map, AddMonoidAlgebra.coeff_zero] at hc | |
| exact hc | |
| Β· simp [coefficientsOfFactors, hw i] | |
| theorem nonempty_of_factorization {R k : Type u} [CommRing R] [Field k] [Algebra R k] | |
| {n d : β} (p : MvPolynomial (Fin n) R) (q : Fin 2 β MvPolynomial (Fin n) k) | |
| (w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d) (hq : β i, (q i).totalDegree β€ d) | |
| (hprod : MvPolynomial.map (algebraMap R k) p = q 0 * q 1) | |
| (hw : β i, (q i).coeff (BoundedPolynomial.Construction.polynomialBoxExponent (w i)) β 0) : | |
| Nonempty (FactorizationAlgebra.Construction.PolynomialFactorization.ParameterAlgebra p d w ββ[R] k) := by | |
| let Ο := coefficientsOfFactors (R := R) q w | |
| have hI : FactorizationAlgebra.Construction.PolynomialFactorization.ideal p d w β€ RingHom.ker Ο.toRingHom := | |
| Ideal.span_le.mpr (fun r hr β¦ factor_relations_vanish p q w hq hprod hw hr) | |
| exact β¨Ideal.Quotient.liftβ (FactorizationAlgebra.Construction.PolynomialFactorization.ideal p d w) Ο (fun r hr β¦ hI hr)β© | |
| theorem parameter_algebra_killed_by_nonzero | |
| {R K : Type u} [CommRing R] [IsDomain R] [Field K] [Algebra R K] [IsFractionRing R K] | |
| {n d : β} (p : MvPolynomial (Fin n) R) (w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d) | |
| (hw : β i, BoundedPolynomial.Construction.polynomialBoxExponent (w i) β 0) | |
| (hp : Irreducible (MvPolynomial.map (algebraMap R (AlgebraicClosure K)) p)) : | |
| β r : R, r β 0 β§ algebraMap R (FactorizationAlgebra.Construction.PolynomialFactorization.ParameterAlgebra p d w) r = 0 := | |
| AlgebraicSpecialization.Construction.finiteType_no_geometric_generic_point_killed_by_nonzero R K (FactorizationAlgebra.Construction.PolynomialFactorization.ParameterAlgebra p d w) | |
| (FactorizationAlgebra.Construction.PolynomialFactorization.no_points_of_irreducible hw hp) | |
| end | |
| end OAI.ArithmeticGeometry.Models.SpreadingOut.FactorizationPoints.Construction.PolynomialFactorization | |