AFTD Auto-Formalizing Theoretical Domains

pyramid_polytope

def

Given natural numbers n and m, a subset B of Fin n → ℝ, and a family of m + 1 vertices v : Fin (m + 1) → (Fin m → ℝ) in Fin m → ℝ, the pyramid polytope pyramid_polytope B v in Fin (n + m) → ℝ is the convex hull in Fin (n + m) → ℝ of the union of the image of B under concatenation with v 0 (namely the points Fin.append x (v 0) for x in B) and the set of apices Fin.append (0 : Fin n → ℝ) (v j.succ) for all j in Fin m.

Statement

def pyramid_polytope {n m : ℕ} (B : Set (Fin n → ℝ)) (v : Fin (m + 1) → (Fin m → ℝ)) :
    Set (Fin (n + m) → ℝ)
Defined in
scout/2611-08819-reflexive-polytopes-can-have-doubly-exponentially-many-vert.md:234
Verified
10 Nov 2026
Axioms
none listed
Used by 1
  • pyramid_polytope_base_subsetGiven natural numbers n and m, a subset B of Fin n → ℝ, and a family of vertices v : Fin (m + 1) → (Fin m → ℝ), the image of B under…

Read back from the Lean

Given natural numbers n and m, a subset B ⊆ (Fin n → ℝ), and a sequence of m + 1 vectors v : Fin (m + 1) → (Fin m → ℝ), pyramid_polytope B v is defined as the convex hull in Fin (n + m) → ℝ of the union of: 1. the image of B under the map x ↦ Fin.append x (v 0) (i.e., vectors whose first n coordinates are given by x ∈ B and whose last m coordinates are v 0), and 2. the range of the map j : Fin m ↦ Fin.append (0 : Fin n → ℝ) (v j.succ) (i.e., vectors whose first n coordinates are 0 and whose last m coordinates are v (j + 1) for each j ∈ Fin 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

/-- The m-fold pyramid polytope over a base B in ℝ^n with apices from the vertices of a simplex in ℝ^m. -/
def pyramid_polytope {n m : ℕ} (B : Set (Fin n → ℝ)) (v : Fin (m + 1) → (Fin m → ℝ)) :
    Set (Fin (n + m) → ℝ) := convexHull ℝ (((fun x => Fin.append x (v 0)) '' B) ∪
    (Set.range (fun j : Fin m => Fin.append (0 : Fin n → ℝ) (v j.succ))))
See it in the graphDiscuss this resultChallenge it