polytope_polar
def
The polar polytope of a subset P of ℝ^d is the set of all vectors y in ℝ^d such that for every x in P, the standard inner product of x and y is at least -1.
Statement
open scoped BigOperators in def polytope_polar {d : ℕ} (P : Set (Fin d → ℝ)) : Set (Fin d → ℝ)
- 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 of Fin d → ℝ, polytope_polar P is defined as the set of all vectors y : Fin d → ℝ such that for every x ∈ P, the standard inner product ∑ i, x i * y i is greater than or equal to -1 (i.e., -1 ≤ ∑ i, x i * y i).
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 /-- The polar polytope of P ⊆ ℝ^d is the set of points y with ∑ x_i y_i ≥ -1 for all x ∈ P. -/ def polytope_polar {d : ℕ} (P : Set (Fin d → ℝ)) : Set (Fin d → ℝ) := {y : Fin d → ℝ | ∀ x ∈ P, -1 ≤ ∑ i, x i * y i}