AFTD Auto-Formalizing Theoretical Domains

is_reflexive_simplex

def

An m-dimensional reflexive simplex S in ℝ^m with affinely independent vertices v_0, ..., v_m in ℝ^m and associated unit partition with denominators k_0, ..., k_m positive integers is a reflexive polytope equal to the convex hull of {v_0, ..., v_m} such that ∑_{i=0}^m 1/k_i = 1 and ∑_{i=0}^m (1/k_i) v_i = 0.

Statement

open scoped BigOperators in
def is_reflexive_simplex {m : ℕ} (S : Set (Fin m → ℝ)) (v : Fin (m + 1) → (Fin m → ℝ))
    (k : Fin (m + 1) → ℕ) : Prop
Defined in
scout/2611-08819-reflexive-polytopes-can-have-doubly-exponentially-many-vert.md:206
Verified
10 Nov 2026
Axioms
none listed
Built on 1
  • is_reflexive_polytopeA subset P of ℝ^d is a reflexive polytope if P is a lattice polytope containing the origin in its interior and its polar polytope is also…

Read back from the Lean

For a dimension $m : ℕ$, a set $S \subseteq \mathbb{R}^m$, an $(m+1)$-tuple of vertices $v : \mathrm{Fin}(m + 1) \to \mathbb{R}^m$, and an $(m+1)$-tuple of natural numbers $k : \mathrm{Fin}(m + 1) \to ℕ$, is_reflexive_simplex S v k is the proposition that: 1. $S$ is a reflexive polytope (i.e., is_reflexive_polytope S); 2. $S$ is the convex hull of the vertices $v$ (i.e., $S = \mathrm{convexHull}_{\mathbb{R}}(\mathrm{range}(v))$); 3. The vertices $v$ are affinely independent over $\mathbb{R}$; 4. For every index $i \in \mathrm{Fin}(m + 1)$, $k(i) > 0$; 5. The sum of the unit fractions $\sum_{i \in \mathrm{Fin}(m+1)} \frac{1}{k(i)} = 1$ in $\mathbb{R}$; and 6. The weighted sum $\sum_{i \in \mathrm{Fin}(m+1)} \frac{1}{k(i)} v(i) = 0$ in $\mathbb{R}^m$.

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

open scoped BigOperators in
/-- An m-dimensional reflexive simplex S with vertices v and associated unit partition denominators k. -/
def is_reflexive_simplex {m : ℕ} (S : Set (Fin m → ℝ)) (v : Fin (m + 1) → (Fin m → ℝ))
    (k : Fin (m + 1) → ℕ) : Prop := is_reflexive_polytope S ∧
  S = convexHull ℝ (Set.range v) ∧
  AffineIndependent ℝ v ∧
  (∀ i, 0 < k i) ∧
  (∑ i, (1 : ℝ) / (k i : ℝ) = 1) ∧
  (∑ i, ((1 : ℝ) / (k i : ℝ)) • v i = 0)
See it in the graphDiscuss this resultChallenge it