Stafford38/Weyl/OrderRees.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Stafford38.Characteristic.AssociatedGradedModule
3 public import Mathlib.Algebra.Polynomial.Coeff
4 
5 @[expose] public section
6 
7 /-!
8 # The differential-order Rees ring
9 
10 This file constructs the literal Rees ring of the differential-order
11 filtration as the subring of the central polynomial ring `A[T]` whose
12 degree-`N` coefficient lies in `F_N A`.  No commutativity of `A`, Rees
13 specialization, or Gabber theorem is assumed.
14 -/
15 
16 namespace Stafford38.WeylOrderRees
17 
18 open Stafford38.CharacteristicAssociatedGradedModule
19 open Stafford38.WeylFiltration
20 open Stafford38.WeylIteratedEquivalence
21 
22 noncomputable section
23 
24 universe u
25 
26 variable (k : Type u) [Field k]
27 variable {n : ℕ}
28 
29 /-- The differential-order Rees ring inside the central polynomial ring over
30 the presented Weyl algebra. -/
31 def orderReesSubring : Subring (Polynomial (PresentedWeyl k n)) where
32   carrier := {f | ∀ N, f.coeff N ∈ orderPiece k n N}
33   zero_mem' := by simp
34   one_mem' := by
35     intro N
36     by_cases hN : N = 0
37     · subst N
38       rw [Polynomial.coeff_one, if_pos rfl]
39       exact (orderPieceOne (n := n) k).property
40     · rw [Polynomial.coeff_one, if_neg hN]
41       exact Submodule.zero_mem _
42   add_mem' := by
43     intro f g hf hg N
44     rw [Polynomial.coeff_add]
45     exact Submodule.add_mem _ (hf N) (hg N)
46   neg_mem' := by
47     intro f hf N
48     rw [Polynomial.coeff_neg]
49     exact Submodule.neg_mem _ (hf N)
50   mul_mem' := by
51     intro f g hf hg N
52     rw [Polynomial.coeff_mul]
53     apply Submodule.sum_mem
54     intro ij hij
55     have hmul := mul_mem_orderPiece k (hf ij.1) (hg ij.2)
56     have hij' : ij.1 + ij.2 = N := Finset.HasAntidiagonal.mem_antidiagonal.mp hij
57     simpa [hij'] using hmul
58 
59 /-- The type of elements of the differential-order Rees ring. -/
60 abbrev OrderReesRing := orderReesSubring (n := n) k
61 
62 @[simp] theorem mem_orderReesSubring_iff
63     (f : Polynomial (PresentedWeyl k n)) :
64     f ∈ orderReesSubring (n := n) k ↔
65       ∀ N, f.coeff N ∈ orderPiece k n N :=
66   Iff.rfl
67 
68 /-- A filtered operator inserted in its declared Rees degree. -/
69 def orderReesMonomial (N : ℕ) (z : orderPiece k n N) :
70     OrderReesRing (n := n) k :=
71   ⟨Polynomial.monomial N (z : PresentedWeyl k n), by
72     intro M
73     rw [Polynomial.coeff_monomial]
74     split_ifs with h
75     · subst M
76       exact z.property
77     · exact Submodule.zero_mem _⟩
78 
79 @[simp] theorem orderReesMonomial_coe (N : ℕ) (z : orderPiece k n N) :
80     ((orderReesMonomial k N z : OrderReesRing (n := n) k) :
81       Polynomial (PresentedWeyl k n)) =
82         Polynomial.monomial N (z : PresentedWeyl k n) :=
83   rfl
84 
85 @[simp] theorem orderReesMonomial_coeff_same
86     (N : ℕ) (z : orderPiece k n N) :
87     ((orderReesMonomial k N z : OrderReesRing (n := n) k) :
88       Polynomial (PresentedWeyl k n)).coeff N = (z : PresentedWeyl k n) := by
89   simp
90 
91 /-- The central Rees parameter `T`, represented in degree one by the unit
92 operator. -/
93 def orderReesParameter : OrderReesRing (n := n) k :=
94   orderReesMonomial k 1
95     ⟨1, presentedWeightPiece_mono k orderWeight (Nat.zero_le 1)
96       (orderPieceOne (n := n) k).property⟩
97 
98 @[simp] theorem orderReesParameter_coe :
99     ((orderReesParameter (n := n) k : OrderReesRing (n := n) k) :
100       Polynomial (PresentedWeyl k n)) = Polynomial.X := by
101   rw [orderReesParameter, orderReesMonomial_coe]
102   exact Polynomial.monomial_one_one_eq_X
103 
104 /-- Multiplication of homogeneous Rees representatives is multiplication in
105 the Weyl algebra, with degrees added. -/
106 theorem orderReesMonomial_mul
107     {N M : ℕ} (z : orderPiece k n N) (y : orderPiece k n M) :
108     orderReesMonomial k N z * orderReesMonomial k M y =
109       orderReesMonomial k (N + M)
110         ⟨(z : PresentedWeyl k n) * (y : PresentedWeyl k n),
111           mul_mem_orderPiece k z.property y.property⟩ := by
112   apply Subtype.ext
113   simp [orderReesMonomial, Polynomial.monomial_mul_monomial]
114 
115 /-- Multiplication by the Rees parameter raises the declared degree and keeps
116 the underlying Weyl operator unchanged. -/
117 theorem orderReesParameter_mul_monomial
118     {N : ℕ} (z : orderPiece k n N) :
119     orderReesParameter (n := n) k * orderReesMonomial k N z =
120       orderReesMonomial k (N + 1)
121         ⟨(z : PresentedWeyl k n),
122           presentedWeightPiece_mono k orderWeight (Nat.le_succ N) z.property⟩ := by
123   apply Subtype.ext
124   simp [orderReesParameter_coe, orderReesMonomial,
125     Polynomial.X_mul_monomial, Nat.add_comm]
126 
127 /-- The polynomial Rees parameter is central, including over the
128 noncommutative Weyl coefficient ring. -/
129 theorem orderReesParameter_mul_comm
130     (r : OrderReesRing (n := n) k) :
131     orderReesParameter (n := n) k * r =
132       r * orderReesParameter (n := n) k := by
133   apply Subtype.ext
134   change Polynomial.X * (r : Polynomial (PresentedWeyl k n)) =
135     (r : Polynomial (PresentedWeyl k n)) * Polynomial.X
136   exact Polynomial.X_mul
137 
138 /-- A homogeneous class in positive Rees degree is divisible by the Rees
139 parameter exactly when its coefficient already lies one filtration step
140 lower.  This is the degreewise kernel statement behind specialization at
141 `T = 0`. -/
142 theorem exists_parameter_mul_eq_monomial_iff_mem_lower
143     {N : ℕ} (z : orderPiece k n (N + 1)) :
144     (∃ r : OrderReesRing (n := n) k,
145         orderReesParameter (n := n) k * r =
146           orderReesMonomial k (N + 1) z) ↔
147       (z : PresentedWeyl k n) ∈ orderPiece k n N := by
148   constructor
149   · rintro ⟨r, hr⟩
150     have hc := congrArg
151       (fun p : Polynomial (PresentedWeyl k n) => p.coeff (N + 1))
152       (congrArg Subtype.val hr)
153     change (Polynomial.X * (r : Polynomial (PresentedWeyl k n))).coeff
154         (N + 1) =
155       (Polynomial.monomial (N + 1) (z : PresentedWeyl k n)).coeff
156         (N + 1) at hc
157     rw [Polynomial.coeff_X_mul, Polynomial.coeff_monomial, if_pos rfl] at hc
158     rw [← hc]
159     exact r.property N
160   · intro hz
161     let zLower : orderPiece k n N := ⟨z, hz⟩
162     refine ⟨orderReesMonomial k N zLower, ?_⟩
163     rw [orderReesParameter_mul_monomial]
164 
165 /-- In Rees degree zero, a homogeneous representative is a parameter multiple
166 only when it is zero. -/
167 theorem exists_parameter_mul_eq_degreeZero_iff
168     (z : orderPiece k n 0) :
169     (∃ r : OrderReesRing (n := n) k,
170         orderReesParameter (n := n) k * r = orderReesMonomial k 0 z) ↔
171       (z : PresentedWeyl k n) = 0 := by
172   constructor
173   · rintro ⟨r, hr⟩
174     have hc := congrArg
175       (fun p : Polynomial (PresentedWeyl k n) => p.coeff 0)
176       (congrArg Subtype.val hr)
177     change (Polynomial.X * (r : Polynomial (PresentedWeyl k n))).coeff 0 =
178       (Polynomial.monomial 0 (z : PresentedWeyl k n)).coeff 0 at hc
179     simpa using hc.symm
180   · intro hz
181     have hz' : z = 0 := Subtype.ext hz
182     subst z
183     refine ⟨0, ?_⟩
184     apply Subtype.ext
185     simp [orderReesMonomial]
186 
187 #print axioms orderReesSubring
188 #print axioms orderReesMonomial
189 #print axioms orderReesParameter
190 #print axioms orderReesMonomial_mul
191 #print axioms orderReesParameter_mul_monomial
192 #print axioms orderReesParameter_mul_comm
193 #print axioms exists_parameter_mul_eq_monomial_iff_mem_lower
194 #print axioms exists_parameter_mul_eq_degreeZero_iff
195 
196 end
197 
198 end Stafford38.WeylOrderRees
199