This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Stafford38.MathlibCompat.MvPolynomialCoeff 3 public import Stafford38.Characteristic.CanonicalNoncharacteristicCancellation 4 public import Stafford38.Weyl.CoordinateCommutatorSymbol 5 public import Stafford38.Weyl.FilteredCommutator 6 public import Stafford38.Weyl.QuotientTransport 7 8 @[expose] public section 9 10 /-! 11 # A concrete filtered criterion for canonical monic saturation 12 13 For every degree, ordinary injectivity of coordinate multiplication on the 14 canonical right quotient, together with coordinate preimages that preserve 15 strict lower-order pieces, implies the exact cancellation statement on every 16 actual associated-graded piece. This is an ambient filtered/Ore criterion: 17 it does not mention the initial ideal or assume its saturation. 18 19 For a Bernstein-monic operator of degree one, commutation with the selected 20 coordinate is exactly `-1`. Hence the two literal canonical generators 21 `d` and `x * d` already generate the unit right ideal. This proves coordinate 22 saturation (and therefore strict noncharacteristic cancellation) without 23 assuming a generic D-module inverse-image theorem. 24 25 The argument deliberately stops at degree one. For degree at least two, the 26 same commutator has positive differential order; proving saturation then needs 27 an order-preserving reduction of those higher commutators. Existing monic Ore 28 division and the positive Euler residue provide unrestricted coordinate 29 preimages, but do not provide the strict differential-order estimate isolated 30 below. 31 -/ 32 33 namespace Stafford38.CanonicalMonicSaturation 34 35 open Stafford38.CanonicalAxisAvoidanceConsumer 36 open Stafford38.CanonicalNoncharacteristicCancellation 37 open Stafford38.Characteristic 38 open Stafford38.CharacteristicInitialIdeal 39 open Stafford38.EulerSurjectivity 40 open Stafford38.WeylAssociatedGraded 41 open Stafford38.WeylCoordinateCommutatorSymbol 42 open Stafford38.WeylEulerResidue 43 open Stafford38.WeylFilteredCommutator 44 open Stafford38.WeylFiltration 45 open Stafford38.WeylIteratedEquivalence 46 open Stafford38.WeylLeadingSymbol 47 open Stafford38.WeylPBWMonicBridge 48 open Stafford38.WeylQuotientTransport 49 50 noncomputable section 51 52 universe u 53 54 variable (k : Type u) [Field k] [Algebra ℚ k] 55 56 /-- The concrete filtered estimate missing from unrestricted Euler 57 surjectivity: every class represented below order `m` has a coordinate 58 predecessor represented below the same order. This is stated in the ambient 59 Weyl algebra, not in the associated graded or the initial ideal. -/ 60 def StrictLowerCoordinatePreimages (n N : ℕ) 61 (d : PresentedWeyl k (n + 1)) : Prop := 62 ∀ (m : ℕ) (l : PresentedWeyl k (n + 1)), 63 l ∈ presentedStrictLowerPiece k orderWeight m → 64 ∃ y : PresentedWeyl k (n + 1), 65 y ∈ presentedStrictLowerPiece k orderWeight m ∧ 66 qmk (presentedCanonicalRightIdeal (k := k) n N d) 67 (y * presentedCoordinate k n) = 68 qmk (presentedCanonicalRightIdeal (k := k) n N d) l 69 70 /-- A genuinely general filtered reduction. Ordinary cancellation on the 71 canonical quotient and strict-order coordinate division together imply the 72 load-bearing cancellation theorem on every filtration degree. -/ 73 theorem coordinateCancellation_of_quotient_injective_of_strict_preimages 74 (n N : ℕ) (d : PresentedWeyl k (n + 1)) 75 (hinjective : Function.Injective 76 (rightMul (presentedCanonicalRightIdeal (k := k) n N d) (presentedCoordinate k n))) 77 (hstrict : StrictLowerCoordinatePreimages k n N d) : 78 CoordinateCancellation k n N d := by 79 intro m z hz hzx 80 obtain ⟨i, hi, l, hl, hil⟩ := Submodule.mem_sup.mp hzx 81 obtain ⟨y, hy, hyx⟩ := hstrict m l hl 82 have hzxl : qmk (presentedCanonicalRightIdeal (k := k) n N d) 83 (z * presentedCoordinate k n) = 84 qmk (presentedCanonicalRightIdeal (k := k) n N d) l := by 85 apply (Submodule.Quotient.eq (presentedCanonicalRightIdeal (k := k) n N d)).2 86 rw [← hil] 87 simpa using hi 88 have hxy : rightMul (presentedCanonicalRightIdeal (k := k) n N d) 89 (presentedCoordinate k n) (qmk (presentedCanonicalRightIdeal (k := k) n N d) z) = 90 rightMul (presentedCanonicalRightIdeal (k := k) n N d) 91 (presentedCoordinate k n) (qmk (presentedCanonicalRightIdeal (k := k) n N d) y) := by 92 rw [← qmk_right_mul, ← qmk_right_mul, hzxl, hyx] 93 have hzy : qmk (presentedCanonicalRightIdeal (k := k) n N d) z = 94 qmk (presentedCanonicalRightIdeal (k := k) n N d) y := hinjective hxy 95 have hdiff : z - y ∈ presentedCanonicalRightIdeal (k := k) n N d := 96 (Submodule.Quotient.eq (presentedCanonicalRightIdeal (k := k) n N d)).mp hzy 97 rw [show z = (z - y) + y by abel] 98 exact Submodule.add_mem _ 99 (Submodule.mem_sup_left hdiff) 100 (Submodule.mem_sup_right hy) 101 102 /-- Actual-graded form of the general filtered reduction. -/ 103 theorem canonical_graded_coordinateAction_injective_of_quotient_injective_of_strict_preimages 104 (n N m : ℕ) (d : PresentedWeyl k (n + 1)) 105 (hinjective : Function.Injective 106 (rightMul (presentedCanonicalRightIdeal (k := k) n N d) (presentedCoordinate k n))) 107 (hstrict : StrictLowerCoordinatePreimages k n N d) : 108 Function.Injective (canonicalGradedCoordinateAction k n N m d) := by 109 exact (coordinateCancellation_iff_forall_graded_injective k n N d).mp 110 (coordinateCancellation_of_quotient_injective_of_strict_preimages 111 k n N d hinjective hstrict) m 112 113 /-- Monicity supplies the unfiltered version of 114 `StrictLowerCoordinatePreimages`: every quotient class has some coordinate 115 predecessor. The absent conclusion is precisely that a lower-order class can 116 be assigned a lower-order predecessor. -/ 117 theorem canonical_unrestricted_coordinate_preimages_of_monic 118 (n N : ℕ) {d : PresentedWeyl k (n + 1)} 119 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 120 (z : PresentedWeyl k (n + 1)) : 121 ∃ y : PresentedWeyl k (n + 1), 122 qmk (presentedCanonicalRightIdeal (k := k) n N d) 123 (y * presentedCoordinate k n) = 124 qmk (presentedCanonicalRightIdeal (k := k) n N d) z := by 125 have hsurjective := 126 presentedCanonicalRightQuotient_rightMul_coordinate_surjective 127 (k := k) n N hd 128 obtain ⟨q, hq⟩ := hsurjective (qmk (presentedCanonicalRightIdeal (k := k) n N d) z) 129 obtain ⟨y, rfl⟩ := Submodule.Quotient.mk_surjective 130 (presentedCanonicalRightIdeal (k := k) n N d) q 131 refine ⟨y, ?_⟩ 132 rw [qmk_right_mul] 133 exact hq 134 135 private theorem degree_eq_one_of_order_one_of_fibreOnly 136 {n : ℕ} {P : SymbolRing k n} {m : PhaseVar n →₀ ℕ} 137 (hm : MvPolynomial.coeff m P ≠ 0) 138 (hhom : MvPolynomial.IsWeightedHomogeneous (@orderWeight n) P 1) 139 (hfibre : IsFibreOnly k P) : 140 m.degree = 1 := by 141 have horder : monomialWeight (@orderWeight n) m = 1 := by 142 exact hhom hm 143 rw [Finsupp.degree_eq_weight_one, Finsupp.weight_apply] 144 simp only [smul_eq_mul, mul_one] 145 rw [monomialWeight] at horder 146 calc 147 m.sum (fun _ e ↦ e) = 148 m.sum (fun i e ↦ e * orderWeight i) := by 149 apply Finsupp.sum_congr 150 intro i hi 151 rcases i with i | i 152 · have hz := hfibre m hm i 153 simp [hz, orderWeight, fibreWeight] 154 · simp [orderWeight, fibreWeight] 155 _ = 1 := horder 156 157 private theorem exponent_eq_selected_of_order_one_of_selected_ne_zero 158 {n : ℕ} {P : SymbolRing k n} {m : PhaseVar n →₀ ℕ} 159 (t : Fin n) 160 (hm : MvPolynomial.coeff m P ≠ 0) 161 (hhom : MvPolynomial.IsWeightedHomogeneous (@orderWeight n) P 1) 162 (hfibre : IsFibreOnly k P) 163 (hmt : m (.inr t) ≠ 0) : 164 m = Finsupp.single (.inr t) 1 := by 165 have hdegree := degree_eq_one_of_order_one_of_fibreOnly k hm hhom hfibre 166 have hdecomp := Finsupp.single_add_erase (.inr t) m 167 have hdegdecomp := congrArg Finsupp.degree hdecomp 168 rw [map_add Finsupp.degree] at hdegdecomp 169 have hmtle := Finsupp.le_degree (.inr t) m 170 rw [hdegree] at hmtle 171 have hmt1 : m (.inr t) = 1 := 172 Nat.le_antisymm hmtle (Nat.one_le_iff_ne_zero.mpr hmt) 173 have heraseDegree : (m.erase (.inr t)).degree = 0 := by 174 simpa [hdegree, hmt1] using hdegdecomp 175 have herase : m.erase (.inr t) = 0 := 176 (Finsupp.degree_eq_zero_iff _).mp heraseDegree 177 rw [← hdecomp, hmt1, herase, add_zero] 178 179 /-- The coefficient of every monomial involving the selected momentum variable 180 vanishes after removing its linear coefficient from a fibre-only order-one 181 symbol. Isolating this coefficient calculation keeps the support argument 182 below independent of polynomial representation reductions. -/ 183 private theorem coeff_sub_X_eq_zero_of_order_one_fibreOnly 184 {n : ℕ} (t : Fin n) (P : SymbolRing k n) 185 (hhom : MvPolynomial.IsWeightedHomogeneous (@orderWeight n) P 1) 186 (hfibre : IsFibreOnly k P) 187 (hcoeff : P.coeff (Finsupp.single (.inr t) 1) = 1) 188 (m : PhaseVar n →₀ ℕ) (hmt : m (.inr t) ≠ 0) : 189 MvPolynomial.coeff m (P - MvPolynomial.X (.inr t)) = 0 := by 190 classical 191 by_cases hm : m = Finsupp.single (.inr t) 1 192 · subst m 193 have hcoeff' : AddMonoidAlgebra.coeff P 194 (Finsupp.single (.inr t) 1) = 1 := by 195 change MvPolynomial.coeff (Finsupp.single (.inr t) 1) P = 1 196 exact hcoeff 197 have hX' : AddMonoidAlgebra.coeff 198 (MvPolynomial.X (.inr t : PhaseVar n) : SymbolRing k n) 199 (Finsupp.single (.inr t) 1) = 1 := by 200 simp [MvPolynomial.X] 201 change AddMonoidAlgebra.coeff 202 (P - MvPolynomial.X (.inr t : PhaseVar n)) 203 (Finsupp.single (.inr t) 1) = 0 204 rw [AddMonoidAlgebra.coeff_sub] 205 change AddMonoidAlgebra.coeff P (Finsupp.single (.inr t) 1) - 206 AddMonoidAlgebra.coeff (MvPolynomial.X (.inr t) : SymbolRing k n) 207 (Finsupp.single (.inr t) 1) = 0 208 rw [hcoeff', hX', sub_self] 209 · have hPzero : MvPolynomial.coeff m P = 0 := by 210 by_contra hP 211 exact hm (exponent_eq_selected_of_order_one_of_selected_ne_zero 212 k t hP hhom hfibre hmt) 213 have hXzero : AddMonoidAlgebra.coeff 214 (MvPolynomial.X (.inr t : PhaseVar n) : SymbolRing k n) m = 0 := by 215 simp [MvPolynomial.X, Ne.symm hm] 216 have hPzero' : AddMonoidAlgebra.coeff P m = 0 := by 217 change MvPolynomial.coeff m P = 0 218 exact hPzero 219 have hXzero' : AddMonoidAlgebra.coeff 220 (MvPolynomial.X (.inr t : PhaseVar n) : SymbolRing k n) m = 0 := by 221 change MvPolynomial.coeff m (MvPolynomial.X (.inr t)) = 0 222 exact hXzero 223 change AddMonoidAlgebra.coeff 224 (P - MvPolynomial.X (.inr t : PhaseVar n)) m = 0 225 rw [AddMonoidAlgebra.coeff_sub] 226 change AddMonoidAlgebra.coeff P m - 227 AddMonoidAlgebra.coeff (MvPolynomial.X (.inr t) : SymbolRing k n) m = 0 228 rw [hPzero', hXzero', sub_self] 229 230 /-- A fibre-only order-homogeneous linear symbol whose selected momentum 231 coefficient is one has selected partial derivative one. -/ 232 theorem pderiv_eq_one_of_order_one_fibreOnly 233 {n : ℕ} (t : Fin n) (P : SymbolRing k n) 234 (hhom : MvPolynomial.IsWeightedHomogeneous (@orderWeight n) P 1) 235 (hfibre : IsFibreOnly k P) 236 (hcoeff : P.coeff (Finsupp.single (.inr t) 1) = 1) : 237 MvPolynomial.pderiv (.inr t) P = 1 := by 238 classical 239 have hQt : (.inr t : PhaseVar n) ∉ 240 (P - MvPolynomial.X (.inr t : PhaseVar n)).vars := by 241 intro ht 242 rw [MvPolynomial.mem_vars_iff_mem_support] at ht 243 obtain ⟨m, hmQ, htm⟩ := ht 244 have hmQne : (P - MvPolynomial.X (.inr t : PhaseVar n)).coeff m ≠ 0 := 245 MvPolynomial.mem_support_iff.mp hmQ 246 have hmt : m (.inr t) ≠ 0 := Finsupp.mem_support_iff.mp htm 247 have hQcoeff : MvPolynomial.coeff m 248 (P - MvPolynomial.X (.inr t : PhaseVar n)) = 0 := 249 coeff_sub_X_eq_zero_of_order_one_fibreOnly k t P hhom hfibre hcoeff m hmt 250 exact hmQne hQcoeff 251 have hQderiv : MvPolynomial.pderiv (.inr t : PhaseVar n) 252 (P - MvPolynomial.X (.inr t : PhaseVar n)) = 0 := 253 MvPolynomial.pderiv_eq_zero_of_notMem_vars hQt 254 have hdecomp : P = (P - MvPolynomial.X (.inr t : PhaseVar n)) + 255 MvPolynomial.X (.inr t : PhaseVar n) := by abel 256 rw [hdecomp, map_add, hQderiv, MvPolynomial.pderiv_X_self, zero_add] 257 set_option maxHeartbeats 200000 258 259 /-- In canonical Bernstein degree one, the selected coordinate commutator is 260 the scalar `-1`. This is the strict low-order replacement for the missing 261 higher-order division estimate. -/ 262 theorem coordinate_commutator_eq_neg_one_degree_one 263 (n : ℕ) {d : PresentedWeyl k (n + 1)} 264 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) 1 d) : 265 Stafford.commutator (presentedCoordinate k n) d = -1 := by 266 let P := presentedPrincipalComponent k (@orderWeight (n + 1)) 1 d 267 have hdOrder : d ∈ orderPiece k (n + 1) 1 := 268 bernsteinPiece_le_orderPiece k (n + 1) 1 hd.1 269 have hxOrder : presentedCoordinate k n ∈ orderPiece k (n + 1) 0 := 270 presentedCoordinate_mem_orderPiece_zero k n 271 have hcommOrder : 272 Stafford.commutator (presentedCoordinate k n) d ∈ 273 orderPiece k (n + 1) 0 := by 274 simpa using commutator_mem_orderPiece_pred k hxOrder hdOrder 275 have hhom : MvPolynomial.IsWeightedHomogeneous (@orderWeight (n + 1)) P 1 := by 276 exact MvPolynomial.weightedHomogeneousComponent_mem _ _ _ 277 have hfibre : IsFibreOnly k P := 278 canonical_orderPrincipalComponent_isFibreOnly k n 1 hd 279 have hcoeff : 280 MvPolynomial.coeff 281 (Finsupp.single (.inr (0 : Fin (n + 1))) 1) P = 1 := 282 canonical_orderPrincipalComponent_pureMomentumCoefficient k n 1 hd 283 have hpderiv : 284 MvPolynomial.pderiv (.inr (0 : Fin (n + 1))) P = 1 := 285 pderiv_eq_one_of_order_one_fibreOnly k 0 P hhom hfibre hcoeff 286 have hprincipal : 287 presentedPrincipalComponent k (@orderWeight (n + 1)) 0 288 (Stafford.commutator (presentedCoordinate k n) d) = -1 := by 289 rw [principalComponent_coordinate_commutator_arbitrary] 290 rw [Stafford38.WeylCommutatorSymbol.poissonBracket_newestCoordinate, 291 hpderiv] 292 have hnegOneOrder : (-1 : PresentedWeyl k (n + 1)) ∈ 293 orderPiece k (n + 1) 0 := by 294 exact (orderPiece k (n + 1) 0).neg_mem 295 (Stafford38.CharacteristicAssociatedGradedModule.orderPieceOne 296 (n := n + 1) k).property 297 have hdiffOrder : 298 Stafford.commutator (presentedCoordinate k n) d - (-1) ∈ 299 orderPiece k (n + 1) 0 := 300 (orderPiece k (n + 1) 0).sub_mem hcommOrder hnegOneOrder 301 have hdiffPrincipal : 302 presentedPrincipalComponent k (@orderWeight (n + 1)) 0 303 (Stafford.commutator (presentedCoordinate k n) d - (-1)) = 0 := by 304 rw [map_sub, hprincipal] 305 change -1 - presentedPrincipalComponent k orderWeight 0 306 (-1 : PresentedWeyl k (n + 1)) = 0 307 rw [map_neg] 308 have honepc : presentedPrincipalComponent k orderWeight 0 309 (1 : PresentedWeyl k (n + 1)) = 1 := by 310 exact Stafford38.CharacteristicAssociatedGradedModule.presentedPrincipalComponent_orderPieceOne 311 (n := n + 1) k 312 rw [honepc] 313 simp 314 have hlower := 315 (presentedPrincipalComponent_eq_zero_iff_mem_strictLower 316 k (@orderWeight (n + 1)) _ hdiffOrder).mp hdiffPrincipal 317 have hdiff : Stafford.commutator (presentedCoordinate k n) d - (-1) = 0 := by 318 simpa [presentedStrictLowerPiece] using hlower 319 exact sub_eq_zero.mp hdiff 320 321 /-- Every canonical degree-one monic presentation is already the unit right 322 ideal. Both terms in the commutator are literal right-ideal elements. -/ 323 theorem canonicalRightIdeal_eq_top_degree_one 324 (n : ℕ) {d : PresentedWeyl k (n + 1)} 325 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) 1 d) : 326 presentedCanonicalRightIdeal (k := k) n 1 d = ⊤ := by 327 apply top_unique 328 intro z hz 329 have hxd : presentedCoordinate k n * d ∈ presentedCanonicalRightIdeal (k := k) n 1 d := by 330 simpa using secondGenerator_mem (presentedCoordinate k n) d 1 331 have hdx : d * presentedCoordinate k n ∈ presentedCanonicalRightIdeal (k := k) n 1 d := by 332 exact (presentedCanonicalRightIdeal (k := k) n 1 d).smul_mem 333 (MulOpposite.op (presentedCoordinate k n)) 334 (firstGenerator_mem (presentedCoordinate k n) d 1) 335 have hneg : (-1 : PresentedWeyl k (n + 1)) ∈ presentedCanonicalRightIdeal (k := k) n 1 d := by 336 rw [← coordinate_commutator_eq_neg_one_degree_one k n hd] 337 exact (presentedCanonicalRightIdeal (k := k) n 1 d).sub_mem hxd hdx 338 have hone : (1 : PresentedWeyl k (n + 1)) ∈ presentedCanonicalRightIdeal (k := k) n 1 d := by 339 simpa using (presentedCanonicalRightIdeal (k := k) n 1 d).neg_mem hneg 340 simpa using (presentedCanonicalRightIdeal (k := k) n 1 d).smul_mem (MulOpposite.op z) hone 341 342 /-- The ordinary coordinate action on the degree-one canonical quotient is 343 injective. This is the first half of the general filtered interface. -/ 344 theorem canonical_quotient_coordinate_injective_degree_one 345 (n : ℕ) {d : PresentedWeyl k (n + 1)} 346 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) 1 d) : 347 Function.Injective 348 (rightMul (presentedCanonicalRightIdeal (k := k) n 1 d) (presentedCoordinate k n)) := by 349 intro q₁ q₂ hq 350 obtain ⟨z₁, rfl⟩ := Submodule.Quotient.mk_surjective 351 (presentedCanonicalRightIdeal (k := k) n 1 d) q₁ 352 obtain ⟨z₂, rfl⟩ := Submodule.Quotient.mk_surjective 353 (presentedCanonicalRightIdeal (k := k) n 1 d) q₂ 354 apply (Submodule.Quotient.eq (presentedCanonicalRightIdeal (k := k) n 1 d)).2 355 rw [canonicalRightIdeal_eq_top_degree_one k n hd] 356 exact Submodule.mem_top 357 358 /-- Strict lower-order coordinate preimages in degree one. Together with 359 `canonical_quotient_coordinate_injective_degree_one`, this instantiates the 360 general filtered reduction and makes the unit-ideal case a reusable base 361 interface rather than an isolated shortcut. -/ 362 theorem canonical_strictLowerCoordinatePreimages_degree_one 363 (n : ℕ) {d : PresentedWeyl k (n + 1)} 364 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) 1 d) : 365 StrictLowerCoordinatePreimages k n 1 d := by 366 intro m l hl 367 refine ⟨0, Submodule.zero_mem _, ?_⟩ 368 apply (Submodule.Quotient.eq (presentedCanonicalRightIdeal (k := k) n 1 d)).2 369 rw [canonicalRightIdeal_eq_top_degree_one k n hd] 370 exact Submodule.mem_top 371 372 /-- The canonical order initial ideal is the unit ideal in degree one. -/ 373 theorem canonical_orderInitialIdeal_eq_top_degree_one 374 (n : ℕ) {d : PresentedWeyl k (n + 1)} 375 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) 1 d) : 376 orderInitialIdeal k (presentedCanonicalRightIdeal (k := k) n 1 d) = ⊤ := by 377 apply (Ideal.eq_top_iff_one _).2 378 have honeI : (1 : PresentedWeyl k (n + 1)) ∈ presentedCanonicalRightIdeal (k := k) n 1 d := by 379 rw [canonicalRightIdeal_eq_top_degree_one k n hd] 380 exact Submodule.mem_top 381 have hone := orderPrincipalComponent_mem_initialIdeal k 382 (presentedCanonicalRightIdeal (k := k) n 1 d) (1 : PresentedWeyl k (n + 1)) 383 (Stafford38.CharacteristicAssociatedGradedModule.orderPieceOne 384 (n := n + 1) k).property honeI 385 have honepc : presentedPrincipalComponent k orderWeight 0 386 (1 : PresentedWeyl k (n + 1)) = 1 := by 387 exact Stafford38.CharacteristicAssociatedGradedModule.presentedPrincipalComponent_orderPieceOne 388 (n := n + 1) k 389 rw [honepc] at hone 390 exact hone 391 392 /-- **Concrete producer.** For every canonical Bernstein-monic operator of 393 degree one, the actual order initial ideal is saturated by the selected 394 coordinate symbol. -/ 395 theorem canonical_orderInitialIdeal_coordinate_saturated_degree_one 396 (n : ℕ) {d : PresentedWeyl k (n + 1)} 397 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) 1 d) : 398 (orderInitialIdeal k (presentedCanonicalRightIdeal (k := k) n 1 d)).colon 399 ({MvPolynomial.X (Sum.inl (0 : Fin (n + 1)))} : 400 Set (SymbolRing k (n + 1))) = 401 orderInitialIdeal k (presentedCanonicalRightIdeal (k := k) n 1 d) := by 402 rw [canonical_orderInitialIdeal_eq_top_degree_one k n hd] 403 apply le_antisymm le_top 404 intro r hr 405 rw [Submodule.mem_colon] 406 intro p hp 407 exact Submodule.mem_top 408 409 /-- The degree-one producer reaches the actual order-characteristic support. -/ 410 theorem canonical_orderCharacteristicSupport_eq_empty_degree_one 411 (n : ℕ) {d : PresentedWeyl k (n + 1)} 412 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) 1 d) : 413 orderCharacteristicSupport k 414 (presentedCanonicalRightIdeal (k := k) n 1 d) = ∅ := by 415 apply (orderCharacteristicSupport_eq_empty_iff k 416 (presentedCanonicalRightIdeal (k := k) n 1 d)).2 417 exact canonical_orderInitialIdeal_eq_top_degree_one k n hd 418 419 /-- The degree-one case yields the literal fixed-source Stafford certificate. -/ 420 theorem exists_fixedSource_certificate_degree_one 421 (n : ℕ) {d : PresentedWeyl k (n + 1)} 422 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) 1 d) : 423 ∃ R S : PresentedWeyl k (n + 1), 424 (1 : PresentedWeyl k (n + 1)) = 425 d * R + presentedCoordinate k n * d * S := by 426 let I := presentedCanonicalRightIdeal (k := k) n 1 d 427 have hone : (1 : PresentedWeyl k (n + 1)) ∈ I := by 428 change (1 : PresentedWeyl k (n + 1)) ∈ 429 presentedCanonicalRightIdeal (k := k) n 1 d 430 rw [canonicalRightIdeal_eq_top_degree_one k n hd] 431 exact Submodule.mem_top 432 change (1 : PresentedWeyl k (n + 1)) ∈ 433 canonicalRightIdeal (presentedCoordinate k n) d 1 at hone 434 have hone' : (1 : PresentedWeyl k (n + 1)) ∈ 435 Submodule.span (PresentedWeyl k (n + 1))ᵐᵒᵖ 436 ({d, presentedCoordinate k n * d} : 437 Set (PresentedWeyl k (n + 1))) := by 438 simpa [canonicalRightIdeal, pow_one] using hone 439 rcases Submodule.mem_span_pair.mp hone' with ⟨r, s, hrs⟩ 440 refine ⟨r.unop, s.unop, ?_⟩ 441 simpa [op_smul_eq_mul] using hrs.symm 442 443 /-- Equivalent actual-graded formulation of the degree-one producer. -/ 444 theorem canonical_graded_coordinateAction_injective_degree_one 445 (n m : ℕ) {d : PresentedWeyl k (n + 1)} 446 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) 1 d) : 447 Function.Injective 448 (canonicalGradedCoordinateAction k n 1 m d) := by 449 exact 450 canonical_graded_coordinateAction_injective_of_quotient_injective_of_strict_preimages 451 k n 1 m d 452 (canonical_quotient_coordinate_injective_degree_one k n hd) 453 (canonical_strictLowerCoordinatePreimages_degree_one k n hd) 454 455 #print axioms pderiv_eq_one_of_order_one_fibreOnly 456 #print axioms coordinateCancellation_of_quotient_injective_of_strict_preimages 457 #print axioms canonical_graded_coordinateAction_injective_of_quotient_injective_of_strict_preimages 458 #print axioms canonical_unrestricted_coordinate_preimages_of_monic 459 #print axioms coordinate_commutator_eq_neg_one_degree_one 460 #print axioms canonicalRightIdeal_eq_top_degree_one 461 #print axioms canonical_quotient_coordinate_injective_degree_one 462 #print axioms canonical_strictLowerCoordinatePreimages_degree_one 463 #print axioms canonical_orderInitialIdeal_eq_top_degree_one 464 #print axioms canonical_orderInitialIdeal_coordinate_saturated_degree_one 465 #print axioms canonical_orderCharacteristicSupport_eq_empty_degree_one 466 #print axioms exists_fixedSource_certificate_degree_one 467 #print axioms canonical_graded_coordinateAction_injective_degree_one 468 469 end 470 471 end Stafford38.CanonicalMonicSaturation 472