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.
Every compact subset of a Bernstein set is countable
Statement
Assume the Axiom of Countable Choice. Let be a Bernstein set. Then every compact subset of is countable.
Facts & Assumptions
Given: The Axiom of Countable Choice, a Bernstein set , and a compact subset .
A Bernstein set meets every nonempty perfect subset of , and so does its complement (Bernstein subset of ).
A subset of is compact if and only if it is closed and bounded (A subset of is compact if and only if it is closed and bounded).
Every nonempty open subset of is uncountable (Both and are dense in , and every nonempty open subset of is uncountable).
A perfect subset of is closed and has no isolated points (Perfect subset of : closed with no isolated points).
Rational open intervals form a countable family, and assuming countable choice, a countable union of countable sets is countable ( is countably infinite, A product of two at most countable sets is at most countable, Countable unions of at most countable sets, assuming ).
Proof
Suppose, for contradiction, that is uncountable. Since is compact, [L1] makes it closed. Let be the set of condensation points of , that is, the points for which every neighbourhood of meets in uncountably many points. For each , take the first rational open interval in a fixed enumeration that contains and meets countably. Thus is covered by a countable family of countable intersections with , and [L5] makes it countable. Hence is uncountable and nonempty.
The set is perfect. It is closed, because if then some neighbourhood of meets only countably, and that same neighbourhood avoids ; and it has no isolated points, because every neighbourhood of a point of meets uncountably, while is countable by step 1.1, so the same neighbourhood meets in a point different from the centre. Thus [L4] applies to .
Now , so the nonempty perfect set misses the complement of , contradicting [F1]. Therefore the assumption in step 1.1 was false, and is countable.
Depends on
- Bernstein subset of $\mathbb{R}$
- A subset of $\mathbb{R}$ is compact if and only if it is closed and bounded
- Both $\mathbb{Q}$ and $\mathbb{R} \setminus \mathbb{Q}$ are dense in $\mathbb{R}$, and every nonempty open subset of $\mathbb{R}$ is uncountable
- $\mathbb{Q}$ is countably infinite
- A product of two at most countable sets is at most countable
- Countable unions of at most countable sets, assuming $\mathrm{AC}_\omega$
- Perfect subset of $\mathbb{R}$: closed with no isolated points
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- Jacek Cichoń, Aleksander Kharazishvili, and Bogdan Węglorz, Subsets of the Real Line, Chapter 8 (standard reference, not scraped)
- Bernstein set (Wikipedia) (standard reference, not scraped)