tetrahedron_boundary_is_partitionable
The boundary of a tetrahedron, formed by four triangular facets on four vertices, is partitionable into boolean intervals.
Statement
theorem tetrahedron_boundary_is_partitionable :
is_partitionable_two_complex ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4)))- Source
- folklore; arXiv:2610.27083 Question 6.2
- Verified
- 25 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- is_partitionable_two_complexA finite simplicial complex given by a set of facets is partitionable if there exists a selection map phi from facets to faces such that…
- Used by 1
- boolean_cube_dist_two_pairs_emptyFor any natural number d, the number of ordered pairs at Hamming distance 2 in the empty set ∅ : Finset (Fin d → Fin 2) is 0, i.e.,…
Read back from the Lean
The boundary of the tetrahedron with vertices in Fin 4, represented as the collection of four facets {{0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3}} : Finset (Finset (Fin 4)), satisfies is_partitionable_two_complex. Explicitly, there exists a map phi : Finset (Fin 4) → Finset (Fin 4) such that for every facet σ in the collection, phi σ ⊆ σ, and for every face τ belonging to the powerset of at least one facet in the collection, there exists a unique facet σ in the collection such that phi σ ⊆ τ and τ ⊆ σ.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
A simplicial complex is partitionable if its face poset can be partitioned into boolean intervals [φ(σ), σ] indexed by its facets σ. The boundary complex of a tetrahedron has four triangular facets and 15 faces in total. The proof provides an explicit map φ sending {0,1,2} to ∅, {0,1,3} to {1,3}, {0,2,3} to {3}, and {1,2,3} to {1,2,3}, and verifies the interval containment, existence, and uniqueness conditions by finite exhaustive computation.
To show partitionability, it suffices to exhibit an interval-assignment function φ on facets satisfying the subset and partitioning conditions.
We instantiate the existential in the definition of `is_partitionable_two_complex` with the explicit function `tetrahedron_boundary_is_partitionable_phi`. This leaves two subgoals: verifying that φ(σ) ⊆ σ for every facet σ, and showing that every face τ of the complex belongs to a unique boolean interval [φ(σ), σ].
uses
tetrahedron_boundary_is_partitionable_phirefine ⟨tetrahedron_boundary_is_partitionable_phi, ?_, ?_⟩For each of the four triangular facets σ, φ(σ) ⊆ σ. automation
The four containment checks—∅ ⊆ {0,1,2}, {1,3} ⊆ {0,1,3}, {3} ⊆ {0,2,3}, and {1,2,3} ⊆ {1,2,3}—are verified directly by finite computation.
· decideEvery face τ of the boundary complex is contained in at least one boolean interval [φ(σ), σ]. automation
The boundary of the tetrahedron consists of 15 faces (the empty set, 4 vertices, 6 edges, and 4 triangles). For each of these finitely many faces τ, an exhaustive search over the four facets finds a facet σ such that φ(σ) ⊆ τ ⊆ σ.
· have hall_exists : ∀ τ ∈ ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4))).biUnion Finset.powerset, ∃ σ, σ ∈ ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4))) ∧ tetrahedron_boundary_is_partitionable_phi σ ⊆ τ ∧ τ ⊆ σ := by decide
No face τ of the boundary complex belongs to more than one boolean interval [φ(σ), σ]. automation
For every face τ and every pair of facets σ₁ and σ₂, the condition that both intervals [φ(σ₁), σ₁] and [φ(σ₂), σ₂] contain τ implies σ₁ = σ₂. This disjointness condition is verified across all pairs of facets by finite exhaustive computation.
have hall_unique : ∀ τ ∈ ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4))).biUnion Finset.powerset, ∀ σ1 σ2, (σ1 ∈ ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4))) ∧ tetrahedron_boundary_is_partitionable_phi σ1 ⊆ τ ∧ τ ⊆ σ1) → (σ2 ∈ ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4))) ∧ tetrahedron_boundary_is_partitionable_phi σ2 ⊆ τ ∧ τ ⊆ σ2) → σ1 = σ2 := by decide
Every face τ of the boundary complex belongs to a unique boolean interval [φ(σ), σ], completing the partition.
Fixing an arbitrary face τ in the complex, the existence step yields a facet σ₀ containing τ in [φ(σ₀), σ₀], and the uniqueness step ensures that any other facet σ satisfying φ(σ) ⊆ τ ⊆ σ must equal σ₀. This establishes unique existence (∃!) and concludes the proof.
intro τ hτ obtain ⟨σ0, hσ0⟩ := hall_exists τ hτ exact ⟨σ0, hσ0, fun σ hσ => hall_unique τ hτ σ σ0 hσ hσ0⟩
tetrahedron_boundary_is_partitionable_phi- The explicit function mapping each of the four facets {0,1,2}, {0,1,3}, {0,2,3}, and {1,2,3} to ∅, {1,3}, {3}, and {1,2,3}, respectively (and any other set to ∅).
- Because the complex has only 15 faces across 4 vertices, the validity of the interval lower bounds and the existence and uniqueness of the interval containing each face are checked by exhaustive computational evaluation (`decide`).
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
def tetrahedron_boundary_is_partitionable_phi : Finset (Fin 4) → Finset (Fin 4) := fun σ => if σ = {0,1,2} then ∅ else if σ = {0,1,3} then {1,3} else if σ = {0,2,3} then {3} else if σ = {1,2,3} then {1,2,3} else ∅/-- The boundary complex of a tetrahedron is partitionable into boolean intervals. -/theorem tetrahedron_boundary_is_partitionable : is_partitionable_two_complex ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4))) := by refine ⟨tetrahedron_boundary_is_partitionable_phi, ?_, ?_⟩ · decide · have hall_exists : ∀ τ ∈ ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4))).biUnion Finset.powerset, ∃ σ, σ ∈ ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4))) ∧ tetrahedron_boundary_is_partitionable_phi σ ⊆ τ ∧ τ ⊆ σ := by decide have hall_unique : ∀ τ ∈ ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4))).biUnion Finset.powerset, ∀ σ1 σ2, (σ1 ∈ ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4))) ∧ tetrahedron_boundary_is_partitionable_phi σ1 ⊆ τ ∧ τ ⊆ σ1) → (σ2 ∈ ({ {0, 1, 2}, {0, 1, 3}, {0, 2, 3}, {1, 2, 3} } : Finset (Finset (Fin 4))) ∧ tetrahedron_boundary_is_partitionable_phi σ2 ⊆ τ ∧ τ ⊆ σ2) → σ1 = σ2 := by decide intro τ hτ obtain ⟨σ0, hσ0⟩ := hall_exists τ hτ exact ⟨σ0, hσ0, fun σ hσ => hall_unique τ hτ σ σ0 hσ hσ0⟩