zero_not_mem_polygon_psd_vertex_count
For any natural number r, 0 does not belong to the set of vertex counts of convex polygons admitting a size-r positive semidefinite slack factorization.
Statement
theorem zero_not_mem_polygon_psd_vertex_count (r : ℕ) : 0 ∉ polygon_psd_vertex_count r- 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_count_ge_threeFor any natural numbers r and n, if n is the vertex count of a convex polygon admitting a size-r positive semidefinite slack…
- 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…
Read back from the Lean
For every natural number $r$, $0$ is not a member of the set polygon_psd_vertex_count r.
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 proof proceeds by contradiction. If 0 were the vertex count of a convex polygon admitting a size-r positive semidefinite slack factorization, then by polygon_psd_vertex_count_ge_three it would have to be at least 3. This gives 3 ≤ 0, an immediate arithmetic contradiction.
Assuming 0 is in the set polygon_psd_vertex_count r implies 3 ≤ 0.
Suppose for contradiction that 0 belongs to polygon_psd_vertex_count r (intro h). Applying polygon_psd_vertex_count_ge_three to this hypothesis establishes that any such vertex count must be at least 3, which yields 3 ≤ 0.
uses
polygon_psd_vertex_count_ge_threeintro h have := polygon_psd_vertex_count_ge_three h
A contradiction is reached.
Linear arithmetic on the natural numbers (omega) recognizes that 3 ≤ 0 is impossible and closes the goal.
omega
polygon_psd_vertex_count_ge_three- Any vertex count n in polygon_psd_vertex_count r satisfies 3 ≤ n.
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.
/-- Zero is not the vertex count of any convex polygon admitting a positive semidefinite slack factorization. -/theorem zero_not_mem_polygon_psd_vertex_count (r : ℕ) : 0 ∉ polygon_psd_vertex_count r := by intro h have := polygon_psd_vertex_count_ge_three h omega