is_partitionable_two_complex
A finite simplicial complex given by a set of facets is partitionable if there exists a selection map phi from facets to faces such that phi(σ) ⊆ σ for every facet σ, and every face of the complex belongs to a unique interval [phi(σ), σ].
Statement
def is_partitionable_two_complex {V : Type*} [DecidableEq V] (facets : Finset (Finset V)) : Prop
- Defined in
- arXiv:2610.27083, Section 2
- Verified
- 24 Oct 2026
- Axioms
- none listed
- Used by 2
- single_facet_is_partitionableA simplicial complex consisting of a single facet is partitionable.
- tetrahedron_boundary_is_partitionableThe boundary of a tetrahedron, formed by four triangular facets on four vertices, is partitionable into boolean intervals.
Read back from the Lean
For a type V with decidable equality and a finite set facets of finite subsets of V, is_partitionable_two_complex facets asserts that there exists a function phi : Finset V → Finset V such that:
1. For every σ ∈ facets, phi σ ⊆ σ; and
2. For every τ belonging to the union of the power sets of the elements of facets (i.e., every subset τ of some σ' ∈ facets), there exists a unique σ such that σ ∈ facets, phi σ ⊆ τ, and τ ⊆ σ.
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 pure 2-dimensional simplicial complex is partitionable if its faces can be partitioned into boolean intervals [phi(σ), σ] indexed by its facets. -/ def is_partitionable_two_complex {V : Type*} [DecidableEq V] (facets : Finset (Finset V)) : Prop := ∃ phi : Finset V → Finset V, (∀ σ ∈ facets, phi σ ⊆ σ) ∧ (∀ τ ∈ facets.biUnion Finset.powerset, ∃! σ, σ ∈ facets ∧ phi σ ⊆ τ ∧ τ ⊆ σ)