Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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.

Assuming dependent choice, a nonempty topological space is uniformizable if and only if it is completely regular

Statement

Assuming dependent choice, a nonempty topological space is uniformizable if and only if it is completely regular.

Facts & Assumptions

Given: A nonempty topological space and dependent choice.

[L1]

Under dependent choice, uniformizable spaces are completely regular (Assuming dependent choice, every uniformizable space is completely regular).

[L2]
[L3]

Uniformizable means induced by some uniformity (Uniformizable and separated-uniformizable topological spaces).

Proof

technique · direct
1.1

The forward implication is [L1].

L1
1.2

The gauge supplied by [L2] is a uniformity inducing the given topology, so the reverse implication is [L2] and [L3].

L2L3
2.1

The two implications prove the equivalence under dependent choice.

step 1.1step 1.2

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 77 results over 11 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