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.
Null master codes and summable slaloms are Tukey equivalent
Statement
In ZFC, let , ordered by inclusion, and let be the summable slalom order of Borel master codes for null and meagre sets. There are Borel morphisms in both directions:
- : Borel maps from null codes to slaloms and from slaloms to null codes with ;
- : Borel maps from slaloms to null codes and from null codes to slaloms with .
These are morphisms of the coded cofinal family; no identification of a code with a unique ideal member is required.
Facts & Assumptions
Given: The fair-coin Cantor probability space, the clopen null codes, and finite-valued summable slaloms.
Valid null codes select clopen of measure at most ; their limsups are null. The slalom space is Borel in the standard product code of finite subsets because the finite partial sums of are uniformly coded. (Borel master codes for null and meagre sets)
Borel families with null sections have Borel-selected covering null master codes. (Null and meagre master codes are cofinal)
Cantor space and Baire space have fixed Borel codes for the standard Borel parameter spaces used here. (Cantor and Baire sequence spaces and coordinate codings)
The Baire category theorem holds on every nonempty compact metric space, in particular on a nonempty closed subset of Cantor space. (Cantor and Baire sequence spaces and coordinate codings, A closed subset of a compact metric space is compact, Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior)
AC gives the ordinary measure and cardinal framework; all maps below are defined by fixed enumerations, Borel tests, and least-index choices. (The Axiom of Choice)
Proof
Enumerate all clopen sets as , as in [F1], and put when and otherwise. For a null code define . This is a slalom, since . For let Its stage- measure is at most , and the sum of these bounds is finite by summability. The elementary tail-union estimate therefore gives . Membership in is Borel in , since each stage is a finite clopen union.
For a null code , define the closed sets They increase to , which has measure one. Choose the least for which and set . This is a Borel choice: each measure is the decreasing limit of measures of finite clopen intersections, and the least-index threshold test is Borel. For the fixed basic clopens let , again Borel by the same finite-stage measure limits, and set This is compact, has the same measure as , is disjoint from , and has the property that every nonempty has positive measure. The last assertion follows because a zero-measure intersection with would be a zero-measure intersection with unless was removed, in which case the intersection is empty. Its closed code is Borel in : the finite-stage closed approximants are clopen, and whether the compact intersection meets a basic clopen is the decreasing-limit nonemptiness test from compactness.
Use [F3] to code as a Borel subset of a Cantor parameter space; extend the Borel family by empty sections off that subset. Apply [F2] and restrict the resulting selector to obtain a Borel null-code map with . If , then for all sufficiently large the two clopen sets and appear in the stage- union defining . Every point of lies in infinitely many even or odd code sets and hence in . Thus , proving the first morphism.
For each pair with , allocate a distinct block of binary coordinates and let be the clopen event that all bits in that block are zero. The blocks are disjoint, so the family of all these events is independent and . For put The sum of stage measures is bounded by , so is null. It is Borel in . As in step 2.1, [F2] supplies a Borel null-code map with .
For each define, when , when , put . The compact-hit tests of step 1.2 make this a Borel family. In the nonempty case put . For every finite set of pairs with , independence gives Taking finite products increasingly shows both that every is finite and that ; indeed and the logarithms of all finite products are bounded below by . Thus is a slalom.
Choose Borelly the least increasing thresholds with . Such thresholds exist by step 4.1; each test is Borel as a limit of finite sums. Put Only finitely many contribute, so the value is finite, and . Also for every .
Assume . Since , the compact misses . Hence it is covered by the increasing closed sets By [F4], one of these closed sets has nonempty relative interior in . Choose a basic witnessing that interior. Then is nonempty and, for all and , it misses . Therefore eventually, and step 5.1 gives . This is the second morphism. AC in [F5] supplies DC for the Baire category theorem [F4] at this step and underlies full null-ideal cofinality in [F2]; the displayed Borel maps make no further arbitrary choices. ∎
Depends on
- Cantor and Baire sequence spaces and coordinate codings
- Borel master codes for null and meagre sets
- Null and meagre master codes are cofinal
- Uniform open hulls for Borel sections of small measure
- The fair-coin measure on Cantor space
- Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior
- A closed subset of a compact metric space is compact
- The Axiom of Choice
Used by
Dependency tree · two levels
45 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, Lemma 3.13, printed pp.9–10 (standard reference, not scraped)