Stafford38/UniversalAssembly.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Stafford38.Statement
3 public import Stafford38.Characteristic.CanonicalCertificate
4 public import Stafford38.Weyl.MonicNormalization
5 public import Stafford38.Weyl.PBWMonicBridge
6 
7 @[expose] public section
8 
9 /-!
10 # Universal theorem assembly
11 
12 This file handles the scalar and symplectic cases and transports the
13 fixed-source certificate. Its final algebraic input is
14 `CanonicalSupportVanishing`; `FoundationClosure.canonicalSupportVanishingViaGeneralCoisotropic`
15 provides the unconditional instance.
16 -/
17 
18 namespace Stafford38.UniversalAssembly
19 
20 open Stafford38
21 open Stafford38.CharacteristicCanonicalCertificate
22 open Stafford38.CharacteristicInitialIdeal
23 open Stafford38.WeylEulerResidue
24 open Stafford38.WeylIteratedEquivalence
25 open Stafford38.WeylMonicNormalization
26 open Stafford38.WeylPBWMonicBridge
27 open Stafford38.WeylSymplectic
28 
29 noncomputable section
30 
31 universe u
32 
33 /-- The one concrete theorem still needed by the final algebraic assembly. -/
34 def CanonicalSupportVanishing : Prop :=
35   ∀ (k : Type u) [Field k] [CharZero k] (n N : ℕ)
36     (d : PresentedWeyl k (n + 1)),
37     0 < N → IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d →
38       orderCharacteristicSupport k
39         (canonicalRightIdeal (presentedCoordinate k n) d N) = ∅
40 
41 private theorem rankZero_certificate
42     (k : Type u) [Field k] (d : PresentedWeyl k 0) (hd : d ≠ 0) :
43     ∃ F R S : PresentedWeyl k 0,
44       (1 : PresentedWeyl k 0) = d * R + F * d * S := by
45   let e := presentedIteratedEquiv k 0
46   let c : k := e d
47   have hc : c ≠ 0 := by
48     intro hczero
49     change e d = 0 at hczero
50     apply hd
51     calc
52       d = e.symm (e d) := (e.symm_apply_apply d).symm
53       _ = e.symm 0 := congrArg e.symm hczero
54       _ = 0 := map_zero e.symm
55   refine ⟨0, e.symm (c⁻¹ : k), 0, ?_⟩
56   have hmul : c * c⁻¹ = (1 : k) := mul_inv_cancel₀ hc
57   have h : d * e.symm (c⁻¹ : k) = 1 := by
58     calc d * e.symm (c⁻¹ : k)
59         = e.symm c * e.symm (c⁻¹ : k) := by
60           congr 1
61           exact (e.symm_apply_apply d).symm
62       _ = e.symm (c * c⁻¹) := (map_mul e.symm _ _).symm
63       _ = e.symm 1 := congrArg e.symm hmul
64       _ = 1 := map_one e.symm
65   simpa using h.symm
66 
67 /-- Once canonical support vanishing is proved, the exact theorem exported by
68 `Stafford38.Statement` follows with no further mathematical hypothesis. -/
69 theorem universalStatement_of_canonicalSupportVanishing
70     (hvanish : CanonicalSupportVanishing.{u}) :
71     Stafford38.UniversalStatement.{u} := by
72   intro k _ _ n d hd
73   cases n with
74   | zero =>
75       exact rankZero_certificate k d hd
76   | succ n =>
77       rcases scalar_or_normalized_symplectic_image k (Nat.succ_pos n) hd with
78         hscalar | hchart
79       · rcases hscalar with ⟨c, hc, rfl⟩
80         refine ⟨0, algebraMap k (PresentedWeyl k (n + 1)) c⁻¹, 0, ?_⟩
81         simp only [zero_mul, zero_add]
82         rw [← map_mul]
83         rw [mul_inv_cancel₀ hc, map_one]
84         simp
85       · rcases hchart with ⟨N, hN, M, Ninv, c, hM, hNinv, hMN, hNM,
86           hc, hpiece, haxis⟩
87         let e := standardSymplecticAlgEquivOfInverse
88           k M Ninv hM hNinv hMN hNM
89         let d' : PresentedWeyl k (n + 1) :=
90           normalizedSymplecticImage k M hM c d
91         have hd' : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d' := by
92           refine ⟨hpiece, ?_⟩
93           rw [← coeff_principal_pure_eq_normalForm k]
94           rw [← coeff_axisPolynomial k]
95           exact haxis
96         have hsupp := hvanish k n N d' hN hd'
97         rcases exists_fixedSource_certificate_of_orderCharacteristicSupport_eq_empty
98             k n N d' hsupp with ⟨R, S, hcert⟩
99         let a : PresentedWeyl k (n + 1) :=
100           algebraMap k (PresentedWeyl k (n + 1)) c⁻¹
101         have hd'eq : d' = a * e d := by
102           simp [d', a, e, normalizedSymplecticImage, Algebra.smul_def,
103             standardSymplecticAlgEquivOfInverse] <;> rfl
104         have ha_comm : ∀ z : PresentedWeyl k (n + 1), a * z = z * a := by
105           intro z
106           exact Algebra.commutes c⁻¹ z
107         have hchartCert :
108             (1 : PresentedWeyl k (n + 1)) =
109               e d * (a * R) +
110                 (presentedCoordinate k n) ^ N * e d * (a * S) := by
111           rw [hcert, hd'eq]
112           rw [ha_comm (e d)]
113           simp only [mul_assoc]
114         refine ⟨e.symm ((presentedCoordinate k n) ^ N),
115           e.symm (a * R), e.symm (a * S), ?_⟩
116         have htransport := congrArg e.symm hchartCert
117         simpa using htransport
118 
119 #print axioms rankZero_certificate
120 #print axioms universalStatement_of_canonicalSupportVanishing
121 
122 end
123 
124 end Stafford38.UniversalAssembly
125