AFTD Auto-Formalizing Theoretical Domains

single_facet_is_partitionable

theoremverified

A simplicial complex consisting of a single facet is partitionable.

Statement

theorem single_facet_is_partitionable {V : Type*} [DecidableEq V] (σ : Finset V) : is_partitionable_two_complex {σ}
Source
folklore
Verified
24 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…

Read back from the Lean

For any type V with decidable equality and any finite subset σ of V, the singleton family of facets {σ} satisfies is_partitionable_two_complex.

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

To show that a simplicial complex consisting of a single facet σ is partitionable, we define the lower-bound map φ to be constantly the empty set ∅, yielding the single boolean interval [∅, σ]. Trivially, ∅ ⊆ σ, so every facet contains its lower bound. Any face τ in the complex is a subset of σ, so ∅ ⊆ τ ⊆ σ, and σ is the unique facet available in the singleton complex {σ}.

  1. Witness partitionability with the constant empty-set map, which satisfies ∅ ⊆ σ.

    To prove the complex is partitionable, we provide the candidate map φ that sends every simplex to the empty set ∅. The first condition requires that φ(σ) ⊆ σ, which holds immediately since ∅ ⊆ σ.

    lines 3–4

      use fun _ => ∅
      refine ⟨by simp, ?_⟩
  2. Any face τ in the complex is a subset of σ.

    Let τ be an arbitrary face in the complex, meaning τ belongs to the union of the powersets of the facets in {σ}. Rewriting with Finset.singleton_biUnion simplifies this union to the powerset of σ, and Finset.mem_powerset then turns membership in the powerset into the inclusion τ ⊆ σ.

    lines 5–6

    uses Finset.singleton_biUnion, Finset.mem_powerset

      intro τ hτ
      rw [Finset.singleton_biUnion, Finset.mem_powerset] at hτ
  3. There is a unique facet in {σ}, namely σ itself, such that ∅ ⊆ τ ⊆ σ.

    We witness the unique existence with σ. It satisfies the condition because σ ∈ {σ}, the empty set is a subset of τ by Finset.empty_subset, and τ ⊆ σ was established in the previous step. Uniqueness is immediate because any facet y ∈ {σ} must equal σ by Finset.mem_singleton.mp.

    line 7

    uses Finset.empty_subset, Finset.mem_singleton.mp

      exact ⟨σ, by simp [Finset.empty_subset, hτ], fun y hy => Finset.mem_singleton.mp hy.1⟩
Finset.singleton_biUnion
The union of a family of finite sets indexed by a singleton {a} is the set associated with a.
Finset.mem_powerset
A finite set belongs to the powerset of another finite set if and only if it is a subset of it.
Finset.empty_subset
The empty set is a subset of every finite set.
Finset.mem_singleton.mp
If an element belongs to the singleton set {a}, it is equal to a.

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

/-- A single simplex is partitionable into a single boolean interval [∅, σ]. -/theorem single_facet_is_partitionable {V : Type*} [DecidableEq V] (σ : Finset V) : is_partitionable_two_complex {σ} := by  use fun _ => ∅  refine ⟨by simp, ?_⟩  intro τ hτ  rw [Finset.singleton_biUnion, Finset.mem_powerset] at hτ  exact ⟨σ, by simp [Finset.empty_subset, hτ], fun y hy => Finset.mem_singleton.mp hy.1⟩
See it in the graphDiscuss this resultChallenge it