Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-10
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.

The Souslin operation preserves Lebesgue measurability

Statement

Assume ZFC and d1. Every ERd has a Lebesgue measurable envelope H containing E such that HD is null for every Lebesgue measurable D containing E. The Souslin operation preserves Lebesgue measurability on Rd. Every analytic subset of Rd is therefore Lebesgue measurable.

Facts & Assumptions

[F1]

The Souslin operation gives decreasing prefix normalization and the branch union.

[F2]

Closed Souslin schemes characterize analytic sets gives closed schemes for analytic sets.

[F3]

Every subset of Rn has a Gδ measurable hull of the same outer measure supplies measurable hulls with equal outer measure under countable choice.

[F4]

Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume gives completeness, countable additivity, and finite volume for half-open boxes under countable choice.

[F5]

Assuming countable choice, every Borel subset of Rn is Lebesgue measurable includes closed sets among measurable sets under countable choice.

[F6]

Carathéodory measurable sets supplies the splitting identity for outer measure at measurable sets.

[A1]

Assume The Axiom of Choice, licensing those countable-choice hypotheses.

Proof

Given: Dimension d1 and the ZFC assumptions. Write λ and λ for measure and outer measure.

1.1

For any sequence of measurable sets, disjointize it by removing preceding finite unions; the disjoint pieces are measurable and contained in the original sets. Countable additivity in F4 and monotonicity then give countable subadditivity. In particular a countable union of null measurable sets is null, and every subset of it is measurable and null by completeness F4. These uses are licensed by A1.

F4A1
2.1

Put Qj=(j,j]d for positive integers j and Ej=EQj. These boxes cover Rd and have finite measure (2j)d by F4. By F3 and A1 choose measurable GjEj with λ(Gj)=λ(Ej); the value is finite by containment of E_j in Q_j and monotonicity. Set Hj=GjQj. Then EjHjGj implies λ(Hj)=λ(Ej). If D is measurable and contains E, then EjHjD implies λ(HjD)λ(Ej)=λ(Hj). Equality follows by the reverse monotonicity. F6's splitting of the finite-measure H_j at D gives λ(HjD)=0. Thus H=jHj is measurable, contains E, and HD is null by step 1.1. No subtraction of infinite quantities occurred.

F3F4F6A1step 1.1
3.1

Normalize the measurable scheme (As) using F1 and finite intersection closure from F4. Set Es=fsnAfn, so EsAs and Es=kEsk. Step 2.1 and A1 select measurable envelopes H_s. Put Bs=AstsHt. These are measurable, decreasing, contain E_s, and are contained in H_s, so retain its envelope property. The measurable set kBsk contains E_s; hence Cs=BskBsk is null. The union C of these defects over all finite words is null by step 1.1.

F1F4A1step 1.1step 2.1
4.1

For xBC the exclusion of each defect lets us recursively choose the least child index retaining membership in B. The resulting branch f has xAfn for all n, so xS(A). Conversely S(A)=EB. Their difference is therefore a subset of null C. Completeness F4 proves S(A) measurable, including schemes with empty root. Finally F2 with A1 represents analytic sets by closed schemes, whose entries are measurable by F5 with A1; the proved preservation applies. QED.

F1F2F4F5A1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

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