AFTD Auto-Formalizing Theoretical Domains

is_facet_lattice_distance

def

A positive integer h is the lattice distance of a facet F of a polytope B in ℝ^n from the origin if there exists a primitive integral vector a in ℤ^n such that for all x in B, ⟨a, x⟩ ≥ -h, and for all x in F, ⟨a, x⟩ = -h.

Statement

open scoped BigOperators in
def is_facet_lattice_distance {n : ℕ} (B F : Set (Fin n → ℝ)) (h : ℕ) : Prop
Defined in
scout/2611-08819-reflexive-polytopes-can-have-doubly-exponentially-many-vert.md:241
Verified
10 Nov 2026
Axioms
none listed

Read back from the Lean

For a dimension n : ℕ, sets B, F ⊆ ℝⁿ (represented as Set (Fin n → ℝ)), and a natural number h : ℕ, is_facet_lattice_distance B F h asserts that: 1. h > 0, and 2. There exists an integer vector a : Fin n → ℤ such that: a. The greatest common divisor of the components of a over Fin n is 1 (i.e., Finset.gcd Finset.univ a = 1), b. For every point x ∈ B, the standard dot product ∑ i, a_i * x_i is at least -h (i.e., - (h : ℝ) ≤ ∑ i, (a i : ℝ) * x i), and c. For every point x ∈ F, the standard dot product ∑ i, a_i * x_i equals -h (i.e., ∑ i, (a i : ℝ) * x i = - (h : ℝ)).

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
/-- A positive integer h is the lattice distance of a facet F of B from the origin if F is defined by a primitive inward normal functional at level -h. -/
def is_facet_lattice_distance {n : ℕ} (B F : Set (Fin n → ℝ)) (h : ℕ) : Prop := 0 < h ∧
  ∃ a : Fin n → ℤ,
    Finset.gcd Finset.univ a = 1 ∧
    (∀ x ∈ B, - (h : ℝ) ≤ ∑ i, (a i : ℝ) * x i) ∧
    (∀ x ∈ F, ∑ i, (a i : ℝ) * x i = - (h : ℝ))
See it in the graphDiscuss this resultChallenge it