[Merged by Bors] - feat(Projectivization/Colinear): Define colinearity for points in projective spaces

Mathlib.lean

@@ -5111,6 +5111,7 @@ public import Mathlib.LinearAlgebra.Projection
 public import Mathlib.LinearAlgebra.Projectivization.Action
 public import Mathlib.LinearAlgebra.Projectivization.Basic
 public import Mathlib.LinearAlgebra.Projectivization.Cardinality
+public import Mathlib.LinearAlgebra.Projectivization.Collinear
 public import Mathlib.LinearAlgebra.Projectivization.Constructions
 public import Mathlib.LinearAlgebra.Projectivization.Independence
 public import Mathlib.LinearAlgebra.Projectivization.Subspace

Mathlib/LinearAlgebra/FiniteDimensional/Basic.lean

@@ -53,6 +53,14 @@ section DivisionRing
 variable [DivisionRing K] [AddCommGroup V] [Module K V] {V₂ : Type v'} [AddCommGroup V₂]
   [Module K V₂]
 
+theorem finrank_le_iff_rank_le [FiniteDimensional K V] {n : ℕ} :
+    finrank K V ≤ n ↔ Module.rank K V ≤ n := by
+  simp [← Cardinal.toNat_le_iff_le_of_lt_aleph0 (rank_lt_aleph0 K V), finrank]
+
+theorem finrank_lt_iff_rank_lt [FiniteDimensional K V] {n : ℕ} :
+    finrank K V < n ↔ Module.rank K V < n := by
+  simp [← Cardinal.toNat_lt_iff_lt_of_lt_aleph0 (rank_lt_aleph0 K V), finrank]
+
 theorem _root_.LinearIndependent.lt_aleph0_of_finiteDimensional {ι : Type w} [FiniteDimensional K V]
     {v : ι → V} (h : LinearIndependent K v) : #ι < ℵ₀ :=
   h.lt_aleph0_of_finite

Mathlib/LinearAlgebra/Projectivization/Collinear.lean

@@ -0,0 +1,121 @@
+/-
+Copyright (c) 2026 Yunzhou Xie. All rights reserved.
+Released under Apache 2.0 license as described in the file LICENSE.
+Authors: Edison Xie, Bhavik Mehta
+-/
+module
+
+public import Mathlib.LinearAlgebra.Projectivization.Subspace
+public import Mathlib.LinearAlgebra.Projectivization.Independence
+public import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas
+public import Mathlib.LinearAlgebra.FiniteDimensional.Basic
+
+/-!
+
+# Collinearity in Projective Space
+
+This file defines collinearity of points in projective space and proves
+the uniqueness of the line through two distinct points.
+
+## Main Results
+
+* `Projectivization.IsCollinear`: A family of points in projective space is collinear if there
+  exists a submodule of dimension at most 2 containing all points in the family.
+* `Projectivization.line_unique`: Given two distinct points in projective space, there is a unique
+  line (submodule of dimension 2) containing both points.
+
+## Tags
+Projective space, collinearity, projective geometry
+
+-/
+
+@[expose] public section
+
+variable {K V : Type*} [DivisionRing K] [AddCommGroup V] [Module K V]
+  (M : Submodule K V) (S : Set (Projectivization K V))
+
+namespace Projectivization
+
+/-- If there exists a submodule of dimension at most `2` containing all points in
+  `S`, then `S` is collinear. The finite-dimensionality is required so that this notion is
+  meaningful even when `V` is infinite-dimensional. -/
+def IsCollinear : Prop := ∃ (M : Subspace K V), Module.Finite K M.submodule ∧
+  Module.finrank K M.submodule ≤ 2 ∧ S ⊆ M
+
+lemma IsCollinear_iff : IsCollinear S ↔ ∃ (M : Subspace K V), Module.Finite K M.submodule ∧
+  Module.finrank K M.submodule ≤ 2 ∧ S ⊆ M := Iff.rfl
+
+lemma IsCollinear_iff_rank :
+    IsCollinear S ↔
+      ∃ (M : Subspace K V), Module.rank K M.submodule ≤ 2 ∧ S ⊆ M := by
+  rw [IsCollinear_iff]
+  refine ⟨fun ⟨M, hM1, hM2, hM3⟩ ↦ ⟨M, ?_, hM3⟩, fun ⟨M, hM1, hM2⟩ ↦ ⟨M, ?_, ?_, hM2⟩⟩
+  · exact FiniteDimensional.finrank_le_iff_rank_le (K := K) (V := M.submodule) (n := 2)|>.1 hM2
+  · exact Module.rank_lt_aleph0_iff.1 (hM1.trans_lt (by norm_num))
+  · exact Module.finrank_le_of_rank_le hM1
+
+@[simp]
+lemma isCollinear_empty : IsCollinear (∅ : Set (Projectivization K V)) := by
+  rw [IsCollinear_iff_rank]
+  use ⊥
+  rw [map_bot]
+  simp
+
+open scoped LinearAlgebra.Projectivization
+
+lemma isCollinear_subset (s t : Set (ℙ K V)) (hst : s ⊆ t) (h : IsCollinear t) : IsCollinear s := by
+  obtain ⟨M, hMfin, hM1, hM2⟩ := h
+  exact ⟨M, hMfin, hM1, hst.trans hM2⟩
+
+@[simp]
+lemma isCollinear_singleton' (a : ℙ K V) : IsCollinear {a} := by
+  induction a using ind with | h v hv =>
+  refine ⟨(Submodule.span K {v}).projectivization, ?_, ?_, ?_⟩
+  · rw [Subspace.submodule.apply_symm_apply]
+    exact Module.Finite.span_of_finite _ (Set.toFinite _)
+  · rw [Subspace.submodule.apply_symm_apply, finrank_span_singleton hv]
+    omega
+  · simp [Submodule.mem_span_of_mem]
+
+lemma isCollinear_subsingleton (hS : S.Subsingleton) :
+    IsCollinear S := by
+  obtain hS' | ⟨x, hx⟩ := hS.eq_empty_or_singleton <;> simp_all
+
+lemma isCollinear_pair (a b : ℙ K V) : IsCollinear {a, b} := by
+  if h : a = b then simp [h] else
+  induction a using Projectivization.ind with | h v hv =>
+  induction b using Projectivization.ind with | h w hw =>
+  rw [← ne_eq, ← independent_pair_iff_ne, independent_mk_iff_LinearIndependent] at h
+  refine ⟨(Submodule.span K {v, w}).projectivization, ?_, ?_, fun s hs ↦ hs.casesOn ?_ ?_⟩
+  · rw [Subspace.submodule.apply_symm_apply]
+    exact Module.Finite.span_of_finite _ (Set.toFinite _)
+  · rw [Subspace.submodule.apply_symm_apply, ← Matrix.range_cons_cons_empty v w ![]]
+    simp [finrank_span_eq_card h]
+  all_goals rintro rfl; simp [Submodule.mem_span_of_mem]
+
+lemma isCollinear_of_card_eq_two (hS : S.ncard = 2) : IsCollinear S := by
+  obtain ⟨x, y, _, rfl⟩ := Set.ncard_eq_two.1 hS
+  exact isCollinear_pair x y
+
+lemma line_unique' {u v : V} (hu : u ≠ 0) (hv : v ≠ 0) (huv : LinearIndependent K ![u, v])
+    (p : Submodule K V) (hp1 : Module.finrank K p = 2)
+    (hp2 : mk K u hu ∈ p.projectivization) (hp3 : mk K v hv ∈ p.projectivization) :
+    p = Submodule.span K {u, v} := by
+  have h1 : Submodule.span K {u, v} ≤ p := by
+    refine Submodule.span_le.2 fun x hx ↦ ?_
+    simp only [Submodule.mk_mem_projectivization_iff] at hp2 hp3
+    refine hx.casesOn ?_ ?_ <;> simp_all
+  have : Module.Finite K p := Module.finite_of_finrank_eq_succ hp1
+  refine Submodule.eq_of_le_of_finrank_eq h1 ?_ |>.symm
+  rw [hp1, ← Matrix.range_cons_cons_empty _ _ ![]]
+  simp [finrank_span_eq_card huv]
+
+lemma line_unique {x y : ℙ K V} (hxy : x ≠ y) (p q : Submodule K V) (hp1 : Module.finrank K p = 2)
+    (hq1 : Module.finrank K q = 2) (hp2 : x ∈ p.projectivization) (hp3 : y ∈ p.projectivization)
+    (hq2 : x ∈ q.projectivization) (hq3 : y ∈ q.projectivization) : p = q := by
+  induction x using ind with | h v hv =>
+  induction y using ind with | h w hw =>
+  rw [← independent_pair_iff_ne, independent_mk_iff_LinearIndependent] at hxy
+  rw [line_unique' hv hw hxy p hp1 hp2 hp3, line_unique' hv hw hxy q hq1 hq2 hq3]
+
+end Projectivization

Mathlib/LinearAlgebra/Projectivization/Independence.lean

@@ -25,7 +25,6 @@ ambient vector space. Similarly for the definition of dependence.
 
 ## Future Work
 
-- Define collinearity in projective space.
 - Prove the axioms of a projective geometry are satisfied by the dependence relation.
 - Define projective linear subspaces.
 -/

Mathlib/LinearAlgebra/Projectivization/Subspace.lean

@@ -247,6 +247,13 @@ theorem mem_submodule_iff (s : Projectivization.Subspace K V) {v : V} (hv : v 
     v ∈ submodule s ↔ Projectivization.mk K v hv ∈ s :=
   ⟨fun h => h hv, fun h _ => h⟩
 
+@[simp]
+lemma bot_coe : ((⊥ : Subspace K V) : Set (Projectivization K V)) = ∅ := by
+  ext x
+  simp only [SetLike.mem_coe, Set.mem_empty_iff_false, iff_false]
+  induction x using ind with | h v hv =>
+  rwa [← Subspace.mem_submodule_iff _ hv, Subspace.submodule.map_bot, Submodule.mem_bot]
+
 end Subspace
 
 end Projectivization