Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

T0, T1, and Hausdorffness are hereditary

Statement

The properties T0, T1, and Hausdorffness are hereditary in the sense of Hereditary, open-hereditary and closed-hereditary properties of topological spaces.

Facts & Assumptions

Given: A subspace S of a space X carrying one of the stated properties.

[F2]

T0 distinguishes a distinct pair by one open set, T1 separates each point from the other by an open set, and Hausdorffness separates a distinct pair by disjoint open sets (T0 (Kolmogorov) and T1 (Frechet) spaces, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not).

Proof

technique · direct
1.1

Let x,y∈S be distinct. If X is T0, choose an open U⊆X containing exactly one of x,y; then S∩U does the same in S.

F1F2
1.2

If X is T1, apply the preceding trace argument separately to the two open sets supplied by the T1 condition, so each of x,y has an open neighbourhood in S missing the other.

F1F2
1.3

If X is Hausdorff, choose disjoint open U,V⊆X containing x,y respectively; S∩U and S∩V are disjoint open neighbourhoods in S.

F1F2
2.1

Since S was arbitrary, each of the three properties is hereditary.

step 1.1step 1.2step 1.3∎

Depends on

Used by

Dependency tree · two levels

14 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