Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A finite simplicial complex has a compact Hausdorff realization

Statement

If K is a finite abstract simplicial complex, then its geometric realization K is compact and Hausdorff.

Proof

Given: A finite abstract simplicial complex K.

1.1

If K has no nonempty simplices, then K=, which is compact and Hausdorff. Otherwise K has finitely many vertices; write them as v1,,vN. For each simplex σ of K, the subset σK identifies with a Euclidean simplex in [0,1]N, cut out by finitely many linear equations and inequalities, so σ is compact.

given
2.1

The realization K is the union of the finitely many subsets σ over the nonempty simplices σ of K, and this union is empty in the case handled at the start of step 1.1. Therefore step 1.1 makes K a finite union of compact sets and hence compact.

step 1.1
2.2

For each simplex σ, let Oσ[0,1]N be open with Uσ=Oσσ. Since there are only finitely many simplices, a subset UK is weakly open exactly when U=(σOσ)K. Thus the weak topology on K agrees with the subspace topology from [0,1]N. The cube [0,1]N is Hausdorff, so K is Hausdorff as a subspace.

step 1.1
3.1

Steps 2.1 and 2.2 give compactness and Hausdorffness.

step 2.1step 2.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

46 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources