This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 3 public import Stafford38.Paper.Section5 4 public import Stafford38.Paper.Section5.Definitions 5 public import Stafford38.Paper.Section5.SmoothLocus 6 public import Stafford38.Paper.Section2.Symplectic 7 public import Stafford38.Geometry.GeneralCoisotropicSets 8 public import Stafford38.Characteristic.PostScalarExtensionPoisson 9 10 @[expose] public section 11 12 /-! 13 # Theorem 5.8 and its proof (Subsection 5.3), paragraph by paragraph 14 15 Notation as in the paper. `X = K^n` with `n = m`, a point `(y, ξ)` of 16 `T*X = K^n × (K^n)*` is `Sum.elim y ξ : PhaseVar m → K`, closed subsets of 17 `T*X` are zero loci `V_K(L)` of ideals of `K[x, ξ] = SymbolRing K m`, and the 18 paper's coordinate `x_1` is index `⟨0, hm⟩`. In the proof `J = I(W)`, 19 `B = J ∩ K[x]` is `exclusionBaseIdeal W` (the contraction along 20 `baseLift : K[x] → K[x, ξ]`), `Y = V_K(B)`, `df_y = differentialAt y f` and 21 `φ(t) = g(y, t df_y)` is `fibreLinePolynomial y (differentialAt y f) g`. 22 Involutivity of `W` is Definition 2.10 (`{I(W), I(W)} ⊆ I(W)`), the predicate 23 `PostScalarExtensionPoisson.IsInvolutive` of `I(W)`. 24 25 The steps `step_*` state the paragraphs of the printed proof in order; 26 `theorem_5_8` chains them and closes with `theorem_5_7_i_printed`. 27 -/ 28 29 namespace Stafford38.Paper.Section5 30 31 open Stafford38.Characteristic 32 open Stafford38.Characteristic.PostScalarExtensionPoisson 33 open Stafford38.Geometry.AffineConormalSpan 34 open Stafford38.Geometry.CoisotropicTranslation 35 open Stafford38.Geometry.ConormalPrincipalOpenDensity 36 open Stafford38.Geometry.FibreConicalVanishingIdeal 37 open Stafford38.Geometry.GeneralCoisotropicSets 38 open Stafford38.Geometry.GeneralConormalContainment 39 open Stafford38.Geometry.ProjectiveConormalDirections 40 open Stafford38.Geometry.SmoothAffineConormal 41 42 noncomputable section 43 44 universe u 45 46 variable {k : Type u} [Field k] [IsAlgClosed k] [CharZero k] {m : ℕ} 47 48 /-- `B = I(W) ∩ K[x]`. -/ 49 abbrev exclusionBaseIdeal (W : Set (PhaseVar m → k)) : 50 Ideal (MvPolynomial (Fin m) k) := 51 (MvPolynomial.vanishingIdeal k W).comap (baseLift (k := k) (n := m)) 52 53 omit [IsAlgClosed k] [CharZero k] in 54 /-- `d` is `K`-linear: every element of `span_K {df_y : f ∈ I}` is `dh_y` for 55 one `h ∈ I`. -/ 56 theorem exists_mem_differentialAt_eq_of_mem_span 57 (I : Ideal (MvPolynomial (Fin m) k)) (y ξ : Fin m → k) 58 (hξ : ξ ∈ Submodule.span k (Set.range fun f : I => differentialAt y f.1)) : 59 ∃ h ∈ I, differentialAt y h = ξ := by 60 induction hξ using Submodule.span_induction with 61 | mem x hx => 62 obtain ⟨f, rfl⟩ := hx 63 exact ⟨f.1, f.2, rfl⟩ 64 | zero => 65 exact ⟨0, I.zero_mem, by funext i; simp [differentialAt]⟩ 66 | add x z _ _ hx hz => 67 obtain ⟨f, hf, rfl⟩ := hx 68 obtain ⟨g, hg, rfl⟩ := hz 69 exact ⟨f + g, I.add_mem hf hg, by funext i; simp [differentialAt]⟩ 70 | smul c x _ hx => 71 obtain ⟨f, hf, rfl⟩ := hx 72 exact ⟨MvPolynomial.C c * f, I.mul_mem_left _ hf, 73 by funext i; simp [differentialAt]⟩ 74 75 /-- Paragraph "Because `W` is fibre-conical": the `ξ`-homogeneous components 76 `g_d` of every `g ∈ J` lie in `J`. The proof is the paper's: `g(y, aξ) = 77 Σ a^d g_d(y, ξ)` vanishes for all `a ∈ K^×`, so every coefficient does. -/ 78 theorem step_homogeneous_components 79 (W : Set (PhaseVar m → k)) (hcone : IsFibreConical W) : 80 ∀ g ∈ MvPolynomial.vanishingIdeal k W, ∀ d : ℕ, 81 (DirectSum.decompose (orderDecomposition (k := k) (n := m)) g d : 82 SymbolRing k m) ∈ MvPolynomial.vanishingIdeal k W := 83 fun _ hg d => vanishingIdeal_isHomogeneous_of_isFibreConical W hcone d hg 84 85 /-- Same paragraph: `g_0 ∈ B`, hence `g(y, 0) = g_0(y) = 0` for `y ∈ Y = V_K(B)`, 86 and `Y × {0} ⊆ V_K(J) = W` because `W` is closed. -/ 87 theorem step_zero_section 88 (W : Set (PhaseVar m → k)) 89 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 90 (hcone : IsFibreConical W) : 91 ∀ y ∈ MvPolynomial.zeroLocus k (exclusionBaseIdeal W), 92 Sum.elim y (0 : Fin m → k) ∈ W := by 93 intro y hy 94 have hhom : (MvPolynomial.vanishingIdeal k W).IsHomogeneous 95 (orderDecomposition (k := k) (n := m)) := 96 fun d _ hg => step_homogeneous_components W hcone _ hg d 97 have hzero := zeroSection_commonZero_of_isHomogeneous 98 (MvPolynomial.vanishingIdeal k W) hhom y hy 99 have hpoint : Sum.elim y (0 : Fin m → k) = zeroSectionPoint y := by 100 funext i; rcases i with i | i <;> rfl 101 rw [← zeroLocus_vanishingIdeal_of_algebraic_closed W hclosed, hpoint] 102 exact hzero 103 104 /-- Same paragraph: `Y = π(W)`. -/ 105 theorem step_projection 106 (W : Set (PhaseVar m → k)) 107 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 108 (hcone : IsFibreConical W) : 109 {y : Fin m → k | ∃ ξ : Fin m → k, Sum.elim y ξ ∈ W} = 110 MvPolynomial.zeroLocus k (exclusionBaseIdeal W) := by 111 ext y 112 constructor 113 · rintro ⟨ξ, hξ⟩ f hf 114 have h := hf (Sum.elim y ξ) hξ 115 simpa [baseLift, MvPolynomial.eval_rename, Function.comp_def] using h 116 · intro hy 117 exact ⟨0, step_zero_section W hclosed hcone y hy⟩ 118 119 /-- Paragraph "Lastly": `W ∩ π⁻¹(H) = ∅` gives `Y ∩ H = ∅`. -/ 120 theorem step_Y_avoids_H 121 (hm : 0 < m) (W : Set (PhaseVar m → k)) 122 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 123 (hcone : IsFibreConical W) 124 (hH : W ∩ {q | q (.inl ⟨0, hm⟩) = 0} = ∅) : 125 ∀ y ∈ MvPolynomial.zeroLocus k (exclusionBaseIdeal W), y ⟨0, hm⟩ ≠ 0 := by 126 intro y hy hy0 127 have hmem : Sum.elim y (0 : Fin m → k) ∈ W ∩ {q | q (.inl ⟨0, hm⟩) = 0} := 128 ⟨step_zero_section W hclosed hcone y hy, hy0⟩ 129 rw [hH] at hmem 130 exact hmem 131 132 omit [IsAlgClosed k] [CharZero k] in 133 /-- Paragraph "For the next argument": for `f ∈ B`, 134 `H_f g = Σ_i ∂f/∂x_i ∂g/∂ξ_i = {f, g}` (the bracket of Definition 2.9, 135 `Section2.poisson`), and involutivity gives `H_f^m g ∈ J` 136 for all `g ∈ J`, `m ≥ 0`. -/ 137 theorem step_hamiltonian 138 (W : Set (PhaseVar m → k)) 139 (hinv : IsInvolutive (MvPolynomial.vanishingIdeal k W)) 140 (f : MvPolynomial (Fin m) k) (hf : f ∈ exclusionBaseIdeal W) 141 (g : SymbolRing k m) (hg : g ∈ MvPolynomial.vanishingIdeal k W) : 142 Stafford38.Paper.Section2.poisson k (baseLift f) g = 143 ∑ i : Fin m, baseLift (MvPolynomial.pderiv i f) * 144 MvPolynomial.pderiv (Sum.inr i : PhaseVar m) g ∧ 145 ∀ j : ℕ, hamiltonIter f j g ∈ MvPolynomial.vanishingIdeal k W := by 146 refine ⟨?_, fun j => ?_⟩ 147 · rw [Stafford38.Paper.Section2.poisson_eq] 148 simp [poissonBracket, pderiv_baseLift_base, pderiv_baseLift_fibre] 149 · induction j with 150 | zero => exact hg 151 | succ j hj => exact hinv _ hf _ hj 152 153 /-- Same paragraph: for `y ∈ Y`, `f ∈ B`, `g ∈ J`, the polynomial 154 `φ(t) = g(y, t df_y)` satisfies `φ^{(j)}(0) = H_f^j g(y, 0) = 0` for all `j`. -/ 155 theorem step_phi_derivatives 156 (W : Set (PhaseVar m → k)) 157 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 158 (hcone : IsFibreConical W) 159 (hinv : IsInvolutive (MvPolynomial.vanishingIdeal k W)) 160 (y : Fin m → k) (hy : y ∈ MvPolynomial.zeroLocus k (exclusionBaseIdeal W)) 161 (f : MvPolynomial (Fin m) k) (hf : f ∈ exclusionBaseIdeal W) 162 (g : SymbolRing k m) (hg : g ∈ MvPolynomial.vanishingIdeal k W) (j : ℕ) : 163 Polynomial.eval 0 ((Polynomial.derivative^[j]) 164 (fibreLinePolynomial y (differentialAt y f) g)) = 0 := by 165 rw [iterate_derivative_fibreLinePolynomial, eval_zero_fibreLinePolynomial] 166 have hpoint : zeroSectionPoint y = Sum.elim y (0 : Fin m → k) := by 167 funext i; rcases i with i | i <;> rfl 168 rw [hpoint] 169 exact (step_hamiltonian W hinv f hf g hg).2 j _ 170 (step_zero_section W hclosed hcone y hy) 171 172 /-- Same paragraph: since `char K = 0`, `φ^{(j)}(0) = j! c_j = 0` forces 173 `φ = 0`, so `(y, t df_y) ∈ V_K(J) = W` for every `t ∈ K`. -/ 174 theorem step_line_mem 175 (W : Set (PhaseVar m → k)) 176 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 177 (hcone : IsFibreConical W) 178 (hinv : IsInvolutive (MvPolynomial.vanishingIdeal k W)) 179 (y : Fin m → k) (hy : y ∈ MvPolynomial.zeroLocus k (exclusionBaseIdeal W)) 180 (f : MvPolynomial (Fin m) k) (hf : f ∈ exclusionBaseIdeal W) (t : k) : 181 Sum.elim y (t • differentialAt y f) ∈ W := by 182 rw [← zeroLocus_vanishingIdeal_of_algebraic_closed W hclosed] 183 intro g hg 184 have hphi : fibreLinePolynomial y (differentialAt y f) g = 0 := 185 polynomial_eq_zero_of_eval_iterate_derivative_zero _ 186 (step_phi_derivatives W hclosed hcone hinv y hy f hf g hg) 187 have h := eval_fibreLinePolynomial y (differentialAt y f) g t 188 rw [hphi, Polynomial.eval_zero] at h 189 have hpt : Sum.elim y (t • differentialAt y f) = 190 Sum.elim y (fun i => t * differentialAt y f i) := rfl 191 rw [hpt] 192 exact h.symm 193 194 /-- Same paragraph, last sentence: `{y} × span{df_y : f ∈ B} ⊆ W` for `y ∈ Y`, 195 since `Σ c_a df_a = d(Σ c_a f_a)` with `Σ c_a f_a ∈ B`, at `t = 1`. -/ 196 theorem step_span_mem 197 (W : Set (PhaseVar m → k)) 198 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 199 (hcone : IsFibreConical W) 200 (hinv : IsInvolutive (MvPolynomial.vanishingIdeal k W)) 201 (y : Fin m → k) (hy : y ∈ MvPolynomial.zeroLocus k (exclusionBaseIdeal W)) 202 (ξ : Fin m → k) 203 (hξ : ξ ∈ Submodule.span k 204 (Set.range fun f : exclusionBaseIdeal W => differentialAt y f.1)) : 205 Sum.elim y ξ ∈ W := by 206 obtain ⟨f, hf, rfl⟩ := exists_mem_differentialAt_eq_of_mem_span _ y ξ hξ 207 simpa using step_line_mem W hclosed hcone hinv y hy f hf 1 208 209 /-- Paragraph "Since `V_K(B) = Y = π(W) ≠ ∅`": `B` is radical and proper (by 210 `step_projection`), has finitely many minimal primes `𝔮_1, …, 𝔮_r`, at least 211 one, and `B = ⋂ 𝔮_i`. -/ 212 theorem step_minimal_primes 213 (W : Set (PhaseVar m → k)) 214 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 215 (hcone : IsFibreConical W) (hne : W.Nonempty) : 216 (exclusionBaseIdeal W).IsRadical ∧ 217 (exclusionBaseIdeal W).minimalPrimes.Finite ∧ 218 sInf (exclusionBaseIdeal W).minimalPrimes = exclusionBaseIdeal W ∧ 219 (exclusionBaseIdeal W).minimalPrimes.Nonempty := by 220 have hrad : (exclusionBaseIdeal W).IsRadical := 221 (vanishingIdeal_isRadical W).comap _ 222 have hproper : exclusionBaseIdeal W ≠ ⊤ := by 223 intro htop 224 obtain ⟨q, hq⟩ := hne 225 have hy : (fun i => q (.inl i)) ∈ MvPolynomial.zeroLocus k (exclusionBaseIdeal W) := by 226 rw [← step_projection W hclosed hcone] 227 refine ⟨fun i => q (.inr i), ?_⟩ 228 have hsplit : Sum.elim (fun i => q (.inl i)) (fun i => q (.inr i)) = q := by 229 funext i; cases i <;> rfl 230 rwa [hsplit] 231 have := hy 1 (htop ▸ trivial) 232 simp at this 233 refine ⟨hrad, Ideal.finite_minimalPrimes_of_isNoetherianRing _ _, ?_, 234 Set.nonempty_coe_sort.mp (Ideal.nonempty_minimalPrimes hproper)⟩ 235 rw [Ideal.sInf_minimalPrimes, hrad.radical] 236 237 /-- Same paragraph: for a minimal prime `𝔮` of `B`, `Y_0 = V_K(𝔮)` is 238 nonempty, closed and irreducible (`𝔮` prime), `𝔮 = I(Y_0)`, `Y_0 ⊆ Y` and 239 `Y_0 ∩ H = ∅`. -/ 240 theorem step_component 241 (hm : 0 < m) (W : Set (PhaseVar m → k)) 242 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 243 (hcone : IsFibreConical W) 244 (hH : W ∩ {q | q (.inl ⟨0, hm⟩) = 0} = ∅) 245 (𝔮 : Ideal (MvPolynomial (Fin m) k)) 246 (h𝔮 : 𝔮 ∈ (exclusionBaseIdeal W).minimalPrimes) : 247 𝔮.IsPrime ∧ (MvPolynomial.zeroLocus k 𝔮).Nonempty ∧ 248 MvPolynomial.vanishingIdeal k (MvPolynomial.zeroLocus k 𝔮) = 𝔮 ∧ 249 MvPolynomial.zeroLocus k 𝔮 ⊆ 250 MvPolynomial.zeroLocus k (exclusionBaseIdeal W) ∧ 251 ∀ y ∈ MvPolynomial.zeroLocus k 𝔮, y ⟨0, hm⟩ ≠ 0 := by 252 have hprime : 𝔮.IsPrime := h𝔮.1.1 253 have hI : MvPolynomial.vanishingIdeal k (MvPolynomial.zeroLocus k 𝔮) = 𝔮 := 254 MvPolynomial.IsPrime.vanishingIdeal_zeroLocus 𝔮 255 have hsub : MvPolynomial.zeroLocus k 𝔮 ⊆ 256 MvPolynomial.zeroLocus k (exclusionBaseIdeal W) := 257 MvPolynomial.zeroLocus_anti_mono h𝔮.1.2 258 refine ⟨hprime, ?_, hI, hsub, fun y hy => 259 step_Y_avoids_H hm W hclosed hcone hH y (hsub hy)⟩ 260 rw [Set.nonempty_iff_ne_empty] 261 intro hempty 262 rw [hempty, MvPolynomial.vanishingIdeal_empty] at hI 263 exact hprime.ne_top hI.symm 264 265 omit [IsAlgClosed k] [CharZero k] in 266 /-- Paragraph "Furthermore": there is a separator `s ∉ 𝔮` with `s𝔮 ⊆ B`, 267 `s = s_2 ⋯ s_r` with `s_i ∈ 𝔮_i ∖ 𝔮`. -/ 268 theorem step_separator 269 (W : Set (PhaseVar m → k)) 270 (𝔮 : Ideal (MvPolynomial (Fin m) k)) 271 (hrad : (exclusionBaseIdeal W).IsRadical) 272 (h𝔮 : 𝔮 ∈ (exclusionBaseIdeal W).minimalPrimes) : 273 ∃ s ∉ 𝔮, ∀ h ∈ 𝔮, s * h ∈ exclusionBaseIdeal W := by 274 classical 275 set B := exclusionBaseIdeal W 276 have hfin := Ideal.finite_minimalPrimes_of_isNoetherianRing 277 (MvPolynomial (Fin m) k) B 278 set T := hfin.toFinset.erase 𝔮 with hT 279 have hchoice : ∀ Q ∈ T, ∃ s ∈ Q, s ∉ 𝔮 := by 280 intro Q hQ 281 rw [hT, Finset.mem_erase, hfin.mem_toFinset] at hQ 282 by_contra hcon 283 push Not at hcon 284 exact hQ.1 (le_antisymm hcon (h𝔮.2 hQ.2.1 hcon)) 285 choose s hsQ hsP using hchoice 286 refine ⟨∏ Q ∈ T.attach, s Q.1 Q.2, ?_, ?_⟩ 287 · intro hs 288 obtain ⟨Q, -, hQ⟩ := (h𝔮.1.1.prod_mem_iff).1 hs 289 exact hsP Q.1 Q.2 hQ 290 · intro h hh 291 rw [← hrad.radical, ← Ideal.sInf_minimalPrimes, Ideal.mem_sInf] 292 intro Q hQ 293 by_cases hQP : Q = 𝔮 294 · subst hQP 295 exact Ideal.mul_mem_left _ _ hh 296 · have hQT : Q ∈ T := by 297 rw [hT, Finset.mem_erase, hfin.mem_toFinset] 298 exact ⟨hQP, hQ⟩ 299 refine Ideal.mul_mem_right _ _ ?_ 300 exact Ideal.mem_of_dvd _ 301 (Finset.dvd_prod_of_mem (fun Q : T ↦ s Q.1 Q.2) 302 (Finset.mem_attach _ ⟨Q, hQT⟩)) 303 (hsQ Q hQT) 304 305 /-- Same paragraph: for `h ∈ 𝔮` and `y ∈ Y_0 ∩ {s ≠ 0}`, `(y, dh_y) ∈ W`, 306 because `d(sh)_y = s(y) dh_y` with `sh ∈ B`, and `W` is fibre-conical. -/ 307 theorem step_dh_on_open 308 (W : Set (PhaseVar m → k)) 309 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 310 (hcone : IsFibreConical W) 311 (hinv : IsInvolutive (MvPolynomial.vanishingIdeal k W)) 312 (𝔮 : Ideal (MvPolynomial (Fin m) k)) 313 (h𝔮 : 𝔮 ∈ (exclusionBaseIdeal W).minimalPrimes) 314 (s : MvPolynomial (Fin m) k) 315 (hs : ∀ h ∈ 𝔮, s * h ∈ exclusionBaseIdeal W) 316 (h : MvPolynomial (Fin m) k) (hh : h ∈ 𝔮) 317 (y : Fin m → k) (hy : y ∈ MvPolynomial.zeroLocus k 𝔮) 318 (hsy : MvPolynomial.eval y s ≠ 0) : 319 Sum.elim y (differentialAt y h) ∈ W := by 320 have hyY : y ∈ MvPolynomial.zeroLocus k (exclusionBaseIdeal W) := 321 MvPolynomial.zeroLocus_anti_mono h𝔮.1.2 hy 322 have hhy : MvPolynomial.eval y h = 0 := hy h hh 323 have hd : differentialAt y (s * h) = MvPolynomial.eval y s • differentialAt y h := by 324 funext i 325 simp [differentialAt, hhy] 326 have hsh : Sum.elim y (differentialAt y (s * h)) ∈ W := 327 step_span_mem W hclosed hcone hinv y hyY _ 328 (Submodule.subset_span ⟨⟨s * h, hs h hh⟩, rfl⟩) 329 rw [hd] at hsh 330 have := ((definition_5_6 W).1 hcone y _ ⟨hsh, rfl⟩ (MvPolynomial.eval y s)⁻¹ 331 (inv_ne_zero hsy)).1 332 rwa [smul_smul, inv_mul_cancel₀ hsy, one_smul] at this 333 334 /-- Same paragraph: `(y, dh_y) ∈ W` for all `y ∈ Y_0`. For `g ∈ J`, 335 `G(x) = g(x, dh_x)` vanishes on `Y_0 ∩ {s ≠ 0}`, so `sG ∈ I(Y_0) = 𝔮`, and 336 `G ∈ 𝔮` as `s ∉ 𝔮`. -/ 337 theorem step_dh_on_component 338 (W : Set (PhaseVar m → k)) 339 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 340 (hcone : IsFibreConical W) 341 (hinv : IsInvolutive (MvPolynomial.vanishingIdeal k W)) 342 (𝔮 : Ideal (MvPolynomial (Fin m) k)) 343 (h𝔮 : 𝔮 ∈ (exclusionBaseIdeal W).minimalPrimes) 344 (s : MvPolynomial (Fin m) k) (hs𝔮 : s ∉ 𝔮) 345 (hs : ∀ h ∈ 𝔮, s * h ∈ exclusionBaseIdeal W) 346 (h : MvPolynomial (Fin m) k) (hh : h ∈ 𝔮) 347 (y : Fin m → k) (hy : y ∈ MvPolynomial.zeroLocus k 𝔮) : 348 Sum.elim y (differentialAt y h) ∈ W := by 349 rw [← zeroLocus_vanishingIdeal_of_algebraic_closed W hclosed] 350 intro g hg 351 have hG : gradientGraphSubstitution h g ∈ 𝔮 := by 352 apply mem_of_vanishes_on_principal_open 𝔮 h𝔮.1.1 hs𝔮 353 intro z hz hsz 354 rw [eval_gradientGraphSubstitution] 355 exact hg _ (step_dh_on_open W hclosed hcone hinv 𝔮 h𝔮 s hs h hh z hz hsz) 356 have h0 : MvPolynomial.eval y (gradientGraphSubstitution h g) = 0 := hy _ hG 357 rw [eval_gradientGraphSubstitution] at h0 358 exact h0 359 360 /-- Same paragraph: `{y} × span{dh_y : h ∈ 𝔮} ⊆ W` for every `y ∈ Y_0`. -/ 361 theorem step_span_component 362 (W : Set (PhaseVar m → k)) 363 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 364 (hcone : IsFibreConical W) 365 (hinv : IsInvolutive (MvPolynomial.vanishingIdeal k W)) 366 (𝔮 : Ideal (MvPolynomial (Fin m) k)) 367 (h𝔮 : 𝔮 ∈ (exclusionBaseIdeal W).minimalPrimes) 368 (s : MvPolynomial (Fin m) k) (hs𝔮 : s ∉ 𝔮) 369 (hs : ∀ h ∈ 𝔮, s * h ∈ exclusionBaseIdeal W) 370 (y : Fin m → k) (hy : y ∈ MvPolynomial.zeroLocus k 𝔮) 371 (ξ : Fin m → k) 372 (hξ : ξ ∈ Submodule.span k (Set.range fun h : 𝔮 => differentialAt y h.1)) : 373 Sum.elim y ξ ∈ W := by 374 obtain ⟨h, hh, rfl⟩ := exists_mem_differentialAt_eq_of_mem_span 𝔮 y ξ hξ 375 exact step_dh_on_component W hclosed hcone hinv 𝔮 h𝔮 s hs𝔮 hs h hh y hy 376 377 /-- Same paragraph: at smooth points `y` of `Y_0`, `{y} × N*_y Y_0 ⊆ W`, with 378 `N*_y Y_0 = span{df_y : f ∈ 𝔮}` (Definition 5.4(c), `𝔮 = I(Y_0)`). -/ 379 theorem step_conormal_subset 380 (W : Set (PhaseVar m → k)) 381 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 382 (hcone : IsFibreConical W) 383 (hinv : IsInvolutive (MvPolynomial.vanishingIdeal k W)) 384 (𝔮 : Ideal (MvPolynomial (Fin m) k)) 385 (h𝔮 : 𝔮 ∈ (exclusionBaseIdeal W).minimalPrimes) 386 (s : MvPolynomial (Fin m) k) (hs𝔮 : s ∉ 𝔮) 387 (hs : ∀ h ∈ 𝔮, s * h ∈ exclusionBaseIdeal W) 388 (y : Fin m → k) (hy : SmoothAffinePoint 𝔮 y) 389 (ξ : Fin m → k) (hξ : coordinateCovector ξ ∈ affineConormalSpace y 𝔮) : 390 Sum.elim y ξ ∈ W := 391 step_span_component W hclosed hcone hinv 𝔮 h𝔮 s hs𝔮 hs y 392 (smoothAffinePoint_mem_zeroLocus 𝔮 hy) ξ ((definition_5_4_c 𝔮 y ξ).1 hξ) 393 394 /-- Same paragraph: `P`, which depends on `ξ` only, vanishes on `N(Y_0)` 395 (Definition 5.4(d)). -/ 396 theorem step_P_vanishes_on_conormal_cone 397 (W : Set (PhaseVar m → k)) 398 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 399 (hcone : IsFibreConical W) 400 (hinv : IsInvolutive (MvPolynomial.vanishingIdeal k W)) 401 (𝔮 : Ideal (MvPolynomial (Fin m) k)) 402 (h𝔮 : 𝔮 ∈ (exclusionBaseIdeal W).minimalPrimes) 403 (s : MvPolynomial (Fin m) k) (hs𝔮 : s ∉ 𝔮) 404 (hs : ∀ h ∈ 𝔮, s * h ∈ exclusionBaseIdeal W) 405 (P : MvPolynomial (Fin m) k) 406 (hPW : ∀ q ∈ W, MvPolynomial.eval (fun i => q (.inr i)) P = 0) : 407 P ∈ MvPolynomial.vanishingIdeal k (smoothConormalFibreProjection 𝔮) := by 408 intro ξ hξ 409 obtain ⟨y, hy, hspan⟩ := (definition_5_4_d 𝔮 ξ).1 hξ 410 have hyξ := step_conormal_subset W hclosed hcone hinv 𝔮 h𝔮 s hs𝔮 hs y hy ξ 411 ((definition_5_4_c 𝔮 y ξ).2 hspan) 412 simpa using hPW _ hyξ 413 414 /-- `P` vanishes on the printed cone `N(Y_0) = ⋃_{y ∈ Y_sm} N*_y Y_0` over the 415 Jacobian smooth locus (Definition 5.4). `step_P_vanishes_on_conormal_cone` 416 argues over Mathlib's smooth points, which are exactly the Jacobian smooth 417 points (`definition_5_4_b_iff`), so the two cones are equal 418 (`conormalCone_paper_eq`). -/ 419 theorem step_P_vanishes_on_N (𝔮 : Ideal (MvPolynomial (Fin m) k)) (hprime : 𝔮.IsPrime) 420 (P : MvPolynomial (Fin m) k) 421 (hP : P ∈ MvPolynomial.vanishingIdeal k (smoothConormalFibreProjection 𝔮)) : 422 ∀ ξ ∈ conormalCone ⟨𝔮, hprime⟩, MvPolynomial.eval ξ P = 0 := by 423 rw [conormalCone_paper_eq ⟨𝔮, hprime⟩] 424 intro ξ hξ 425 simpa using (MvPolynomial.mem_vanishingIdeal_iff.1 hP) ξ hξ 426 427 /-- Final sentence: `Y_0` is nonempty, closed, irreducible (Definition 5.4(a), 428 `I(Y_0) = 𝔮` prime) and avoids `H`, and `P` vanishes on `N(Y_0)`, so Theorem 5.7(i) 429 gives `P(1, 0, …, 0) = 0`. -/ 430 theorem step_theorem_5_7_applies 431 (hm : 0 < m) (𝔮 : Ideal (MvPolynomial (Fin m) k)) (hprime : 𝔮.IsPrime) 432 (havoid : ∀ y ∈ MvPolynomial.zeroLocus k 𝔮, y ⟨0, hm⟩ ≠ 0) 433 (P : MvPolynomial (Fin m) k) 434 (hP : ∀ ξ ∈ conormalCone ⟨𝔮, hprime⟩, MvPolynomial.eval ξ P = 0) : 435 MvPolynomial.eval (fun i : Fin m => if i = ⟨0, hm⟩ then (1 : k) else 0) P = 0 := by 436 -- `Y_0 = V_K(𝔮)` is nonempty, closed and irreducible, with `I(Y_0) = 𝔮` 437 obtain ⟨hne, hY, hpt⟩ := irreducibleClosed_zeroLocus_of_isPrime (k := k) 𝔮 438 refine theorem_5_7_i_printed hm _ hne hY ?_ P (hpt ▸ hP) 439 ext y 440 simp only [Set.mem_inter_iff, Set.mem_ofPred_eq, Set.mem_empty_iff_false, iff_false, not_and] 441 exact fun hy h0 => havoid y hy h0 442 443 /-- **Theorem 5.8.** Let `K` be algebraically closed of characteristic zero and 444 `W ⊆ T*X` Zariski closed, fibre-conical and involutive. If 445 `P ∈ K[ξ_1, …, ξ_n]` with `P(1, 0, …, 0) ≠ 0` vanishes on `W` and 446 `W ∩ π⁻¹(H) = ∅`, then `W = ∅`. Proved along Subsection 5.3. -/ 447 theorem theorem_5_8 448 (hm : 0 < m) (W : Set (PhaseVar m → k)) 449 (hclosed : ∃ L : Ideal (SymbolRing k m), W = MvPolynomial.zeroLocus k L) 450 (hcone : IsFibreConical W) 451 (hinv : IsInvolutive (MvPolynomial.vanishingIdeal k W)) 452 (P : MvPolynomial (Fin m) k) 453 (haxis : MvPolynomial.eval 454 (fun i : Fin m => if i = ⟨0, hm⟩ then (1 : k) else 0) P ≠ 0) 455 (hPW : ∀ q ∈ W, MvPolynomial.eval (fun i => q (.inr i)) P = 0) 456 (hH : W ∩ {q | q (.inl ⟨0, hm⟩) = 0} = ∅) : 457 W = ∅ := by 458 -- Suppose `W ≠ ∅`. 459 by_contra hne 460 have hW : W.Nonempty := Set.nonempty_iff_ne_empty.2 hne 461 -- `B` is radical with a minimal prime `𝔮`; `Y_0 = V_K(𝔮)`. 462 obtain ⟨hrad, -, -, 𝔮, h𝔮⟩ := step_minimal_primes W hclosed hcone hW 463 obtain ⟨hprime, -, -, -, havoid⟩ := step_component hm W hclosed hcone hH 𝔮 h𝔮 464 -- The separator `s`, then `P` vanishes on `N(Y_0)`. 465 obtain ⟨s, hs𝔮, hs⟩ := step_separator W 𝔮 hrad h𝔮 466 have hPN := step_P_vanishes_on_conormal_cone W hclosed hcone hinv 𝔮 h𝔮 s hs𝔮 hs P hPW 467 -- Theorem 5.7(i) contradicts `P(1, 0, …, 0) ≠ 0`. 468 exact haxis (step_theorem_5_7_applies hm 𝔮 hprime havoid P 469 (step_P_vanishes_on_N 𝔮 hprime P hPN)) 470 471 #print axioms exists_mem_differentialAt_eq_of_mem_span 472 #print axioms step_homogeneous_components 473 #print axioms step_zero_section 474 #print axioms step_projection 475 #print axioms step_Y_avoids_H 476 #print axioms step_hamiltonian 477 #print axioms step_phi_derivatives 478 #print axioms step_line_mem 479 #print axioms step_span_mem 480 #print axioms step_minimal_primes 481 #print axioms step_component 482 #print axioms step_separator 483 #print axioms step_dh_on_open 484 #print axioms step_dh_on_component 485 #print axioms step_span_component 486 #print axioms step_conormal_subset 487 #print axioms step_P_vanishes_on_conormal_cone 488 #print axioms step_P_vanishes_on_N 489 #print axioms step_theorem_5_7_applies 490 #print axioms theorem_5_8 491 492 end 493 494 end Stafford38.Paper.Section5 495