Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-07-27
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 nonempty perfect subset of R is uncountable

Statement

Let P⊆R be nonempty and perfect (Perfect subset of R: closed with no isolated points). Then P is uncountable (Finite, countably infinite, countable, uncountable).

The selection is canonical, so that this proof spends no dependent choice. The textbook proof shrinks a neighbourhood at every stage by choosing a point of P and then a radius, a choice made infinitely often and each time depending on the previous one: that is the axiom of dependent choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain), which is not available at this point in the reading order; only the axiom of countable choice is, and it does not licence a recursive selection. The construction below therefore fixes an enumeration e of the rationals once (Q is countably infinite, The rationals embed densely in the reals) and, at every stage, takes the interval with least-indexed rational endpoints meeting the requirements. The requirements are met by some rational-endpoint interval, which is what step 2.1 proves, and the least such index is determined by The well-ordering principle, so the whole recursion is a single application of The recursion theorem to a total map and no choice principle is used anywhere.

Facts & Assumptions

Given: A nonempty perfect set P⊆R. Write QR for the image of Q in R under q↦q^. A pair (p,q)∈QR×QR is called good when p<q and (p,q)∩P≠∅, and G denotes the set of good pairs.

[L1]

P is perfect: P is closed and every x∈P is a limit point of P, so every punctured neighbourhood of x meets P (Perfect subset of R: closed with no isolated points, Limit point, isolated point, adherent point, derived set, and dense subset of R).

[L3]

Nε(x)=(x−ε,x+ε); x∈Nε(x); Nε∗(x)=Nε(x)∖{x}; and y∈Nε(x) with 0<δ≤ε−∣y−x∣ gives Nδ(y)⊆Nε(x) (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L5]

A nonempty at most countable set admits a surjection from N; uncountable means not at most countable (A nonempty set is at most countable iff it is a surjective image of N, Finite, countably infinite, countable, uncountable).

[L6]

Q≈N (Q is countably infinite); q↦q^ is injective with image QR and strictly between any two reals lies an element of QR (The rationals embed densely in the reals); a composition of bijections is a bijection (Injection, surjection, bijection, Equinumerous sets, A≈B and A⪯B).

[L7]

Every nonempty subset of N has a least element (The well-ordering principle).

[L8]

Recursion: for a set Y, an element y0∈Y and a function T:Y→Y there is h:N→Y with h(0)=y0 and h(σ(k))=T(h(k)) (The recursion theorem).

[L9]

Nested interval property: for nonempty closed bounded intervals Ik=[ak,bk] with Ik+1⊆Ik, the intersection is nonempty, and it is a single point exactly when the lengths bk−ak tend to 0 (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 0).

[L10]

