polygon_v2_four_ge_eight
If there exists a convex octagon in the plane admitting a real positive semidefinite slack factorization of size 4, and the set of realizable vertex counts is bounded above, then 8 ≤ V₂(4).
Statement
theorem polygon_v2_four_ge_eight (h8 : 8 ∈ polygon_psd_vertex_count 4) (hb : BddAbove (polygon_psd_vertex_count 4)) : 8 ≤ polygon_v2 4- Formalizes
- arXiv:2610.04498 Thm. 7.1
- Verified
- 24 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- 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 ≤…
- 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…
- 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…
- polygon_v2For a natural number r, polygon_v2 r is V₂(r), defined as the supremum of the set of vertex counts of convex polygons in the plane…
Read back from the Lean
Assuming that 8 is an element of polygon_psd_vertex_count 4 (hypothesis h8) and that polygon_psd_vertex_count 4 is bounded above in ℕ (hypothesis hb), 8 is less than or equal to polygon_v2 4.
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
By definition, V₂(4) is the supremum of the set of vertex counts of convex polygons that admit a size-4 positive semidefinite slack factorization. Under the hypotheses that this set contains 8 and is bounded above, 8 is at most the supremum by the defining property of suprema in conditionally complete lattices.
8 ≤ polygon_v2 4
By definition, `polygon_v2 4` is the supremum (`sSup`) of `polygon_psd_vertex_count 4`. Applying `le_csSup` to the hypothesis `hb` that this set is bounded above and the hypothesis `h8` that 8 belongs to it proves that 8 is less than or equal to the supremum.
uses
le_csSuptheorem polygon_v2_four_ge_eight (h8 : 8 ∈ polygon_psd_vertex_count 4) (hb : BddAbove (polygon_psd_vertex_count 4)) : 8 ≤ polygon_v2 4 := le_csSup hb h8
le_csSup- In a conditionally complete lattice, any element of a set bounded from above is less than or equal to the supremum of that set.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- V₂(4) is at least 8, provided an 8-gon with size-4 PSD slack factorization exists and the vertex count is bounded above. -/theorem polygon_v2_four_ge_eight (h8 : 8 ∈ polygon_psd_vertex_count 4) (hb : BddAbove (polygon_psd_vertex_count 4)) : 8 ≤ polygon_v2 4 := le_csSup hb h8