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.
The Souslin operation
Definition
Work in ZF. For a set and a scheme of subsets of , with finite prefixes as in Trees and their bodies and branches in Baire sequence space and its cylinder topology, the Souslin operation is
The intersection includes , so . Setting makes that term neutral; setting it empty makes the result empty. All unions and intersections are indexed by sets, so Separation and Union define a subset of .
One may normalize to a decreasing scheme by putting , where prefixes include itself. If , its prefix family is included in that of , so . For each fixed branch , membership in every implies membership in by taking that prefix itself. Conversely membership in all implies membership in every , since each prefix of is for some . The branch intersections, and hence the two Souslin results, are equal. This also covers the empty ambient set and uses no choice.
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
- Definition 4.19 p39 and normalization at the start of Theorem 4.22 p40 (standard reference, not scraped)