Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26
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 B⊆R be a Bernstein set. Then every compact subset of B is countable.

Facts & Assumptions

Given: The Axiom of Countable Choice, a Bernstein set B⊆R, and a compact subset K⊆B.

[F1]

A Bernstein set meets every nonempty perfect subset of R, and so does its complement (Bernstein subset of R).

[L1]

A subset of R is compact if and only if it is closed and bounded (A subset of R is compact if and only if it is closed and bounded).

[L4]

A perfect subset of R is closed and has no isolated points (Perfect subset of R: closed with no isolated points).

[L5]

Rational open intervals form a countable family, and assuming countable choice, a countable union of countable sets is countable (Q is countably infinite, A product of two at most countable sets is at most countable, Countable unions of at most countable sets, assuming ACω).

Proof

technique · direct
1.1L1L3L5assume-contra

Suppose, for contradiction, that K is uncountable. Since K is compact, [L1] makes it closed. Let C be the set of condensation points of K, that is, the points x∈K for which every neighbourhood of x meets K in uncountably many points. For each x∈K∖C, take the first rational open interval in a fixed enumeration that contains x and meets K countably. Thus K∖C is covered by a countable family of countable intersections with K, and [L5] makes it countable. Hence C is uncountable and nonempty.

2.1step 1.1L4algebra

The set C is perfect. It is closed, because if x∉C then some neighbourhood of x meets K only countably, and that same neighbourhood avoids C; and it has no isolated points, because every neighbourhood of a point of C meets K uncountably, while K∖C is countable by step 1.1, so the same neighbourhood meets C in a point different from the centre. Thus [L4] applies to C.

3.1step 2.1F1discharge-contradiction∎

Now C⊆K⊆B, so the nonempty perfect set C misses the complement of B, contradicting [F1]. Therefore the assumption in step 1.1 was false, and K is countable.

Depends on

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