Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)
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.

Under dependent choice a compact Hausdorff space is Tychonoff, and its disjoint closed sets are separated by continuous functions

Statement

Facts & Assumptions

Given: A compact Hausdorff topological space (X,T), and dependent choice.

[L1]

A compact Hausdorff space is regular and normal, hence T3 and T4 (A compact Hausdorff space is regular and normal, hence T3 and T4).

[L3]

Under dependent choice, if X is normal and P,Q⊆X are disjoint closed sets, there is a continuous f:X→[0,1] with P⊆f−1({0}), Q⊆f−1({1}) (Urysohn's lemma, under the axiom of dependent choice: in a normal space two disjoint closed sets are separated by a continuous function into [0,1], and conversely such a space is normal).

Proof

technique · direct
1.1

X is compact and Hausdorff (given); by [L1], X is regular and normal, hence T3 and T4, that is, in particular, normal and T1.

givenL1
2.1

By [L2] applied to step 1.1 (normal and T1), X is completely regular.

step 1.1L2
2.2

Let A,B⊆X be disjoint closed sets; by [L3] applied to step 1.1 (normal), fix a continuous f:X→[0,1] with A⊆f−1({0}) and B⊆f−1({1}).

step 1.1L3choose
3.1

By step 1.1 (T1) and step 2.1 (completely regular), X is Tychonoff by [L4].

step 1.1step 2.1L4
4.1

Steps 3.1 and 2.2 establish the two clauses of the statement.

step 3.1step 2.2∎

Depends on

Used by

Dependency tree · two levels

39 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