simplicial_dual_graph
def
The dual graph of an abstract simplicial complex pure of facet size d is the simple graph whose vertices are the facets of Δ, where two distinct facets are adjacent if and only if their intersection has cardinality d - 1.
Statement
def simplicial_dual_graph {V : Type*} [DecidableEq V] (Δ : AbstractSimplicialComplex V) (d : ℕ) : SimpleGraph {F : Finset V // simplicial_is_facet Δ F}
- Defined in
- arXiv:2611.08071 Section 3
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 1
- 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 Δ.
- Used by 2
- 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…
- 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…
Read back from the Lean
Given a type V with decidable equality, an abstract simplicial complex Δ on V, and a natural number d, simplicial_dual_graph Δ d is the simple graph whose vertices are the facets of Δ (faces of Δ that are maximal under inclusion). Two vertices F₁ and F₂ are adjacent if and only if they are distinct (F₁.1 ≠ F₂.1) and their intersection has cardinality d - 1 ((F₁.1 ∩ F₂.1).card = d - 1).
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 dual graph of an abstract simplicial complex pure of facet size d. -/ def simplicial_dual_graph {V : Type*} [DecidableEq V] (Δ : AbstractSimplicialComplex V) (d : ℕ) : SimpleGraph {F : Finset V // simplicial_is_facet Δ F} where Adj F₁ F₂ := F₁.1 ≠ F₂.1 ∧ (F₁.1 ∩ F₂.1).card = d - 1 symm := ⟨fun {F₁ F₂} h => ⟨h.1.symm, by rw [Finset.inter_comm, h.2]⟩⟩ loopless := ⟨fun F h => h.1 rfl⟩