Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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.

For a Lebesgue measurable set and every positive ε there is an open superset whose difference from it has outer measure below ε

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). For every Lebesgue measurable ERn and every real ε>0 there is an open set U with

EUandλn(UE)<ε.

No finiteness hypothesis on λn(E) is imposed; the excess is measured by the outer measure of the difference, not by a difference of measures, which is what lets the statement hold when λn(E)=+.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, a Lebesgue measurable set E, and a real ε>0.

[L1]

Assuming countable choice, λn(E)=inf{λn(U):URn open and EU} for every subset E (Assuming countable choice, the Lebesgue outer measure of an arbitrary subset of Rn is the infimum of the measures of the open sets containing it).

[L2]

Assuming countable choice, L(Rn) is a sigma-algebra, λn is a complete measure on it, and λn is the restriction of λn (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[L3]

Assuming countable choice, λn is an outer measure on Rn, hence monotone and countably subadditive (Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume, Outer measures).

[L4]

Assuming countable choice, every Borel subset of Rn is Lebesgue measurable (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable).

[L5]

Every bounded subset ERn has λn(E)<+ (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure).

[L6]

Every set R with RRR is Lebesgue measurable with λn(R)=i<n(biai) (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included), and (u,v]n:=B(u,v) (Half-open boxes in Rn and their volume).

[F1]

Let μ be a measure and let AB be measurable with μ(A)<+; then μ(B)=μ(A)+μ(BA) (Measure of a set difference when the smaller set has finite measure).

[F3]

If r<1 then k=0rk=1/(1r); in particular k=02k=2 (For r<1, k0rk=1/(1r), and for r1 the series diverges).

[F4]

The nonnegative extended sum of a sequence in [0,+] is k=0ak:=supnNsn, the supremum of its nondecreasing partial sums (Series in the nonnegative extended real line).

[F5]

For sequences of reals, k<nλak=λk<nak, and if akbk whenever 0k<n then k<nakk<nbk (Laws of finite sums and finite products, claims 2 and 4; Finite sums and finite products, by recursion).

[F6]

The Axiom of Countable Choice says that for every family (Xn)nN of nonempty sets indexed by N there is a function f with domain N such that f(n)Xn for every nN (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1

Suppose first λn(E)<+ and let η be a positive real. Outer regularity supplies an open UE with λn(U)<λn(E)+η; both E and U are measurable, so the difference formula gives λn(U)=λn(E)+λn(UE) and hence λn(UE)=λn(UE)<η.

L1L2L4F1
1.2

For kN put Sk:=E(((k+1),k+1]n(k,k]n); each Sk is Lebesgue measurable, being an intersection and difference of measurable sets, is bounded and therefore of finite measure, and kNSk=E because the cubes (k,k]n increase to Rn.

L2L5L6
2.1

By step 1.1 applied to each Sk with η:=ε2k2, the family of open VSk with λn(VSk)<ε2k2 is nonempty for every k, so countable choice selects such a Uk for every k; the union U:=kUk is open and contains E.

step 1.1step 1.2F2F6
3.1

Since SkE, one has UEk(UkSk), so countable subadditivity gives λn(UE)k=0ε2k2, whose partial sums are ε22k<N2kε/2, so the sum is at most ε/2<ε.

step 1.2step 2.1L3F3F4F5

Depends on

Used by

Dependency tree · two levels

84 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