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.

Analytic subsets of Baire space have tree projections

Statement

In ZF, A⊆N is analytic in the closed-projection convention if and only if A=p[T] for a synchronous tree T. For this representation and each x∈N,

x∈A⟺[Tx]≠∅,Tx={t:(x↾∣t∣,t)∈T}.

Facts & Assumptions

[F1]

Synchronous trees, their bodies and sections are defined in Synchronous trees and projection bodies.

[F2]

Analytic means projection of a closed subset of the binary product with Baire space; see Analytic and coanalytic sets by closed projection.

[F3]

The cylinder-complement argument characterizes closed sets as prefix-tree bodies in one coordinate; see Closed subsets of Baire space are tree bodies. We give its two-coordinate form explicitly.

Proof

Given: A⊆N, with synchronous restrictions and the product topology as in F1–F2.

1.1F1F2F3

A basic neighbourhood of (x,y) contains Nx↾k×Ny↾l for some k,l. Setting n=max⁡(k,l) gives a contained product of equal-length cylinders. If (x,y)∉[T], some paired prefix of length n is absent; every point of that product cylinder has the same absent prefix. The complement of [T] is therefore open, precisely as in the argument for F3.

2.1F1step 1.1

Conversely, for closed F⊆N×N, put T={(x↾n,y↾n):(x,y)∈F, n∈N}. Restrictions of witnessed pairs have the same witness, so T is a synchronous tree and F⊆[T]. A point of [T]∖F would have an equal-length product cylinder disjoint from F by step 1.1's neighbourhood observation, but its paired prefix in T supplies a point of F in that cylinder. Thus [T]=F. For F=∅ the constructed tree is empty.

3.1F2step 1.1step 2.1

If A is analytic, choose its one closed witness F and apply step 2.1 to obtain A=p[T]. Conversely, if A=p[T], step 1.1 makes [T] a closed witness for analyticity. These choices concern one asserted witness and do not require AC.

4.1F1step 3.1

For each fixed x, restricting a pair in T proves prefix closure of Tx. For any y, the assertions y↾n∈Tx for all n and (x↾n,y↾n)∈T for all n are identical. Existence of such y is exactly x∈p[T]=A, proving the section equivalence. QED.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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