Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-08 (gpt-5.6-sol)
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.

Facts & Assumptions

Given: A finite abstract simplicial complex K.

[L1]

There are finitely many simplices, and the realization has barycentric coordinates and the weak topology determined by their Euclidean simplex topologies (Local finiteness, finiteness, and finite dimensionality of a simplicial complex, The geometric realization of an abstract simplicial complex).

[L2]

Closed subsets of a subspace are traces of ambient closed sets. In particular, a closed subset of a closed subspace is ambient closed (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace). Finite unions of closed sets are closed by complementation of finite intersections of open sets (Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed).

Proof

technique · direct
1.1L1given

If there is no nonempty simplex, the realization is empty and is compact and Hausdorff. Otherwise enumerate the finitely many vertices as v1,…,vN, with N≥1. The barycentric coordinate map identifies the realization as a set with E:=⋃σ∈K, σ≠∅Eσ⊆[0,1]N, where Eσ={x∈[0,1]N: ∑i=1Nxi=1, xi=0 if vi∉σ}. On each simplex this identification has precisely its Euclidean simplex topology.

2.1L2step 1.1algebra

Each Eσ is closed in RN. Indeed coordinates and their sum are continuous: ∣xi−yi∣≤∥x−y∥2 and ∣∑ixi−∑iyi∣≤N∥x−y∥2. Thus violating any of its finitely many closed coordinate constraints persists on a sufficiently small ball. The finite union E is closed by [L2] and bounded since it lies in [0,1]N.

3.1L1L2step 2.1

A subset F⊆E is weakly closed exactly when F∩Eσ is closed in Eσ for every nonempty simplex, by taking complements in the weak-open criterion [L1]. If F is weakly closed, each such intersection is closed in RN by step 2.1 and [L2]. Their finite union is F, so F is closed in E. Conversely, if F is closed in E, all its traces on Eσ are closed there by [L2], hence F is weakly closed. Therefore the weak topology equals the Euclidean subspace topology on E.

4.1L2L3step 1.1step 2.1step 3.1∎

By [L3] and step 2.1, E is compact. For two distinct points of E, intersect their disjoint Euclidean open balls from [L3] with E; these are disjoint subspace-open neighborhoods. Hence E is Hausdorff. Step 3.1 transfers both properties to the realization; step 1.1 handled the empty case.

Depends on

Used by

Dependency tree · two levels

49 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