Stafford38/Characteristic/CanonicalAxisAvoidanceConsumer.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Stafford38.MathlibCompat.MvPolynomialCoeff
3 public import Stafford38.Characteristic.FilteredQuotientGraded
4 public import Stafford38.Characteristic.InitialIdealHomogeneous
5 public import Stafford38.Weyl.QuotientTransport
6 
7 @[expose] public section
8 
9 /-!
10 # Conditional consumer for canonical axis avoidance
11 
12 This file assumes, but does not prove, the missing degreewise cancellation
13 statement for the canonical filtered quotient.  It combines that hypothesis
14 with the proved surjectivity of right multiplication by the distinguished
15 coordinate and derives strict filtered surjectivity and its associated-graded
16 form.
17 -/
18 
19 namespace Stafford38.CanonicalAxisAvoidanceConsumer
20 
21 open Stafford38.Characteristic
22 open Stafford38.CharacteristicFilteredQuotient
23 open Stafford38.CharacteristicFilteredQuotientGraded
24 open Stafford38.CharacteristicInitialIdeal
25 open Stafford38.CharacteristicInitialIdealHomogeneous
26 open Stafford38.EulerSurjectivity
27 open Stafford38.WeylAssociatedGraded
28 open Stafford38.WeylFiltration
29 open Stafford38.WeylIteratedEquivalence
30 open Stafford38.WeylLeadingSymbol
31 open Stafford38.WeylEulerResidue
32 open Stafford38.WeylPBW
33 open Stafford38.WeylQuotientTransport
34 
35 noncomputable section
36 
37 universe u
38 
39 variable (k : Type u) [Field k] [Algebra ℚ k]
40 
41 /-- The distinguished coordinate belongs to differential order zero. -/
42 theorem presentedCoordinate_mem_orderPiece_zero (n : ℕ) :
43     presentedCoordinate k n ∈ orderPiece k (n + 1) 0 := by
44   rw [orderPiece, mem_presentedWeightPiece,
45     presentedCoordinate, presentedNormalFormLinearEquiv_generator]
46   intro m hm
47   change AddMonoidAlgebra.coeff
48     (MvPolynomial.X (.inl (0 : Fin (n + 1)))) m ≠ 0 at hm
49   rw [MvPolynomial.coeff_X'] at hm
50   split at hm
51   · next heq =>
52       subst m
53       simp [monomialWeight, orderWeight, fibreWeight]
54   · exact (hm rfl).elim
55 
56 /-- The exact missing input: multiplication by the coordinate can be
57 cancelled in every degree of the actual filtered quotient. -/
58 def CoordinateCancellation (n N : ℕ)
59     (d : PresentedWeyl k (n + 1)) : Prop :=
60   ∀ (m : ℕ) (z : PresentedWeyl k (n + 1)),
61     z ∈ orderPiece k (n + 1) m →
62     z * presentedCoordinate k n ∈
63         rightIdealKSubmodule k (canonicalRightIdeal (presentedCoordinate k n) d N) ⊔
64           presentedStrictLowerPiece k orderWeight m →
65     z ∈ rightIdealKSubmodule k (canonicalRightIdeal (presentedCoordinate k n) d N) ⊔
66       presentedStrictLowerPiece k orderWeight m
67 
68 /-- Cancellation plus unrestricted quotient surjectivity lowers an arbitrary
69 predecessor until it has no larger order than the target. -/
70 theorem exists_strict_coordinate_preimage
71     (n N m : ℕ) {d : PresentedWeyl k (n + 1)}
72     (hd : Stafford38.WeylPBWMonicBridge.IsPBWMonicAt k
73       (.inr (0 : Fin (n + 1))) N d)
74     (hcancel : CoordinateCancellation k n N d)
75     (z : PresentedWeyl k (n + 1))
76     (hz : z ∈ orderPiece k (n + 1) m) :
77     ∃ y : PresentedWeyl k (n + 1),
78       y ∈ orderPiece k (n + 1) m ∧
79       qmk (canonicalRightIdeal (presentedCoordinate k n) d N) (y * presentedCoordinate k n) =
80         qmk (canonicalRightIdeal (presentedCoordinate k n) d N) z := by
81   let I := canonicalRightIdeal (presentedCoordinate k n) d N
82   let x := presentedCoordinate k n
83   have hsurj : Function.Surjective (rightMul I x) := by
84     exact presentedCanonicalRightQuotient_rightMul_coordinate_surjective
85       (k := k) n N hd
86   obtain ⟨q, hq⟩ := hsurj (qmk I z)
87   obtain ⟨y, rfl⟩ := Submodule.Quotient.mk_surjective I q
88   change rightMul I x (qmk I y) = qmk I z at hq
89   rw [← qmk_right_mul] at hq
90   obtain ⟨L, hyL⟩ := exists_mem_orderPiece k y
91   have hdesc : ∀ L, ∀ y : PresentedWeyl k (n + 1),
92       y ∈ orderPiece k (n + 1) L → qmk I (y * x) = qmk I z →
93       ∃ y' : PresentedWeyl k (n + 1),
94         y' ∈ orderPiece k (n + 1) m ∧ qmk I (y' * x) = qmk I z := by
95     intro L
96     induction L using Nat.strong_induction_on with
97     | h L ih =>
98       intro y hyL hyx
99       by_cases hLm : L ≤ m
100       · exact ⟨y, presentedWeightPiece_mono k orderWeight hLm hyL, hyx⟩
101       · have hmL : m < L := Nat.lt_of_not_ge hLm
102         have hzLower : z ∈ presentedStrictLowerPiece k orderWeight L := by
103           cases L with
104           | zero => omega
105           | succ L =>
106               simp only [presentedStrictLowerPiece]
107               exact presentedWeightPiece_mono k orderWeight (Nat.le_of_lt_succ hmL) hz
108         have hyxSub : y * x - z ∈ I :=
109           (Submodule.Quotient.eq I).mp hyx
110         have hyxMem : y * x ∈
111             rightIdealKSubmodule k I ⊔
112               presentedStrictLowerPiece k orderWeight L := by
113           rw [show y * x = (y * x - z) + z by abel]
114           exact Submodule.add_mem _
115             (Submodule.mem_sup_left hyxSub)
116             (Submodule.mem_sup_right hzLower)
117         have hyMem := hcancel L y hyL hyxMem
118         obtain ⟨i, hi, l, hl, hil⟩ := Submodule.mem_sup.mp hyMem
119         cases L with
120         | zero => omega
121         | succ L =>
122             simp only [presentedStrictLowerPiece] at hl
123             have hyl : qmk I y = qmk I l := by
124               apply (Submodule.Quotient.eq I).2
125               rw [← hil]
126               simpa using hi
127             have hlx : qmk I (l * x) = qmk I z := by
128               rw [qmk_right_mul, ← hyl, ← qmk_right_mul]
129               exact hyx
130             exact ih L (Nat.lt_succ_self L) l hl hlx
131   exact hdesc L y hyL hq
132 
133 /-- Every actual associated-graded piece has surjective multiplication by
134 the order-zero coordinate symbol. -/
135 theorem canonical_graded_coordinate_surjective
136     (n N m : ℕ) {d : PresentedWeyl k (n + 1)}
137     (hd : Stafford38.WeylPBWMonicBridge.IsPBWMonicAt k
138       (.inr (0 : Fin (n + 1))) N d)
139     (hcancel : CoordinateCancellation k n N d) :
140     Function.Surjective
141       (quotientOrderHomogeneousAction (N := m) (M := 0)
142         k (canonicalRightIdeal (presentedCoordinate k n) d N)
143         (principalComponentOnPiece k (@orderWeight (n + 1)) 0
144           ⟨presentedCoordinate k n,
145             presentedCoordinate_mem_orderPiece_zero k n⟩)) := by
146   intro q
147   obtain ⟨z, rfl⟩ := orderPieceToQuotientGraded_surjective
148     k (canonicalRightIdeal (presentedCoordinate k n) d N) m q
149   obtain ⟨y, hy, hyx⟩ :=
150     exists_strict_coordinate_preimage k n N m hd hcancel z z.property
151   refine ⟨orderPieceToQuotientGraded k (canonicalRightIdeal (presentedCoordinate k n) d N) m ⟨y, hy⟩, ?_⟩
152   rw [quotientOrderHomogeneousAction_mk_mul]
153   have hyx' : (rightIdealKSubmodule k (canonicalRightIdeal (presentedCoordinate k n) d N)).mkQ
154         (y * presentedCoordinate k n) =
155       (rightIdealKSubmodule k (canonicalRightIdeal (presentedCoordinate k n) d N)).mkQ z :=
156     congrArg
157       (filteredRightQuotientEquivRightQuotient k
158         (canonicalRightIdeal (presentedCoordinate k n) d N)).symm hyx
159   apply (Submodule.Quotient.eq _).2
160   change (orderPieceToQuotientPiece k (canonicalRightIdeal (presentedCoordinate k n) d N) m
161       ⟨y * presentedCoordinate k n, _⟩ :
162         FilteredRightQuotient k (canonicalRightIdeal (presentedCoordinate k n) d N)) -
163       orderPieceToQuotientPiece k (canonicalRightIdeal (presentedCoordinate k n) d N) m z ∈
164         quotientOrderStrictLowerPiece k (canonicalRightIdeal (presentedCoordinate k n) d N) m
165   rw [show (orderPieceToQuotientPiece k (canonicalRightIdeal (presentedCoordinate k n) d N) m
166       ⟨y * presentedCoordinate k n, _⟩ :
167         FilteredRightQuotient k (canonicalRightIdeal (presentedCoordinate k n) d N)) =
168       (rightIdealKSubmodule k (canonicalRightIdeal (presentedCoordinate k n) d N)).mkQ
169         (y * presentedCoordinate k n) from rfl]
170   rw [show (orderPieceToQuotientPiece k (canonicalRightIdeal (presentedCoordinate k n) d N) m z :
171       FilteredRightQuotient k (canonicalRightIdeal (presentedCoordinate k n) d N)) =
172       (rightIdealKSubmodule k (canonicalRightIdeal (presentedCoordinate k n) d N)).mkQ z from rfl]
173   rw [hyx', sub_self]
174   exact Submodule.zero_mem _
175 
176 /-- The order-zero principal symbol of the distinguished coordinate is the
177 corresponding base variable. -/
178 theorem coe_coordinate_order_symbol (n : ℕ) :
179     ((principalComponentOnPiece k (@orderWeight (n + 1)) 0
180         ⟨presentedCoordinate k n,
181           presentedCoordinate_mem_orderPiece_zero k n⟩) :
182       SymbolRing k (n + 1)) =
183       MvPolynomial.X (.inl (0 : Fin (n + 1))) := by
184   ext m
185   change AddMonoidAlgebra.coeff
186       (presentedPrincipalComponent k orderWeight 0
187         (presentedCoordinate k n)) m =
188     AddMonoidAlgebra.coeff (MvPolynomial.X (.inl (0 : Fin (n + 1)))) m
189   rw [coeff_presentedPrincipalComponent, presentedCoordinate,
190     presentedNormalFormLinearEquiv_generator, MvPolynomial.coeff_X']
191   by_cases hm : Finsupp.single (.inl (0 : Fin (n + 1))) 1 = m
192   · subst m
193     simp [monomialWeight, orderWeight, fibreWeight]
194   · simp [hm]
195 
196 /-- Conditional scheme-level axis avoidance: the order initial ideal together
197 with the distinguished coordinate generates the unit ideal. -/
198 theorem canonical_orderInitialIdeal_sup_coordinate_eq_top
199     (n N : ℕ) {d : PresentedWeyl k (n + 1)}
200     (hd : Stafford38.WeylPBWMonicBridge.IsPBWMonicAt k
201       (.inr (0 : Fin (n + 1))) N d)
202     (hcancel : CoordinateCancellation k n N d) :
203     orderInitialIdeal k (canonicalRightIdeal (presentedCoordinate k n) d N) ⊔
204         Ideal.span {MvPolynomial.X (.inl (0 : Fin (n + 1)))} = ⊤ := by
205   let I := canonicalRightIdeal (presentedCoordinate k n) d N
206   let X : MvPolynomial.weightedHomogeneousSubmodule k
207       (@orderWeight (n + 1)) 0 :=
208     principalComponentOnPiece k (@orderWeight (n + 1)) 0
209       ⟨presentedCoordinate k n, presentedCoordinate_mem_orderPiece_zero k n⟩
210   let oneH : MvPolynomial.weightedHomogeneousSubmodule k
211       (@orderWeight (n + 1)) 0 :=
212     ⟨1, MvPolynomial.isWeightedHomogeneous_one k orderWeight⟩
213   have hsurjActual := canonical_graded_coordinate_surjective
214     k n N 0 hd hcancel
215   have hsurjSymbol : Function.Surjective
216       (homogeneousSymbolAction (N := 0) (M := 0) k I X) := by
217     intro q
218     obtain ⟨r, hr⟩ := hsurjActual
219       ((quotientOrderGradedPieceEquivSymbols k I 0).symm q)
220     refine ⟨quotientOrderGradedPieceEquivSymbols k I 0 r, ?_⟩
221     rw [← quotientOrderHomogeneousAction_compatibility]
222     simpa [I, X] using congrArg
223       (quotientOrderGradedPieceEquivSymbols k I 0) hr
224   obtain ⟨q, hq⟩ := hsurjSymbol (Submodule.Quotient.mk oneH)
225   obtain ⟨P, rfl⟩ := Submodule.Quotient.mk_surjective
226     (orderSymbolRelation k I 0) q
227   rw [homogeneousSymbolAction_mk] at hq
228   have hrel : homogeneousRightMul k X P - oneH ∈
229       orderSymbolRelation k I 0 :=
230     (Submodule.Quotient.eq _).mp hq
231   have hJ : ((homogeneousRightMul k X P - oneH :
232       MvPolynomial.weightedHomogeneousSubmodule k
233         (@orderWeight (n + 1)) 0) : SymbolRing k (n + 1)) ∈
234       orderInitialIdeal k I :=
235     (mem_orderSymbolRelation_iff_coe_mem_orderInitialIdeal k I 0 _).mp hrel
236   have hJ' : (P : SymbolRing k (n + 1)) *
237         MvPolynomial.X (.inl (0 : Fin (n + 1))) - 1 ∈
238       orderInitialIdeal k I := by
239     convert hJ using 1
240     simp only [Submodule.coe_sub, coe_homogeneousRightMul,
241       Submodule.coe_mk]
242     rw [show (X : SymbolRing k (n + 1)) =
243       MvPolynomial.X (.inl (0 : Fin (n + 1))) by
244         exact coe_coordinate_order_symbol k n]
245   apply (Ideal.eq_top_iff_one _).2
246   rw [show (1 : SymbolRing k (n + 1)) =
247       -((P : SymbolRing k (n + 1)) * MvPolynomial.X (.inl 0) - 1) +
248         (P : SymbolRing k (n + 1)) * MvPolynomial.X (.inl 0) by ring]
249   apply Submodule.add_mem
250   · apply Submodule.mem_sup_left
251     apply (orderInitialIdeal k I).neg_mem
252     exact hJ'
253   · apply Submodule.mem_sup_right
254     rw [Ideal.mem_span_singleton]
255     exact ⟨(P : SymbolRing k (n + 1)), by rw [mul_comm]⟩
256 
257 /-- Set-theoretic consequence: the canonical order-characteristic support is
258 disjoint from the distinguished coordinate hyperplane. -/
259 theorem canonical_orderCharacteristicSupport_disjoint_coordinate_zeroLocus
260     (n N : ℕ) {d : PresentedWeyl k (n + 1)}
261     (hd : Stafford38.WeylPBWMonicBridge.IsPBWMonicAt k
262       (.inr (0 : Fin (n + 1))) N d)
263     (hcancel : CoordinateCancellation k n N d) :
264     Disjoint
265       (orderCharacteristicSupport k (canonicalRightIdeal (presentedCoordinate k n) d N))
266       (PrimeSpectrum.zeroLocus
267         ({MvPolynomial.X (.inl (0 : Fin (n + 1)))} :
268           Set (SymbolRing k (n + 1)))) := by
269   rw [Set.disjoint_left]
270   intro p hp hpx
271   rw [orderCharacteristicSupport_eq_zeroLocus,
272     PrimeSpectrum.mem_zeroLocus] at hp
273   rw [PrimeSpectrum.mem_zeroLocus] at hpx
274   have htop := canonical_orderInitialIdeal_sup_coordinate_eq_top
275     k n N hd hcancel
276   have hle : orderInitialIdeal k (canonicalRightIdeal (presentedCoordinate k n) d N) ⊔
277       Ideal.span {MvPolynomial.X (.inl (0 : Fin (n + 1)))} ≤ p.asIdeal :=
278     sup_le hp (Ideal.span_le.mpr hpx)
279   rw [htop] at hle
280   exact p.2.ne_top (top_unique hle)
281 
282 #print axioms presentedCoordinate_mem_orderPiece_zero
283 #print axioms exists_strict_coordinate_preimage
284 #print axioms canonical_graded_coordinate_surjective
285 #print axioms coe_coordinate_order_symbol
286 #print axioms canonical_orderInitialIdeal_sup_coordinate_eq_top
287 #print axioms canonical_orderCharacteristicSupport_disjoint_coordinate_zeroLocus
288 
289 end
290 
291 end Stafford38.CanonicalAxisAvoidanceConsumer
292