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.

Gale–Stewart games and strategies

Definition

Let E be a nonempty set, TE<ω a nonempty pruned tree (Trees and their bodies), and A[T]. In G(A;T), player I moves at even-length positions and player II at odd-length positions. A legal move at s is eE such that seT. A full play is a branch x[T]. Player I wins it when xA; otherwise player II wins.

A strategy for player P assigns a legal move to every position at which P moves, including positions inconsistent with its earlier prescriptions. A branch x is consistent with σ when x(n)=σ(xn) 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 E is implicit.

For sT put [T]s={x[T]:sx}. These cylinders, including [T]=[T], 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

[T][T]s={[T]t:tT, t=s, ts},

so cylinders are clopen. Empty cylinders are permitted. Neither this topology nor the winning-strategy definition asserts nonemptiness of [T] in ZF for arbitrary E.

Depends on

Used by

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