Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

MA makes unions of fewer than continuum many null sets null

Statement

In ZFC+MA, the union of fewer than 20 Lebesgue-null subsets of the real line is null. In particular every set of reals of cardinality below the continuum is null.

Facts & Assumptions

Proof

1.1

Let Pε be the set of open subsets U of R with m(U)<ε, ordered by reverse inclusion: UV means UV, so a larger open set is a stronger condition in the convention of [F3]. For every α, the subcollection Dα={U:NαU} is dense: given U, choose by F1 an open cover O of the null set NαU with m(O)<εm(U); then UOU lies in Dα.

F1F3
2.1

The order is ccc. Enumerate the rational open intervals whose closures lie in a condition U; their union is U. The increasing finite unions WjU therefore have union U, so F2 supplies some finite rational-interval union W=Wj with m(UW)<(εm(U))/2. If two conditions U,V share this W, then, labelling so that m(U)m(V), m(UV)m(W)+m(UW)+m(VW)<m(U)+εm(U)2+εm(U)2=ε, so UV is a condition below both in the declared reverse-inclusion order. Only countably many sets W occur, so no antichain of conditions is uncountable.

F2step 1.1
3.1

MA gives a filter meeting all Dα. Its union U covers every Nα. Directedness toward stronger conditions in the reverse-inclusion order makes every finite subunion of filter members a subset of one stronger member, so it has measure below ε. The rational base gives a countable cofinal subfamily for the union, so continuity from below yields m(U)ε. Repeating for ε=2n proves the total union has outer measure zero, and completeness gives nullity.

F3F4step 1.1step 2.1
4.1

A singleton has measure zero. Applying the first clause to the family of singletons indexed by any set of reals of size below c gives the second. AC was used to enumerate/cardinalize the family and choose all covers and approximations.

F4step 3.1

Depends on

Used by

Dependency tree · two levels

38 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