AFTD Auto-Formalizing Theoretical Domains

polygon_psd_vertex_count

deforiginal

For 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 the slack matrix of a convex n-gon in the plane and has a real positive semidefinite factorization of size r.

Statement

def polygon_psd_vertex_count (r : ℕ) : Set ℕ
Related work
arXiv:2610.04498 Sec. 1
Verified
23 Oct 2026
Axioms
none listed
Built on 2
  • 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…
Used by 5
  • 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…
  • 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…
  • polygon_v2_four_eq_eight_iff_no_largerAssuming an 8-gon with size-4 positive semidefinite slack factorization exists and the set of realizable vertex counts is bounded above,…
  • polygon_v2_four_ge_eightIf there exists a convex octagon in the plane admitting a real positive semidefinite slack factorization of size 4, and the set of…
  • 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…

Read back from the Lean

For a given natural number r, polygon_psd_vertex_count r is defined as the set of natural numbers n for which there exists an n × n real matrix S such that S is the slack matrix of an n-vertex convex polygon in ℝ² and S admits a positive semidefinite (PSD) factorization of size r.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The set of vertex counts n of convex polygons in ℝ² admitting a size-r real positive semidefinite slack factorization. -/
def polygon_psd_vertex_count (r : ℕ) : Set ℕ := {n : ℕ | ∃ (S : Matrix (Fin n) (Fin n) ℝ), is_convex_polygon_slack_matrix n S ∧ matrix_has_psd_factorization S r}
See it in the graphDiscuss this resultChallenge it