Stafford38/Paper/Section6/Proof.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 
3 public import Stafford38.Paper.Section6.BaseChange
4 public import Stafford38.Paper.Section5.Exclusion
5 public import Stafford38.Characteristic.InitialIdealHomogeneous
6 public import Stafford38.Geometry.FibreConicalVanishingIdeal
7 public import Mathlib.FieldTheory.IsAlgClosed.AlgebraicClosure
8 
9 @[expose] public section
10 
11 /-!
12 # Section 6: the proof of Theorem 1.1, paragraph by paragraph (tex 1531–1597)
13 
14 For `d̃` in the normal form (3.1) with `N = deg_B d̃ ≥ 1` the paper shows
15 `Q = A_n(k)/𝓘 = 0`.  It passes to an algebraically closed `K ⊇ k`
16 (`K = k̄`), sets `W = V_K(Ann_{K[x,ξ]} gr Q_K)`, the closed points of
17 `Char(Q_K)`, checks the six hypotheses of Theorem 5.8 for `W` and
18 `P = σ_N^ord(d̃)` (one `step_W_*` per bullet), and concludes `W = ∅`, hence
19 `gr Q_K = 0`, `Q_K = 0` and `Q = 0`.
20 
21 The steps are stated for any algebraically closed `K` of characteristic zero
22 over `k`; `theorem_6_Q_eq_zero` takes `K = AlgebraicClosure k`.  A point
23 `(y, ξ) ∈ K^n × (K^n)^*` is a function `q : PhaseVar (n+1) → K`; `y₁` is
24 `q (Sum.inl 0)`, and `π⁻¹(H) = {y₁ = 0}`.
25 -/
26 
27 namespace Stafford38.Paper.Section6
28 
29 open Stafford38.Characteristic
30 open Stafford38.CharacteristicAssociatedGradedModule
31 open Stafford38.CharacteristicEmptySupportVanishing
32 open Stafford38.CharacteristicFilteredQuotient
33 open Stafford38.CharacteristicInitialIdeal
34 open Stafford38.CharacteristicInitialIdealHomogeneous
35 open Stafford38.CharacteristicHomogeneousChart
36 open Stafford38.Geometry.CoisotropicTranslation
37 open Stafford38.Geometry.FibreConicalVanishingIdeal
38 open Stafford38.WeylFiltration
39 open Stafford38.WeylIteratedEquivalence
40 open Stafford38.WeylLeadingSymbol
41 open Stafford38.Weyl.PresentedScalarExtension
42 open Stafford38.Paper.Section2
43 open Stafford38.Paper.Section3
44 
45 noncomputable section
46 
47 universe u v
48 
49 variable {k : Type u} {K : Type v} [Field k] [Field K] [Algebra k K]
50 
51 /-- `W = V_K(Ann_{K[x,ξ]} gr Q_K) ⊆ K^n × (K^n)^*`. -/
52 abbrev W (K : Type v) [Field K] [Algebra k K] {n : ℕ} (N : ℕ) (dt : PresentedWeyl k (n + 1)) :
53     Set (PhaseVar (n + 1) → K) :=
54   VK K (Module.annihilator (SymbolRing K (n + 1)) (grQ K N (dtK K dt)))
55 
56 /-- `W` is the set of closed points of `Char(Q_K)` (Theorem 2.12(a)), with
57 vanishing ideal `I(W) = √(Ann gr Q_K)` (Theorem 2.12(c)). -/
58 theorem step_W_closed_points [IsAlgClosed K] {n N : ℕ} (dt : PresentedWeyl k (n + 1)) :
59     (∀ q, q ∈ W K N dt ↔ closedPoint K q ∈ Section2.Char K (idealI K N (dtK K dt))) ∧
60       vanishingIdealOf K (W K N dt) =
61         (Module.annihilator (SymbolRing K (n + 1)) (grQ K N (dtK K dt))).radical :=
62   ⟨fun q => by rw [Section2.Char_eq]; exact (theorem_2_12 K _).1.2.2 q, (theorem_2_12 K _).2.2⟩
63 
64 /-- **Bullet 1.** `W` is Zariski closed, the zero set of an ideal. -/
65 theorem step_W_closed {n N : ℕ} (dt : PresentedWeyl k (n + 1)) :
66     ∃ L : Ideal (SymbolRing K (n + 1)), W K N dt = MvPolynomial.zeroLocus K L :=
67   ⟨_, VK_eq_zeroLocus K _⟩
68 
69 local instance orderGradedAlgebraInstance {n : ℕ} :
70     GradedAlgebra (MvPolynomial.weightedHomogeneousSubmodule K (@orderWeight n)) :=
71   MvPolynomial.weightedGradedAlgebra K (@orderWeight n)
72 
73 /-- "The module `gr Q_K` is graded by the order filtration, which assigns
74 degree `0` to the `x_i` and degree `1` to the `ξ_i`; so `Ann gr Q_K` is
75 homogeneous in `ξ`": a homogeneous `g_d` of degree `d` maps the degree-`0`
76 generator `q̄` into degree `d`, so `g q̄ = 0` forces `g_d q̄ = 0` for every
77 component, and `gr Q_K` is generated by `q̄`. -/
78 theorem step_annihilator_homogeneous {n N : ℕ} (dt : PresentedWeyl k (n + 1)) :
79     (Module.annihilator (SymbolRing K (n + 1)) (grQ K N (dtK K dt))).IsHomogeneous
80       (MvPolynomial.weightedHomogeneousSubmodule K (@orderWeight (n + 1))) := by
81   classical
82   let I := idealI K N (dtK K dt)
83   let 𝒜 := MvPolynomial.weightedHomogeneousSubmodule K (@orderWeight (n + 1))
84   let x0 := orderPieceToQuotientGraded K I 0 (orderPieceOne (n := n + 1) K)
85   have hq : qBar K I = orderAssociatedGradedOf K I 0 x0 := rfl
86   -- `π_e`, the degree-`e` component of `gr Q_K = ⊕_e Q_{K,e}/Q_{K,e-1}`.
87   let π : ∀ e : ℕ, OrderAssociatedGradedModule K I →+ QuotientOrderGradedPiece K I e :=
88     fun e => { toFun := fun z =>
89                 (show Stafford38.CharacteristicFilteredQuotientGraded.QuotientOrderAssociatedGraded
90                   K I from z) e
91                map_zero' := rfl
92                map_add' := fun _ _ => rfl }
93   have hπ : ∀ e j (x : QuotientOrderGradedPiece K I j),
94       π e (orderAssociatedGradedOf K I j x) = if h : j = e then h ▸ x else 0 := by
95     intro e j x
96     change (DirectSum.of _ j x : DirectSum ℕ _) e = _
97     rw [DirectSum.of_apply]
98   -- The degree-`(0 + d)` component of `g q̄` is `g_d q̄`.
99   have hcomp : ∀ (g : SymbolRing K (n + 1)) (d : ℕ),
100       ((DirectSum.decompose 𝒜 g d : SymbolRing K (n + 1))) • qBar K I =
101         orderAssociatedGradedOf K I (0 + d) (π (0 + d) (g • qBar K I)) := by
102     intro g d
103     rw [hq, smul_orderAssociatedGradedOf_eq_of_homogeneousAction]
104     congr 1
105     conv_rhs => rw [← DirectSum.sum_support_decompose 𝒜 g]
106     rw [Finset.sum_smul, map_sum]
107     simp_rw [smul_orderAssociatedGradedOf_eq_of_homogeneousAction, hπ]
108     by_cases hd : d ∈ (DirectSum.decompose 𝒜 g).support
109     · rw [Finset.sum_eq_single d]
110       · simp
111       · intro i _ hid
112         exact dite_eq_right_iff.mpr fun h => absurd h (by omega)
113       · exact fun h => absurd hd h
114     · have hact : CharacteristicFilteredQuotientGraded.quotientOrderHomogeneousAction K I
115           (0 : 𝒜 d) x0 = 0 := by
116         have h0 := smul_orderAssociatedGradedOf_eq_of_homogeneousAction K I (0 : 𝒜 d) x0
117         rw [Submodule.coe_zero, zero_smul] at h0
118         exact DirectSum.of_injective (β := QuotientOrderGradedPiece K I) (0 + d)
119           (h0.symm.trans (map_zero (DirectSum.of (QuotientOrderGradedPiece K I) (0 + d))).symm)
120       rw [DFinsupp.notMem_support_iff.mp hd, hact, Finset.sum_eq_zero]
121       intro i hi
122       exact dite_eq_right_iff.mpr fun h => absurd (show i = d by omega ▸ hi) hd
123   intro d g hg
124   rw [Module.mem_annihilator] at hg ⊢
125   intro m
126   obtain ⟨h, rfl⟩ := grCyclic_generated K I m
127   rw [smul_comm, hcomp, hg, map_zero]
128   have h0 : orderAssociatedGradedOf K I (0 + d) 0 = (0 : OrderAssociatedGradedModule K I) :=
129     map_zero _
130   rw [h0]
131   exact smul_zero h
132 
133 /-- **Bullet 2.** `W` is fibre-conical: for `g ∈ Ann gr Q_K` and `(y, ξ) ∈ W`,
134 `g(y, tξ) = ∑_d t^d g_d(y, ξ) = 0`, as every `ξ`-homogeneous component `g_d`
135 lies in `Ann gr Q_K`. -/
136 theorem step_W_fibreConical [IsAlgClosed K] [CharZero K] {n N : ℕ} (dt : PresentedWeyl k (n + 1)) :
137     IsFibreConical (W K N dt) := by
138   have hhom := step_annihilator_homogeneous (K := K) (N := N) dt
139   rw [W, VK_eq_zeroLocus]
140   intro q hq a _
141   let y : Fin (n + 1) → K := fun i => q (.inl i)
142   let ξ : Fin (n + 1) → K := fun i => q (.inr i)
143   have hqsplit : q = Sum.elim y ξ := by
144     funext i
145     rcases i with i | i <;> rfl
146   have hline (f : SymbolRing K (n + 1))
147       (hf : f ∈ Module.annihilator (SymbolRing K (n + 1)) (grQ K N (dtK K dt))) :
148       fibreLinePolynomial y ξ f = 0 := by
149     apply Polynomial.ext
150     intro d
151     rw [coeff_fibreLinePolynomial_eq_eval_weightedHomogeneousComponent, ← hqsplit]
152     exact (MvPolynomial.mem_zeroLocus_iff.mp hq) _ (hhom d hf)
153   intro f hf
154   have heval := eval_fibreLinePolynomial y ξ f a
155   rw [hline f hf, Polynomial.eval_zero] at heval
156   simpa [y, ξ] using heval.symm
157 
158 /-- **Bullet 3.** `I(W)` is involutive, by Gabber's theorem (Theorem 2.11)
159 and `I(W) = √(Ann gr Q_K)`. -/
160 theorem step_W_involutive [IsAlgClosed K] [CharZero K] {n N : ℕ}
161     (dt : PresentedWeyl k (n + 1)) :
162     IsInvolutiveSet K (W K N dt) := by
163   rw [IsInvolutiveSet, (step_W_closed_points (K := K) (N := N) dt).2]
164   exact theorem_2_11_cyclic K (n + 1) (idealI K N (dtK K dt))
165 
166 /-- **Bullet 4.** By (3.5) (Proposition 3.6), `P ∈ Ann_{k[x,ξ]} gr Q`, hence
167 `P ∈ Ann_{K[x,ξ]} gr Q_K` by Lemma 6.2, so `P` vanishes on `W`.  Here
168 `σ_N^ord(d̃) = P(ξ)` with `P ∈ k[ξ]` (Lemma 3.5), regarded in `K[ξ]`. -/
169 theorem step_W_P_vanishes {n N : ℕ} {dt : PresentedWeyl k (n + 1)}
170     (hform : IsMonicNormalForm k N dt) (hdeg : bernsteinDegree k dt = N)
171     {P : MvPolynomial (Fin (n + 1)) k} (hP : orderSymbol k N dt = MvPolynomial.rename Sum.inr P) :
172     ∀ q ∈ W K N dt, MvPolynomial.eval (fun i => q (.inr i))
173       (MvPolynomial.map (algebraMap k K) P) = 0 := by
174   intro q hq
175   have hAnn := proposition_3_6 k hform hdeg
176   have hAnnK : σ k K n (orderSymbol k N dt) ∈
177       Module.annihilator (SymbolRing K (n + 1)) (grQ K N (dtK K dt)) := by
178     rw [(lemma_6_2 (K := K) (N := N) dt).2.1]
179     exact Ideal.mem_map_of_mem _ hAnn
180   have h := hq _ hAnnK
181   rw [hP, σ, AlgHom.toRingHom_eq_coe, AlgHom.coe_toRingHom, symbolScalarExtension_apply,
182     MvPolynomial.map_rename, MvPolynomial.eval_rename] at h
183   exact h
184 
185 /-- **Bullet 5.** By (3.4) (Lemma 3.5), `P(1, 0, …, 0) = 1 ≠ 0`. -/
186 theorem step_W_P_axis {n N : ℕ} {dt : PresentedWeyl k (n + 1)}
187     (hform : IsMonicNormalForm k N dt) (hdeg : bernsteinDegree k dt = N)
188     {P : MvPolynomial (Fin (n + 1)) k} (hP : orderSymbol k N dt = MvPolynomial.rename Sum.inr P) :
189     MvPolynomial.eval (fun i : Fin (n + 1) => if i = ⟨0, Nat.succ_pos n⟩ then (1 : K) else 0)
190       (MvPolynomial.map (algebraMap k K) P) = 1 := by
191   have h := lemma_3_5_eval_axis k hform hdeg
192   rw [hP, MvPolynomial.eval_rename] at h
193   have hpt : (fun i : Fin (n + 1) => if i = ⟨0, Nat.succ_pos n⟩ then (1 : K) else 0) =
194       algebraMap k K ∘ (axisPoint k (.inr (0 : Fin (n + 1))) ∘ Sum.inr) := by
195     funext i
196     by_cases hi : i = 0 <;> simp [axisPoint, hi]
197   have hcomp := MvPolynomial.eval₂_comp_left (algebraMap k K) (RingHom.id k)
198     (axisPoint k (.inr (0 : Fin (n + 1))) ∘ Sum.inr) P
199   rw [RingHom.comp_id] at hcomp
200   rw [hpt, MvPolynomial.eval_map, ← hcomp]
201   change algebraMap k K (MvPolynomial.eval _ P) = 1
202   rw [h, map_one]
203 
204 
205 /-- `V(x₁) ⊆ Spec K[x,ξ]` is the preimage of `V(x₁) ⊆ Spec k[x,ξ]`. -/
206 theorem step_Vx₁_preimage {n : ℕ} :
207     Vx₁ K n = PrimeSpectrum.comap (σ k K n) ⁻¹' Vx₁ k n := by
208   ext p
209   simp only [Set.mem_preimage, Vx₁, mem_V_iff, Ideal.span_singleton_le_iff_mem,
210     PrimeSpectrum.comap_asIdeal, Ideal.mem_comap]
211   change _ ↔ MvPolynomial.map (algebraMap k K) (MvPolynomial.X _) ∈ p.asIdeal
212   rw [MvPolynomial.map_X]
213 
214 /-- **Bullet 6, first part.** `Char(Q_K)` and `V(x₁)` are the preimages of
215 `Char(Q)` and `V(x₁)` under `Spec K[x,ξ] → Spec k[x,ξ]` (Lemma 6.2), and
216 preimages commute with intersections, so Proposition 6.1 gives
217 `Char(Q_K) ∩ V(x₁) = ∅`. -/
218 theorem step_char_K_avoids [CharZero k] {n N : ℕ} {dt : PresentedWeyl k (n + 1)}
219     (hN : 0 < N) (hform : IsMonicNormalForm k N dt) :
220     Section2.Char K (idealI K N (dtK K dt)) ∩ Vx₁ K n = ∅ := by
221   rw [(lemma_6_2 (K := K) (N := N) dt).2.2.2, step_Vx₁_preimage (k := k), ← Set.preimage_inter,
222     proposition_6_1 hN hform, Set.preimage_empty]
223 
224 /-- **Bullet 6, second part.** By Definition 2.6 a closed point
225 `𝔪_{(y,ξ)}` lies in `V(x₁)` iff `y₁ = 0`, so the closed points of `V(x₁)` form
226 `π⁻¹(H) = H × (K^n)^*`. -/
227 theorem step_closedPoint_mem_Vx₁ {n : ℕ} (q : PhaseVar (n + 1) → K) :
228     closedPoint K q ∈ Vx₁ K n ↔ q (.inl (0 : Fin (n + 1))) = 0 := by
229   rw [Vx₁, mem_V_iff, Ideal.span_singleton_le_iff_mem]
230   change x₁Symbol K n ∈ maxIdealAt K q ↔ _
231   rw [mem_maxIdealAt_iff, MvPolynomial.eval_X]
232 
233 /-- **Bullet 6.** The closed points of `Char(Q_K) ∩ V(x₁)` are
234 `W ∩ π⁻¹(H)`, hence `W ∩ π⁻¹(H) = ∅` (`π = proj`, Definition 2.5). -/
235 theorem step_W_avoids_H [IsAlgClosed K] [CharZero k] {n N : ℕ} {dt : PresentedWeyl k (n + 1)}
236     (hN : 0 < N) (hform : IsMonicNormalForm k N dt) :
237     W K N dt ∩ proj ⁻¹' {y : Fin (n + 1) → K | y ⟨0, Nat.succ_pos n⟩ = 0} = ∅ := by
238   ext q
239   simp only [Set.mem_inter_iff, Set.mem_preimage, Set.mem_ofPred_eq, Set.mem_empty_iff_false,
240     iff_false]
241   rintro ⟨hqW, hq1⟩
242   have hmem : closedPoint K q ∈ Section2.Char K (idealI K N (dtK K dt)) ∩ Vx₁ K n :=
243     ⟨((step_W_closed_points (K := K) (N := N) dt).1 q).1 hqW,
244       (step_closedPoint_mem_Vx₁ q).2 hq1⟩
245   rw [step_char_K_avoids hN hform] at hmem
246   exact hmem
247 
248 /-- **Theorem 5.8 applies:** `W = ∅`. -/
249 theorem step_W_empty [IsAlgClosed K] [CharZero K] [CharZero k] {n N : ℕ}
250     {dt : PresentedWeyl k (n + 1)} (hN : 0 < N) (hform : IsMonicNormalForm k N dt)
251     (hdeg : bernsteinDegree k dt = N) :
252     W K N dt = ∅ := by
253   obtain ⟨-, P, hP, -⟩ := lemma_3_5 k hform hdeg
254   have hinv : Stafford38.Characteristic.PostScalarExtensionPoisson.IsInvolutive
255       (MvPolynomial.vanishingIdeal K (W K N dt)) :=
256     (isInvolutive_iff K _).1 (step_W_involutive (K := K) (N := N) dt)
257   exact Stafford38.Paper.Section5.theorem_5_8 (Nat.succ_pos n) (W K N dt)
258     (step_W_closed dt) (step_W_fibreConical dt) hinv
259     (MvPolynomial.map (algebraMap k K) P)
260     (by rw [step_W_P_axis hform hdeg hP]; exact one_ne_zero)
261     (step_W_P_vanishes hform hdeg hP) (step_W_avoids_H hN hform)
262 
263 /-- As `K` is algebraically closed, `W = ∅` gives `1 ∈ Ann gr Q_K`
264 (Theorem 2.12(b)), so `gr Q_K = 0`. -/
265 theorem step_grQK_zero [IsAlgClosed K] {n N : ℕ} {dt : PresentedWeyl k (n + 1)}
266     (hW : W K N dt = ∅) :
267     Subsingleton (grQ K N (dtK K dt)) := by
268   have h1 := (theorem_2_12 K _).2.1.1 hW
269   refine ⟨fun a b => ?_⟩
270   rw [← one_smul (SymbolRing K (n + 1)) a, ← one_smul (SymbolRing K (n + 1)) b,
271     Module.mem_annihilator.mp h1, Module.mem_annihilator.mp h1]
272 
273 omit [Field K] [Algebra k K] in
274 /-- An exhaustive filtration `M_0 ⊆ M_1 ⊆ …` with `M_{-1} = 0` and
275 `gr M = ⊕_m M_m/M_{m-1} = 0` has `M = 0`: by induction on `m`, `M_m = M_{m-1} = 0`. -/
276 theorem step_filtration_zero {F : Type v} [Field F] {M : Type*} [AddCommGroup M] [Module F M]
277     (Mf : ℕ → Submodule F M) (hex : ∀ x : M, ∃ i, x ∈ Mf i)
278     (hgr : Subsingleton (Section2.gr Mf)) : Subsingleton M := by
279   classical
280   have hpiece : ∀ m (x : Mf m), x ∈ (lowerPiece Mf m).comap (Mf m).subtype := fun m x => by
281     rw [← Submodule.Quotient.mk_eq_zero]
282     apply DirectSum.of_injective (β := grPiece Mf) m
283     rw [map_zero]
284     exact Subsingleton.elim _ _
285   have hzero : ∀ m, Mf m = ⊥ := by
286     intro m
287     induction m with
288     | zero =>
289         rw [eq_bot_iff]
290         intro x hx
291         simpa [lowerPiece] using hpiece 0 ⟨x, hx⟩
292     | succ m ih =>
293         rw [eq_bot_iff]
294         intro x hx
295         have h := hpiece (m + 1) ⟨x, hx⟩
296         change x ∈ Mf m at h
297         rw [ih] at h
298         exact h
299   refine ⟨fun a b => ?_⟩
300   obtain ⟨i, hi⟩ := hex a
301   obtain ⟨j, hj⟩ := hex b
302   rw [hzero, Submodule.mem_bot] at hi hj
303   rw [hi, hj]
304 
305 /-- "Since the filtration of `Q_K` is exhaustive with `Q_{K,-1} = 0`,
306 induction on `m` implies `Q_{K,m} = 0` for all `m`, so `Q_K = 0`": `gr Q_K` is
307 the associated graded module of `Q_{K,m} = qF_mA_n(K)` (`grCyclicEquiv`). -/
308 theorem step_QK_zero {n N : ℕ} {dt : PresentedWeyl k (n + 1)}
309     (h : Subsingleton (grQ K N (dtK K dt))) :
310     Subsingleton (Q K N (dtK K dt)) :=
311   step_filtration_zero _ (cyclicFiltration_order_isCompatible K _).exhaustive
312     ((grCyclicEquiv K (idealI K N (dtK K dt))).toEquiv.symm.subsingleton)
313 
314 /-- **Body of the proof of Theorem 1.1.** For `d̃` in the normal form (3.1)
315 with `N = deg_B d̃ ≥ 1`, `Q = A_n(k)/(d̃A_n(k) + x₁^N d̃A_n(k)) = 0`.  With
316 `K = k̄`: `W = ∅` by Theorem 5.8, so `gr Q_K = 0`, `Q_K = 0`, and `Q = 0` by
317 Lemma 6.2. -/
318 theorem theorem_6_Q_eq_zero [CharZero k] {n N : ℕ} {dt : PresentedWeyl k (n + 1)}
319     (hN : 0 < N) (hform : IsMonicNormalForm k N dt) (hdeg : bernsteinDegree k dt = N) :
320     Subsingleton (Q k N dt) := by
321   let K := AlgebraicClosure k
322   have : CharZero K := charZero_of_injective_algebraMap (algebraMap k K).injective
323   have hW := step_W_empty (K := K) hN hform hdeg
324   exact ((lemma_6_2 (K := K) (N := N) dt).2.2.1).2 (step_QK_zero (step_grQK_zero hW))
325 
326 /-- `n = 0`: `A_0(k) = k`, and every nonzero `d` is a unit. -/
327 theorem step_rank_zero (d : PresentedWeyl k 0) (hd : d ≠ 0) :
328     ∃ F R S : PresentedWeyl k 0, (1 : PresentedWeyl k 0) = d * R + F * d * S := by
329   let e := presentedIteratedEquiv k 0
330   let c : k := e d
331   have hc : c ≠ 0 := by
332     intro hczero
333     change e d = 0 at hczero
334     apply hd
335     calc
336       d = e.symm (e d) := (e.symm_apply_apply d).symm
337       _ = e.symm 0 := congrArg e.symm hczero
338       _ = 0 := map_zero e.symm
339   refine ⟨0, e.symm (c⁻¹ : k), 0, ?_⟩
340   have hmul : c * c⁻¹ = (1 : k) := mul_inv_cancel₀ hc
341   have h : d * e.symm (c⁻¹ : k) = 1 := by
342     calc d * e.symm (c⁻¹ : k)
343         = e.symm c * e.symm (c⁻¹ : k) := by
344           congr 1
345           exact (e.symm_apply_apply d).symm
346       _ = e.symm (c * c⁻¹) := (map_mul e.symm _ _).symm
347       _ = e.symm 1 := congrArg e.symm hmul
348       _ = 1 := map_one e.symm
349   simpa using h.symm
350 
351 /-- **Proof of Theorem 1.1.**  `n = 0` is `step_rank_zero`.  For `n ≥ 1`,
352 Section 3 (`section_3_reduction`) either finds `deg_B d = 0` and a unit, or
353 the normal form `d̃ = c⁻¹Φ_g(d)` with `N = deg_B d ≥ 1`, for which `Q = 0`
354 (`theorem_6_Q_eq_zero`) gives `1 = d̃R + x₁^N d̃S` and, transported by
355 `Φ_g^{-1}` (Remark 3.3),
356 `1 = d(c⁻¹Φ_g^{-1}(R)) + F d(c⁻¹Φ_g^{-1}(S))` with `F = Φ_g^{-1}(x₁)^N`. -/
357 theorem theorem_1_1_paper : Stafford38Challenge.UniversalStatement.{u} := by
358   intro k _ _ n d hd
359   cases n with
360   | zero => exact step_rank_zero d hd
361   | succ n =>
362       rcases section_3_reduction k hd with ⟨-, h⟩ | ⟨hN, g, c, -, hform, hdeg, himp⟩
363       · exact h
364       · obtain ⟨ell, R, S, -, h⟩ := himp (theorem_6_Q_eq_zero hN hform hdeg)
365         exact ⟨ell ^ bernsteinDegree k d, R, S, h⟩
366 
367 /-- **Theorem 1.1, "moreover".** For `n ≥ 1` one may take
368 `F = Φ_g^{-1}(x₁)^{deg_B d}` with a linear `ω`-preserving `g`; for
369 `deg_B d = 0` any linear coordinate works, since then `F = 1`. -/
370 theorem theorem_1_1_fixedSource_paper :
371     Stafford38FixedSourceChallenge.UniversalFixedSourceStatement.{u} := by
372   intro k _ _ n d hd
373   rw [← bernsteinDegree_eq]
374   rcases section_3_reduction k hd with ⟨hN0, -⟩ | ⟨hN, g, c, -, hform, hdeg, himp⟩
375   · obtain ⟨c, -, -, hcert⟩ := step_scalar_case k hd hN0
376     refine ⟨_, algebraMap k _ c⁻¹, 0, phiG_symm_x₁_isLinearWeylCoordinate k 1, ?_⟩
377     rw [hN0, pow_zero]
378     exact hcert
379   · exact himp (theorem_6_Q_eq_zero hN hform hdeg)
380 
381 #print axioms step_W_closed_points
382 #print axioms step_W_closed
383 #print axioms step_annihilator_homogeneous
384 #print axioms step_W_fibreConical
385 #print axioms step_W_involutive
386 #print axioms step_W_P_vanishes
387 #print axioms step_W_P_axis
388 #print axioms step_Vx₁_preimage
389 #print axioms step_char_K_avoids
390 #print axioms step_closedPoint_mem_Vx₁
391 #print axioms step_W_avoids_H
392 #print axioms step_W_empty
393 #print axioms step_grQK_zero
394 #print axioms step_filtration_zero
395 #print axioms step_QK_zero
396 #print axioms theorem_6_Q_eq_zero
397 #print axioms step_rank_zero
398 #print axioms theorem_1_1_paper
399 #print axioms theorem_1_1_fixedSource_paper
400 
401 end
402 
403 end Stafford38.Paper.Section6
404