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.

Countable covers by closed boxes, by open boxes and by closed cubes all compute Lebesgue outer measure

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). For u,vRn with uivi for every i<n write [u,v] for the closed rectangle and V(u,v):={xRn:ui<xi<vi for every i<n} for the open box, both of size i<n(viui) (Axis-parallel rectangles in Rm and their volume); a closed cube of side 0 is a set i<n[ci,ci+], of size n. For ERn put

λcl(E):=inf{k=0vol[uk,vk]  :  Ek[uk,vk]},λop(E):=inf{k=0i<n(vikuik)  :  EkV(uk,vk)},

λcb(E):=inf{k=0kn  :  Eki<n[cik,cik+k]},

infima over countable covers of the stated kind, which exist because Rn is covered by the rectangles [k1,k1], by the open boxes V(k1,k1) and by the cubes i[k,k+2k]. Then

λcl(E)  =  λop(E)  =  λcb(E)  =  λn(E).

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, a subset ERn, and the three infima displayed in the Statement.

[L1]

λn(E):=inf{k=0μ0(Ak):AkEn for every k and EkAk} (Lebesgue outer measure on Rn, Elementary sets: the finite unions of half-open boxes in Rn).

[L2]

B(a,b):={xRn:ai<xibi  for every i<n}; a box is nonempty exactly when ai<bi for every i<n; vol():=0; and for a nonempty box with real parameters vol(B):=i<n(biai) (Half-open boxes in Rn and their volume).

[L3]

Assuming countable choice, λn(A)=μ0(A) for every elementary set A, and λn is an outer measure (Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume), μ0 being the elementary volume of The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition.

[L4]

Assuming countable choice, λn(E)=inf{λn(U):U open and EU} (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).

[L5]

Every open URn is the union of an at most countable family of pairwise disjoint dyadic cubes (Every open subset of Rn is the union of a countable pairwise disjoint family of dyadic cubes), each of the form Qk,m={x:mi2k<xi(mi+1)2k (i<n)} (Dyadic cubes of generation k in Rn, Integer powers am).

[L7]

Assuming countable choice, λn is a measure on the sigma-algebra L(Rn) with λn(B)=vol(B) for every half-open box (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume), so it is countably additive on pairwise disjoint measurable sequences (Measures on sigma-algebras).

[F1]

[a,b]:={xRm:ajxjbj (j<m)} and vol[a,b]:=j<m(bjaj) (Axis-parallel rectangles in Rm and their volume).

[F2]

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

[F3]

Every nonempty subset SN has a least element (The well-ordering principle).

[F4]

For every real ε>0 there is a natural number k1 with 1/k<ε (For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε).

[F5]

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

[F6]

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

[F7]

An at most countable family may always be presented as a sequence (Finite, countably infinite, countable, uncountable).

Proof

technique · direct
1.1

For a natural number r, reals 0piqi (i<r) and a real V1 with qiV for every i<r, one has i<rqii<rpiVri<r(qipi): at r=0 both products are 1 and both sides are 0, and the passage from r to r+1 uses i<r+1qii<r+1pi=qr(i<rqii<rpi)+(qrpr)i<rpi with i<rpiVr, so the estimate follows by induction on r.

F1F6
1.2

For real uivi one has V(u,v)B(u,v)[u,v] and volB(u,v)=vol[u,v]=i<n(viui), the box being empty and the product zero together when some ui=vi; moreover [u,v]V(uθ1,v+θ1) for every real θ>0, whose size is i<n(viui+2θ), and a closed cube of side is the closed rectangle [c,c+1] of size n.

L2F1F6
2.1

λcl(E)λcb(E), because every closed-cube cover is a closed-rectangle cover with the same terms.

step 1.2F1
2.2

λn(E)λop(E), because an open-box cover EkV(uk,vk) gives the elementary cover EkB(uk,vk) whose covering cost kμ0(B(uk,vk)) has exactly the same terms.

step 1.2L1L2L3
2.3

λop(E)λcl(E): given a closed-rectangle cover and a real ε>0, let mk be the least natural number with i<n(vikuik+2/(mk+1))vol[uk,vk]+ε2k, which exists by step 1.1 with V a real at least 1 bounding all vikuik+2 and by the Archimedean property; the open boxes V(ukθk1,vk+θk1) with θk:=1/(mk+1) cover E, and each partial sum of their sizes is at most k<Nvol[uk,vk]+εk<N2kk=0vol[uk,vk]+2ε, so λop(E) is at most that closed cover's total plus 2ε, for every positive real ε.

step 1.1step 1.2F2F3F4F5F6
2.4

λcb(E)λn(E): the inequality is trivial when λn(E)=+, and otherwise, given a real ε>0, outer regularity supplies an open UE with λn(U)λn(E)+ε, the dyadic decomposition writes U as a disjoint union of an at most countable family of dyadic cubes, presented as a sequence (Qkj,mj)j and padded with copies of if it is finite, countable additivity gives jλn(Qkj,mj)=λn(U), and each Qkj,mj is contained in the closed cube i<n[mij2kj,mij2kj+2kj] of side 2kj and size 2kjn=λn(Qkj,mj), a padding term contributing the degenerate cube of side 0.

step 1.2L4L5L6L7F1F7
3.1

The four quantities therefore satisfy λcl(E)λcb(E)λn(E)λop(E)λcl(E), so all four are equal.

step 2.1step 2.2step 2.3step 2.4

Depends on

Used by

Dependency tree · two levels

97 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