Stafford38/Geometry/FibreConicalVanishingIdeal.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Stafford38.Geometry.GeneralConormalContainment
3 
4 @[expose] public section
5 
6 /-!
7 # Fibre-conical zero sets have homogeneous vanishing ideals
8 -/
9 
10 namespace Stafford38.Geometry.FibreConicalVanishingIdeal
11 
12 open Stafford38.Characteristic
13 open Stafford38.Geometry.CoisotropicTranslation
14 open Stafford38.Geometry.GeneralConormalContainment
15 open Stafford38.WeylFiltration
16 
17 noncomputable section
18 
19 variable {k : Type*} [Field k] [CharZero k] [IsAlgClosed k] {n : ℕ}
20 
21 /-- Stability under every nonzero scalar dilation in each cotangent fibre. -/
22 def IsFibreConical (W : Set (PhaseVar n → k)) : Prop :=
23   ∀ q ∈ W, ∀ a : k, a ≠ 0 →
24     Sum.elim (fun i => q (.inl i)) (fun i => a * q (.inr i)) ∈ W
25 
26 /-- The coefficient of fibre degree `d` on a fibre line is evaluation of the
27 `d`th order-weight homogeneous component. -/
28 theorem coeff_fibreLinePolynomial_eq_eval_weightedHomogeneousComponent
29     (y ξ : Fin n → k) (g : SymbolRing k n) (d : ℕ) :
30     (fibreLinePolynomial y ξ g).coeff d =
31       MvPolynomial.eval (Sum.elim y ξ)
32         (DirectSum.decompose (orderDecomposition (k := k) (n := n)) g d :
33           SymbolRing k n) := by
34   induction g using MvPolynomial.induction_on generalizing d with
35   | C c =>
36       have hC : MvPolynomial.C c ∈ orderDecomposition (k := k) (n := n) 0 :=
37         MvPolynomial.isWeightedHomogeneous_C (@orderWeight n) c
38       cases d with
39       | zero =>
40           rw [DirectSum.decompose_of_mem_same
41             (orderDecomposition (k := k) (n := n)) hC]
42           simp
43       | succ d =>
44           rw [DirectSum.decompose_of_mem_ne
45             (orderDecomposition (k := k) (n := n)) hC (Nat.succ_ne_zero d).symm]
46           simp
47   | add P Q hP hQ =>
48       rw [fibreLinePolynomial_add, Polynomial.coeff_add,
49         DirectSum.decompose_add]
50       change _ = MvPolynomial.eval (Sum.elim y ξ)
51         ((DirectSum.decompose (orderDecomposition (k := k) (n := n)) P d :
52           SymbolRing k n) +
53          (DirectSum.decompose (orderDecomposition (k := k) (n := n)) Q d :
54           SymbolRing k n))
55       rw [MvPolynomial.eval_add, hP, hQ]
56   | mul_X P i hP =>
57       rcases i with i | i
58       · have hX : MvPolynomial.X (Sum.inl i : PhaseVar n) ∈
59             orderDecomposition (k := k) (n := n) 0 :=
60           MvPolynomial.isWeightedHomogeneous_X k (@orderWeight n) _
61         rw [DirectSum.coe_decompose_mul_of_right_mem_of_le
62           (orderDecomposition (k := k) (n := n)) hX (Nat.zero_le d)]
63         simp [fibreLinePolynomial_mul, hP]
64       · have hX : MvPolynomial.X (Sum.inr i : PhaseVar n) ∈
65             orderDecomposition (k := k) (n := n) 1 :=
66           MvPolynomial.isWeightedHomogeneous_X k (@orderWeight n) _
67         cases d with
68         | zero =>
69             rw [DirectSum.coe_decompose_mul_of_right_mem_of_not_le
70               (orderDecomposition (k := k) (n := n)) hX (by omega)]
71             simp [fibreLinePolynomial_mul]
72         | succ d =>
73             rw [DirectSum.coe_decompose_mul_of_right_mem_of_le
74               (orderDecomposition (k := k) (n := n)) hX (by omega)]
75             rw [fibreLinePolynomial_mul, fibreLinePolynomial_X_fibre, ← mul_assoc,
76               Polynomial.coeff_mul_X, Polynomial.coeff_mul_C]
77             simp [hP]
78 
79 /-- Fibre-conicality makes the vanishing ideal homogeneous for fibre degree. -/
80 theorem vanishingIdeal_isHomogeneous_of_isFibreConical
81     (W : Set (PhaseVar n → k)) (hW : IsFibreConical W) :
82     (MvPolynomial.vanishingIdeal k W).IsHomogeneous
83       (orderDecomposition (k := k) (n := n)) := by
84   intro d g hg
85   rw [MvPolynomial.mem_vanishingIdeal_iff] at hg ⊢
86   intro q hq
87   let y : Fin n → k := fun i => q (.inl i)
88   let ξ : Fin n → k := fun i => q (.inr i)
89   have hline : fibreLinePolynomial y ξ g = 0 := by
90     apply Polynomial.eq_zero_of_infinite_isRoot
91     refine Set.Infinite.mono ?_ (Set.infinite_univ.sdiff (Set.finite_singleton 0))
92     intro a ha
93     simp only [Set.mem_diff, Set.mem_univ, Set.mem_singleton_iff, true_and] at ha
94     change Polynomial.eval a (fibreLinePolynomial y ξ g) = 0
95     rw [eval_fibreLinePolynomial]
96     exact hg _ (hW q hq a ha)
97   have hqeq : q = Sum.elim y ξ := by
98     funext i
99     cases i <;> rfl
100   rw [hqeq]
101   change MvPolynomial.eval (Sum.elim y ξ)
102       (DirectSum.decompose (orderDecomposition (k := k) (n := n)) g d :
103         SymbolRing k n) = 0
104   rw [← coeff_fibreLinePolynomial_eq_eval_weightedHomogeneousComponent y ξ g d,
105     hline, Polynomial.coeff_zero]
106 
107 end
108 end Stafford38.Geometry.FibreConicalVanishingIdeal
109 
110 #print axioms Stafford38.Geometry.FibreConicalVanishingIdeal.vanishingIdeal_isHomogeneous_of_isFibreConical
111