Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

Countable discrete spaces are standard borel

Example

Every at most countable set S with its full power-set sigma-algebra is standard Borel, including the empty set. For example S=N has the discrete complete metric d(m,n)=1{mn}.

Facts & Assumptions

Given: An at most countable set S with its full power-set sigma-algebra.

[F1]

A separable completely metrizable space is Polish. (Polish spaces are separable completely metrizable spaces)

[F2]

A measurable space with a Polish presentation is standard Borel. (Standard Borel spaces)

Verification

technique · direct
1.1

On S define d(x,y)=0 if x=y and d(x,y)=1 otherwise. Symmetry and separation are immediate, and if xz, at least one of xy or yz holds, giving d(x,z)=1d(x,y)+d(y,z). Balls of radius one half are singletons. Every Cauchy sequence is eventually constant, by applying the Cauchy condition with tolerance one half; hence d is complete. On N, for instance, d(2,5)=1 and Bd(2,1/2)={2}.

given
2.1

The countable set S itself is dense. Every subset is a union of singleton opens, so the Borel sigma-algebra is exactly its full power set. By [F1] S is Polish and the identity gives the presentation in [F2]. For empty S there are no Cauchy sequences, the empty metric is complete, and the empty set is a countable dense subset; for a singleton the only sequence is constant.

step 1.1F1F2

Source notes

Marker, Descriptive Set Theory, Example 1.2, printed p.2; Durrett Theorem 2.1.22, printed pp.53–54. The metric and its Cauchy property are explicitly evaluated here.

Depends on

Used by

Nothing in the library uses this result yet.

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