Alphabeta Math
LemmaStatement: 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 splitting in a Polish space

Statement

In ZFC every uncountable subset A of a Polish space has two disjoint open neighbourhoods each meeting A uncountably. They may be chosen in a countable metric basis with arbitrarily small positive diameter bounds. Analyticity of A is not required.

Facts & Assumptions

[F1]

Polish spaces are separable completely metrizable spaces supplies a compatible metric and a countable dense set.

Proof

Given: Uncountable AX and a desired bound ϵ>0.

1.1

A countable dense set with positive rational radii gives an enumerated metric basis (Un): inside any ball around a point, choose a dense centre sufficiently near the point and a rational radius large enough to contain the point but small enough that its ball stays inside the original ball. For each n with nonempty countable AUn, A1 selects an enumeration of that intersection; an injection into N gives such a surjection by filling unused indices with the value at the least occupied index. Pairing n and enumeration indices shows that M={AUn:AUn is countable} is countable; empty terms contribute nothing. If there are no nonempty terms then M is empty.

F1A1
2.1

The set AM is uncountable: otherwise an enumeration of it and one of M, interleaved, would enumerate A. In particular it contains distinct x,y. Every basis neighbourhood of either meets A uncountably, by the definition of M. Take disjoint balls around x,y with radii less than min(d(x,y)/3,ϵ/3), and refine each at its centre to a basis neighbourhood. The refinements are disjoint, each has diameter less than ϵ, and both have uncountable intersection with A. This proves the statement for every positive bound. QED.

F1step 1.1

Depends on

Used by

Dependency tree · two levels

5 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