Reciprocal Archimedean property: for every real ε>0 there is a natural n≥1 with 1/n<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Every complete ordered field is Archimedean); canonical naturals are positive and increasing, and reciprocation of positives reverses the order (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

[L11]

Every nonempty finite set of reals has a minimum, which is one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set); 0<1, so 2:=1+1>0 and 0<d⋅2−1<d for d>0; adding a constant and multiplying by a positive preserve inequalities (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

[L12]

Convergence of a sequence of reals to 0 is tested against rational ε>0 (Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L13]

Absolute value: ∣z∣≥0, and ∣y−x∣≤b−a whenever x,y∈[a,b] (Basic properties of the absolute value).

Proof

technique · contradiction
1.1

Suppose, for contradiction, that the nonempty perfect set P is at most countable; by [L5] fix a surjection f:N→P.

assume-contraL5choose
1.2

By [L6] fix a bijection β:N→Q and put e:=ι∘β with ι(q)=q^, a bijection from N onto QR.

L6choose
1.3

Recall the terminology of the Given: a pair (p,q) of elements of QR is good when p<q and (p,q)∩P≠∅, and G is the set of good pairs.

givenconstruct
2.1

Refinement claim. For every good (p,q), every x∈R and every real η>0 there is a good (p′,q′) with [p′,q′]⊆(p,q), x∉[p′,q′] and q′−p′<η. To see it, fix y∈(p,q)∩P and, (p,q) being open, a real ε>0 with Nε(y)⊆(p,q); since y∈P is not isolated, [L1] gives z∈Nε∗(y)∩P, so z∈P∩(p,q) and z≠y. At least one of y,z differs from x; let w be y if y≠x and z otherwise, so w∈P∩Nε(y) and w≠x. Put δ:=min⁡{ ε−∣w−y∣, ∣w−x∣, η⋅2−1 }, a positive real by [L11] since each entry is positive, and use [L6] to fix p′,q′∈QR with w−δ<p′<w<q′<w+δ. Then [p′,q′]⊆Nδ(w)⊆Nε(y)⊆(p,q) by [L3], the pair (p′,q′) is good because w∈(p′,q′)∩P, the point x lies outside Nδ(w) because ∣x−w∣≥δ, and q′−p′<2δ≤η.

step 1.3L1L3L4L6L11choose
3.1

Successor rule. For (k,(p,q))∈N×G let m be the least natural for which some natural n makes (e(m),e(n)) good with [e(m),e(n)]⊆(p,q), f(k)∉[e(m),e(n)] and e(n)−e(m)<1/(k+1), and let n be the least natural with those properties for that m; put T(k,(p,q)):=(σ(k),(e(m),e(n))). The set of eligible m is nonempty by step 2.1 applied with x=f(k) and η=1/(k+1)>0, since e is onto QR, so both minima exist by [L7] and T:N×G→N×G is a total function defined without any selection.

step 2.1L6L7L10construct
4.1

The recursion. P is nonempty, so fix y0∈P and, by [L6], elements p0<y0<q0 of QR; then (p0,q0) is good. Apply [L8] with Y=N×G, seed (0,(p0,q0)) and map T to get h:N→N×G with h(0)=(0,(p0,q0)) and h(σ(k))=T(h(k)); an induction on k shows the first coordinate of h(k) is k, so write h(k)=(k,(pk,qk)) with every (pk,qk) good.

step 1.3step 3.1L6L8construct
5.1

Writing Ik:=[pk,qk] and ℓk:=qk−pk>0, the rule of step 3.1 gives, for every k∈N: Ik+1⊆(pk,qk)⊆Ik, so the intervals are nested and nonempty; f(k)∉Ik+1; ℓk+1<1/(k+1); and Ik∩P≠∅, because (pk,qk)∩P≠∅.

step 3.1step 4.1L4
6.1

For every real ε>0 there is k≥1 with ℓk<ε, and moreover ℓk→0: by step 5.1 one has ℓj<1/j for every j≥1, since ℓj=ℓ(j−1)+1<1/((j−1)+1)=1/j; given ε>0, [L10] supplies a natural n≥1 with 1/n<ε, and then every k≥n satisfies k≥1 and ∣ℓk−0∣=ℓk<1/k≤1/n<ε by [L10] and [L13], which is both assertions, the second by [L12] since a rational ε>0 is in particular a real one.

step 5.1L10L12L13
7.1

By [L9] the nested family (Ik) of nonempty closed bounded intervals has an intersection that is a single point, since its lengths tend to 0 by step 6.1; write {x} for it, so x∈Ik for every k.

step 5.1step 6.1L9
8.1

x∈P: let ε>0 be real and use step 6.1 to fix k≥1 with ℓk<ε; by step 5.1 there is y∈Ik∩P, and x∈Ik by step 7.1, so ∣y−x∣≤ℓk<ε by [L13] and y∈Nε(x)∩P. Every neighbourhood of x therefore meets P, so x∈P‾=P by [L1] and [L2].

step 5.1step 6.1step 7.1L1L2L3L13
9.1

For every k∈N one has x∈Ik+1 by step 7.1 while f(k)∉Ik+1 by step 5.1, so x≠f(k); thus the element x of P found in step 8.1 is not a value of f, contradicting the surjectivity of the f fixed in step 1.1. The assumption is therefore untenable: a nonempty perfect subset of R is not at most countable, that is, it is uncountable.

step 1.1step 5.1step 7.1step 8.1L5discharge-contradiction∎

Remarks

Depends on

Used by

Dependency tree · two levels

77 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