Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Choice produces an undetermined natural-number game

Statement

Assuming AC, some ANN has no winning strategy for either player. Consequently AD is incompatible with AC.

Facts & Assumptions

[F1]

Coding strategies and their compatible plays identifies each strategy family and each compatible-play set with the play space.

[F2]

The well-ordering theorem well-orders every set under AC.

[F5]

Transfinite recursion gives total-rule recursion along a well-order.

Proof

Given: ZF and A1. Write R=NN.

1.1

Apply F2 using A1 and then F3 to obtain the infinite initial cardinal κ=R, a bijection κR and its induced well-order of R. Infinitude follows already from the distinct constant sequences. By F1 index I's strategies as σα and II's as τα, α<κ. Each compatible-play set has cardinal κ by that same fact.

F1F2F3A1
2.1

Suppose pairs (xβ,yβ) have been chosen for β<α<κ. Their used set is the image of α×2, so has cardinal at most 2α. For infinite α, F3 gives α<κ by initiality, and F4 gives 2α=α<κ; adding one further point still has that cardinal by F4. For finite α, both the used set and its extension by one point are finite, hence smaller than infinite κ. Therefore some play compatible with σα is unused, and after selecting it some play compatible with τα is still unused.

F3F4step 1.1
3.1

Set xα to the least eligible σα-play in the fixed well-order, then yα to the least eligible τα-play outside the used set and {xα}. Define the rule on any malformed history or empty eligible set to be the constant-zero pair. It is a single-valued total set rule; F5 gives its recursion through κ. Step 2.1 inductively ensures the default is never used on the actual history, and all selected points are pairwise distinct.

F5step 1.1step 2.1
4.1

Put A={yα:α<κ}. For each I strategy σα, its compatible play xα is outside A, including outside all later selected points by step 3.1. Thus it loses on that play. For each II strategy τα, its compatible yα is in A, so it loses on that play. Neither player has a winning strategy. AD asserts determinacy for this very natural-number payoff, so it cannot hold together with AC. No cofinality or regularity assumption on κ occurred. QED.

F1step 3.1

Depends on

Used by

Dependency tree · two levels

31 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