Stafford38/Characteristic/CanonicalUnitPreimageFromInitialTop.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Stafford38.Characteristic.CanonicalUnitCoordinatePreimage
3 
4 @[expose] public section
5 
6 /-!
7 # A strict unit preimage from degree-zero initial-ideal generation
8 
9 If the canonical order initial ideal and the distinguished coordinate symbol
10 generate the unit ideal, the degree-zero homogeneous part of that identity is
11 an exact order-symbol relation.  An exact filtered representative of that
12 relation differs from `y * x - 1` by the strict lower order piece in degree
13 zero, which is zero.  This produces the literal order-zero coordinate
14 predecessor required by `StrictUnitCoordinatePreimage`.
15 
16 No noncharacteristic or characteristic-variety theorem is used here.
17 -/
18 
19 namespace Stafford38.CanonicalUnitPreimageFromInitialTop
20 
21 open Stafford38.CanonicalAxisAvoidanceConsumer
22 open Stafford38.CanonicalUnitCoordinatePreimage
23 open Stafford38.Characteristic
24 open Stafford38.CharacteristicAssociatedGradedModule
25 open Stafford38.CharacteristicFilteredQuotient
26 open Stafford38.CharacteristicInitialIdeal
27 open Stafford38.CharacteristicInitialIdealHomogeneous
28 open Stafford38.EulerSurjectivity
29 open Stafford38.WeylAssociatedGraded
30 open Stafford38.WeylFiltration
31 open Stafford38.WeylIteratedEquivalence
32 open Stafford38.WeylLeadingSymbol
33 open Stafford38.WeylEulerResidue
34 
35 noncomputable section
36 
37 set_option maxHeartbeats 1200000
38 set_option synthInstance.maxHeartbeats 200000
39 
40 universe u
41 
42 variable (k : Type u) [Field k] [Algebra ℚ k]
43 
44 abbrev CanonicalIdeal (n N : ℕ)
45     (d : PresentedWeyl k (n + 1)) :=
46   canonicalRightIdeal (presentedCoordinate k n) d N
47 
48 abbrev OrderHomogeneous (n N : ℕ) :=
49   MvPolynomial.weightedHomogeneousSubmodule k (@orderWeight n) N
50 
51 abbrev orderDecomposition (n : ℕ) :=
52   MvPolynomial.weightedHomogeneousSubmodule k (@orderWeight n)
53 
54 local instance orderGradedAlgebraInstance (n : ℕ) :
55     GradedAlgebra (orderDecomposition k n) :=
56   MvPolynomial.weightedGradedAlgebra k (@orderWeight n)
57 
58 /-- The converse needed by the terminal cancellation route: unit generation
59 in the order initial ideal yields an actual order-zero coordinate predecessor
60 of the unit in the canonical right quotient. -/
61 theorem strictUnitCoordinatePreimage_of_orderInitialIdeal_sup_coordinate_eq_top
62     (n N : ℕ) {d : PresentedWeyl k (n + 1)}
63     (htop :
64       orderInitialIdeal k (CanonicalIdeal k n N d) ⊔
65         Ideal.span {MvPolynomial.X (.inl (0 : Fin (n + 1)))} = ⊤) :
66     StrictUnitCoordinatePreimage k n N d := by
67   classical
68   let I := CanonicalIdeal k n N d
69   let x := presentedCoordinate k n
70   let X : OrderHomogeneous k (n + 1) 0 :=
71     principalComponentOnPiece k (@orderWeight (n + 1)) 0
72       ⟨x, presentedCoordinate_mem_orderPiece_zero k n⟩
73   have hX : (X : SymbolRing k (n + 1)) =
74       MvPolynomial.X (.inl (0 : Fin (n + 1))) := by
75     exact coe_coordinate_order_symbol k n
76   have honeSup : (1 : SymbolRing k (n + 1)) ∈
77       orderInitialIdeal k I ⊔
78         Ideal.span {MvPolynomial.X (.inl (0 : Fin (n + 1)))} := by
79     rw [show orderInitialIdeal k I ⊔
80         Ideal.span {MvPolynomial.X (.inl (0 : Fin (n + 1)))} = ⊤ by
81       simpa [I] using htop]
82     exact Submodule.mem_top
83   obtain ⟨j, hj, s, hs, hjs⟩ := Submodule.mem_sup.mp honeSup
84   obtain ⟨a, ha⟩ := (Ideal.mem_span_singleton.mp hs)
85   have hsEq : s = a * (X : SymbolRing k (n + 1)) := by
86     calc
87       s = MvPolynomial.X (.inl (0 : Fin (n + 1))) * a := ha
88       _ = a * MvPolynomial.X (.inl (0 : Fin (n + 1))) := mul_comm _ _
89       _ = a * (X : SymbolRing k (n + 1)) := by rw [hX]
90   have hrelationInitial : s - 1 ∈ orderInitialIdeal k I := by
91     have hsj : s - 1 = -j := by
92       rw [← hjs]
93       abel
94     rw [hsj]
95     exact (orderInitialIdeal k I).neg_mem hj
96   let A₀ : OrderHomogeneous k (n + 1) 0 :=
97     DirectSum.decompose (orderDecomposition k (n + 1)) a 0
98   let oneH : OrderHomogeneous k (n + 1) 0 :=
99     ⟨1, MvPolynomial.isWeightedHomogeneous_one k orderWeight⟩
100   have hprod :
101       (A₀ : SymbolRing k (n + 1)) * (X : SymbolRing k (n + 1)) ∈
102         MvPolynomial.weightedHomogeneousSubmodule k
103           (@orderWeight (n + 1)) 0 := by
104     simpa using A₀.property.mul X.property
105   have hdiffHom :
106       (A₀ : SymbolRing k (n + 1)) * (X : SymbolRing k (n + 1)) - 1 ∈
107         MvPolynomial.weightedHomogeneousSubmodule k
108           (@orderWeight (n + 1)) 0 :=
109     (MvPolynomial.weightedHomogeneousSubmodule k
110       (@orderWeight (n + 1)) 0).sub_mem hprod oneH.property
111   have hcomponent :
112       DirectSum.decompose (orderDecomposition k (n + 1)) (s - 1) 0 =
113         ⟨(A₀ : SymbolRing k (n + 1)) * (X : SymbolRing k (n + 1)) - 1,
114           hdiffHom⟩ := by
115     apply Subtype.ext
116     rw [DirectSum.decompose_sub, hsEq]
117     have hmul := DirectSum.coe_decompose_mul_of_right_mem_of_le
118       (orderDecomposition k (n + 1)) X.property (Nat.zero_le 0)
119       (a := a) (n := 0)
120     change ((DirectSum.decompose (orderDecomposition k (n + 1))
121         (a * (X : SymbolRing k (n + 1))) 0 :
122           OrderHomogeneous k (n + 1) 0) : SymbolRing k (n + 1)) -
123         ((DirectSum.decompose (orderDecomposition k (n + 1))
124           (1 : SymbolRing k (n + 1)) 0 :
125             OrderHomogeneous k (n + 1) 0) : SymbolRing k (n + 1)) = _
126     rw [hmul]
127     have honeDecomp :
128         DirectSum.decompose (orderDecomposition k (n + 1))
129             (1 : SymbolRing k (n + 1)) 0 = oneH := by
130       change DirectSum.decompose (orderDecomposition k (n + 1))
131           (oneH : SymbolRing k (n + 1)) 0 = oneH
132       simp only [DirectSum.decompose_coe, DirectSum.of_eq_same]
133     rw [honeDecomp]
134   have hcomponentRelation :
135       DirectSum.decompose (orderDecomposition k (n + 1)) (s - 1) 0 ∈
136         orderSymbolRelation k I 0 :=
137     decompose_mem_orderSymbolRelation_of_mem_orderInitialIdeal
138       k I (s - 1) hrelationInitial 0
139   rw [hcomponent] at hcomponentRelation
140   obtain ⟨yPiece, hySymbol⟩ :=
141     principalComponentOnPiece_surjective k (@orderWeight (n + 1)) A₀
142   let y : PresentedWeyl k (n + 1) := yPiece
143   have hy : y ∈ orderPiece k (n + 1) 0 := yPiece.property
144   have hx : x ∈ orderPiece k (n + 1) 0 :=
145     presentedCoordinate_mem_orderPiece_zero k n
146   have hyxOne : y * x - 1 ∈ orderPiece k (n + 1) 0 :=
147     (orderPiece k (n + 1) 0).sub_mem
148       (mul_mem_orderPiece k hy hx)
149       (orderPieceOne (n := n + 1) k).property
150   let relationH : OrderHomogeneous k (n + 1) 0 :=
151     ⟨(A₀ : SymbolRing k (n + 1)) * (X : SymbolRing k (n + 1)) - 1,
152       hdiffHom⟩
153   have hrelationH : relationH ∈ orderSymbolRelation k I 0 := by
154     exact hcomponentRelation
155   obtain ⟨z, hz, hzI, hzSymbol⟩ :=
156     (mem_orderSymbolRelation_iff k I 0 relationH).mp hrelationH
157   have hpcEq :
158       principalComponentOnPiece k (@orderWeight (n + 1)) 0
159           ⟨y * x - 1, hyxOne⟩ =
160         principalComponentOnPiece k (@orderWeight (n + 1)) 0 ⟨z, hz⟩ := by
161     rw [← hzSymbol]
162     apply Subtype.ext
163     change presentedPrincipalComponent k orderWeight 0 (y * x - 1) =
164       (relationH : SymbolRing k (n + 1))
165     rw [map_sub, presentedPrincipalComponent_mul_order k hy hx]
166     have honePC : presentedPrincipalComponent k orderWeight 0
167         (1 : PresentedWeyl k (n + 1)) = 1 := by
168       change presentedPrincipalComponent k orderWeight 0
169           ((orderPieceOne (n := n + 1) k : orderPiece k (n + 1) 0) :
170             PresentedWeyl k (n + 1)) = 1
171       exact presentedPrincipalComponent_orderPieceOne (n := n + 1) k
172     rw [honePC]
173     change presentedPrincipalComponent k orderWeight 0 y *
174         presentedPrincipalComponent k orderWeight 0 x - 1 = _
175     rw [show presentedPrincipalComponent k orderWeight 0 y =
176         (A₀ : SymbolRing k (n + 1)) by
177       exact congrArg Subtype.val hySymbol]
178     change (A₀ : SymbolRing k (n + 1)) *
179         presentedPrincipalComponent k orderWeight 0 x - 1 = _
180     rw [show presentedPrincipalComponent k orderWeight 0 x =
181         (X : SymbolRing k (n + 1)) by rfl]
182   have heq : y * x - 1 = z := by
183     have hdiffPiece : y * x - 1 - z ∈ orderPiece k (n + 1) 0 :=
184       (orderPiece k (n + 1) 0).sub_mem hyxOne hz
185     have hzero : presentedPrincipalComponent k orderWeight 0
186         (y * x - 1 - z) = 0 := by
187       rw [map_sub]
188       exact sub_eq_zero.mpr (congrArg
189         (fun q : OrderHomogeneous k (n + 1) 0 =>
190           (q : SymbolRing k (n + 1))) hpcEq)
191     have hlower := (presentedPrincipalComponent_eq_zero_iff_mem_strictLower
192       k (@orderWeight (n + 1)) (y * x - 1 - z) hdiffPiece).mp hzero
193     change y * x - 1 - z ∈ (⊥ : Submodule k (PresentedWeyl k (n + 1))) at hlower
194     rw [Submodule.mem_bot] at hlower
195     exact sub_eq_zero.mp hlower
196   refine ⟨y, hy, ?_⟩
197   apply (Submodule.Quotient.eq I).2
198   change y * x - 1 ∈ I
199   rw [heq]
200   exact hzI
201 
202 #print axioms strictUnitCoordinatePreimage_of_orderInitialIdeal_sup_coordinate_eq_top
203 
204 end
205 
206 end Stafford38.CanonicalUnitPreimageFromInitialTop
207