File size: 5,991 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 | import OAI.AlgebraicGeometry.Foundations.Scheme.HomogeneousEvalMap
import Mathlib.LinearAlgebra.Projectivization.Basic
/-! # Projective Zero Locus -/
namespace OAI.AlgebraicGeometry.Foundations.Scheme.ProjectiveZeroLocus
/-!
# Homogeneous polynomial zero loci on projective space
A homogeneous polynomial need not define a scalar-valued function on projective space,
but its vanishing does descend. This file constructs that descended set using the
actual quotient `Projectivization` and proves its representative criterion.
This is a set-level construction. No identification with the analytic complex points
of a projective scheme, or with the scheme's closed subschemes, is asserted here.
-/
open _root_.MvPolynomial
variable {K : Type*} {ι : Type*} [Field K]
/-- The projective vanishing locus of a homogeneous polynomial. -/
def homogeneousProjectiveZeroLocus (f : MvPolynomial ι K) {d : ℕ}
(hf : f.IsHomogeneous d) : Set (Projectivization K (ι → K)) :=
fun p => Projectivization.lift
(fun (v : {v : ι → K // v ≠ 0}) => eval (v : ι → K) f = 0)
(by
intro a b c h
apply propext
have hc : c ≠ 0 := by
intro hc
apply a.property
simpa only [hc, zero_smul] using h
rw [h]
exact HomogeneousEvalMap.eval_smul_eq_zero_iff hf hc (b : ι → K)) p
@[simp]
theorem mem_homogeneousProjectiveZeroLocus_mk (f : MvPolynomial ι K) {d : ℕ}
(hf : f.IsHomogeneous d) (v : ι → K) (hv : v ≠ 0) :
Projectivization.mk K v hv ∈ homogeneousProjectiveZeroLocus f hf ↔
eval v f = 0 :=
Iff.rfl
/-- The vanishing test may be made on any nonzero representative. -/
theorem mem_homogeneousProjectiveZeroLocus_iff (f : MvPolynomial ι K) {d : ℕ}
(hf : f.IsHomogeneous d) (p : Projectivization K (ι → K))
(v : ι → K) (hv : v ≠ 0) (hp : Projectivization.mk K v hv = p) :
p ∈ homogeneousProjectiveZeroLocus f hf ↔ eval v f = 0 := by
subst p
exact mem_homogeneousProjectiveZeroLocus_mk f hf v hv
/-- The chosen representative in mathlib gives the same test. -/
theorem mem_homogeneousProjectiveZeroLocus_rep (f : MvPolynomial ι K) {d : ℕ}
(hf : f.IsHomogeneous d) (p : Projectivization K (ι → K)) :
p ∈ homogeneousProjectiveZeroLocus f hf ↔ eval p.rep f = 0 :=
mem_homogeneousProjectiveZeroLocus_iff f hf p p.rep p.rep_nonzero p.mk_rep
/-- Equivalently, a homogeneous polynomial vanishes on some representative. -/
theorem mem_homogeneousProjectiveZeroLocus_exists (f : MvPolynomial ι K) {d : ℕ}
(hf : f.IsHomogeneous d) (p : Projectivization K (ι → K)) :
p ∈ homogeneousProjectiveZeroLocus f hf ↔
∃ (v : ι → K) (hv : v ≠ 0), Projectivization.mk K v hv = p ∧ eval v f = 0 := by
constructor
· intro hp
exact ⟨p.rep, p.rep_nonzero, p.mk_rep,
(mem_homogeneousProjectiveZeroLocus_rep f hf p).mp hp⟩
· rintro ⟨v, hv, hp, hzero⟩
exact (mem_homogeneousProjectiveZeroLocus_iff f hf p v hv hp).mpr hzero
/-- Equivalently, it vanishes on every representative. -/
theorem mem_homogeneousProjectiveZeroLocus_forall (f : MvPolynomial ι K) {d : ℕ}
(hf : f.IsHomogeneous d) (p : Projectivization K (ι → K)) :
p ∈ homogeneousProjectiveZeroLocus f hf ↔
∀ (v : ι → K) (hv : v ≠ 0), Projectivization.mk K v hv = p → eval v f = 0 := by
constructor
· intro hp v hv hrep
exact (mem_homogeneousProjectiveZeroLocus_iff f hf p v hv hrep).mp hp
· intro hp
exact (mem_homogeneousProjectiveZeroLocus_rep f hf p).mpr
(hp p.rep p.rep_nonzero p.mk_rep)
/-- Changing the proof or the degree of homogeneity does not change the vanishing set. -/
theorem homogeneousProjectiveZeroLocus_eq (f : MvPolynomial ι K) {d e : ℕ}
(hf : f.IsHomogeneous d) (hg : f.IsHomogeneous e) :
homogeneousProjectiveZeroLocus f hf = homogeneousProjectiveZeroLocus f hg := by
ext p
rw [mem_homogeneousProjectiveZeroLocus_rep, mem_homogeneousProjectiveZeroLocus_rep]
/-- A family of homogeneous equations cuts out their intersection. -/
def projectiveCommonZeroLocus {κ : Type*} (f : κ → MvPolynomial ι K)
(d : κ → ℕ) (hf : ∀ k, (f k).IsHomogeneous (d k)) :
Set (Projectivization K (ι → K)) :=
⋂ k, homogeneousProjectiveZeroLocus (f k) (hf k)
@[simp]
theorem mem_projectiveCommonZeroLocus_mk {κ : Type*} (f : κ → MvPolynomial ι K)
(d : κ → ℕ) (hf : ∀ k, (f k).IsHomogeneous (d k)) (v : ι → K) (hv : v ≠ 0) :
Projectivization.mk K v hv ∈ projectiveCommonZeroLocus f d hf ↔
∀ k, eval v (f k) = 0 := by
simp [projectiveCommonZeroLocus]
/-- A degree-zero equation is constant, so it either cuts out everything or nothing. -/
@[simp]
theorem mem_homogeneousProjectiveZeroLocus_C (c : K)
(p : Projectivization K (ι → K)) :
p ∈ homogeneousProjectiveZeroLocus (C c) (isHomogeneous_C ι c) ↔ c = 0 := by
rw [mem_homogeneousProjectiveZeroLocus_rep]
simp
@[simp]
theorem homogeneousProjectiveZeroLocus_zero (d : ℕ) :
homogeneousProjectiveZeroLocus (0 : MvPolynomial ι K)
(isHomogeneous_zero ι K d) = Set.univ := by
ext p
rw [mem_homogeneousProjectiveZeroLocus_rep]
simp
/-- A nonzero constant has empty projective zero locus, also in degree zero. -/
theorem homogeneousProjectiveZeroLocus_C_of_ne_zero (c : K) (hc : c ≠ 0) :
homogeneousProjectiveZeroLocus (C c : MvPolynomial ι K)
(isHomogeneous_C ι c) = ∅ := by
ext p
simp [hc]
/-- Product equations give the union of their projective vanishing loci. -/
theorem homogeneousProjectiveZeroLocus_mul (f g : MvPolynomial ι K) {d e : ℕ}
(hf : f.IsHomogeneous d) (hg : g.IsHomogeneous e) :
homogeneousProjectiveZeroLocus (f * g) (hf.mul hg) =
homogeneousProjectiveZeroLocus f hf ∪ homogeneousProjectiveZeroLocus g hg := by
ext p
simp only [Set.mem_union, mem_homogeneousProjectiveZeroLocus_rep, map_mul, mul_eq_zero]
end OAI.AlgebraicGeometry.Foundations.Scheme.ProjectiveZeroLocus
|