AFTD Auto-Formalizing Theoretical Domains

polygon_v2_four_eq_eight_iff_no_larger

theoremverifiedoriginal

Assuming an 8-gon with size-4 positive semidefinite slack factorization exists and the set of realizable vertex counts is bounded above, V₂(4) = 8 if and only if every convex polygon admitting a size-4 positive semidefinite slack factorization has at most 8 vertices.

Statement

theorem polygon_v2_four_eq_eight_iff_no_larger (h8 : 8 ∈ polygon_psd_vertex_count 4) (hb : BddAbove (polygon_psd_vertex_count 4)) : polygon_v2 4 = 8 ↔ (∀ n ∈ polygon_psd_vertex_count 4, n ≤ 8)
Related work
arXiv:2610.04498 Sec. 8, P3
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 \in \text{polygon\_psd\_vertex\_count } 4$ (hypothesis h8) and that the set $\text{polygon\_psd\_vertex\_count } 4$ is bounded above in $\mathbb{N}$ (hypothesis hb), the value $\text{polygon\_v2 } 4$ equals $8$ if and only if every $n \in \text{polygon\_psd\_vertex\_count } 4$ satisfies $n \le 8$.

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 theorem characterizes when the maximum number of vertices of a convex polygon admitting a size-4 positive semidefinite slack factorization is 8. By definition, polygon_v2 4 is the supremum of the set of realizable vertex counts polygon_psd_vertex_count 4. Since this set contains 8 and is bounded above, the supremum is at least 8. Antisymmetry then reduces the equality polygon_v2 4 = 8 to the upper bound condition polygon_v2 4 ≤ 8, which holds if and only if every realizable polygon has at most 8 vertices.

  1. The set of realizable vertex counts is nonempty and 8 is bounded above by its supremum, so 8 ≤ polygon_v2 4.

    Since 8 is assumed to belong to polygon_psd_vertex_count 4 (hypothesis h8), the set is nonempty, witnessed by 8. Because the set is bounded above (hypothesis hb), le_csSup implies that any element of the set is at most its supremum, establishing 8 ≤ polygon_v2 4.

    lines 3–4

    uses le_csSup

      have hne : (polygon_psd_vertex_count 4).Nonempty := ⟨8, h8⟩
      have hge : 8 ≤ polygon_v2 4 := le_csSup hb h8
  2. polygon_v2 4 = 8 holds if and only if every polygon in polygon_psd_vertex_count 4 has at most 8 vertices.

    Unfolding the definition of polygon_v2 4 as the supremum of polygon_psd_vertex_count 4, equality with 8 is equivalent by le_antisymm_iff to the conjunction sSup ≤ 8 ∧ 8 ≤ sSup. The second conjunct 8 ≤ sSup was already established in the previous step. For a nonempty set bounded above, csSup_le_iff states that the supremum is at most 8 if and only if every element of the set is at most 8. Simplification with these two facts completes the equivalence.

    lines 5–7

    uses le_antisymm_iff, csSup_le_iff

      rw [polygon_v2] at *
      rw [le_antisymm_iff]
      simp [hge, csSup_le_iff hb hne]
le_csSup
An element of a set bounded above in a conditionally complete lattice is at most the supremum of that set.
le_antisymm_iff
In a partially ordered set, two elements are equal if and only if each is less than or equal to the other.
csSup_le_iff
For a nonempty set bounded above in a conditionally complete lattice, its supremum is at most a given value if and only if every element of the set is at most that value.

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

/-- Characterisation of V₂(4) = 8: given attainment of 8 and boundedness, V₂(4) = 8 if and only if every realizable polygon has at most 8 vertices. -/theorem polygon_v2_four_eq_eight_iff_no_larger (h8 : 8 ∈ polygon_psd_vertex_count 4) (hb : BddAbove (polygon_psd_vertex_count 4)) : polygon_v2 4 = 8 ↔ (∀ n ∈ polygon_psd_vertex_count 4, n ≤ 8) := by  have hne : (polygon_psd_vertex_count 4).Nonempty := ⟨8, h8⟩  have hge : 8 ≤ polygon_v2 4 := le_csSup hb h8  rw [polygon_v2] at *  rw [le_antisymm_iff]  simp [hge, csSup_le_iff hb hne]
See it in the graphDiscuss this resultChallenge it