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 has no winning strategy for either player. Consequently AD is incompatible with AC.
Facts & Assumptions
Coding strategies and their compatible plays identifies each strategy family and each compatible-play set with the play space.
The well-ordering theorem well-orders every set under AC.
A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used assigns the least equinumerous ordinal to a well-orderable set.
Absorption: for cardinals with infinite and , , and when gives for infinite cardinals .
Transfinite recursion gives total-rule recursion along a well-order.
Assume The Axiom of Choice.
Proof
Given: ZF and A1. Write .
Apply F2 using A1 and then F3 to obtain the infinite initial cardinal , a bijection and its induced well-order of . 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.
Suppose pairs have been chosen for . Their used set is the image of , so has cardinal at most . For infinite , F3 gives by initiality, and F4 gives ; 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.
Set to the least eligible -play in the fixed well-order, then to the least eligible -play outside the used set and . 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.
Put . For each I strategy , its compatible play is outside , including outside all later selected points by step 3.1. Thus it loses on that play. For each II strategy , its compatible is in , 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.
Depends on
- Coding strategies and their compatible plays
- The well-ordering theorem
- A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used
- Absorption: for cardinals $\kappa, \lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda = \kappa$, and $\kappa \otimes \lambda = \kappa$ when $\lambda \ne 0$
- Transfinite recursion
- The Axiom of Choice
Used by
- Every set of reals is Borel False statement
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
- Exercise 6.8, printed p55 (standard reference, not scraped)