Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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 T,S be trees with terminal taboos in the sense of Game trees with terminal taboos. A covering of T is a triple (S,π,ϕ) with the following data and requirements, formulated in ZF.

The position map π:ST preserves lengths and prefixes. It reflects target taboos: if π(s) is taboo for P in T, then s is taboo for P in S. For y[S], define π(y)=nπ(yn). Prefix and length preservation make this a branch of T with those specified restrictions. For a finite maximal play use the position map.

The strategy map ϕ sends every total strategy on S to a total strategy for the same player on T. 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 <n, their images agree at all target positions of length <n.

Lifting requirement. For each strategy σ for player P on S and each maximal play x on T consistent with ϕ(σ), there exists a maximal play y on S consistent with σ such that π(y)x and either π(y)=x or y is taboo for P. 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 kN, this is a k-covering if S,T have identical nodes and taboo labels at lengths k, π is the identity on those nodes, and ϕ(σ) equals σ at positions of length <k. In particular a zero-covering identifies the roots and their taboo labels; its strategy-identity condition is vacuous.

A covering unravels A[T] if π1(A) is clopen in [S]. This preimage uses infinite branches only. The branch map is continuous: for a cylinder [T]p its preimage is {[S]s:s=p, π(s)=p}. 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