This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Stafford38.Characteristic.InitialIdealHomogeneous 3 public import Stafford38.Characteristic.ReducedSupportIdeal 4 5 @[expose] public section 6 7 /-! 8 # Zero-section containment of the reduced order support 9 10 The differential-order initial ideal is homogeneous for fibre degree. At the 11 level of field-valued points this forces every fibre-conical support fibre to 12 contain its zero: if `(y, ξ)` is a common zero of the reduced order support 13 ideal, then `(y, 0)` is a common zero as well. 14 15 The proof does not assume conicality of the radical. For an element of the 16 radical, it takes a power in the order initial ideal, extracts its fibre-degree 17 zero component there, and then uses reducedness of the ground field. 18 -/ 19 20 namespace Stafford38.Characteristic.ZeroSectionContainment 21 22 open Stafford38.Characteristic 23 open Stafford38.CharacteristicFilteredQuotient 24 open Stafford38.CharacteristicInitialIdeal 25 open Stafford38.CharacteristicInitialIdealHomogeneous 26 open Stafford38.Characteristic.ReducedSupportIdeal 27 open Stafford38.Geometry.CoisotropicTranslation 28 open Stafford38.EulerSurjectivity 29 open Stafford38.WeylIteratedEquivalence 30 open Stafford38.WeylFiltration 31 32 noncomputable section 33 34 universe u 35 36 variable (k : Type u) [Field k] 37 variable {n : ℕ} 38 39 private abbrev orderDecomposition := 40 MvPolynomial.weightedHomogeneousSubmodule k (@orderWeight n) 41 42 local instance orderGradedAlgebraInstance : 43 GradedAlgebra (orderDecomposition (n := n) k) := 44 MvPolynomial.weightedGradedAlgebra k (@orderWeight n) 45 46 /-- Evaluation of the fibre-degree-zero component at `(y, ξ)` is evaluation 47 of the original polynomial at `(y, 0)`. -/ 48 private theorem eval_zeroComponent 49 (y ξ : Fin n → k) (P : SymbolRing k n) : 50 MvPolynomial.eval (Sum.elim y ξ) 51 (DirectSum.decompose (orderDecomposition (n := n) k) P 0 : 52 SymbolRing k n) = 53 MvPolynomial.eval (zeroSectionPoint y) P := by 54 induction P using MvPolynomial.induction_on with 55 | C a => 56 have hC : MvPolynomial.C a ∈ orderDecomposition (n := n) k 0 := 57 MvPolynomial.isWeightedHomogeneous_C (@orderWeight n) a 58 let C0 : orderDecomposition (n := n) k 0 := ⟨MvPolynomial.C a, hC⟩ 59 have hd := congrArg (fun z => z 0) 60 (DirectSum.decompose_coe (orderDecomposition (n := n) k) C0) 61 have hd' : (DirectSum.decompose (orderDecomposition (n := n) k) 62 (MvPolynomial.C a) 0 : SymbolRing k n) = MvPolynomial.C a := by 63 simpa [C0] using congrArg Subtype.val hd 64 rw [hd'] 65 simp 66 | add P Q hP hQ => 67 rw [DirectSum.decompose_add] 68 change MvPolynomial.eval (Sum.elim y ξ) 69 ((DirectSum.decompose (orderDecomposition (n := n) k) P 0 : 70 SymbolRing k n) + 71 (DirectSum.decompose (orderDecomposition (n := n) k) Q 0 : 72 SymbolRing k n)) = _ 73 simp only [MvPolynomial.eval_add, hP, hQ] 74 | mul_X P i hP => 75 rcases i with i | i 76 · have hX : MvPolynomial.X (Sum.inl i : PhaseVar n) ∈ 77 orderDecomposition (n := n) k 0 := by 78 exact MvPolynomial.isWeightedHomogeneous_X k (@orderWeight n) 79 (Sum.inl i) 80 rw [DirectSum.coe_decompose_mul_of_right_mem_of_le 81 (orderDecomposition (n := n) k) hX (Nat.zero_le 0)] 82 simp only [Nat.zero_sub, MvPolynomial.eval_mul, hP, 83 MvPolynomial.eval_X] 84 rfl 85 · have hX : MvPolynomial.X (Sum.inr i : PhaseVar n) ∈ 86 orderDecomposition (n := n) k 1 := by 87 exact MvPolynomial.isWeightedHomogeneous_X k (@orderWeight n) 88 (Sum.inr i) 89 rw [DirectSum.coe_decompose_mul_of_right_mem_of_not_le 90 (orderDecomposition (n := n) k) hX (by omega)] 91 simp [zeroSectionPoint] 92 93 /-- A field-valued common zero of the reduced order support ideal remains a 94 common zero after its fibre coordinate is set to zero. -/ 95 theorem zeroSection_mem_of_mem_reducedOrderSupport_zeroSet 96 (I : RightIdeal (PresentedWeyl k n)) (y ξ : Fin n → k) 97 (hpoint : ∀ P ∈ reducedOrderSupportIdeal k I, 98 MvPolynomial.eval (Sum.elim y ξ) P = 0) : 99 ∀ P ∈ reducedOrderSupportIdeal k I, 100 MvPolynomial.eval (zeroSectionPoint y) P = 0 := by 101 intro P hP 102 obtain ⟨m, hm⟩ := (mem_reducedOrderSupportIdeal_iff k I P).mp hP 103 have hcomponent : 104 (DirectSum.decompose (orderDecomposition (n := n) k) (P ^ m) 0 : 105 SymbolRing k n) ∈ orderInitialIdeal k I := 106 coe_mem_orderInitialIdeal_of_mem_orderSymbolRelation k I 0 107 (DirectSum.decompose (orderDecomposition (n := n) k) (P ^ m) 0) 108 (decompose_mem_orderSymbolRelation_of_mem_orderInitialIdeal 109 k I (P ^ m) hm 0) 110 have hevalComponent := hpoint _ 111 (orderInitialIdeal_le_reducedOrderSupportIdeal k I hcomponent) 112 rw [eval_zeroComponent k y ξ (P ^ m)] at hevalComponent 113 rw [map_pow] at hevalComponent 114 exact (pow_eq_zero_iff'.mp hevalComponent).1 115 116 #print axioms zeroSection_mem_of_mem_reducedOrderSupport_zeroSet 117 118 end 119 120 end Stafford38.Characteristic.ZeroSectionContainment 121