File size: 5,489 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 | import OAI.ArithmeticGeometry.Models.SpreadingOut.BoundedPolynomial
import OAI.ArithmeticGeometry.Models.SpreadingOut.AlgebraicSpecialization
/-! # Factorization Algebra -/
namespace OAI.ArithmeticGeometry.Models.SpreadingOut.FactorizationAlgebra.Construction.PolynomialFactorization
noncomputable section
/-! Finite-type algebras parameterizing bounded nonconstant factorizations. -/
open _root_.MvPolynomial
open scoped BigOperators
universe u
abbrev Variables (n d : β) := (Fin 2 Γ BoundedPolynomial.Construction.PolynomialBox n d) β Fin 2
abbrev Coefficients (R : Type u) [CommRing R] (n d : β) := MvPolynomial (Variables n d) R
def universalFactor (R : Type u) [CommRing R] (n d : β) (i : Fin 2) :
MvPolynomial (Fin n) (Coefficients R n d) :=
BoundedPolynomial.Construction.boundedPolynomial (fun v β¦ X (Sum.inl (i, v)))
def discrepancy {R : Type u} [CommRing R] {n : β} (p : MvPolynomial (Fin n) R) (d : β) :
MvPolynomial (Fin n) (Coefficients R n d) :=
MvPolynomial.map (algebraMap R (Coefficients R n d)) p -
universalFactor R n d 0 * universalFactor R n d 1
def relations {R : Type u} [CommRing R] {n : β} (p : MvPolynomial (Fin n) R) (d : β)
(w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d) : Set (Coefficients R n d) :=
Set.range (fun m β¦ (discrepancy p d).coeff m) βͺ
Set.range (fun i : Fin 2 β¦ X (Sum.inr i) * X (Sum.inl (i, w i)) - 1)
def ideal {R : Type u} [CommRing R] {n : β} (p : MvPolynomial (Fin n) R) (d : β)
(w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d) : Ideal (Coefficients R n d) :=
Ideal.span (relations p d w)
abbrev ParameterAlgebra {R : Type u} [CommRing R] {n : β}
(p : MvPolynomial (Fin n) R) (d : β) (w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d) :=
Coefficients R n d β§Έ ideal p d w
def evalCoefficients {R k : Type u} [CommRing R] [CommRing k] [Algebra R k]
{n d : β} {p : MvPolynomial (Fin n) R} {w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d}
(Ο : ParameterAlgebra p d w ββ[R] k) : Coefficients R n d ββ[R] k :=
Ο.comp (Ideal.Quotient.mkβ R (ideal p d w))
def evalFactor {R k : Type u} [CommRing R] [CommRing k] [Algebra R k]
{n d : β} {p : MvPolynomial (Fin n) R} {w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d}
(Ο : ParameterAlgebra p d w ββ[R] k) (i : Fin 2) : MvPolynomial (Fin n) k :=
MvPolynomial.map (evalCoefficients Ο).toRingHom (universalFactor R n d i)
theorem eval_relation_zero {R k : Type u} [CommRing R] [CommRing k] [Algebra R k]
{n d : β} {p : MvPolynomial (Fin n) R} {w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d}
(Ο : ParameterAlgebra p d w ββ[R] k) {r : Coefficients R n d} (hr : r β relations p d w) :
evalCoefficients Ο r = 0 := by
change Ο (Ideal.Quotient.mk (ideal p d w) r) = 0
have hz : Ideal.Quotient.mk (ideal p d w) r = 0 :=
Ideal.Quotient.eq_zero_iff_mem.mpr (Ideal.subset_span hr)
rw [hz, map_zero]
theorem evalFactor_product {R k : Type u} [CommRing R] [CommRing k] [Algebra R k]
{n d : β} {p : MvPolynomial (Fin n) R} {w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d}
(Ο : ParameterAlgebra p d w ββ[R] k) :
MvPolynomial.map (algebraMap R k) p = evalFactor Ο 0 * evalFactor Ο 1 := by
have h : MvPolynomial.map (evalCoefficients Ο).toRingHom (discrepancy p d) = 0 := by
ext m
rw [coeff_map, AddMonoidAlgebra.coeff_zero]
exact eval_relation_zero Ο (Or.inl β¨m, rflβ©)
have hp : MvPolynomial.map (evalCoefficients Ο).toRingHom
(MvPolynomial.map (algebraMap R (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) (evalCoefficients Ο).comp_algebraMap
apply sub_eq_zero.mp
simpa only [discrepancy, map_sub, map_mul, hp, evalFactor] using h
theorem evalFactor_nonconstant_coeff {R k : Type u} [CommRing R] [Field k] [Algebra R k]
{n d : β} {p : MvPolynomial (Fin n) R} {w : Fin 2 β BoundedPolynomial.Construction.PolynomialBox n d}
(Ο : ParameterAlgebra p d w ββ[R] k) (i : Fin 2) :
(evalFactor Ο i).coeff (BoundedPolynomial.Construction.polynomialBoxExponent (w i)) β 0 := by
have he := eval_relation_zero Ο (Or.inr β¨i, rflβ©)
have hm : evalCoefficients Ο (X (Sum.inr i)) * evalCoefficients Ο (X (Sum.inl (i, w i))) = 1 := by
apply sub_eq_zero.mp
simpa only [map_sub, map_mul, map_one] using he
rw [evalFactor, coeff_map, universalFactor, BoundedPolynomial.Construction.boundedPolynomial_coeff]
exact (mul_ne_zero_iff.mp (hm.trans_ne one_ne_zero)).2
theorem no_points_of_irreducible {R k : Type u} [CommRing R] [Field k] [Algebra 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 k) p)) :
IsEmpty (ParameterAlgebra p d w ββ[R] k) := by
refine β¨fun Ο β¦ ?_β©
have hu (i : Fin 2) : Β¬ IsUnit (evalFactor Ο i) :=
BoundedPolynomial.Construction.polynomial_not_isUnit_of_nonconstant_coefficient (hw i) (evalFactor_nonconstant_coeff Ο i)
exact (hp.isUnit_or_isUnit (evalFactor_product Ο)).elim (hu 0) (hu 1)
end
end OAI.ArithmeticGeometry.Models.SpreadingOut.FactorizationAlgebra.Construction.PolynomialFactorization
|