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 the real line can be well ordered, a Bernstein set exists
Statement
Assume the real line can be well ordered. Then there exists a Bernstein set .
Facts & Assumptions
Given: A well-order of .
A Bernstein set is a subset of that meets every nonempty perfect subset of , and whose complement does too (Bernstein subset of ).
Every nonempty perfect subset of has the cardinality of the continuum, equivalently is equinumerous with (Every nonempty perfect subset of has the cardinality of the continuum).
The Cantor-set ternary-description theorem gives a bijection between and a subset of (The Cantor set is exactly the set of with every , and this gives a bijection with , claim 3), and with rationals dense in ( is countably infinite, The rationals embed densely in the reals).
If there are injections both ways then the two sets are equinumerous; a set equinumerous with a well-orderable set is well-orderable and has the same cardinality, and that cardinality is a cardinal (The Schröder-Bernstein theorem, A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used, Cardinal (initial ordinal) and cardinality).
If is an infinite cardinal then , and the natural number is a cardinal (Absorption: for cardinals with infinite and , , and when , Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations, Every natural number and are cardinals, every infinite cardinal is a limit ordinal, and on the natural numbers the cardinal operations are the published finite counting operations, with in the finite sense equal to in the cardinal sense).
Transfinite recursion along a well-order is available in ZF (Transfinite recursion, Well-order and well-ordered set).
Proof
Let be the family of nonempty perfect subsets of . Every such set is closed, so it is determined by the set of rational open intervals disjoint from it; since rational intervals are countably coded, [L2] gives an injection . Conversely the map is an injection , because each interval is nonempty and perfect in the sense of Perfect subset of : closed with no isolated points. Hence [L3] gives . Let . The given well-order of makes well-orderable, so [L3] gives and shows that is a cardinal. The interval is a nonempty perfect subset of , so [L1] shows is infinite; therefore [L4] gives . Fix a bijection .
For , write with . Suppose has been defined for every , and put . By construction each new is chosen outside the earlier set , so the map is a bijection from onto . Hence , because and is a cardinal. The set is nonempty perfect, so [L1] and [L3] give ; therefore is nonempty. Let be the -least point of . By transfinite recursion [L5], this defines a function on .
Put . Let be any nonempty perfect subset of . Since is onto, there exist with and . Step 2.1 gives and . Moreover by definition, while because . Thus every nonempty perfect subset of meets both and , so [F1] makes a Bernstein set.
Depends on
- Bernstein subset of $\mathbb{R}$
- Every nonempty perfect subset of $\mathbb{R}$ has the cardinality of the continuum
- The Cantor set is exactly the set of $\sum_{k \ge 1} a_k 3^{-k}$ with every $a_k \in \{0,2\}$, and this gives a bijection with $\{0,1\}^{\mathbb{N}}$
- $\mathbb{Q}$ is countably infinite
- The rationals embed densely in the reals
- Transfinite recursion
- Well-order and well-ordered set
- Injection, surjection, bijection
- Perfect subset of $\mathbb{R}$: closed with no isolated points
- The Schröder-Bernstein theorem
- A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used
- Cardinal (initial ordinal) and cardinality
- Absorption: for cardinals $\kappa, \lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda = \kappa$, and $\kappa \otimes \lambda = \kappa$ when $\lambda \ne 0$
- Cardinal sum $\kappa \oplus \lambda$, product $\kappa \otimes \lambda$ and exponentiation $\kappa^{\lambda}$, and why they are written apart from the ordinal operations
- Every natural number and $\omega$ are cardinals, every infinite cardinal is a limit ordinal, and on the natural numbers the cardinal operations are the published finite counting operations, with $\lvert A \rvert$ in the finite sense equal to $\lvert A \rvert$ in the cardinal sense
Used by
Dependency tree · two levels
98 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, Theorem 8.5 (standard reference, not scraped)
- Bernstein set (Wikipedia) (standard reference, not scraped)