Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Uncountable analytic sets contain compact Cantor copies

Statement

In ZFC every uncountable analytic subset A of a Polish space X contains a compact subspace homeomorphic to C. In particular it contains a nonempty perfect closed subset of X. This includes uncountable Borel subsets and uncountable Polish spaces.

Facts & Assumptions

[F1]

Equivalent analytic normal forms and Borel maps supplies Baire parametrization and includes Borel sets among analytic sets.

[F2]

Uncountable splitting in a Polish space splits uncountable subsets into disjoint open neighbourhoods with uncountable intersections.

[F3]

Cantor and Baire sequence spaces and coordinate codings gives compactness and no isolated points of C, and the Baire cylinder topology.

Proof

Given: Uncountable analytic AX, in ZFC.

1.1

Fix continuous f:NX onto A by F1 and A1. We build words tsN<ω indexed by binary words s, with t=, strict extension on each edge, and uncountable f[Nts]. Given ts, F2 supplies disjoint opens U0,U1 meeting its image uncountably. Each Ntsf1[Ui] is open and is the union of all cylinders it contains whose word lengths exceed ts. There are countably many such cylinders. If every one had countable image, A1 would choose enumerations of the nonempty images and a pairing would enumerate their union, contradicting its uncountability. Thus for each i select the least word code with uncountable image and cylinder inside this preimage, and set it to tsi. It extends ts and has its image inside Ui. All choices of eligible open pairs can be made on the set of finite words by A1; length recursion then constructs the tree of words.

F1F2F3A1
2.1

For zC set g(z)=ntzn. Strict length growth makes this a full Baire sequence. Agreement on n input bits fixes an output prefix of length at least n, so g is continuous by F3. If z,w first split at a binary node s, their images under fg lie in the two disjoint opens chosen there in step 1.1. Hence fg is injective as well as continuous, and its image is contained in A.

F3step 1.1
3.1

The image K is compact by pulling any open cover back to compact C and pushing a finite subcover forward. For a point x outside a compact subset of a metric space, the balls B(y,d(x,y)/3) about its members y have a finite subcover; the minimum of these finitely many positive radii gives a ball about x missing the compact set. Hence compact sets are closed. Closed subsets of C are compact (adjoin the open complement to a cover), so their images under fg are closed. The inverse of this injection onto K is therefore continuous. Thus K is homeomorphic to C, is nonempty and closed, and has no isolated point by F3. Finally Borel A is analytic by F1's normal forms (use its identity map), and X is itself Borel in X. This proves both final special cases. QED.

F1F3step 2.1

Depends on

Used by

Dependency tree · two levels

14 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