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.
A clopen game decided by the first move
Example
On let . Player I wins by the strategy at every even-length position . The payoff is clopen.
Facts & Assumptions
Full-position strategies and their winning condition are in Gale–Stewart games and strategies.
Finite-prefix cylinders form the topology of Baire sequence space and its cylinder topology.
Verification
Given: The full natural-number tree, payoff , and the constant-zero I strategy.
Every belongs to the full tree, so is a legal strategy, including at . We have and , both open by F2. Hence is clopen.
Every branch consistent with satisfies , so belongs to . For example, if II always plays , the unique compatible branch is and its first coordinate is . The same first-coordinate calculation holds for every sequence of II moves, proving that wins. 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
- Opening definitions of games and strategies (standard reference, not scraped)