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 (). If a nonempty metric space 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 is dense.
Facts & Assumptions
Given: The Axiom of Dependent Choice (), closed sets with empty interior, and a nonempty open set .
A complete metric space contains the limit of every Cauchy sequence (Complete metric space: every Cauchy sequence converges in the space).
Under the assumed Axiom of Dependent Choice, a serial sequence of states recording each ball together with its centre and positive radius is permitted (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
For every positive real number there is a reciprocal integer smaller than it (For every in a complete ordered field there is a natural with ).
Proof
If is empty the assertion is vacuous. Otherwise choose and such that ; openness supplies a ball about in , and a smaller positive radius has this property. Put .
Given and a state with , the open set is nonempty because is closed with empty interior. Choose in that set and small enough that and ; openness and [L3] permit this for each individual state. Thus the relation from to with these properties is serial on the set of triples .
Apply dependent choice to the serial state relation in step 1.2, starting at . Its successive states have first coordinate , so write them and put . The centres and radii are coordinate projections of this single DC sequence, not separately chosen from countably many balls. They satisfy , for , and .
The nesting and the radius bound make Cauchy: for , both and lie in , so their distance is at most twice the radius of , which tends to zero.
Let , supplied by completeness [L1]. For every , the tail lies in the closed set , so .
Thus . Every nonempty open meets this complement, proving both stated formulations.
Depends on
- Complete metric space: every Cauchy sequence converges in the space
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
Used by
- Under Dependent Choice, every completely metrizable space is Baire Corollary
- Baire diagonal passage from finite regularity to smooth metrics Lemma
- Faithful essential pure-state orbits obstruct countable separation Lemma
- Null master codes and summable slaloms are Tukey equivalent Lemma
- Primitive ideals have standard Borel quotient-norm codings Lemma
- The closure of a bounded image contains a ball Lemma
- Dualizing real vector-space sequences and the choice boundary Remark
- Baire dichotomy for a pointwise-defined family of bounded linear operators Theorem
- Dunford--Pettis for real L¹ on a finite measure space Theorem
- Under Dependent Choice, a bounded operator between Banach spaces is bounded below exactly when it is injective with closed range Theorem
- Under Dependent Choice, continuous nowhere differentiable functions form a dense subset of C([0,1],ℝ) Theorem
- Uniform boundedness principle Theorem
- Uniform finite order bounds for pointwise bounded distributions Theorem
Dependency tree · two levels
24 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
- Baire category theorem (standard reference, not scraped)