AFTD Auto-Formalizing Theoretical Domains

is_convex_facet

def

F is a facet of P if F is a maximal proper nonempty convex extreme subset of P: among the convex extreme subsets of P, no one other than F and P contains F. For a polytope these are exactly the facets in the usual sense.

Statement

def is_convex_facet {E : Type*} [AddCommGroup E] [Module ℝ E] (P F : Set E) : Prop
Defined in
folklore; Ziegler, Lectures on Polytopes (faces of a polytope are its convex extreme subsets)
Verified
09 Nov 2026
Axioms
none listed
Used by 1
  • polytope_convex_facetsThe set of all facets of P, that is, of its maximal proper nonempty convex extreme subsets.

Read back from the Lean

Let $E$ be an additive commutative group equipped with a real vector space structure ([AddCommGroup E] [Module ℝ E]), and let $P$ and $F$ be subsets of $E$. The predicate is_convex_facet P F asserts that: 1. $F$ is an extreme set of $P$ over $\mathbb{R}$ (IsExtreme ℝ P F), 2. $F$ is convex over $\mathbb{R}$ (Convex ℝ F), 3. $F$ is nonempty (F.Nonempty), 4. $F \neq P$, and 5. for every subset $G \subseteq E$, if $G$ is an extreme set of $P$ over $\mathbb{R}$ and $G$ is convex over $\mathbb{R}$ and $F \subseteq G$, then $G = F$ or $G = P$ (that is, $F$ is a maximal proper convex extreme subset of $P$).

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 facet of P: a maximal proper nonempty convex extreme subset of P. -/
def is_convex_facet {E : Type*} [AddCommGroup E] [Module ℝ E] (P F : Set E) : Prop := IsExtreme ℝ P F ∧ Convex ℝ F ∧ F.Nonempty ∧ F ≠ P ∧ ∀ G, IsExtreme ℝ P G → Convex ℝ G → F ⊆ G → G = F ∨ G = P
See it in the graphDiscuss this resultChallenge it