Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Finite simplicial weak topology agrees with euclidean topology

Statement

For finite K, the weak topology on ∣K∣ equals the Euclidean subspace topology in RV(K); ∣K∣ is compact, metrizable and Hausdorff. If P is a finite subcomplex of any K, then ∣P∣↪∣K∣ is a closed embedding, with that same finite Euclidean topology.

Source locators

2C.1 proof, p.178; direct closed-cover verification.

Proof

Given: A simplicial complex K and, for the last assertion, a finite subcomplex P.

1.1F1F2

In a finite nonempty vertex set, each simplex is defined by nonnegative coordinates, sum 1, and zero coordinates outside its face. It is closed and bounded in the ambient finite-dimensional Euclidean space, hence compact. The finite union ∣K∣ is also closed and bounded, hence compact by Heine–Borel. If K has no vertices its realization is empty and compact directly.

2.1F1step 1.1

If E⊆∣K∣ is weakly closed, then E∩∣σ∣ is closed in the Euclidean simplex, and thus closed in the ambient Euclidean space since ∣σ∣ is closed. Their finite union is E, so E is Euclidean closed. Conversely, a Euclidean relatively closed E has closed traces on every simplex and is weakly closed. Consequently both topologies agree, and the Euclidean metric and Hausdorff property restrict to ∣K∣.

3.1F1step 2.1∎

For finite P⊆K and closed E⊆∣P∣, write E=⋃σ∈P(E∩∣σ∣). For any τ∈K, each summand meets ∣τ∣ in a closed subset of the common face ∣σ∩τ∣, hence in a closed subset of ∣τ∣. There are finitely many summands, so E is weakly closed in ∣K∣. Conversely an ambient weakly closed set has closed traces on the simplices of P. These two implications show that the inclusion induces exactly the topology of ∣P∣ and is closed; taking E=∣P∣ proves the closed-image assertion.

Depends on

Used by

Dependency tree · two levels

33 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