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, is closed if and only if for a tree on . When is closed, its prefix tree
has body . If is nonempty, is nonempty and pruned; if is empty, is empty.
Facts & Assumptions
Baire cylinders form a basis, including ; see Baire sequence space and its cylinder topology.
A tree is prefix closed, and means every finite prefix of lies in ; see Trees and their bodies.
Proof
Given: A subset and the definitions above.
For any tree and , F2 gives with . If , it has that same excluded prefix, so . Thus each point of the complement has a basic neighbourhood in the complement, which proves closed. This includes and .
Suppose is closed. If , one witness extending also extends every restriction of . Thus is a tree. Each has all its prefixes in , so .
Let . If , closedness and F1 give a cylinder disjoint from . But has an extending witness , a contradiction to this disjointness. Therefore , and equality follows.
If , no prefix has a witness and . If , its empty prefix belongs to . For each individual , a witness extends it to , 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.
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
- Lemma 1.14(ii), Definition 1.15 (standard reference, not scraped)