is_lattice_polytope
def
A subset P of ℝ^d is a lattice polytope if P is the convex hull of the real embeddings of a finite set of integer lattice vectors in ℤ^d.
Statement
def is_lattice_polytope {d : ℕ} (P : Set (Fin d → ℝ)) : Prop
- Defined in
- arXiv:2611.08819 Section 1; Batyrev 1994
- Verified
- 09 Nov 2026
- Axioms
- none listed
- Used by 2
- p8_reflexive_with_1371_convex_facetsThe 8-dimensional polytope P_8 is a reflexive polytope with exactly 44 vertices and exactly 1371 facets, which exceeds 6^(8/2) = 1296,…
- 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
Given a natural number $d$ and a subset $P \subseteq \mathbb{R}^d$ (represented as Set (Fin d → ℝ)), is_lattice_polytope P asserts that there exists a finite set $S$ of integer lattice points (of type Finset (Fin d → ℤ)) such that $P$ is the real convex hull of the image of $S$ under the canonical coordinate-wise inclusion from $\mathbb{Z}^d$ into $\mathbb{R}^d$.
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 subset of ℝ^d is a lattice polytope if it is the convex hull of a finite set of integer lattice points. -/ def is_lattice_polytope {d : ℕ} (P : Set (Fin d → ℝ)) : Prop := ∃ S : Finset (Fin d → ℤ), P = convexHull ℝ ((fun z i => (z i : ℝ)) '' (S : Set (Fin d → ℤ)))