AFTD Auto-Formalizing Theoretical Domains

is_convex_polygon_slack_matrix

def

A 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 ≤ n and there exist an injective function v : Fin n → Fin 2 → ℝ and a family of affine functionals ℓ : Fin n → (Fin 2 → ℝ) →ᵃ[ℝ] ℝ such that the extreme points of the convex hull of range(v) equal range(v), the affine span of range(v) is ⊤, the convex hull of range(v) equals {x | ∀ i, 0 ≤ ℓ i x}, for each i there exist distinct indices j₁ ≠ j₂ such that ℓ i (v j₁) = 0 and ℓ i (v j₂) = 0, and S i j = ℓ i (v j) for all i and j.

Statement

def is_convex_polygon_slack_matrix (n : ℕ) (S : Matrix (Fin n) (Fin n) ℝ) : Prop
Defined in
arXiv:2610.04498 Sec. 2
Verified
23 Oct 2026
Axioms
none listed
Used by 7
  • 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…
  • 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…
  • is_convex_polygon_slack_matrix_nonnegFor any natural number n and any real matrix S : Matrix (Fin n) (Fin n) ℝ, if is_convex_polygon_slack_matrix n S holds, then for all…
  • 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

The definition is_convex_polygon_slack_matrix n S asserts that for a natural number $n$ and an $n \times n$ matrix $S$ over $\mathbb{R}$ (indexed by Fin n): 1. $3 \le n$; 2. There exist points $v : \text{Fin } n \to (\text{Fin } 2 \to \mathbb{R})$ (i.e., $n$ points in $\mathbb{R}^2$) and affine maps $\ell : \text{Fin } n \to ((\text{Fin } 2 \to \mathbb{R}) \to^a[\mathbb{R}] \mathbb{R})$ (i.e., $n$ affine functionals on $\mathbb{R}^2$) such that: - $v$ is injective (all $n$ points are pairwise distinct); - The set of extreme points of the convex hull of the range of $v$ is exactly the range of $v$ (every point is a vertex of the convex hull); - The affine span of the range of $v$ is all of $\mathbb{R}^2$ (the points are not collinear); - The convex hull of the range of $v$ equals the intersection of the halfspaces $\{x \mid \forall i, 0 \le \ell_i(x)\}$; - For every $i \in \text{Fin } n$, there exist distinct indices $j_1 \ne j_2$ in $\text{Fin } n$ such that $\ell_i(v(j_1)) = 0$ and $\ell_i(v(j_2)) = 0$ (each bounding hyperplane contains at least two distinct vertices); - For all $i, j \in \text{Fin } n$, the matrix entry $S_{i, j}$ equals $\ell_i(v(j))$.

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

/-- A real matrix S is the slack matrix of a convex n-gon in ℝ² if it is generated by n extreme vertices and n facet-defining affine functionals. -/
def is_convex_polygon_slack_matrix (n : ℕ) (S : Matrix (Fin n) (Fin n) ℝ) : Prop := 3 ≤ n ∧
  ∃ (v : Fin n → Fin 2 → ℝ) (ℓ : Fin n → (Fin 2 → ℝ) →ᵃ[ℝ] ℝ),
    Function.Injective v ∧
    (convexHull ℝ (Set.range v)).extremePoints ℝ = Set.range v ∧
    affineSpan ℝ (Set.range v) = ⊤ ∧
    convexHull ℝ (Set.range v) = {x | ∀ i, 0 ≤ ℓ i x} ∧
    (∀ i, ∃ j₁ j₂, j₁ ≠ j₂ ∧ ℓ i (v j₁) = 0 ∧ ℓ i (v j₂) = 0) ∧
    ∀ i j, S i j = ℓ i (v j)
See it in the graphDiscuss this resultChallenge it