Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-02
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 nonempty complete metric space is not a countable union of closed sets with empty interior

Statement

Assume the Axiom of Dependent Choice (DC\mathrm{DC}). If a nonempty metric space XX is complete, then it is not the union of a sequence of closed sets each having empty interior. Equivalently, the intersection of countably many open dense subsets of XX is dense.

Facts & Assumptions

Given: The Axiom of Dependent Choice (DC\mathrm{DC}), closed sets F1,F2,XF_1,F_2,\ldots\subseteq X with empty interior, and a nonempty open set OXO\subseteq X.

[L1]

A complete metric space contains the limit of every Cauchy sequence (Complete metric space: every Cauchy sequence converges in the space).

[L2]

Under the assumed Axiom of Dependent Choice, a recursively specified sequence of balls is permitted (The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain).

Proof

technique · constructive
1.1

If XX is empty the assertion is vacuous. Otherwise choose an open ball B0B_0 whose closure lies in OO; this is possible because OO is open.

givenalgebra
1.2

Given a nonempty open ball Bn1B_{n-1}, its intersection with XFnX\setminus F_n is nonempty because FnF_n has empty interior. Choose an open ball BnB_n with nonempty closure, BnBn1Fn\overline{B_n}\subseteq B_{n-1}\setminus F_n, and radius below 2n2^{-n}.

givenL3construct
2.1

Dependent choice gives balls BnB_n satisfying step 1.2 for every nn. Choose centres xnBnx_n\in B_n.

L2step 1.2choose
3.1

The nesting and the radius bound make (xn)(x_n) Cauchy: for m>nm>n, both xmx_m and xnx_n lie in Bn\overline{B_n}, so their distance is at most twice the radius of BnB_n, which tends to zero.

step 1.2step 2.1L3algebra
4.1

Let x=limnxnx=\lim_nx_n, supplied by completeness [L1]. For every nn, the tail lies in the closed set Bn\overline{B_n}, so xBnBn1Fnx\in\overline{B_n}\subseteq B_{n-1}\setminus F_n.

L1step 1.2step 3.1algebra
5.1

Thus xOnFnx\in O\setminus\bigcup_nF_n. Every nonempty open OO meets this complement, proving both stated formulations.

step 4.1discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

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