AFTD Auto-Formalizing Theoretical Domains

simplicial_is_facet

def

A face F of an abstract simplicial complex Δ is a facet if it is maximal with respect to inclusion among all faces of Δ.

Statement

def simplicial_is_facet {V : Type*} (Δ : AbstractSimplicialComplex V) (F : Finset V) : Prop
Defined in
arXiv:2611.08071 Section 3
Verified
06 Nov 2026
Axioms
none listed
Used by 4
  • simplicial_is_normalAn abstract simplicial complex Δ pure of facet size d is normal if for every face σ of Δ, the subgraph of the dual graph induced by all…
  • simplicial_is_pureAn abstract simplicial complex Δ is pure of facet size d if every facet of Δ has cardinality d.
  • disjoint_minimal_nonfaces_dimensionLet Δ be an abstract simplicial complex on an n-element vertex set V, pure of facet size d, with connected dual graph. If its minimal…
  • simplicial_dual_graphThe dual graph of an abstract simplicial complex pure of facet size d is the simple graph whose vertices are the facets of Δ, where two…

Read back from the Lean

For any type V, an abstract simplicial complex Δ with vertices in V, and a finite subset F of V, simplicial_is_facet Δ F asserts that F is a face of Δ (F ∈ Δ.faces) and that F is maximal with respect to inclusion: for every face G of Δ (∀ G ∈ Δ.faces), if F ⊆ G, then F = G.

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 an abstract simplicial complex is a maximal face under inclusion. -/
def simplicial_is_facet {V : Type*} (Δ : AbstractSimplicialComplex V) (F : Finset V) : Prop := F ∈ Δ.faces ∧ ∀ G ∈ Δ.faces, F ⊆ G → F = G
See it in the graphDiscuss this resultChallenge it