This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Mathlib.Algebra.RingQuot 3 public import Mathlib.Algebra.FreeAlgebra 4 public import Mathlib.LinearAlgebra.SymplecticGroup 5 public import Mathlib.Order.Lattice.Nat 6 public import Mathlib.RingTheory.Localization.FractionRing 7 public import Mathlib.RingTheory.Localization.Away.Basic 8 9 @[expose] public section 10 11 /-! 12 # Stafford's Conjecture 3.8 13 14 J. T. Stafford, *Module structure of Weyl algebras*, J. London Math. Soc. (2) 15 18 (1978), 429–442, states on page 438: 16 17 > Conjecture 3.8. Let `d ∈ Aₙ`. Then there exists `f ∈ Aₙ` such that 18 > `Aₙ = d Aₙ + f d Aₙ`. 19 20 Here `Aₙ = Aₙ(k)` is the `n`th Weyl algebra over a field `k` of characteristic 21 zero, generated by `x₁, …, xₙ, ∂₁, …, ∂ₙ` with `[∂ᵢ, xⱼ] = δᵢⱼ` and all other 22 pairs of generators commuting. Both `d Aₙ` and `f d Aₙ` are right ideals, and 23 `f` stands to the left of `d`. Membership of `1` in their sum is the identity 24 `1 = d R + f d S` for some `R, S ∈ Aₙ`, with the factors in this order. 25 26 The printed conjecture omits the hypothesis `d ≠ 0`, without which the 27 conclusion fails for `d = 0`; the discussion following it in the article uses 28 that hypothesis. This file states the intended nonzero form, for every 29 characteristic-zero field and every rank `n ≥ 0`. For `n = 0` the Weyl algebra 30 is the field itself and a nonzero `d` is a unit. 31 32 Besides this statement, the file states the results the accompanying paper 33 claims: Theorem 1.1 and Corollary 6.3 as printed, the stable cyclicity of 34 Corollary 6.3, and the consequences listed in Section 7 that have no printed 35 proof (the left-handed identity, Corollary 6.3 for left modules, the identity 36 for differential operators on localizations of `k[x_1, …, x_n]`, and the 37 identity with `F = x^r` for `d = p^r − ∑_j a_j x^{m_j}`). 38 39 The presentation and statements below repeat the exact definitions used by 40 `Stafford38.ChallengeDefinitions` and `Stafford38.PaperClaimDefinitions` in the 41 solution. Palomar requires the selected Challenge to import only authenticated 42 libraries. The independent Comparator checks that the definitions and theorem 43 types match; this file contains the deliberate placeholders filled by the 44 solution. 45 -/ 46 47 namespace Stafford 48 49 variable {k A ι : Type*} [Field k] [Ring A] [Algebra k A] 50 [Fintype ι] [DecidableEq ι] 51 52 /-- Linear combination of an indexed family by the rows of a matrix. -/ 53 def linearCombination (M : Matrix ι ι k) (z : ι → A) (i : ι) : A := 54 ∑ j, algebraMap k A (M i j) * z j 55 56 variable {k ι : Type*} [Field k] 57 58 /-- The commutator relations presenting a Weyl-type algebra. -/ 59 def freeWeylRelation (omega : Matrix ι ι k) 60 (a b : FreeAlgebra k ι) : Prop := 61 ∃ i j, 62 a = FreeAlgebra.ι k i * FreeAlgebra.ι k j - 63 FreeAlgebra.ι k j * FreeAlgebra.ι k i ∧ 64 b = algebraMap k (FreeAlgebra k ι) (omega i j) 65 66 /-- The free algebra modulo the commutator relations encoded by `omega`. -/ 67 abbrev FreeWeyl (k : Type*) [Field k] (ι : Type*) 68 (omega : Matrix ι ι k) := RingQuot (freeWeylRelation omega) 69 70 /-- The canonical generators of the presented Weyl-type algebra. -/ 71 def freeWeylGenerator (omega : Matrix ι ι k) (i : ι) : FreeWeyl k ι omega := 72 RingQuot.mkAlgHom k (freeWeylRelation omega) (FreeAlgebra.ι k i) 73 74 end Stafford 75 76 namespace Stafford 77 namespace Reduction 78 79 variable {k A : Type*} [Field k] [Ring A] [Algebra k A] 80 81 /-- Stafford 3.8 for one element, in written operator order. -/ 82 def Stafford38 (e : A) : Prop := ∃ F R S : A, (1 : A) = e * R + F * e * S 83 84 end Reduction 85 end Stafford 86 87 namespace Stafford38Challenge 88 89 universe u 90 91 /-- Index type of the coordinate and momentum generators. -/ 92 abbrev PhaseVar (n : ℕ) := Fin n ⊕ Fin n 93 94 /-- The Weyl commutator relation for the standard symplectic matrix. -/ 95 abbrev relation {k : Type*} [Field k] {n : ℕ} 96 (omega : Matrix (PhaseVar n) (PhaseVar n) k) 97 (a b : FreeAlgebra k (PhaseVar n)) : Prop := 98 Stafford.freeWeylRelation omega a b 99 100 /-- The standard presented Weyl algebra, shared with the substantive proof. -/ 101 abbrev WeylAlg (k : Type*) [Field k] (n : ℕ) := 102 Stafford.FreeWeyl k (PhaseVar n) (Matrix.J (Fin n) k) 103 104 /-- Stafford's Conjecture 3.8 in its intended nonzero form. -/ 105 def UniversalStatement : Prop := 106 ∀ (k : Type u) [Field k] [CharZero k] (n : ℕ) (d : WeylAlg k n), 107 d ≠ 0 → Stafford.Reduction.Stafford38 d 108 109 /-- A named generator in the canonical presentation. -/ 110 abbrev generator (k : Type*) [Field k] (n : ℕ) (i : PhaseVar n) : WeylAlg k n := 111 Stafford.freeWeylGenerator (Matrix.J (Fin n) k) i 112 113 /-- The standard symplectic form used for the fixed-source coordinate. -/ 114 abbrev standardForm (k : Type*) [Field k] (n : ℕ) : 115 Matrix (PhaseVar n) (PhaseVar n) k := Matrix.J (Fin n) k 116 117 end Stafford38Challenge 118 119 namespace Stafford38FixedSourceChallenge 120 121 universe u 122 123 /-- The fixed-source challenge uses the same phase variables and Weyl 124 presentation as the ordinary challenge. -/ 125 abbrev PhaseVar (n : ℕ) := Stafford38Challenge.PhaseVar n 126 127 abbrev relation {k : Type u} [Field k] {n : ℕ} 128 (omega : Matrix (PhaseVar n) (PhaseVar n) k) 129 (a b : FreeAlgebra k (PhaseVar n)) : Prop := 130 Stafford38Challenge.relation omega a b 131 132 abbrev WeylAlg (k : Type u) [Field k] (n : ℕ) := 133 Stafford38Challenge.WeylAlg k n 134 135 abbrev generator (k : Type u) [Field k] (n : ℕ) (i : PhaseVar n) : WeylAlg k n := 136 Stafford38Challenge.generator k n i 137 138 /-- Insert an old phase variable after the newest coordinate or momentum. -/ 139 def oldIndex {n : ℕ} : PhaseVar n → PhaseVar (n + 1) 140 | .inl i => .inl i.succ 141 | .inr i => .inr i.succ 142 143 @[simp] theorem oldIndex_inl {n : ℕ} (i : Fin n) : 144 oldIndex (.inl i) = .inl i.succ := rfl 145 146 @[simp] theorem oldIndex_inr {n : ℕ} (i : Fin n) : 147 oldIndex (.inr i) = .inr i.succ := rfl 148 149 /-- Insert an old free-algebra word into the next-rank free algebra. -/ 150 def freeOldMap (k : Type u) [Field k] (n : ℕ) : 151 FreeAlgebra k (PhaseVar n) →ₐ[k] FreeAlgebra k (PhaseVar (n + 1)) := 152 FreeAlgebra.lift k (fun i => FreeAlgebra.ι k (oldIndex i)) 153 154 /-- Ordered PBW words, with old pairs followed by the newest pair. -/ 155 def freeOrderedMonomial (k : Type u) [Field k] : 156 (n : ℕ) → (Fin n → ℕ) → (Fin n → ℕ) → FreeAlgebra k (PhaseVar n) 157 | 0, _, _ => 1 158 | n + 1, a, p => 159 freeOldMap k n 160 (freeOrderedMonomial k n (fun i => a i.succ) (fun i => p i.succ)) * 161 FreeAlgebra.ι k (.inl (0 : Fin (n + 1))) ^ a 0 * 162 FreeAlgebra.ι k (.inr (0 : Fin (n + 1))) ^ p 0 163 164 /-- The image of an ordered PBW word in the shared Weyl quotient. -/ 165 def orderedMonomial (k : Type u) [Field k] (n : ℕ) 166 (a p : Fin n → ℕ) : WeylAlg k n := 167 RingQuot.mkAlgHom k (relation (k := k) (n := n) (Matrix.J (Fin n) k)) 168 (freeOrderedMonomial k n a p) 169 170 /-- Total degree of a split coordinate/momentum exponent. -/ 171 def phaseDegree {n : ℕ} (a p : Fin n → ℕ) : ℕ := 172 (∑ i, a i) + ∑ i, p i 173 174 /-- Span of the ordered Weyl words of total degree at most `N`. -/ 175 def bernsteinPiece (k : Type u) [Field k] (n N : ℕ) : 176 Submodule k (WeylAlg k n) := 177 Submodule.span k 178 {z | ∃ a p : Fin n → ℕ, 179 phaseDegree a p ≤ N ∧ z = orderedMonomial k n a p} 180 181 /-- The intrinsic Bernstein degree of a presented element: its least piece. -/ 182 noncomputable def bernsteinDegree (k : Type u) [Field k] {n : ℕ} 183 (d : WeylAlg k n) : ℕ := 184 sInf {N : ℕ | d ∈ bernsteinPiece k n N} 185 186 /-- The shared matrix-row combination used to name a linear source. -/ 187 abbrev linearCombination (k : Type u) [Field k] {n : ℕ} 188 (M : Matrix (PhaseVar n) (PhaseVar n) k) 189 (z : PhaseVar n → WeylAlg k n) (i : PhaseVar n) : WeylAlg k n := 190 Stafford.linearCombination M z i 191 192 abbrev standardForm (k : Type u) [Field k] (n : ℕ) : 193 Matrix (PhaseVar n) (PhaseVar n) k := Stafford38Challenge.standardForm k n 194 195 /-- A source coordinate obtained from an invertible symplectic linear change 196 of the canonical Weyl generators. -/ 197 def IsLinearWeylCoordinate (k : Type u) [Field k] (n : ℕ) 198 (ell : WeylAlg k (n + 1)) : Prop := 199 ∃ (M N : Matrix (PhaseVar (n + 1)) (PhaseVar (n + 1)) k) 200 (_hM : M * standardForm k (n + 1) * Matrix.transpose M = 201 standardForm k (n + 1)) 202 (_hN : N * standardForm k (n + 1) * Matrix.transpose N = 203 standardForm k (n + 1)) 204 (_hMN : M * N = 1) (_hNM : N * M = 1), 205 ell = linearCombination k N (generator k (n + 1)) 206 (.inl (0 : Fin (n + 1))) 207 208 /-- Shared template for the fixed-source proposition, parameterized only by 209 the chosen degree function. -/ 210 def UniversalFixedSourceStatementWithDegree 211 (degree : ∀ (k : Type u) [Field k] {n : ℕ}, WeylAlg k n → ℕ) : Prop := 212 ∀ (k : Type u) [Field k] [CharZero k] (n : ℕ) 213 (d : WeylAlg k (n + 1)), d ≠ 0 → 214 ∃ ell R S : WeylAlg k (n + 1), 215 IsLinearWeylCoordinate k n ell ∧ 216 (1 : WeylAlg k (n + 1)) = 217 d * R + ell ^ degree k d * d * S 218 219 /-- The exact fixed-source challenge, using the intrinsic degree. -/ 220 abbrev UniversalFixedSourceStatement : Prop := 221 UniversalFixedSourceStatementWithDegree.{u} bernsteinDegree 222 223 end Stafford38FixedSourceChallenge 224 225 namespace Stafford38.TorsionCyclicity 226 227 universe u v 228 229 /-- Every element of a right module is killed by some nonzero right scalar. -/ 230 def IsRightTorsion {A : Type u} {M : Type v} [Ring A] 231 [AddCommGroup M] [Module Aᵐᵒᵖ M] : Prop := 232 ∀ m : M, ∃ d : A, d ≠ 0 ∧ (MulOpposite.op d : Aᵐᵒᵖ) • m = 0 233 234 end Stafford38.TorsionCyclicity 235 236 namespace Stafford38Challenge 237 238 universe u v 239 240 /-- The generator `x₁` of `A_n(k)`, `n ≥ 1`. -/ 241 abbrev x₁ (k : Type*) [Field k] {n : ℕ} (hn : 0 < n) : WeylAlg k n := 242 generator k n (.inl ⟨0, hn⟩) 243 244 /-- The linear map `g` on the generator space `V = span(x_1, …, ∂_n)`, given by 245 the rows of its matrix: `g(u_i) = ∑_j g_ij u_j`. -/ 246 abbrev linearImage (k : Type*) [Field k] {n : ℕ} 247 (g : Matrix (PhaseVar n) (PhaseVar n) k) (i : PhaseVar n) : WeylAlg k n := 248 Stafford.linearCombination g (generator k n) i 249 250 /-- An `ω`-preserving `g` (`g J gᵀ = J`) preserves the Weyl relations 251 `[u_i, u_j] = J_ij`. -/ 252 theorem linearImage_rel (k : Type*) [Field k] {n : ℕ} 253 (g : Matrix.symplecticGroup (Fin n) k) ⦃a b : FreeAlgebra k (PhaseVar n)⦄ 254 (h : relation (Matrix.J (Fin n) k) a b) : 255 FreeAlgebra.lift k (linearImage k (g : Matrix (PhaseVar n) (PhaseVar n) k)) a = 256 FreeAlgebra.lift k (linearImage k (g : Matrix (PhaseVar n) (PhaseVar n) k)) b := by 257 obtain ⟨i, j, rfl, rfl⟩ := h 258 have hcomm : ∀ p q : PhaseVar n, 259 generator k n p * generator k n q - generator k n q * generator k n p = 260 algebraMap k (WeylAlg k n) (Matrix.J (Fin n) k p q) := by 261 intro p q 262 have := RingQuot.mkAlgHom_rel k 263 (show relation (Matrix.J (Fin n) k) _ _ from ⟨p, q, rfl, rfl⟩) 264 simpa [generator, Stafford.freeWeylGenerator, map_sub, map_mul] using this 265 have hg := (SymplecticGroup.mem_iff).mp g.2 266 -- Reversed simp lemmas (`← l`) would become helpers named after the compiling 267 -- module, so challenge and solution copies of this proof would differ. 268 have smul_def' : ∀ (c : k) (x : WeylAlg k n), algebraMap k (WeylAlg k n) c * x = c • x := 269 fun c x => (Algebra.smul_def c x).symm 270 have sum_sub' : ∀ (s : Finset (PhaseVar n)) (f f' : PhaseVar n → WeylAlg k n), 271 ∑ p ∈ s, f p - ∑ p ∈ s, f' p = ∑ p ∈ s, (f p - f' p) := 272 fun s f f' => (Finset.sum_sub_distrib f f').symm 273 have sum_algebraMap : ∀ (s : Finset (PhaseVar n)) (f : PhaseVar n → k), 274 ∑ p ∈ s, algebraMap k (WeylAlg k n) (f p) = algebraMap k (WeylAlg k n) (∑ p ∈ s, f p) := 275 fun s f => (map_sum (algebraMap k (WeylAlg k n)) f s).symm 276 simp only [map_sub, map_mul, FreeAlgebra.lift_ι_apply, AlgHom.commutes, linearImage, 277 Stafford.linearCombination, smul_def', Finset.sum_mul, Finset.mul_sum, 278 smul_mul_smul_comm] 279 rw [Finset.sum_comm, ← Finset.sum_sub_distrib] 280 simp_rw [sum_sub'] 281 have hterm : ∀ p q : PhaseVar n, 282 ((g : Matrix _ _ k) i p * (g : Matrix _ _ k) j q) • (generator k n p * generator k n q) - 283 ((g : Matrix _ _ k) j q * (g : Matrix _ _ k) i p) • (generator k n q * generator k n p) = 284 algebraMap k (WeylAlg k n) 285 ((g : Matrix _ _ k) i p * Matrix.J (Fin n) k p q * (g : Matrix _ _ k) j q) := by 286 intro p q 287 rw [mul_comm ((g : Matrix _ _ k) j q)] 288 rw [show ∀ (c : k) (x y : WeylAlg k n), c • x - c • y = c • (x - y) from 289 fun c x y => (smul_sub c x y).symm, hcomm, Algebra.smul_def, ← map_mul] 290 congr 1 291 ring 292 simp_rw [hterm, sum_algebraMap] 293 congr 1 294 conv_rhs => rw [← hg] 295 simp only [Matrix.mul_apply, Matrix.transpose_apply, Finset.sum_mul] 296 rw [Finset.sum_comm] 297 298 /-- **`Φ_g`**: for a linear `ω`-preserving automorphism `g` of the generator 299 space (`g J gᵀ = J`, i.e. `g ∈ Sp(2n, k)`), the algebra automorphism of 300 `A_n(k)` extending `u_i ↦ g(u_i) = ∑_j g_ij u_j`. Its inverse is 301 `Φ_g⁻¹ = Φ_{g⁻¹}`. -/ 302 noncomputable def phiG (k : Type*) [Field k] (n : ℕ) (g : Matrix.symplecticGroup (Fin n) k) : 303 WeylAlg k n →ₐ[k] WeylAlg k n := 304 RingQuot.liftAlgHom k 305 ⟨FreeAlgebra.lift k (linearImage k (g : Matrix (PhaseVar n) (PhaseVar n) k)), 306 fun _ _ h => linearImage_rel k g h⟩ 307 308 /-- A right module `M` is cyclic: `M = mA` for some `m ∈ M`. -/ 309 def IsCyclicModule (A : Type u) (M : Type v) [Ring A] [AddCommGroup M] [Module Aᵐᵒᵖ M] : 310 Prop := 311 ∃ m : M, ∀ x : M, ∃ a : A, x = MulOpposite.op a • m 312 313 /-- **Theorem 1.1.** For every field of characteristic zero `k`, every `n ≥ 0` 314 and every nonzero `d ∈ A_n(k)`, there exists an `F ∈ A_n(k)` such that 315 `A_n(k) = dA_n(k) + FdA_n(k)`, or equivalently, there exist `F, S, R ∈ A_n(k)` 316 such that `1 = dR + FdS`. Moreover, if `n ≥ 1`, one may choose 317 `F = Φ_g^{-1}(x₁)^{deg_B d}` for a linear `ω`-preserving automorphism `g`. -/ 318 def PaperTheorem_1_1 : Prop := 319 ∀ (k : Type u) [Field k] [CharZero k] (n : ℕ) (d : WeylAlg k n), d ≠ 0 → 320 (∃ F : WeylAlg k n, (⊤ : Submodule (WeylAlg k n)ᵐᵒᵖ (WeylAlg k n)) = 321 Submodule.span (WeylAlg k n)ᵐᵒᵖ {d} ⊔ Submodule.span (WeylAlg k n)ᵐᵒᵖ {F * d}) ∧ 322 (∃ F S R : WeylAlg k n, (1 : WeylAlg k n) = d * R + F * d * S) ∧ 323 (∀ hn : 1 ≤ n, ∃ g : Matrix.symplecticGroup (Fin n) k, ∃ R S : WeylAlg k n, 324 (1 : WeylAlg k n) = d * R + 325 phiG k n g⁻¹ (x₁ k hn) ^ Stafford38FixedSourceChallenge.bernsteinDegree k d * d * S) 326 327 /-- **Corollary 6.3** (Stafford 1978). Every finitely generated torsion right 328 `A_n(k)`-module is cyclic. -/ 329 def PaperCorollary_6_3 : Prop := 330 ∀ (k : Type u) [Field k] [CharZero k] (n : ℕ) (M : Type v) [AddCommGroup M] 331 [Module (WeylAlg k n)ᵐᵒᵖ M] [Module.Finite (WeylAlg k n)ᵐᵒᵖ M], 332 Stafford38.TorsionCyclicity.IsRightTorsion (A := WeylAlg k n) (M := M) → 333 IsCyclicModule (WeylAlg k n) M 334 335 end Stafford38Challenge 336 337 namespace Stafford38Challenge 338 339 universe u v 340 341 /-- Stafford's *stably cyclic* [Sta78, p. 435], as quoted in the proof of 342 Corollary 6.3 (tex line 1619): "given `l ≥ 1` and `a_1, …, a_{l+1} ∈ T` that 343 generate `T`, there exist `f_i ∈ A_n` such that `a_i + a_{l+1} f_i`, 344 `i = 1, …, l`, also generate `T`". -/ 345 def IsStablyCyclic (A : Type u) (T : Type v) [Ring A] [AddCommGroup T] [Module Aᵐᵒᵖ T] : 346 Prop := 347 ∀ l ≥ 1, ∀ a : Fin (l + 1) → T, Submodule.span Aᵐᵒᵖ (Set.range a) = ⊤ → 348 ∃ f : Fin l → A, Submodule.span Aᵐᵒᵖ 349 (Set.range fun i : Fin l => a i.castSucc + (MulOpposite.op (f i) : Aᵐᵒᵖ) • a (Fin.last l)) = 350 ⊤ 351 352 /-- **Corollary 6.3, stable cyclicity** (tex lines 75, 108, 1619). Every 353 finitely generated torsion right `A_n(k)`-module is stably cyclic. -/ 354 def PaperCorollary_6_3_stablyCyclic : Prop := 355 ∀ (k : Type u) [Field k] [CharZero k] (n : ℕ) (M : Type v) [AddCommGroup M] 356 [Module (WeylAlg k n)ᵐᵒᵖ M] [Module.Finite (WeylAlg k n)ᵐᵒᵖ M], 357 Stafford38.TorsionCyclicity.IsRightTorsion (A := WeylAlg k n) (M := M) → 358 IsStablyCyclic (WeylAlg k n) M 359 360 /-- **Section 7, left-handed identity** (tex lines 1629–1630): every nonzero 361 `d ∈ A_n(k)` has `R, S, F` with `1 = Rd + SdF`. -/ 362 def LeftHandedIdentity : Prop := 363 ∀ (k : Type u) [Field k] [CharZero k] (n : ℕ) (d : WeylAlg k n), d ≠ 0 → 364 ∃ R S F : WeylAlg k n, (1 : WeylAlg k n) = R * d + S * d * F 365 366 /-- Every element of a left module is killed by some nonzero scalar. -/ 367 def IsLeftTorsion (A : Type u) (M : Type v) [Ring A] [AddCommGroup M] [Module A M] : Prop := 368 ∀ m : M, ∃ d : A, d ≠ 0 ∧ d • m = 0 369 370 /-- A left module `M` is cyclic: `M = Am` for some `m ∈ M`. -/ 371 def IsLeftCyclicModule (A : Type u) (M : Type v) [Ring A] [AddCommGroup M] [Module A M] : 372 Prop := 373 ∃ m : M, ∀ x : M, ∃ a : A, x = a • m 374 375 /-- **Section 7, Corollary 6.3 for left torsion modules** (tex line 1630): 376 every finitely generated torsion left `A_n(k)`-module is cyclic. -/ 377 def LeftCorollary_6_3 : Prop := 378 ∀ (k : Type u) [Field k] [CharZero k] (n : ℕ) (M : Type v) [AddCommGroup M] 379 [Module (WeylAlg k n) M] [Module.Finite (WeylAlg k n) M], 380 IsLeftTorsion (WeylAlg k n) M → IsLeftCyclicModule (WeylAlg k n) M 381 382 /-- `P` is a `k`-linear differential operator of order at most `N` on the 383 commutative `k`-algebra `B` (Grothendieck): every iterated commutator 384 `[…[[P, b₀], b₁], …, b_N]` with multiplication operators vanishes, where 385 `[Q, b] = Q ∘ b − b ∘ Q`. -/ 386 def IsDifferentialOperatorOfOrder (k : Type u) (B : Type v) [CommRing k] [CommRing B] 387 [Algebra k B] (N : ℕ) (P : Module.End k B) : Prop := 388 ∀ b : List B, b.length = N + 1 → 389 b.foldl (fun Q c => Q * LinearMap.mulLeft k c - LinearMap.mulLeft k c * Q) P = 0 390 391 /-- `P` is a `k`-linear differential operator of finite order on `B`. -/ 392 def IsDifferentialOperator (k : Type u) (B : Type v) [CommRing k] [CommRing B] 393 [Algebra k B] (P : Module.End k B) : Prop := 394 ∃ N, IsDifferentialOperatorOfOrder k B N P 395 396 /-- The identity `1 = dR + FdS` in the ring `D_k(B)` of finite-order 397 `k`-linear differential operators on `B`: for every nonzero `d ∈ D_k(B)` there 398 are `F, R, S ∈ D_k(B)` with `1 = dR + FdS`. -/ 399 def HasDifferentialIdentity (k : Type u) (B : Type v) [CommRing k] [CommRing B] 400 [Algebra k B] : Prop := 401 ∀ d : Module.End k B, IsDifferentialOperator k B d → d ≠ 0 → 402 ∃ F R S : Module.End k B, IsDifferentialOperator k B F ∧ IsDifferentialOperator k B R ∧ 403 IsDifferentialOperator k B S ∧ (1 : Module.End k B) = d * R + F * d * S 404 405 /-- **Section 7, localizations** (tex lines 1630–1631): the identity for 406 finite-order differential operators on every localization `B = S⁻¹k[x_1, …, x_n]`. -/ 407 def LocalizedDifferentialIdentity : Prop := 408 ∀ (k : Type u) [Field k] [CharZero k] (n : ℕ) (S : Submonoid (MvPolynomial (Fin n) k)) 409 (B : Type v) [CommRing B] [Algebra (MvPolynomial (Fin n) k) B] [Algebra k B] 410 [IsScalarTower k (MvPolynomial (Fin n) k) B] [IsLocalization S B], 411 HasDifferentialIdentity k B 412 413 /-- **Section 7, evolutionary identity** (tex lines 1631–1634): for `r ≥ 1`, in 414 every `k`-algebra `D` with `px = xp + 1`, the element 415 `d = p^r − ∑_j a_j x^{m_j}`, each `a_j` commuting with `x` and `p`, has 416 `R, S` with `1 = dR + x^r d S`. -/ 417 def EvolutionaryIdentity : Prop := 418 ∀ (k : Type u) [Field k] [CharZero k] (D : Type v) [Ring D] [Algebra k D] (x p : D), 419 p * x = x * p + 1 → ∀ r : ℕ, 1 ≤ r → ∀ (J : ℕ) (a : Fin J → D) (m : Fin J → ℕ), 420 (∀ j, a j * x = x * a j) → (∀ j, a j * p = p * a j) → 421 ∃ R S : D, (1 : D) = (p ^ r - ∑ j, a j * x ^ m j) * R + 422 x ^ r * (p ^ r - ∑ j, a j * x ^ m j) * S 423 424 end Stafford38Challenge 425 426 namespace Stafford38Challenge 427 428 universe u 429 430 /-- The compared theorem. The proof is supplied by `Solution.lean`. -/ 431 theorem universalStatement : UniversalStatement := by 432 sorry 433 434 /-- Theorem 1.1 of the paper, as printed. The proof is supplied by `Solution.lean`. -/ 435 theorem theorem_1_1 : PaperTheorem_1_1 := by 436 sorry 437 438 /-- Corollary 6.3 of the paper, as printed. The proof is supplied by `Solution.lean`. -/ 439 theorem corollary_6_3 : PaperCorollary_6_3 := by 440 sorry 441 442 /-- Corollary 6.3, stable cyclicity, as claimed in the introduction and the 443 printed proof. The proof is supplied by `Solution.lean`. -/ 444 theorem corollary_6_3_stablyCyclic : PaperCorollary_6_3_stablyCyclic := by 445 sorry 446 447 /-- Section 7: the left-handed identity `1 = Rd + SdF`. -/ 448 theorem leftHandedIdentity : LeftHandedIdentity := by 449 sorry 450 451 /-- Section 7: Corollary 6.3 for left torsion modules. -/ 452 theorem corollary_6_3_left : LeftCorollary_6_3 := by 453 sorry 454 455 /-- Section 7: the identity in `D_k(B)` for every localization `B` of 456 `k[x_1, …, x_n]`. -/ 457 theorem localizedDifferentialIdentity : LocalizedDifferentialIdentity := by 458 sorry 459 460 /-- Section 7: the identity in `D_k(k[x_1, …, x_n]_f)` (principal opens). -/ 461 theorem principalOpenDifferentialIdentity : 462 ∀ (k : Type u) [Field k] [CharZero k] (n : ℕ) (f : MvPolynomial (Fin n) k), 463 HasDifferentialIdentity k (Localization.Away f) := by 464 sorry 465 466 /-- Section 7: the identity in `D_k(k[x_1^{±1}, …, x_n^{±1}])` (Laurent-polynomial 467 coefficients). -/ 468 theorem laurentDifferentialIdentity : 469 ∀ (k : Type u) [Field k] [CharZero k] (n : ℕ), 470 HasDifferentialIdentity k 471 (Localization.Away (∏ i, MvPolynomial.X i : MvPolynomial (Fin n) k)) := by 472 sorry 473 474 /-- Section 7: the identity in `D_k(k(x_1, …, x_n))` (the fraction field). -/ 475 theorem fractionFieldDifferentialIdentity : 476 ∀ (k : Type u) [Field k] [CharZero k] (n : ℕ), 477 HasDifferentialIdentity k (FractionRing (MvPolynomial (Fin n) k)) := by 478 sorry 479 480 /-- Section 7: the identity with `F = x^r` for `d = p^r − ∑_j a_j x^{m_j}`. -/ 481 theorem evolutionaryIdentity : EvolutionaryIdentity := by 482 sorry 483 484 end Stafford38Challenge 485