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.
AD implies the Baire property for subsets of sequence spaces and the real line
Statement
In ZF+AD every subset of , or has the Baire property. Only countable choice for sets of Baire-real codes, obtained from AD, is used; neither AC nor unrestricted DC is assumed.
Facts & Assumptions
Category-game strategies characterize meagreness and local comeagreness gives both strategy characterizations, specified witnesses, open-subspace transfer and nonmeagreness of nonempty basic opens. Its games have the explicit natural-number coding described there.
AD implies countable choice for subsets of Baire space gives countable choice for nonempty sets of Baire reals under AD.
The property of Baire defines the property by meagre symmetric difference from an open set.
Assume Axiom of determinacy for natural-number games for the coded category games and the real-code selection theorem.
Given: ZF+AD, one of the three stated spaces X and , with its enumerated basic opens .
Proof
Let U be the union of the basis opens V on which A is comeagre. For each contributing V, F1's open-subspace transfer gives a sequence of ambient closed nowhere dense sets covering . Such a sequence has a Baire-real code: each closed F is determined by the set of basis indices whose opens miss F, since their union is exactly . Code this binary index set, and pair its coordinates with the sequence index to code the whole sequence in . For each contributing V the set of valid covering codes is nonempty; for every other V take the singleton code of the all-empty sequence. F2 under the assumed AD selects one code per basis index. Decode and pair the two sequence indices. This gives an actual closed nowhere dense covering sequence for .
Put . AD determines its coded category game. If I won, F1 would make E comeagre in some nonempty basic V. Since , the same witnesses show A comeagre in V; hence by definition of U. But then , so the same witnesses would make V meagre in itself, contradicting F1. Thus I cannot win, and determinacy gives a winning II strategy. F1 provides a specified nowhere dense covering sequence for E.
Interleave that sequence with step 1.1's sequence for . Their union covers and each term is nowhere dense. Hence the symmetric difference is meagre; U is open by its definition, so F3 proves the Baire property. This construction works with rational interval codes for the real line as well as with the two cylinder bases; it requires no homeomorphic transfer. Empty A gives U empty and the same argument, while A=X gives U=X. QED.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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.