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.
Gale–Stewart games and strategies
Definition
Let be a nonempty set, a nonempty pruned tree (Trees and their bodies), and . In , player I moves at even-length positions and player II at odd-length positions. A legal move at is such that . A full play is a branch . Player I wins it when ; otherwise player II wins.
A strategy for player assigns a legal move to every position at which moves, including positions inconsistent with its earlier prescriptions. A branch is consistent with when at each coordinate of that player's parity. The strategy is winning if every consistent branch is won by that player. The game is determined if at least one player has a winning strategy. These are definitions in ZF; a legal move exists individually at each position, but no simultaneous strategy-existence assertion for arbitrary is implicit.
For put . These cylinders, including , form a basis: two cylinders intersect in the longer one when the words are comparable, and are disjoint otherwise. Unions of cylinders therefore satisfy the topology axioms in Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison. Moreover
so cylinders are clopen. Empty cylinders are permitted. Neither this topology nor the winning-strategy definition asserts nonemptiness of in ZF for arbitrary .
Depends on
Used by
- Axiom of determinacy for natural-number games Definition
- Game trees with terminal taboos Definition
- The Banach–Mazur category game on sequence spaces and the real line Definition
- The rational measure game Definition
- A clopen game decided by the first move Example
- Coding strategies and their compatible plays Lemma
- Perfect-set game strategy dichotomy on Cantor space Lemma
- Open and closed Gale–Stewart games are determined Theorem
Dependency tree · two levels
4 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, before Lemma 1; compare Marker Definitions 6.1–6.3 (standard reference, not scraped)