Alphabeta Math
TheoremStatement: 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.

Assuming countable choice, the Lebesgue measure of a measurable set is the supremum of the measures of its compact subsets

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). For every Lebesgue measurable ERn,

λn(E)  =  sup{λn(K)  :  KE and K is a compact subset of Rn}

(Open cover, subcover, compact metric space, and compact subset of a metric space), the supremum being over a nonempty family since is compact.

The choice hypothesis is inherited, not decorative. The proof runs through Assuming countable choice, four equivalent descriptions of a Lebesgue measurable subset of Rn, which is itself stated under countable choice, so the conclusion carries the same hypothesis and says so.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, and a Lebesgue measurable set ERn.

[L1]

Assuming countable choice, E is Lebesgue measurable if and only if for every real ε>0 there is a closed FE with λn(EF)<ε (Assuming countable choice, four equivalent descriptions of a Lebesgue measurable subset of Rn, condition 3).

[L2]

Assuming countable choice, L(Rn) is a sigma-algebra and λ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, every Borel subset of Rn is Lebesgue measurable (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable).

[L4]

Every bounded Lebesgue measurable subset of Rn has finite measure, and every compact subset of Rn is Lebesgue measurable of finite measure (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure).

[L5]

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).

[F2]

Closed balls are closed, for every xX and every r>0 (Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, claim 4), where Bˉ(x,r):={yX:d(x,y)r} (Open ball, closed ball and sphere in a metric space).

[F3]

Let (En)nN be an increasing sequence of measurable sets for a measure μ; then μ(nNEn)=supnNμ(En) (Continuity from below for measures).

[F4]

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).

[F5]

If A,BA and AB, then μ(A)μ(B) (Measures are monotone).

[F6]

Every complete ordered field F is Archimedean: for every xF there is a natural number n1 with x<n1F (Every complete ordered field is Archimedean).

[F7]

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

Every compact KE is Lebesgue measurable of finite measure and satisfies λn(K)λn(E) by monotonicity, and the empty set is compact, so the displayed family is nonempty and its supremum is at most λn(E).

L2L4F1F5
1.2

Suppose λn(E)<+ and let t<λn(E) be real. Applying the closed-deficit condition with ε:=λn(E)t gives a closed FE with λn(EF)<λn(E)t; F is Borel, hence measurable, of finite measure, and the difference formula gives λn(E)=λn(F)+λn(EF), so λn(F)>t.

L1L2L3L4F4F7
2.1

The sets FBˉ(0,k) for k1 are closed and bounded, hence compact subsets of E, they increase with k, and their union is F because the Archimedean property puts every point of F inside some Bˉ(0,k); continuity from below therefore gives λn(F)=supkλn(FBˉ(0,k)), so some k has λn(FBˉ(0,k))>t.

step 1.2L2L3F1F2F3F6
3.1

Suppose instead λn(E)=+ and let t be any real. The sets E(k,k]n are measurable, bounded and hence of finite measure, they increase with k and their union is E, so continuity from below gives supkλn(E(k,k]n)=+ and some k has λn(E(k,k]n)>t; steps 1.2 and 2.1 applied to that set of finite measure produce a compact subset of it, hence of E, of measure above t.

step 1.2step 2.1L2L4L5F3F6
4.1

In both cases every real below λn(E) is below the measure of some compact subset of E, so the supremum is at least λn(E), and step 1.1 gives the reverse inequality.

step 1.1step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

90 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