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.

Closed Souslin schemes characterize analytic sets

Statement

In ZFC, A in a Polish space X is analytic if and only if A=S(F) for a scheme of closed subsets of X. Such a scheme may be chosen decreasing along extensions.

Facts & Assumptions

[F1]

The Souslin operation defines the operation including the root and its decreasing normalization.

[F2]

Equivalent analytic normal forms and Borel maps gives the closed-projection and Baire-image characterizations.

Proof

Given: The Polish space and ZFC assumptions.

1.1

For a closed scheme F put C={(x,f):n xFfn}. If (x,f)C, some n has xFfn. The open product (XFfn)×Nfn misses C. This remains true for n=0. Hence C is closed and its projection, exactly S(F) by F1, is analytic by F2 and A1.

F1F2A1
2.1

Conversely empty A uses the all-empty closed scheme. If A is nonempty analytic, F2 and A1 give continuous g:NX with image A. Set Fs=g[Ns], closed and decreasing. For each f, g(f) belongs to all Ffn. If xg(f), put r=d(x,g(f))/3>0. Continuity gives n with g[Nfn]B(g(f),r); its closure lies in the closed radius-r ball, which excludes x. Thus nFfn={g(f)}. Taking the branch union gives exactly A. The closures, rather than the raw images, supply closed sets without changing the branch intersections. QED.

F1F2A1

Depends on

Used by

Dependency tree · two levels

10 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