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.
Meagre master codes are below summable slaloms
Statement
Let be the good clopen array of A good clopen family for summable slaloms and put for . These sets form an inclusion-cofinal subfamily of the meagre ideal. There are Borel maps and such that Thus the meagre master family is below the summable slalom order in the ideal-inclusion morphism sense.
Facts & Assumptions
Given: The fixed good clopen array and repeating basic cylinders .
Every meets ; some is contained in any specified dense open set; and any at most members in row have intersection meeting . (A good clopen family for summable slaloms)
A Borel family of meagre sections admits Borel-selected closed nowhere-dense covers. (Uniform closed nowhere-dense covers for Borel meagre sections)
Meagre master codes are inclusion-cofinal. The summable slalom space is Borel in its product code. (Null and meagre master codes are cofinal, Borel master codes for null and meagre sets)
Baire-space and Cantor-space parameters admit fixed Borel coding. (Cantor and Baire sequence spaces and coordinate codings)
Proof
For each , every tail union is dense open: a given basic cylinder equals for some , and meets it by [F1]. Hence is meagre. It is represented by a code of Borel master codes for null and meagre sets: at master stage , enumerate the basic cylinders contained in that dense open tail union. This enumeration is Borel in because the tail union is a coded countable union of clopens and inclusion of a compact cylinder in it is a finite-subcover test.
If is meagre, take closed nowhere-dense with . For each , the complement of is dense open, so choose the least such that lies in that complement, using [F1]. Every belongs to some and therefore misses for all ; hence . This proves cofinality.
Define , a slalom since . For , summability implies for every sufficiently large . Let be the least integer beyond which this holds; it is Borel because the condition is a countable conjunction of coordinate tests. Put for , and put for earlier . Empty intersections are the whole space. By [F1], each for meets . Therefore every tail union is dense open, and is meagre. Its membership relation is Borel in because each is a finite clopen intersection with Borel dependence on .
Code the Borel slalom parameter space in a Cantor parameter space via [F4], extending by empty sections outside its coded domain. Apply [F2] to get Borel closed nowhere-dense codes with . Set to be the least such that The complement of that finite union is dense open, so [F1] gives such an . For a Borel-coded closed set, disjointness from a fixed clopen set is a Borel finite-subcover test on its open complement; hence is Borel. If , then for some , and it misses whenever . Thus .
If , then eventually and eventually. Hence and, on taking complements, . This is the required Borel morphism. The special family is cofinal by step 1.2, so it is an eligible cofinal master family for ideal inequalities. ∎
Depends on
Used by
Dependency tree · two levels
28 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
- Tomek Bartoszyński, Invariants of Measure and Category, Lemmas 3.14–3.15, printed pp.10–11 (standard reference, not scraped)