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 meagre sets meagre

Statement

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

Facts & Assumptions

Given: AC, MA, and {Mα:α<κ} with κ<c.

[F2]

Martin's Axiom at a cardinal and Martin's Axiom supplies filters for ccc coding orders.

Proof

1.1

By AC choose increasing closed nowhere-dense covers MαnFαn. Fix a countable base (Bj) of rational intervals. A condition is (m,F,w), where m<ω, Fκ is finite, and w(n,j) for n,j<m is a nonempty rational interval with closure inside Bj. A condition (m,F,w) extends (m,F,w) when mm, FF, it preserves old w, and every newly assigned cell (n,j)[0,m)2[0,m)2 has closure disjoint from Fαn for all αF, the old side set. This includes the new columns of old rows. The relation is transitive: cells added at the first extension avoid the original side set, and cells added later avoid the larger intermediate side set. Finite unions of closed nowhere-dense sets leave the required subintervals in every Bj.

F1
2.1

Conditions with the same m,w are compatible: take the union of their finite side sets without adding a new row. There are only countably many finite rational arrays w, so the order is ccc. For each α, the set requiring αF is dense. For every r, the set requiring m>r is dense by filling the finitely many new cells inside the complements prescribed in step 1.1. These are only κ+0<c requirements, so MA supplies a filter G.

F2step 1.1
3.1

Coherence of the filter defines Inj=w(n,j) for every n,j. Put Vn=jInj and Wr=nrVn. Each Vn, hence each Wr, is open dense because InjBj exists for every basic interval. Fix α and a filter condition that first has α in its side set at length m. For every nm and every j, the cell (n,j) is assigned only in an extension of that condition and its closure avoids Fαn by step 1.1, even if it is a new column of an earlier row. Thus VnFαn=. If xMα, choose k with xFαk; since the cover is increasing, xVn for all nmax(m,k). Thus xWmax(m,k) and xrWr. Therefore the union of the Mα is covered by the meagre set r(RWr). Singletons are nowhere dense, proving the final clause. The simultaneous cover choice is the exact AC use; the defective published sigma-ideal proposition is not used.

F1step 1.1step 2.1

Depends on

Used by

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.

Sources