AFTD Auto-Formalizing Theoretical Domains

pyramid_polytope_base_subset

theoremverified

Given 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 concatenation with v 0, {Fin.append x (v 0) | x ∈ B}, is a subset of the pyramid polytope pyramid_polytope B v in Fin (n + m) → ℝ.

Statement

theorem pyramid_polytope_base_subset {n m : ℕ} (B : Set (Fin n → ℝ))
    (v : Fin (m + 1) → (Fin m → ℝ)) :
    (fun x => Fin.append x (v 0)) '' B ⊆ pyramid_polytope B v
Source
scout/2611-08819-reflexive-polytopes-can-have-doubly-exponentially-many-vert.md:234
Verified
10 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • pyramid_polytopeGiven 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…

Read back from the Lean

For all natural numbers $n$ and $m$, every subset $B \subseteq \mathbb{R}^n$ (modeled as Set (Fin n → ℝ)), and every map $v : \mathrm{Fin}(m + 1) \to \mathbb{R}^m$ (modeled as Fin (m + 1) → (Fin m → ℝ)), the image of $B$ under the embedding $x \mapsto x \frown v(0)$ (concatenating $x$ with $v(0)$ to form a vector in $\mathbb{R}^{n+m}$) is a subset of the pyramid polytope pyramid_polytope B v.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The pyramid polytope is defined as the convex hull of the union of the base polytope embedded at the first vertex v 0 and the remaining vertices. The result follows by transitivity of set inclusion: the embedded base is a subset of the union, which is in turn contained in its convex hull.

  1. The embedded base is contained in the pyramid polytope.

    By definition, the pyramid polytope `pyramid_polytope B v` is the convex hull of the union S ∪ A, where S = (fun x => Fin.append x (v 0)) '' B is the embedded base and A is the set of remaining vertices. The set S is a subset of the union S ∪ A by the standard inclusion of a set into a union, and any set is contained in its convex hull by subset_convexHull. Composing these two inclusions by transitivity yields the desired subset relation.

    line 5

    uses subset_convexHull

      Set.subset_union_left.trans (subset_convexHull ℝ _)
subset_convexHull
Any subset of an affine or module space is contained in its convex hull over a scalar semiring.

Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The base polytope B embedded at the first apex v_0 is contained in the pyramid polytope. -/theorem pyramid_polytope_base_subset {n m : ℕ} (B : Set (Fin n → ℝ))    (v : Fin (m + 1) → (Fin m → ℝ)) :    (fun x => Fin.append x (v 0)) '' B ⊆ pyramid_polytope B v :=  Set.subset_union_left.trans (subset_convexHull ℝ _)
See it in the graphDiscuss this resultChallenge it