Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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)(X,\mathcal{T}), and dependent choice.

[L1]

A compact Hausdorff space is regular and normal, hence T3T_3 and T4T_4 (A compact Hausdorff space is regular and normal, hence T3T_3 and T4T_4).

[L3]

Under dependent choice, if XX is normal and P,QXP,Q \subseteq X are disjoint closed sets, there is a continuous f:X[0,1]f : X \to [0,1] with Pf1({0})P \subseteq f^{-1}(\{0\}), Qf1({1})Q \subseteq 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][0,1], and conversely such a space is normal).

Proof

technique · direct
1.1

XX is compact and Hausdorff (given); by [L1], XX is regular and normal, hence T3T_3 and T4T_4, that is, in particular, normal and T1T_1.

givenL1
2.1

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

step 1.1L2
2.2

Let A,BXA, B \subseteq X be disjoint closed sets; by [L3] applied to step 1.1 (normal), fix a continuous f:X[0,1]f : X \to [0,1] with Af1({0})A \subseteq f^{-1}(\{0\}) and Bf1({1})B \subseteq f^{-1}(\{1\}).

step 1.1L3choose
3.1

By step 1.1 (T1T_1) and step 2.1 (completely regular), XX 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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 116 results over 23 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources