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.
Game coverings, k-coverings and unraveling
Definition
Let be trees with terminal taboos in the sense of Game trees with terminal taboos. A covering of is a triple with the following data and requirements, formulated in ZF.
The position map preserves lengths and prefixes. It reflects target taboos: if is taboo for in , then is taboo for in . For , define . Prefix and length preservation make this a branch of with those specified restrictions. For a finite maximal play use the position map.
The strategy map sends every total strategy on to a total strategy for the same player on . Regard strategies as tagged by their player, even if the underlying functions happen to coincide. Finite-depth locality means: if two input strategies for the same player agree at all positions of length , their images agree at all target positions of length .
Lifting requirement. For each strategy for player on and each maximal play on consistent with , there exists a maximal play on consistent with such that and either or is taboo for . Thus a lift may end early only as a loss for its strategy's player. No specified lift function is part of the data, and independent existential lifts are not asserted to be coherent.
For , this is a -covering if have identical nodes and taboo labels at lengths , is the identity on those nodes, and equals at positions of length . In particular a zero-covering identifies the roots and their taboo labels; its strategy-identity condition is vacuous.
A covering unravels if is clopen in . This preimage uses infinite branches only. The branch map is continuous: for a cylinder its preimage is . A finite maximal lifted play can project to a nonterminal target position; taboo reflection is not being reversed in that situation.
Depends on
Used by
Dependency tree · two levels
3 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
- covering definition before Lemma 2 and k-covering definition before Lemma 4 (standard reference, not scraped)
- definitions printed pp65–68, triple variant p66 (standard reference, not scraped)