Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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 N0={Nf:f is a valid null master code}, ordered by inclusion, and let (S,⊆∗) be the summable slalom order of Borel master codes for null and meagre sets. There are Borel morphisms in both directions:

  • N0⪯S: Borel maps u from null codes to slaloms and v from slaloms to null codes with u(f)⊆∗S⇒Nf⊆Nv(S);
  • S⪯N0: Borel maps u′ from slaloms to null codes and v′ from null codes to slaloms with Nu′(S)⊆Nf⇒S⊆∗v′(f).

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.

[F1]

Valid null codes select clopen Cf(n) of measure at most 2−n; their limsups are null. The slalom space is Borel in the standard product code of finite subsets because the finite partial sums of ∑n∣S(n)∣2−n are uniformly coded. (Borel master codes for null and meagre sets)

[F2]

Borel families with null sections have Borel-selected covering null master codes. (Null and meagre master codes are cofinal)

[F3]

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)

[F5]

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

technique · two explicit coded morphisms
1.1

Enumerate all clopen sets as (Ci)i, as in [F1], and put Cik=Ci when μ(Ci)≤2−k and Cik=∅ otherwise. For a null code f define u(f)(n)={f(2n),f(2n+1)}. This is a slalom, since ∑n∣u(f)(n)∣2−n≤∑n21−n<∞. For S∈S let HS=lim sup⁡n⋃i∈S(n)(Ci2n∪Ci2n+1). Its stage-n measure is at most ∣S(n)∣(2−2n+2−(2n+1)), and the sum of these bounds is finite by summability. The elementary tail-union estimate therefore gives μ(HS)=0. Membership in HS is Borel in (S,y), since each stage is a finite clopen union.

F1
1.2

For a null code f, define the closed sets Km′(f)=⋂n≥m(2ω∖Cf(n)). They increase to 2ω∖Nf, which has measure one. Choose the least m=m(f) for which μ(Km′(f))>1/2 and set Kf′=Km(f)′(f). 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 (Uj)j let Zj={f:μ(Kf′∩Uj)=0}, again Borel by the same finite-stage measure limits, and set Kf=Kf′∖⋃j:f∈ZjUj. This is compact, has the same measure as Kf′, is disjoint from Nf, and has the property that every nonempty Kf∩Uj has positive measure. The last assertion follows because a zero-measure intersection with Kf would be a zero-measure intersection with Kf′ unless Uj was removed, in which case the intersection is empty. Its closed code is Borel in f: the finite-stage closed approximants are clopen, and whether the compact intersection meets a basic clopen is the decreasing-limit nonemptiness test from compactness.

F1
2.1

Use [F3] to code S as a Borel subset of a Cantor parameter space; extend the Borel family HS by empty sections off that subset. Apply [F2] and restrict the resulting selector to obtain a Borel null-code map v(S) with HS⊆Nv(S). If u(f)⊆∗S, then for all sufficiently large n the two clopen sets Cf(2n) and Cf(2n+1) appear in the stage-n union defining HS. Every point of Nf lies in infinitely many even or odd code sets and hence in HS. Thus Nf⊆Nv(S), proving the first morphism.

step 1.1F2F3
3.1

For each pair (n,i) with n≥1, allocate a distinct block of n binary coordinates and let Gin 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 μ(Gin)=2−n. For S∈S put LS=lim sup⁡n≥1⋃i∈S(n)Gin. The sum of stage measures is bounded by ∑n≥1∣S(n)∣2−n<∞, so LS is null. It is Borel in (S,y). As in step 2.1, [F2] supplies a Borel null-code map u′(S) with LS⊆Nu′(S).

F1F2F3
4.1

For each f,j,n define, when Kf∩Uj≠∅, Tf,j(n)={i:Kf∩Uj∩Gin=∅}; when Kf∩Uj=∅, put Tf,j(n)=∅. The compact-hit tests of step 1.2 make this a Borel family. In the nonempty case put a=μ(Kf∩Uj)>0. For every finite set of pairs (n,i) with i∈Tf,j(n), independence gives a≤∏(n,i)(1−2−n). Taking finite products increasingly shows both that every Tf,j(n) is finite and that ∑n≥1∣Tf,j(n)∣2−n<∞; indeed −log⁡(1−t)≥t and the logarithms of all finite products are bounded below by log⁡a. Thus Tf,j is a slalom.

step 3.1step 1.2
5.1

Choose Borelly the least increasing thresholds rj(f)≥j with ∑n≥rj(f)∣Tf,j(n)∣2−n<2−j. Such thresholds exist by step 4.1; each test is Borel as a limit of finite sums. Put v′(f)(n)=⋃j:rj(f)≤nTf,j(n). Only finitely many j≤n contribute, so the value is finite, and ∑n∣v′(f)(n)∣2−n≤∑j2−j<∞. Also Tf,j⊆∗v′(f) for every j.

step 4.1
6.1

Assume Nu′(S)⊆Nf. Since LS⊆Nu′(S), the compact Kf misses LS. Hence it is covered by the increasing closed sets Kf∩⋂n≥m(2ω∖⋃i∈S(n)Gin)(m∈ω). By [F4], one of these closed sets has nonempty relative interior in Kf. Choose a basic Uj witnessing that interior. Then Kf∩Uj is nonempty and, for all n≥m and i∈S(n), it misses Gin. Therefore S(n)⊆Tf,j(n) eventually, and step 5.1 gives S⊆∗v′(f). 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. ∎

step 3.1step 5.1F2F4F5

Depends on

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