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.

Closed subsets of Baire space are tree bodies

Statement

In ZF, FN=NN is closed if and only if F=[T] for a tree T on N. When F is closed, its prefix tree

TF={sN<ω:(yF) sy}

has body F. If F is nonempty, TF is nonempty and pruned; if F is empty, TF is empty.

Facts & Assumptions

[F1]

Baire cylinders Ns form a basis, including N=N; see Baire sequence space NN and its cylinder topology.

[F2]

A tree is prefix closed, and x[T] means every finite prefix of x lies in T; see Trees and their bodies.

Proof

Given: A subset FN and the definitions above.

1.1

For any tree T and x[T], F2 gives n with xnT. If yNxn, it has that same excluded prefix, so y[T]. Thus each point of the complement has a basic neighbourhood in the complement, which proves [T] closed. This includes n=0 and T=.

F1F2
1.2

Suppose F is closed. If sTF, one witness yF extending s also extends every restriction of s. Thus TF is a tree. Each yF has all its prefixes in TF, so F[TF].

givenF2
2.1

Let x[TF]. If xF, closedness and F1 give a cylinder Nxn disjoint from F. But xnTF has an extending witness yF, a contradiction to this disjointness. Therefore [TF]F, and equality follows.

givenF1step 1.2
3.1

If F=, no prefix has a witness and TF=. If F, its empty prefix belongs to TF. For each individual sTF, a witness y extends it to y(s+1)TF, proving pruning. These are separate existential deductions at each node, not a simultaneous choice of witnesses. Together with the closed-body implication this establishes both directions and all additional claims. QED.

F2step 1.1step 2.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