polygon_psd_vertex_count_ge_three
For any natural numbers r and n, if n is the vertex count of a convex polygon admitting a size-r positive semidefinite slack factorization, then 3 ≤ n.
Statement
theorem polygon_psd_vertex_count_ge_three {r n : ℕ} (h : n ∈ polygon_psd_vertex_count r) : 3 ≤ n- Source
- arXiv:2610.04498 Sec. 2
- Verified
- 24 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- is_convex_polygon_slack_matrixA real matrix S : Matrix (Fin n) (Fin n) ℝ is the slack matrix of a convex n-gon in the plane (is_convex_polygon_slack_matrix n S) if 3 ≤…
- polygon_psd_vertex_countFor a natural number r, polygon_psd_vertex_count r is the set of natural numbers n such that there exists an n × n real matrix S that is…
- matrix_has_psd_factorizationFor types m and n, a real matrix M : Matrix m n ℝ has a positive semidefinite (PSD) factorization of size r (for a natural number r) if…
- Used by 1
- zero_not_mem_polygon_psd_vertex_countFor any natural number r, 0 does not belong to the set of vertex counts of convex polygons admitting a size-r positive semidefinite slack…
Read back from the Lean
For any natural numbers $r$ and $n$, if $n$ is in polygon_psd_vertex_count r, then $3 \le n$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The result follows directly by unfolding definitions. By definition, membership of n in `polygon_psd_vertex_count r` implies there exists a slack matrix S for an n-gon, which in turn explicitly requires 3 ≤ n as its very first condition.
3 ≤ n
By definition of `polygon_psd_vertex_count`, the assumption gives a matrix S satisfying `is_convex_polygon_slack_matrix n S` (as well as admitting a PSD factorization). The definition of `is_convex_polygon_slack_matrix` explicitly requires 3 ≤ n as its first conjunct; extracting this conjunct (via `hS.1`) completes the proof.
rcases h with ⟨S, hS, -⟩ exact hS.1
- The requirement 3 ≤ n is built directly into the definition of `is_convex_polygon_slack_matrix`, so the proof does not need to analyze positive semidefinite factorizations or convex geometry.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Every polygon admitting a positive semidefinite slack factorization has at least 3 vertices. -/theorem polygon_psd_vertex_count_ge_three {r n : ℕ} (h : n ∈ polygon_psd_vertex_count r) : 3 ≤ n := by rcases h with ⟨S, hS, -⟩ exact hS.1