AFTD Auto-Formalizing Theoretical Domains

simplicial_is_normal

def

An abstract simplicial complex Δ pure of facet size d is normal if for every face σ of Δ, the subgraph of the dual graph induced by all facets containing σ is connected.

Statement

def simplicial_is_normal {V : Type*} [DecidableEq V] (Δ : AbstractSimplicialComplex V) (d : ℕ) : Prop
Defined in
arXiv:2611.08071 Section 1
Verified
06 Nov 2026
Axioms
none listed
Built on 2
  • 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…
  • simplicial_is_facetA face F of an abstract simplicial complex Δ is a facet if it is maximal with respect to inclusion among all faces of Δ.

Read back from the Lean

For a type V with decidable equality, an abstract simplicial complex Δ on V, and a natural number d, simplicial_is_normal Δ d asserts that for every face σ ∈ Δ.faces, the subgraph of the dual graph simplicial_dual_graph Δ d induced by the facets of Δ that contain σ is connected (in the sense of SimpleGraph.Connected).

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

/-- An abstract simplicial complex is normal if the star of every face has a connected dual graph. -/
def simplicial_is_normal {V : Type*} [DecidableEq V] (Δ : AbstractSimplicialComplex V) (d : ℕ) : Prop := ∀ σ ∈ Δ.faces, ((simplicial_dual_graph Δ d).induce {F | σ ⊆ F.1}).Connected
See it in the graphDiscuss this resultChallenge it