Alphabeta Math
Session-authored (Fable 5 assisted)
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.

47 results · all verified · 27 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 20 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Lebesgue Measure on Euclidean Space

1 · Prerequisites

2 · Summary

Assuming countable choice, the outer-measure and Caratheodory-extension machinery from the prerequisite page, together with the Borel sigma-algebra, Heine-Borel compactness in Rn, the published covering notions of nullity, Jordan content, and the determinant and elementary-matrix material, gives the framework for Lebesgue measure on Euclidean space. Those dependencies are used here to pass from countable covers to measurable sets, to compare Lebesgue nullity with the earlier covering vocabulary, and to move from box computations to structural results such as regularity and invariance.

The page begins with half-open boxes and elementary sets, proves that elementary volume is a sigma-finite premeasure, and then defines Lebesgue outer measure, the Lebesgue sigma-algebra and Lebesgue measure. It next computes the measure of boxes, proves sigma-finiteness and the basic nullity results, identifies outer and inner regularity through the Littlewood characterisations and the Borel-completion description, and then turns to invariance: translation, dilation, orthogonal maps, the linear determinant formula, and finally Steinhaus with its subgroup corollary.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Half-open boxes in Rn and their volume

Definition

Fix nN with n1 and let Rn be the set of functions nR, writing xi:=x(i) for i<n (Rn as the set of functions nR, and d1, d2, d are metrics on it). A parameter is a function nR, where R=R{,+} carries the total order of The extended real line R=R{,+}, its order, and the arithmetic that is left undefined. For a pair (a,b) of parameters set

B(a,b)  :=  {xRn  :  ai<xibi  for every i<n},

both comparisons taken in R. A half-open box is a set of this form. For a single uR write u for the constant parameter with value u, and abbreviate (u,v]n:=B(u,v); thus Rn=(,+]n and (0,1]n is the unit cube. At n=1, and for real a0<b0, the box B(a,b) is the half-open interval (a0,b0] of Intervals of R: the nine order-convex forms, nondegeneracy, and length.

A box is nonempty exactly when ai<bi for every i<n. If some aibi then no real xi satisfies both ai<xi and xibi, by transitivity of the order, so B(a,b)=. Conversely suppose ai<bi for every i. Then in each coordinate some real t satisfies ai<tbi: if biR take t:=bi, which is >ai; if bi=+ then ai+, so take t:=ai+1 when ai is real and t:=0 when ai=. Assembling one such t in each coordinate gives a point of B(a,b); the assembly is a definition by cases on finitely many coordinates and selects nothing.

The parameters of a nonempty box are determined by the set. Let B:=B(a,b), fix i<n and put Si:={xi:xB}. Then Si={tR:ai<tbi}: the inclusion is the defining condition, and for take any yB and replace its i-th coordinate by t, which leaves every other defining inequality untouched. Now bi=+ exactly when Si has no upper bound in R, and otherwise bi is the greatest element of Si; likewise ai= exactly when Si has no lower bound in R, and otherwise ai is the greatest lower bound of Si in R. So B determines ai and bi for every i, and hence determines (a,b).

Volume. For a half-open box B define vol(B)[0,+]R by

  • vol():=0;
  • if B, with its unique parameter pair (a,b), then vol(B):=+ when ai= or bi=+ for some i<n, and vol(B):=i<n(biai) when every ai and every bi is real.

The product is the finite product of Finite sums and finite products, by recursion. In the last clause every factor biai is a strictly positive real, since ai<bi in R, so the product is a strictly positive real (Laws of finite sums and finite products, claim 6) and in particular no factor is 0 and no product of the form 0(±) is ever formed. That is what the case split buys: a box with a degenerate side is empty, not a box of volume 0 with an infinite side. So vol is a total function on the half-open boxes with values in [0,+], and vol(Rn)=+, vol((0,1]n)=1.

Agreement with the published rectangle volume. For real parameters with ai<bi for every i<n, the closed rectangle [a,b] of Axis-parallel rectangles in Rm and their volume has vol[a,b]=j<n(bjaj), which is the value assigned above to B(a,b). The two notions of volume therefore agree wherever both are written, and no second notion of volume is introduced.

Remarks

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

Half-open boxes are closed under intersection, and the complement of a half-open box is a finite disjoint union of half-open boxes

Statement

Let n1 and let half-open boxes B(a,b)Rn be as in Half-open boxes in Rn and their volume.

  1. Intersection. For parameter pairs (a,b) and (a,b), B(a,b)B(a,b)  =  B(c,d),ci:=max{ai,ai},di:=min{bi,bi}(i<n), the extremes taken in the total order of R. Consequently the intersection of the members of a finite list of half-open boxes is a half-open box, the empty list giving Rn.
  2. Complement. For every parameter pair (a,b) there is a finite list of pairwise disjoint half-open boxes whose union is RnB(a,b). When B(a,b) the list may be taken to have 2n members, indexed by a coordinate i<n and a side.

Facts & Assumptions

Given: A natural number n1 and parameter pairs (a,b), (a,b), that is, pairs of functions nR.

[L1]

B(a,b):={xRn:ai<xibi  for every i<n}, and Rn=(,+]n (Half-open boxes in Rn and their volume).

[L2]

A box is nonempty exactly when ai<bi for every i<n (Half-open boxes in Rn and their volume).

[F1]

(R,) is a totally ordered set, and the inclusion of R preserves and reflects the order (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

Proof

technique · direct
1.1

For claim 1, a point xRn lies in B(a,b)B(a,b) exactly when ai<xibi and ai<xibi for every i<n; the order being total, each two-element set {ai,ai} has a greatest member ci and each {bi,bi} a least member di, and for a real xi the conjunction ai<xi and ai<xi says exactly ci<xi while xibi and xibi says exactly xidi, so the intersection is B(c,d); iterating along a list of length m gives the finite case by induction on m, with the empty list giving Rn=B(,+).

L1F1algebra
1.2

For claim 2 in the degenerate case, if B(a,b)= then RnB(a,b)=Rn=(,+]n, a list with the single member Rn, whose members are vacuously pairwise disjoint.

L1
1.3

For claim 2 in the remaining case, assume B(a,b), so ai<bi for every i<n, and for i<n define two parameter pairs (ai,0,bi,0) and (ai,1,bi,1) by setting, in coordinates j<i, aji,ϵ:=aj and bji,ϵ:=bj; in coordinate i, (aii,0,bii,0):=(,ai) and (aii,1,bii,1):=(bi,+); and in coordinates j>i, aji,ϵ:= and bji,ϵ:=+.

L1L2construct
2.1

Still for claim 2, every xB(a,b) lies in one of these 2n boxes: the set of i<n with ¬(ai<xibi) is a nonempty subset of n, so it has a least member i; then aj<xjbj for every j<i, and by totality either xiai, putting x in B(ai,0,bi,0), or xi>bi, putting x in B(ai,1,bi,1), the coordinates j>i being unconstrained in both.

step 1.3F1L1
2.2

Still for claim 2, each of the 2n boxes is disjoint from B(a,b), since its points satisfy xiai or xi>bi; and two of them are disjoint from one another, because for i<i a point of a box with index i fails ai<xibi while a point of a box with index i satisfies it, and for a common i a point of both would satisfy bi<xiai, contradicting ai<bi.

step 1.3L1L2
3.1

Claim 1 is step 1.1, and claim 2 is step 1.2 in the empty case and steps 2.1 and 2.2 in the nonempty case, the union of the 2n boxes being exactly RnB(a,b).

step 1.1step 1.2step 2.1step 2.2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Elementary sets: the finite unions of half-open boxes in Rn

Definition

Fix n1. A subset ERn is an elementary set when there are a natural number m and a list B0,,Bm1 of half-open boxes (Half-open boxes in Rn and their volume), that is a function jBj on {jN:j<m} whose values are half-open boxes, with

E  =  j<mBj.

Write En for the family of all elementary subsets of Rn.

The list is part of the data of the presentation and not of the set: one elementary set has many presentations, and nothing below reads a presentation off a set. At m=0 the union is empty, so En; at m=1 every half-open box is elementary, Rn=(,+]n included. The boxes of a presentation are not required to be disjoint or nonempty.

Remarks

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

The elementary sets form an algebra of subsets of Rn containing every half-open box

Statement

Let n1. The family En of elementary subsets of Rn (Elementary sets: the finite unions of half-open boxes in Rn) is an algebra of subsets of Rn (Algebras of subsets): it contains , it is closed under complement in Rn, and it is closed under union of two members. It contains every half-open box, and it is closed under intersection of two members and under difference.

Facts & Assumptions

Given: A natural number n1 and the family En of finite unions of half-open boxes in Rn.

[L1]

A subset ERn is an elementary set when there are a natural number m and a list B0,,Bm1 of half-open boxes with E=j<mBj; at m=0 the union is empty, so En; at m=1 every half-open box is elementary, Rn=(,+]n included (Elementary sets: the finite unions of half-open boxes in Rn).

[L2]

The intersection of the members of a finite list of half-open boxes is a half-open box, the empty list giving Rn (Half-open boxes are closed under intersection, and the complement of a half-open box is a finite disjoint union of half-open boxes).

[L3]

For every parameter pair (a,b) there is a finite list of pairwise disjoint half-open boxes whose union is RnB(a,b) (Half-open boxes are closed under intersection, and the complement of a half-open box is a finite disjoint union of half-open boxes).

[F1]

An algebra of subsets of X is a family AP(X) such that A; if AA, then XAA; and if A,BA, then ABA (Algebras of subsets).

[F2]

B(a,b):={xRn:ai<xibi  for every i<n} (Half-open boxes in Rn and their volume).

Proof

technique · direct
1.1

The empty list of boxes has union and the one-member list B has union B, so En, every half-open box lies in En, and RnEn.

L1
1.2

If E=j<mBj and F=k<pCk are presentations, then concatenating the two lists into a list of length m+p presents EF, so En is closed under the union of two members.

L1
1.3

With the same presentations, EF=j<mk<p(BjCk), each BjCk is a half-open box, and the mp boxes can be listed by a bijection of {qN:q<mp} with the pairs (j,k), so EFEn.

L1L2F2algebra
1.4

The complement of a single half-open box is a finite union of half-open boxes, hence lies in En.

L3L1
2.1

For a presentation E=j<mBj one has RnE=j<m(RnBj); putting F0:=Rn and Fq+1:=Fq(RnBq), an induction on qm using step 1.1 for F0 and steps 1.3 and 1.4 for the successor case gives FqEn for every qm, and Fm=RnE.

step 1.1step 1.3step 1.4algebra
3.1

Steps 1.1, 1.2 and 2.1 are the three clauses of [F1], so En is an algebra of subsets of Rn; it contains every half-open box by step 1.1, is closed under binary intersection by step 1.3, and is closed under difference because EF=E(RnF).

step 1.1step 1.2step 1.3step 2.1F1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Every elementary set is a finite disjoint union of half-open boxes, and any finitely many boxes admit a common grid refinement

Statement

Let n1 and let B0,,Bm1 be a finite list of half-open boxes in Rn (Half-open boxes in Rn and their volume), where Bj=B(aj,bj). For i<n put

Ci  :=  {,+}{aij:j<m}{bij:j<m}    R,

a finite set with at least two members, and let ci,0<ci,1<<ci,Ni be its increasing enumeration, so that ci,0=, ci,Ni=+ and Ni1. The cells of the grid generated by the list are the half-open boxes

Qk  :=  B((ci,ki)i<n, (ci,ki+1)i<n),ki<Ni  (i<n).

Then:

  1. the cells are pairwise disjoint and their union is Rn;
  2. for every j<m, a cell that meets Bj is contained in Bj, and Bj is the union of the cells contained in it;
  3. consequently every elementary set (Elementary sets: the finite unions of half-open boxes in Rn) is the union of a finite list of pairwise disjoint half-open boxes.

Facts & Assumptions

Given: A natural number n1, a finite list B0,,Bm1 of half-open boxes with parameter pairs (aj,bj), and the sets Ci and cells Qk displayed in the Statement.

[L1]

B(a,b):={xRn:ai<xibi  for every i<n} (Half-open boxes in Rn and their volume).

[L2]

A subset ERn is an elementary set when there are a natural number m and a list B0,,Bm1 of half-open boxes with E=j<mBj (Elementary sets: the finite unions of half-open boxes in Rn).

[F1]

(R,) is a totally ordered set, and the inclusion of R preserves and reflects the order; is the least and + the greatest element of R, and <x<+ for every xR (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

Proof

technique · direct
1.1

Each Ci is a finite subset of the totally ordered set R containing the two distinct elements and +, so it has a unique strictly increasing enumeration ci,0<<ci,Ni with Ni1, and its least and greatest members are ci,0= and ci,Ni=+.

F1
1.2

For claim 1, distinct multi-indices kk differ at some i, say ki<ki, whence ki+1ki and ci,ki+1ci,ki; a common point x would satisfy both xici,ki+1 and ci,ki<xi, which is impossible, so the cells are pairwise disjoint.

L1F1
1.3

For claim 1 again, given xRn and i<n, the set {rNi:ci,r<xi} contains 0 because ci,0=<xi and omits Ni because ci,Ni=+ is not below the real xi, so it has a greatest member ki with ki<Ni, and then ci,ki<xici,ki+1; the multi-index k so obtained puts x in Qk.

L1F1
1.4

For claim 2, suppose xQkBj and fix i<n. From aij<xici,ki+1 and aijCi it follows that aij<ci,ki+1, and the members of Ci strictly below ci,ki+1 are exactly ci,0,,ci,ki, so aijci,ki; from ci,ki<xibij and bijCi it follows that ci,ki<bij, and the members of Ci strictly above ci,ki are exactly ci,ki+1,,ci,Ni, so ci,ki+1bij.

L1F1
2.1

For claim 2, step 1.4 gives aijci,ki and ci,ki+1bij in every coordinate, hence QkBj; and every point of Bj lies in some cell by step 1.3, that cell then meeting Bj and so contained in it, so Bj is exactly the union of the cells contained in it.

step 1.3step 1.4L1
3.1

For claim 3, let E=j<mBj be elementary; by step 2.1 each Bj is the union of the cells contained in it, so E is the union of those cells that are contained in at least one Bj, and by step 1.2 these finitely many cells are pairwise disjoint; listing them proves claim 3, while claims 1 and 2 are steps 1.2, 1.3 and 2.1.

step 1.2step 1.3step 2.1L2
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The volume of a half-open box is the sum of the volumes of the cells of any coordinate grid subdividing it

Statement

Let n1 and let B=B(a,b)Rn be a nonempty half-open box (Half-open boxes in Rn and their volume). Suppose that for each i<n a strictly increasing finite list

ai=ci,0<ci,1<<ci,Ni=bi,Ni1,

in R is given, and for a multi-index k with ki<Ni for every i<n put Qk:=B((ci,ki)i<n, (ci,ki+1)i<n). Then the cells Qk are nonempty half-open boxes, pairwise disjoint, with union B, and

vol(B)  =  k0<N0 kn1<Nn1vol(Qk),

where a sum over cells is the iterated recursive sum of Grid partitions of a rectangle in Rm, their cells, refinements and mesh, formed here in [0,+] by the recursion of Series in the nonnegative extended real line.

Facts & Assumptions

Given: A natural number n1, a nonempty box B=B(a,b), the lists ci,0<<ci,Ni and the cells Qk of the Statement, and the induction principle (The principle of mathematical induction). For pn and a multi-index k with ki<Ni for every i<p, let Dkp denote the half-open box whose i-th parameter pair is (ci,ki,ci,ki+1) for i<p and (ai,bi) for pi<n, so that D0 is B itself and Dkn=Qk; and let S(p) be the assertion that vol(B)=k0<N0kp1<Np1vol(Dkp), a sum over no index being read as its single term.

[L1]

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

[L2]

For a nonempty box with parameter pair (a,b), vol(B):=+ when ai= or bi=+ for some i<n, and vol(B):=i<n(biai) when every ai and every bi is real; and vol():=0 (Half-open boxes in Rn and their volume).

[F1]

For sequences of reals, k<nλak=λk<nak; if mn then k<nak=(k<mak)(k=mn1ak); k<n(ck+1ck)=cnc0; and k<n(akbk)=(k<nak)(k<nbk) (Laws of finite sums and finite products, claims 2, 3, 5 and 6).

[F2]

Finite sums and finite products of a sequence of reals are defined by the recursions Σ0=0, Σσ(n)=Σn+an and Π0=1, Πσ(n)=Πnan, written k<nak and k<nak (Finite sums and finite products, by recursion).

[F3]

For a,bR, a+b:=+ when a=+ and b, or b=+ and a (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

[F4]

The partial sums of a sequence in [0,+] are the unique sequence with s0=0 and sn+1=sn+an, and finite sums use the same recursion, k<nak=sn (Series in the nonnegative extended real line).

[F5]

A sum over cells means the iterated recursive sum i0<n0im1<nm1 of Finite sums and finite products, by recursion (Grid partitions of a rectangle in Rm, their cells, refinements and mesh).

Proof

technique · induction
1.1

Each cell is a nonempty box contained in B, since ai=ci,0ci,ki<ci,ki+1ci,Ni=bi for every i<n, so that (ci,ki,ci,ki+1](ai,bi] in every coordinate.

L1
1.2

The cells are pairwise disjoint with union B: distinct multi-indices differ at some i with, say, ki<ki, whence ci,ki+1ci,ki and no point can satisfy xici,ki+1 and ci,ki<xi at once; and for xB and i<n the set {rNi:ci,r<xi} contains 0 and omits Ni, so its greatest member ki satisfies ki<Ni and ci,ki<xici,ki+1.

L1
1.3

A finite sum in [0,+] equals + exactly when one of its terms does, and when every term is real it is the finite sum of those reals: the recursion sq+1=sq+uq produces + once a term is + and never leaves [0,+) otherwise.

F3F4
1.4

Let D=B(d,f) be a nonempty box all of whose parameters are real, let p<n, let dp=t0<<tN=fp be reals, and write D(r) for the box obtained from D by replacing its p-th parameter pair by (tr,tr+1); putting ui:=fidi for ip and up:=1, and Π:=i<nui, the product and splitting laws give vol(D)=Π(fpdp) and vol(D(r))=Π(tr+1tr), so scaling and telescoping give r<Nvol(D(r))=Πr<N(tr+1tr)=Π(tNt0)=vol(D).

L2F1F2algebra
1.5

At p=0 the iterated sum carries no summation index, so its value is its single term vol(D0)=vol(B) and S(0) holds.

F5base
1.6

Let p<n and assume S(p) as the induction hypothesis.

ih
2.1

Let D=B(d,f) be a nonempty box, let p<n, and let dp=t0<<tN=fp in R with the boxes D(r) as in step 1.4; if some parameter of D is infinite then vol(D)=+, and the sum r<Nvol(D(r)) is + as well, because an infinite parameter in a coordinate ip is shared by every nonempty D(r), while dp= makes vol(D(0))=+ and fp=+ makes vol(D(N1))=+.

step 1.3L2F3
3.1

Combining the two cases, for every nonempty box D, every p<n and every strictly increasing list dp=t0<<tN=fp in R one has vol(D)=r<Nvol(D(r)), since either all parameters of D are real, and then so are all the tr, or some parameter is infinite.

step 1.4step 2.1L2
4.1

Each box Dkp is nonempty, by the inequalities of step 1.1 applied in coordinates i<p and ai<bi in the others, and its p-th parameter pair is (ap,bp) with the list ap=cp,0<<cp,Np=bp available, so step 3.1 gives vol(Dkp)=kp<Npvol(Dkp+1); substituting this into the identity of step 1.6 termwise yields S(p+1).

step 1.1step 1.6step 3.1
5.1

By induction S(p) holds for every pn, and S(n) is the displayed identity because Dkn=Qk; together with steps 1.1 and 1.2 this is the Statement.

step 1.1step 1.2step 4.1discharge-induction: step 4.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition

Statement

Let n1 and let ARn be an elementary set (Elementary sets: the finite unions of half-open boxes in Rn). If

A  =  j<mBj  =  l<pCl

for finite lists of pairwise disjoint half-open boxes (Half-open boxes in Rn and their volume), then

j<mvol(Bj)  =  l<pvol(Cl)

in [0,+]. Consequently there is exactly one function μ0:En[0,+], the elementary volume, whose value at A is the sum of the volumes of the members of any presentation of A by a finite list of pairwise disjoint half-open boxes. It satisfies μ0()=0 and μ0(B)=vol(B) for every half-open box B.

Facts & Assumptions

Given: A natural number n1, an elementary set A, and two presentations A=j<mBj=l<pCl by finite lists of pairwise disjoint half-open boxes.

[L1]

Every elementary set has a presentation as a finite pairwise disjoint union of half-open boxes. Applied to the concatenated list B0,,Bm1,C0,,Cp1, the generated grid has pairwise disjoint cells whose union is Rn; for every member of the list, a cell that meets it is contained in it, and that member is the union of the cells contained in it (Every elementary set is a finite disjoint union of half-open boxes, and any finitely many boxes admit a common grid refinement).

[L2]

For a nonempty box B=B(a,b) and strictly increasing lists ai=ci,0<<ci,Ni=bi with Ni1, the cells Qk are nonempty pairwise disjoint boxes with union B and vol(B)=k0<N0kn1<Nn1vol(Qk) (The volume of a half-open box is the sum of the volumes of the cells of any coordinate grid subdividing it).

[L3]

vol():=0, and a box is nonempty exactly when ai<bi for every i<n (Half-open boxes in Rn and their volume).

[L4]

A subset ERn is an elementary set when there are a natural number m and a list B0,,Bm1 of half-open boxes with E=j<mBj (Elementary sets: the finite unions of half-open boxes in Rn).

[F1]

For sequences of reals, k<n(ak+bk)=k<nak+k<nbk, and if mn then k<nak=k<mak+k=mn1ak (Laws of finite sums and finite products, claims 1 and 3).

[F2]

Finite sums of a sequence of reals are defined by the recursion Σ0=0, Σσ(n)=Σn+an, written k<nak (Finite sums and finite products, by recursion).

Proof

technique · direct
1.1

Let (Qk) be the cells of the grid generated by the concatenated list, indexed by the multi-indices k with ki<Ni for i<n; they are nonempty, pairwise disjoint, cover Rn, and each of them is either contained in or disjoint from each Bj and each Cl.

L1L3
1.2

If one of the boxes in either decomposition has infinite volume, then both sums are + and there is nothing left to prove. Indeed, by [L3] a nonempty box has infinite volume exactly when some endpoint is infinite, and such a box is unbounded. Conversely, a finite union of boxes all of whose endpoints are real is bounded: for each such box B(a,b) every coordinate of every point of B lies between the real endpoints ai and bi, so choosing one real bound for each box and then taking the maximum over the finite list bounds the whole union. Therefore, if A contains an unbounded box from one decomposition, the other decomposition cannot consist entirely of finite-volume boxes, since that would make A bounded. So it remains only to treat the case in which every Bj and every Cl has finite volume; from now on all the volumes that appear are real numbers and the finite-sum laws of [F1] apply to them.

L3F1F2
2.1

For each j<m let wkj:=vol(Qk) when QkBj and wkj:=0 otherwise; then vol(Bj)=k0<N0kn1<Nn1wkj, because for Bj= no cell is contained in it and both sides are 0, while for Bj=B(aj,bj) nonempty the parameters aij and bij occur among the grid points, say aij=ci,αi and bij=ci,βi with αi<βi, the cells contained in Bj are exactly those with αiki<βi in every coordinate, the lists ci,αi<<ci,βi subdivide Bj so that [L2] applies, and widening each summation range from αiki<βi to ki<Ni only inserts zero terms.

step 1.1step 1.2L2L3F1
2.2

A cell is contained in A exactly when it is contained in exactly one Bj, since a cell contained in A meets A, hence meets some Bj and is contained in it, while a cell contained in two of the pairwise disjoint boxes would be empty; so, writing vk:=vol(Qk) when QkA and vk:=0 otherwise, one has j<mwkj=vk for every k.

step 1.1L3L4
3.1

Summing the identities of step 2.1 over j<m and regrouping the resulting finite real sums by repeated use of the additivity law in [F1] gives j<mvol(Bj)=k0<N0kn1<Nn1j<mwkj. Since step 2.2 identifies the inner sum with vk, this is k0<N0kn1<Nn1vk.

step 1.2step 2.1step 2.2F1
4.1

The right-hand side of step 3.1 is built from A and the grid alone, and the same computation applied to the list C0,,Cp1, whose parameters also generate the same grid, gives l<pvol(Cl) for the same value; hence the two sums agree, and since every elementary set has at least one presentation by a finite list of pairwise disjoint half-open boxes, the assignment μ0 is a well-defined function on En with μ0()=0 and μ0(B)=vol(B) for a single box.

step 3.1L1L3L4
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Elementary volume is finitely additive, monotone and finitely subadditive on the elementary algebra

Statement

Let n1, let En be the elementary subsets of Rn (Elementary sets: the finite unions of half-open boxes in Rn) and let μ0 be elementary volume (The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition). Let E,FEn and let E0,,Eq1 be a finite list in En. Then:

  1. Finite additivity. If the Ej are pairwise disjoint, then μ0(j<qEj)=j<qμ0(Ej).
  2. Monotonicity. If EF, then μ0(E)μ0(F).
  3. Finite subadditivity. μ0(j<qEj)j<qμ0(Ej).

All three hold with the value + allowed, the sums being the finite sums of Series in the nonnegative extended real line.

Facts & Assumptions

Given: A natural number n1, the algebra En, elementary volume μ0, and elementary sets E, F and E0,,Eq1.

[L1]

For every n1, there is exactly one function μ0:En[0,+] whose value at A is the sum of the volumes of the members of any presentation of A by a finite list of pairwise disjoint half-open boxes (The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition).

[L2]

Every elementary set is the union of a finite list of pairwise disjoint half-open boxes (Every elementary set is a finite disjoint union of half-open boxes, and any finitely many boxes admit a common grid refinement).

[L3]

En is an algebra of subsets of Rn, it contains every half-open box, and it is closed under intersection of two members and under difference (The elementary sets form an algebra of subsets of Rn containing every half-open box).

[L4]

A subset ERn is an elementary set when there are a natural number m and a list B0,,Bm1 of half-open boxes with E=j<mBj (Elementary sets: the finite unions of half-open boxes in Rn).

[F1]

For sequences of reals, k<n(ak+bk)=k<nak+k<nbk; if mn then k<nak=k<mak+k=mn1ak; and if akbk whenever 0k<n then k<nakk<nbk (Laws of finite sums and finite products, claims 1, 3 and 4).

[F2]

Finite sums of a sequence of reals are defined by the recursion Σ0=0, Σσ(n)=Σn+an (Finite sums and finite products, by recursion).

[F3]

The partial sums of a sequence in [0,+] are the unique sequence with s0=0 and sn+1=sn+an, and finite sums use the same recursion, k<nak=sn (Series in the nonnegative extended real line).

[F4]

For a,bR, a+b:=+ when a=+ and b, or b=+ and a (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

Proof

technique · direct
1.1

A finite sum in [0,+] equals + exactly when one of its terms does, and otherwise is the finite sum of reals; hence such sums split over a concatenation of two lists, are monotone termwise, and satisfy xx+y for x,y[0,+], since with all terms real these are the laws for finite sums of reals and otherwise both sides are +.

F1F2F3F4
2.1

For claim 1, choose for each j<q a presentation of Ej by a finite list of pairwise disjoint half-open boxes, finitely many instantiations of an existential statement; the concatenated list presents j<qEj and its members are pairwise disjoint, boxes from different Ej being disjoint because the Ej are, so splitting the concatenated sum over the q blocks gives μ0(j<qEj)=j<qμ0(Ej).

step 1.1L1L2L4
3.1

For claim 2, F=E(FE) is a disjoint union of two elementary sets, so claim 1 gives μ0(F)=μ0(E)+μ0(FE)μ0(E).

step 1.1step 2.1L3
4.1

For claim 3, put Dj:=Ejl<jEl; each Dj is elementary, the Dj are pairwise disjoint with j<qDj=j<qEj, and DjEj, so claim 1 and then claim 2 termwise give μ0(j<qEj)=j<qμ0(Dj)j<qμ0(Ej), which with steps 2.1 and 3.1 is the Statement.

step 1.1step 2.1step 3.1L3
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

Every elementary set is squeezed in volume between a compact subset and an elementary set whose interior contains it

Statement

Let n1, let μ0 be elementary volume on the elementary sets En (The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition, Elementary sets: the finite unions of half-open boxes in Rn), and for AEn and a real δ>0 put

A+δ  :=  {A+s  :  sRn with siδ for every i<n},

the translates being those of Translation of a subset of Rn. Then:

  1. A+δ is an elementary set, it is determined by A and δ alone, it contains A, and every point of A is an interior point of A+δ in (Rn,d2) (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, Rn as the set of functions nR, and d1, d2, d are metrics on it).
  2. For every real ε>0 there is mN with μ0(A+1/(m+1))μ0(A)+ε.
  3. If μ0(A)<+, then for every real ε>0 there are an elementary set A and a compact set KRn (Open cover, subcover, compact metric space, and compact subset of a metric space) with AKA and μ0(A)μ0(A)+ε.

Nothing in claim 1 or claim 2 depends on a presentation of A, so the assignment δA+δ and the least m satisfying claim 2 are both functions of the data and involve no selection.

Facts & Assumptions

Given: A natural number n1, an elementary set ARn, and a real δ>0. A presentation of A is written A=j<qBj with Bj=B(aj,bj) pairwise disjoint half-open boxes, and ij:=bijaij when these are real.

[L1]

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 vol(B):=+ when ai= or bi=+ for some i<n, and vol(B):=i<n(biai) when every ai and every bi is real (Half-open boxes in Rn and their volume).

[L2]

Every elementary set is the union of a finite list of pairwise disjoint half-open boxes, and a subset ERn is an elementary set when there are a natural number m and a list B0,,Bm1 of half-open boxes with E=j<mBj (Every elementary set is a finite disjoint union of half-open boxes, and any finitely many boxes admit a common grid refinement, Elementary sets: the finite unions of half-open boxes in Rn).

[L3]

For every n1, there is exactly one function μ0:En[0,+] whose value at A is the sum of the volumes of the members of any presentation of A by a finite list of pairwise disjoint half-open boxes (The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition).

[L4]

Elementary volume is finitely additive on pairwise disjoint elementary sets, monotone, and finitely subadditive (Elementary volume is finitely additive, monotone and finitely subadditive on the elementary algebra).

[F1]

The translate of ERn by a is E+a:={x+a:xE} (Translation of a subset of Rn).

[F2]

d2(x,y):= k<n(xkyk)2  and d(x,y):=max{xkyk:k<n} are metrics on Rn for n1 (Rn as the set of functions nR, and d1, d2, d are metrics on it).

[F4]

x is an interior point of A if B(x,r)A for some r, where B(x,r):={yX:d(x,y)<r}, and a subset U is open in (X,d) if every xU has such a ball inside U (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, Open ball, closed ball and sphere in a metric space, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).

[F5]

For reals akbk (k<n) the box Q={xRn:akxkbk for every k<n} is a compact subset of (Rn,d2), and a subset KRn is compact if and only if K is closed in Rn and bounded (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, claims 1 and 2; Axis-parallel rectangles in Rm and their volume).

[F6]

A compact subset of a metric space is closed and bounded (A compact subset of a metric space is closed and bounded).

[F7]

If n1 and U0,,Un1 are open, then U0Un1 is open (Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, claim 3).

[F8]

A is bounded if A= or there are x0X and a real r>0 with AB(x0,r) (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).

[F9]

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

[F10]

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

[F11]

Finite sums and finite products of a sequence of reals are defined by the recursions Σ0=0, Σσ(n)=Σn+an and Π0=1, Πσ(n)=Πnan (Finite sums and finite products, by recursion).

[F12]

For a,bR, a+b:=+ when a=+ and b, or b=+ and a; and a+b:= when a= and b+, or b= and a+ (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

Proof

technique · direct
1.1

For a natural number r, reals 0uivi (i<r) and a real V1 with viV for every i<r, one has i<rvii<ruiVri<r(viui): at r=0 both products are the empty product 1 and both sides are 0, and passing from r to r+1 uses i<r+1vii<r+1ui=vr(i<rvii<rui)+(vrur)i<rui together with i<ruiVr and vrV, so the estimate follows by induction on r.

F10F11algebra
1.2

For a box B(a,b) and sRn one has B(a,b)+s=B(a+s,b+s), where a+s is the parameter iai+si, and the two boxes have the same volume; consequently, for a real δ>0, B(a,b)+δ=B(aδ1,b+δ1) when B(a,b) and +δ=, and A+δ=j<qBj+δ for any presentation of A, so A+δ is elementary while its definition mentions no presentation.

L1L2F1F12
1.3

For x,yRn and i<n one has yixid(x,y)d2(x,y).

F2F3
1.4

If μ0(A)<+ then every nonempty box of a disjoint presentation of A has all parameters real, since an infinite parameter would make its volume, and hence the sum, equal to +. Put M:=1+j<qBji<n(aij+bij), and M:=1 when every box is empty. Then M is a real number and every endpoint of every nonempty box has modulus at most M. Every point of a nonempty box therefore has every coordinate bounded by M, hence has Euclidean norm at most nM; thus every box lies in the ball about the origin of radius 1+nM. Therefore A is bounded and so is every subset of A.

L1L2L3F2F8F10
2.1

For claim 1, taking s=0 gives AA+δ; and if xA and d2(x,y)<δ then s:=yx satisfies sid2(x,y)<δ for every i<n by step 1.3, so y=x+sA+sA+δ, whence the ball B(x,δ) of (Rn,d2) lies in A+δ and x is an interior point of it.

step 1.2step 1.3F1F4
2.2

For claim 2, if μ0(A)=+ the inequality holds with m=0; otherwise fix a disjoint presentation, let V1 be a real with ij+2V for every nonempty Bj and every i<n, and let 0<δ1: finite subadditivity and step 1.2 give μ0(A+δ)j<qvol(Bj+δ), an empty Bj contributing 0 and a nonempty one contributing i<n(ij+2δ), so step 1.1 applied with vi=ij+2δ and ui=ij bounds each term by vol(Bj)+2nVnδ and hence μ0(A+δ)μ0(A)+2nqVnδ.

step 1.1step 1.2L1L3L4F10
3.1

For claim 3, assume μ0(A)<+, fix a disjoint presentation with all parameters of the nonempty Bj real by step 1.4, and define ij=bijaij for nonempty Bj and ij=0 for empty Bj. Let V be as in step 2.2, let 0<δ1, and put Bjδ:=B(aj+δ1,bjδ1) for nonempty Bj and Bjδ:= otherwise, A:=j<qBjδ and K:={[aj+δ1,bjδ1]:j<q and Bj and aij+δbijδ for every i<n}: then AKA, each listed closed rectangle is compact and hence closed, a finite union of closed sets is closed by complementation, K is bounded because KA, so K is compact; and vol(Bjδ)=i<nmax{ij2δ,0} in both the empty and the nonempty case, so step 1.1 applied with vi=ij and ui=max{ij2δ,0}, whose difference is at most 2δ, gives μ0(A)μ0(A)+2nqVnδ.

step 1.1step 1.4L1L3L4F5F6F7F8F10
4.1

Given a real ε>0, apply [F9] to the positive real ε/(2nqVn+1) to obtain k1 with 1/k<ε/(2nqVn+1), and put m:=k1, so that δ:=1/(m+1)=1/k satisfies 0<δ1 and 2nqVnδε; steps 2.2 and 3.1 then give claims 2 and 3, and step 2.1 gives claim 1.

step 2.1step 2.2step 3.1F9
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Elementary volume is a sigma-finite premeasure on the algebra of elementary sets

Statement

Let n1, let En be the algebra of elementary subsets of Rn (The elementary sets form an algebra of subsets of Rn containing every half-open box) and let μ0 be elementary volume (The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition). Then μ0 is a sigma-finite premeasure on En (Premeasures on algebras of sets): μ0()=0; whenever (Ak)kN is a pairwise disjoint sequence in En whose union A again lies in En,

μ0(A)  =  k=0μ0(Ak);

and Rn=kN(k,k]n with μ0((k,k]n)<+ for every k.

No choice principle is used. The one place where a textbook proof selects countably many objects is the enlargement of each Ak, and here the enlarged set is the canonical Ak+1/(m+1) of Every elementary set is squeezed in volume between a compact subset and an elementary set whose interior contains it with m the least natural number that works, which is a definition rather than a selection. The compact inner set and the finite subcover are each a single instantiation of an existential statement.

Facts & Assumptions

Given: A natural number n1, the algebra En with elementary volume μ0, and a pairwise disjoint sequence (Ak)kN in En whose union A lies in En.

[L1]

En is an algebra of subsets of Rn, it contains every half-open box, and it is closed under intersection of two members and under difference (The elementary sets form an algebra of subsets of Rn containing every half-open box).

[L2]

For every n1, there is exactly one function μ0:En[0,+] whose value at A is the sum of the volumes of the members of any presentation of A by a finite list of pairwise disjoint half-open boxes; it satisfies μ0()=0 and μ0(B)=vol(B) for every half-open box B (The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition).

[L3]

Elementary volume is finitely additive on pairwise disjoint elementary sets, monotone, and finitely subadditive (Elementary volume is finitely additive, monotone and finitely subadditive on the elementary algebra).

[L4]

A+δ is an elementary set, it is determined by A and δ alone, it contains A, and every point of A is an interior point of A+δ in (Rn,d2) (Every elementary set is squeezed in volume between a compact subset and an elementary set whose interior contains it, claim 1).

[L5]

For every real ε>0 there is mN with μ0(A+1/(m+1))μ0(A)+ε (Every elementary set is squeezed in volume between a compact subset and an elementary set whose interior contains it, claim 2).

[L6]

If μ0(A)<+, then for every real ε>0 there are an elementary set A and a compact set KRn with AKA and μ0(A)μ0(A)+ε (Every elementary set is squeezed in volume between a compact subset and an elementary set whose interior contains it, claim 3).

[L7]

For a nonempty box vol(B):=+ when ai= or bi=+ for some i<n, and vol(B):=i<n(biai) when every ai and every bi is real; B(a,b):={xRn:ai<xibi  for every i<n}; and (u,v]n:=B(u,v) (Half-open boxes in Rn and their volume).

[L8]

A subset ERn is an elementary set when there are a natural number m and a list B0,,Bm1 of half-open boxes with E=j<mBj (Elementary sets: the finite unions of half-open boxes in Rn).

[F1]

A premeasure on an algebra A0 vanishes at the empty set and is countably additive whenever a disjoint sequence in A0 has its union in A0; it is sigma-finite if there is a sequence (Pn) in A0 with X=nPn and μ0(Pn)<+ for every n (Premeasures on algebras of sets).

[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]

A is a compact subset of X if and only if for every set I and every family (Ui)iI of open subsets of X with AiIUi there are nN and indices i0,,inI with AUi0Uin, or else A= (A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 3; Open cover, subcover, compact metric space, and compact subset of a metric space).

[F5]

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

[F6]

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

[F7]

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

[F8]

For sequences of reals, k<n(ak+bk)=k<nak+k<nbk; if akbk for all k<n then k<nakk<nbk; and if ak0 for all k<n then k<nak0, with k<nak>0 when every ak>0 (Laws of finite sums and finite products, claims 1, 4 and 6).

[F9]

Finite sums and finite products of a sequence of reals are defined by the recursions Σ0=0, Σσ(n)=Σn+an and Π0=1, Πσ(n)=Πnan (Finite sums and finite products, by recursion).

[F10]

For a,bR, a+b:=+ when a=+ and b, or b=+ and a (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

Proof

technique · direct
1.1

μ0 is a function on the algebra En with values in [0,+] and μ0()=0, which is the first premeasure clause.

L1L2F1
1.2

Each cube (k,k]n is a half-open box, hence elementary, with μ0((k,k]n)=(2k)n<+ for k1 and μ0((0,0]n)=0; and kN(k,k]n=Rn, because for xRn the Archimedean property supplies a natural k1 above each of the finitely many reals xi.

L1L2L7L8F7
1.3

For every N, finite additivity gives k<Nμ0(Ak)=μ0(k<NAk) and monotonicity gives μ0(k<NAk)μ0(A), so every partial sum is at most μ0(A) and therefore k=0μ0(Ak)μ0(A), that supremum being the nonnegative extended sum.

L3F2
1.4

Suppose μ0(A)<+ and let ε>0 be real. Fix an elementary A and a compact K with AKA and μ0(A)μ0(A)+ε; for each k let mk be the least natural number with μ0(Ak+1/(mk+1))μ0(Ak)+ε2k, which exists because the set of such naturals is nonempty and N is well ordered, and put Uk:=int(Ak+1/(mk+1)), an open set containing Ak. Since KA=kAkkUk, compactness yields finitely many indices covering K, hence a natural N with Kk<NUk, so that Ak<NAk+1/(mk+1); monotonicity, finite subadditivity and the geometric series then give μ0(A)k<Nμ0(Ak+1/(mk+1))k<Nμ0(Ak)+εk<N2kk=0μ0(Ak)+2ε, whence μ0(A)k=0μ0(Ak)+3ε; as ε was an arbitrary positive real and μ0(A) is finite, μ0(A)k=0μ0(Ak).

L2L3L4L5L6F2F3F4F5F6F8
2.1

Suppose instead μ0(A)=+ and put T:=k=0μ0(Ak); if T=+ then μ0(A)T holds, and if T<+ a contradiction follows. Fix a disjoint box presentation A=j<qBj; some Bj0=B(a,b) has infinite volume, hence is nonempty with ai0= or bi0=+ for some i0<n. Take yBj0 and put αi:=yi1 when ai= and αi:=(ai+yi)/2 otherwise, so that ai<αi<yi and c:=i<nui>0, where ui:=yiαi for ii0 and ui0:=1. For a real R exceeding every αi and every yi, the box DR with parameter pairs (αi,yi] for ii0 and (αi0,R], respectively (R,yi0], in coordinate i0 according as bi0=+ or ai0=, satisfies DRBj0(R,R]nA(R,R]n and has volume at least (Rαi0yi0)c. On the other hand A(R,R]n is elementary of finite volume and is the disjoint union of the elementary sets Ak(R,R]n, so step 1.4 and monotonicity give μ0(A(R,R]n)k=0μ0(Ak(R,R]n)T; taking R above (T/c)+αi0+yi0+1 by the Archimedean property contradicts this.

step 1.4L1L2L3L7L8F2F7F8F9F10
3.1

Steps 1.3, 1.4 and 2.1 give μ0(A)=k=0μ0(Ak) in every case, which with steps 1.1 and 1.2 makes μ0 a sigma-finite premeasure on En.

step 1.1step 1.2step 1.3step 1.4step 2.1F1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Lebesgue outer measure on Rn

Definition

Fix n1. Lebesgue outer measure λn on Rn is the outer set function induced by the premeasure μ0 of Elementary volume is a sigma-finite premeasure on the algebra of elementary sets on the algebra En of elementary sets (Elementary sets: the finite unions of half-open boxes in Rn), in the sense of The outer set function induced by a premeasure:

λn(E)  :=  inf{ k=0μ0(Ak) : AkEn for every kN and EkNAk }

for ERn, the series being the nonnegative extended sum of Series in the nonnegative extended real line. The family of covering costs is nonempty, because RnEn and the sequence (Rn,,,) covers every E, so the infimum is a well-determined element of [0,+]. On the real line the subscript is dropped and λ:=λ1.

The values λn(E) are defined for every subset of Rn, with no measurability hypothesis. That the resulting set function is an outer measure, and that it agrees with μ0 on En, are proved in Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume; until then the name outer measure is not claimed, exactly as The outer set function induced by a premeasure stipulates.

Remarks

  • Why the covers are by elementary sets and not by boxes. Both give the same value, since an elementary set is a finite union of boxes and a countable family of finite lists reindexes to a countable family of boxes; taking elementary sets is what makes the definition an instance of the published construction, so that the Carathéodory theory applies with nothing reproved. The comparison with covers by closed, open and cubic boxes is Countable covers by closed boxes, by open boxes and by closed cubes all compute Lebesgue outer measure.

  • The definition itself spends no choice principle; it is an infimum of a nonempty subset of [0,+]. Countable choice enters only when the infimum is shown to be countably subadditive, and that is recorded where it happens.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume

Statement

Let n1. Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Then Lebesgue outer measure λn (Lebesgue outer measure on Rn) is an outer measure on Rn (Outer measures): it vanishes at , is monotone, and is countably subadditive.

The agreement clause is a theorem of ZF and needs no choice principle: λn(A)=μ0(A) for every elementary set A (Elementary sets: the finite unions of half-open boxes in Rn), where μ0 is elementary volume. In particular λn(B)=vol(B) for every half-open box B, and λn()=0.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, the premeasure μ0 on the algebra En, and its induced outer set function λn.

[L1]

λn is the outer set function induced by the premeasure μ0 on the algebra En of elementary sets (Lebesgue outer measure on Rn).

[L2]

Elementary volume μ0 is a sigma-finite premeasure on En (Elementary volume is a sigma-finite premeasure on the algebra of elementary sets).

[F1]

Assume the Axiom of Countable Choice. The outer set function induced by a premeasure is an outer measure (Assuming countable choice, the outer set function induced by a premeasure is an outer measure).

[F2]

For every AA0, the outer measure induced by a premeasure satisfies μ(A)=μ0(A) (The induced outer measure agrees with the premeasure on the source algebra).

[F3]

An outer measure on a set X is a function μ:P(X)[0,+] that vanishes at the empty set, is monotone, and is countably subadditive (Outer measures).

[F4]

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

Elementary volume is a premeasure on the algebra En of subsets of Rn, and λn is by definition the outer set function it induces, so both [F1] and [F2] apply to this pair.

L1L2
1.2

Under the Axiom of Countable Choice, an induced outer set function is an outer measure, which is the first assertion.

F1F3F4
1.3

The identity λn(A)=μ0(A) on the source algebra is [F2], whose statement carries no choice hypothesis, so the agreement clause holds in ZF alone; applied to a half-open box B, which is elementary, it gives λn(B)=μ0(B)=vol(B), and applied to it gives λn()=0.

F2L2
2.1

Steps 1.1, 1.2 and 1.3 together are the Statement.

step 1.1step 1.2step 1.3
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Lebesgue measurable sets, the family L(Rn), and the restricted set function λn

Definition

Fix n1 and let λn be the Lebesgue outer set function on Rn (Lebesgue outer measure on Rn). A set ERn is Lebesgue measurable when

λn(A)  =  λn(AE)  +  λn(AE)for every ARn.

This formula makes sense before any outer-measure theorem is invoked. Under countable choice, Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume makes λn an outer measure, and the displayed condition is then exactly Carathéodory measurability in the sense of Carathéodory measurable sets.

The family of Lebesgue measurable sets is written L(Rn), and Lebesgue measure is the restriction

λn  :=  λn ⁣L(Rn).

On the real line the subscript is dropped and λ:=λ1.

The quantifier over every test set A is part of the condition, and no hypothesis on E is imposed before it is tested. That L(Rn) is a sigma-algebra and that λn is a complete measure on it are not part of this definition: they are proved, under the Axiom of Countable Choice, in Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume , which is recorded in this item's justified_by because it is a statement about the objects introduced here. Until that theorem the symbols L(Rn) and λn name a family of sets and a restricted set function, nothing more.

Remarks

  • Why the Carathéodory criterion rather than the inner-outer criterion. Lebesgue's original definition compares the outer measure of E with that of its complement inside a large box, and it is available only for bounded E; the criterion above is stated for every subset at once and is what makes the published Carathéodory machinery apply verbatim. The two agree, and the equivalence with the approximation criteria is Assuming countable choice, four equivalent descriptions of a Lebesgue measurable subset of Rn.

  • The definition is relative to λn and to nothing else. Changing the outer measure changes the family; the family attached to a general outer measure is written Mμ in Carathéodory measurable sets, and L(Rn) is the name reserved for the instance μ=λn.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

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

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Then:

  1. L(Rn) is a sigma-algebra on Rn and λn is a measure on it (Measures on sigma-algebras);
  2. the measure space (Rn,L(Rn),λn) is complete (Complete measure spaces), and every SRn with λn(S)=0 is Lebesgue measurable with λn(S)=0;
  3. every elementary set is Lebesgue measurable and λn(A)=μ0(A) for every AEn; in particular λn(B)=vol(B) for every half-open box B, λn()=0 and λn(Rn)=+.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, Lebesgue outer measure λn, and the family L(Rn) of sets Carathéodory measurable for it.

[L1]

A set ERn is Lebesgue measurable when it is Carathéodory measurable for λn, the family of these is L(Rn), and λn:=λn ⁣L(Rn) (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn).

[L2]

Assuming countable choice, λn is an outer measure on Rn, and λn(A)=μ0(A) for every elementary set A (Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume).

[L3]

λn is the outer set function induced by the premeasure μ0 on the algebra En of elementary sets (Lebesgue outer measure on Rn).

[F1]

For an outer measure μ on X, the Carathéodory measurable subsets form a sigma-algebra, and the restriction of the outer measure to it is a complete measure (Carathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure).

[F2]

Assume the Axiom of Countable Choice. Every member of the source algebra is Carathéodory measurable for the induced outer measure (Assuming countable choice, every source-algebra set is measurable for the induced outer measure).

[F3]

Assume the Axiom of Countable Choice. If μ0 is a premeasure on an algebra A0 of subsets of X and μ is its induced outer set function, then A0Mμ and μA0=μ0 (Assuming countable choice, a premeasure extends through its induced outer measure).

[F4]

Every set of outer measure zero, and every subset of it, is Carathéodory measurable and has outer measure zero (Every outer-null set is Carathéodory measurable).

[F5]

A measure space (X,A,μ) is complete if every subset of every measurable μ-null set is measurable (Complete measure spaces); and a measure on (X,A) is a function μ:A[0,+] with μ()=0 that is countably additive on pairwise disjoint sequences (Measures on sigma-algebras).

[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

Under countable choice λn is an outer measure on Rn, so [F1] applies to it: its Carathéodory measurable sets, which are by definition the members of L(Rn), form a sigma-algebra, and the restriction λn of λn to it is a complete measure.

L1L2F1F5F6
1.2

Since λn is the outer set function induced by the premeasure μ0 on En, the extension theorem and the source-algebra lemma give EnL(Rn) and λn(A)=μ0(A) there; a half-open box and and Rn are elementary, so λn(B)=vol(B), λn()=0 and λn(Rn)=+.

L1L3L4F2F3F6
1.3

A set S with λn(S)=0 is Carathéodory measurable for λn, hence Lebesgue measurable, and its measure is its outer measure, namely 0.

L1F4
2.1

Claim 1 and the completeness half of claim 2 are step 1.1, the null-set half of claim 2 is step 1.3, and claim 3 is step 1.2.

step 1.1step 1.2step 1.3
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Dyadic cubes of generation k in Rn

Definition

Fix n1. For kN and a function m:nZ (The integers as equivalence classes of pairs of naturals), whose values are read inside R along the canonical embedding, the dyadic cube of generation k and index m is the half-open box (Half-open boxes in Rn and their volume)

Qk,m  :=  B(a,b),ai:=mi2k,bi:=(mi+1)2k(i<n),

that is Qk,m={xRn:mi2k<xi(mi+1)2k for every i<n}, the powers being the integer powers of Integer powers am. A dyadic cube is a set of this form for some k and m; its generation is k and its side length is 2k.

Every dyadic cube is nonempty, since mi2k<(mi+1)2k for every i, so by Half-open boxes in Rn and their volume its parameters are determined by the set; the generation and the index are therefore determined by the cube as well. At k=0 the cubes are the translates of the unit cube (0,1]n by integer vectors, and Q0,0=(0,1]n.

Remarks

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

For each generation, the dyadic cubes of that generation are pairwise disjoint and cover Rn

Statement

Let n1 and let kN. Every xRn lies in exactly one dyadic cube of generation k (Dyadic cubes of generation k in Rn); that is, the generation-k dyadic cubes are pairwise disjoint and their union is Rn. Each of them has volume vol(Qk,m)=2kn (Half-open boxes in Rn and their volume).

Facts & Assumptions

Given: A natural number n1, a natural number k, and the dyadic cubes of generation k.

[L1]

Qk,m={xRn:mi2k<xi(mi+1)2k for every i<n} (Dyadic cubes of generation k in Rn).

[L2]

For a nonempty box vol(B):=i<n(biai) when every ai and every bi is real (Half-open boxes in Rn and their volume).

[F1]

For every real x there is exactly one integer p with px<p+1 (Integer part: for every real x there is exactly one integer m with mx<m+1).

[F2]

For a0 and m,nZ, am+n=aman and (am)n=amn (Laws of integer exponents, claims 1 and 3; Integer powers am).

[F3]

k<n(akbk)=(k<nak)(k<nbk), and finite products are defined by the recursion Π0=1, Πσ(n)=Πnan (Laws of finite sums and finite products, claim 6; Finite sums and finite products, by recursion).

Proof

technique · direct
1.1

For a real t there is exactly one integer m with m<tm+1: applying [F1] to t gives the unique integer p with pt<p+1, and m:=p1 then satisfies m<tm+1, while any integer m with m<tm+1 yields m1t<m, so m1=p by the uniqueness in [F1] and m=m.

F1algebra
1.2

Since 2k>0, the condition mi2k<xi(mi+1)2k is equivalent to mi<2kximi+1, the powers satisfying 2k2k=1.

L1F2algebra
1.3

The volume of Qk,m is i<n((mi+1)2kmi2k)=i<n2k=(2k)n=2kn, the last two equalities by the recursion for finite products and the power laws.

L1L2F2F3
2.1

Given xRn, step 1.1 applied in each coordinate to the real 2kxi produces exactly one integer mi with mi<2kximi+1, so by step 1.2 the function m so determined is the unique index of a generation-k dyadic cube containing x; hence the generation-k cubes cover Rn and no two of them share a point.

step 1.1step 1.2L1
3.1

Steps 2.1 and 1.3 are the Statement.

step 1.3step 2.1
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

Two dyadic cubes are either disjoint or one contains the other

Statement

Let n1 and let Q and Q be dyadic cubes in Rn (Dyadic cubes of generation k in Rn) of generations k and k with kk. If QQ then QQ. Consequently any two dyadic cubes are either disjoint or one of them contains the other, and two dyadic cubes of the same generation are either equal or disjoint.

Facts & Assumptions

Given: A natural number n1 and dyadic cubes Q=Qk,m and Q=Qk,m with kk.

[L1]

Qk,m={xRn:mi2k<xi(mi+1)2k for every i<n}, and every dyadic cube is nonempty (Dyadic cubes of generation k in Rn).

[L2]

B(a,b):={xRn:ai<xibi  for every i<n} (Half-open boxes in Rn and their volume).

[F1]

For a0 and m,nZ, am+n=aman (Laws of integer exponents, claim 3; Integer powers am).

[F2]

The order relation on Z is a total order compatible with addition: xy implies x+zy+z (The integers form a totally ordered ring).

[F3]

The canonical embedding of N into Z is injective and preserves addition, multiplication and order, and its image is exactly the set of nonnegative integers, so every x0 in Z is the image of a unique natural number (The naturals embed in the integers, The integers as equivalence classes of pairs of naturals).

[F4]

For all m,nN: m<n if and only if σ(m)n (Discreteness: σ(n) is the immediate successor).

Proof

technique · direct
1.1

Put d:=kk0 and Mi:=mi2d, an integer; then mi2k=Mi2k and (mi+1)2k=(Mi+2d)2k, so in coordinate i the cube Q is cut out by Mi2k<xi(Mi+2d)2k and the cube Q by mi2k<xi(mi+1)2k.

L1L2F1
1.2

For integers u<v one has u+1v, since vu>0 is the image of a unique natural number, that natural is not 0, hence it is at least 1 and vu1; consequently, for integers A<B and C, if the real conditions A<tB and C<tC+1 hold for some real t, then AC and C+1B, because C<A would give C+1A and tC+1A, contradicting A<t, while B<C+1 would give BC and tBC, contradicting C<t.

F2F3F4
2.1

If xQQ then step 1.2, applied in each coordinate with A:=Mi, B:=Mi+2d, C:=mi and t:=2kxi, gives Mimi and mi+1Mi+2d, so the parameter interval of Q in coordinate i is contained in that of Q, and hence QQ.

step 1.1step 1.2L1L2
3.1

For arbitrary dyadic cubes, relabel so that the generation of the first is the smaller, and step 2.1 gives the dichotomy; when the generations are equal, QQ and the symmetric conclusion QQ both hold, so Q=Q.

step 2.1L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

Every open subset of Rn is the union of a countable pairwise disjoint family of dyadic cubes

Statement

Let n1 and let URn be open in the metric topology of (Rn,d2) (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Rn as the set of functions nR, and d1, d2, d are metrics on it). Then there is an at most countable family M of pairwise disjoint dyadic cubes (Dyadic cubes of generation k in Rn, Finite, countably infinite, countable, uncountable) with

U  =  M.

For U= the family is empty. No choice principle is used: the cube attached to a point is the one of least generation that fits inside U, and least is a definition.

Facts & Assumptions

Given: A natural number n1 and an open subset URn.

[L1]

Every xRn lies in exactly one dyadic cube of generation k (For each generation, the dyadic cubes of that generation are pairwise disjoint and cover Rn).

[L2]

If Q and Q are dyadic cubes of generations kk and QQ, then QQ (Two dyadic cubes are either disjoint or one contains the other).

[L3]

Qk,m={xRn:mi2k<xi(mi+1)2k for every i<n}, and every dyadic cube is nonempty (Dyadic cubes of generation k in Rn, Integer powers am).

[L4]

A nonempty box determines its parameter pair, since B determines ai and bi for every i (Half-open boxes in Rn and their volume).

[F1]

A subset UX is open in (X,d) if for every xU there is a real r>0 with B(x,r)U, where B(x,r):={yX:d(x,y)<r} (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space).

[F2]

d2(x,y):= k<n(xkyk)2  and d(x,y):=max{xkyk:k<n} are metrics on Rn for n1 (Rn as the set of functions nR, and d1, d2, d are metrics on it).

[F3]

For every xRn, x2x1 and x1nx, n being the canonical natural of R; and xy2=d2(x,y), xy=d(x,y) (The finite and reverse triangle inequalities for a norm; and for n1 every norm N on Rn satisfies N(x)Cx1 and is Lipschitz, hence continuous, for d2, claim 3; Each p is a norm on Rn, and the induced metrics are exactly d1, d2 and d of the published metric-spaces page, claim 3; The p-norms xp for rational p1, and x).

[F5]

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

[F7]

If A and B are at most countable then so is A×B (A product of two at most countable sets is at most countable); and if A is at most countable and BA then B is at most countable (Every subset of an at most countable set is at most countable, Finite, countably infinite, countable, uncountable).

Proof

technique · direct
1.1

The set D of all dyadic cubes is at most countable: each of its members is nonempty and so determines its parameter pair, whose entries mi2k and (mi+1)2k are rational, so the assignment of a cube to that pair is an injection of D into Qn×Qn, a countable set, and D is therefore equinumerous with an at most countable subset of it.

L3L4F6F7
1.2

For every xU there is a natural number k such that the generation-k dyadic cube containing x is a subset of U: openness supplies a real r>0 with B(x,r)U; since (2k)kN is null there is k with 2k<r/n; and every y in the generation-k cube containing x has yixi<2k in each coordinate, because xi and yi lie in one parameter interval of length 2k, so d(x,y)<2k and d2(x,y)nd(x,y)<r.

L1L3F1F2F3F4
2.1

For xU let k(x) be the least natural number provided by step 1.2 and let Qx be the generation-k(x) dyadic cube containing x, which is unique; then xQxU, and Qx is maximal among the dyadic cubes contained in U, for if QxQU with Q of generation k, then Q contains x and is therefore the generation-k cube containing x, so kk(x) by minimality, and then QxQ with k(x)k gives QQx and hence Q=Qx.

step 1.2L1L2L3F5
3.1

Put M:={Qx:xU}: its members are dyadic cubes contained in U and every xU lies in one of them, so M=U; two members meeting each other are nested by [L2], and each being maximal in U they are equal, so the members are pairwise disjoint; and MD is at most countable by step 1.1.

step 1.1step 2.1L2F7
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The sigma-algebra generated by the half-open boxes of Rn is the Borel sigma-algebra

Statement

Let n1, let Hn be the family of half-open boxes in Rn (Half-open boxes in Rn and their volume) and let En be the family of elementary sets (Elementary sets: the finite unions of half-open boxes in Rn). With Rn carrying its product topology, which is the metric topology of the Euclidean metric (A subset of Rn with the product topology is compact exactly when it is closed and bounded, the product topology being the Euclidean metric topology),

σ(Hn)  =  σ(En)  =  B(Rn)

(The sigma-algebra generated by a family of sets, The Borel sigma-algebra of a topological space).

Facts & Assumptions

Given: A natural number n1, the topology T of (Rn,d2), the family Hn of half-open boxes and the family En of elementary sets.

[L1]

B(a,b):={xRn:ai<xibi  for every i<n}, with parameters in R (Half-open boxes in Rn and their volume).

[L2]

A subset ERn is an elementary set when there are a natural number m and a list B0,,Bm1 of half-open boxes with E=j<mBj; at m=1 every half-open box is elementary (Elementary sets: the finite unions of half-open boxes in Rn).

[L3]

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), and a dyadic cube is the half-open box Qk,m={x:mi2k<xi(mi+1)2k for every i<n} (Dyadic cubes of generation k in Rn).

[L4]

Each of the following families generates B(Rn): all open sets; and all rational half-open boxes i<n(ai,bi] with rational endpoints ai<bi (For n at least one, open sets, closed sets, compact sets, open balls, boxes, rational open boxes, and rational half-open boxes generate the Borel sigma-algebra on R^n).

[F1]

The Borel sigma-algebra of X is the sigma-algebra generated by its open sets, B(X):=σX(T) (The Borel sigma-algebra of a topological space), and σX(E) is the unique smallest sigma-algebra on X containing E (The sigma-algebra generated by a family of sets, Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal).

[F2]

If EσX(F) and FσX(E), then σX(E)=σX(F) (Two families generate the same sigma-algebra when each lies in the sigma-algebra generated by the other).

[F3]

A sigma-algebra is closed under countable unions and under countable intersections (Sigma-algebras, Sigma-algebras are closed under countable intersections, differences, symmetric differences, and set limits).

[F7]

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

[F8]

For a,bR, a+b:=+ when a=+ and b, and a+b:= when a= and b+ (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

[F9]

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

Proof

technique · direct
1.1

For parameters a,c the set V(a,c):={xRn:ai<xi<ci for every i<n} is open: given xV(a,c), the finitely many quantities xiai with ai real and cixi with ci real are strictly positive, so their minimum ρ is a positive real, or ρ:=1 if there are none, and d2(x,y)<ρ forces yixid2(x,y)<ρ in every coordinate, hence ai<yi<ci throughout.

F5F6
1.2

Every half-open box is a countable intersection of sets of the form V(a,c), namely B(a,b)=q1V(a,b+(1/q)1): a point of B(a,b) satisfies xibi<bi+1/q when bi is real and xi<+ when bi=+, while a point of every V(a,b+(1/q)1) satisfies ai<xi and, for real bi, cannot have xi>bi, since some 1/q is below xibi; a coordinate with bi= makes both sides empty.

L1F7F8
1.3

In the other direction every open U lies in σ(Hn): it is the union of an at most countable family of dyadic cubes, that family may be presented as a sequence, and each dyadic cube is a half-open box.

L3F3F9
1.4

The published generator theorem gives that same inclusion by a second route, since the rational half-open boxes i<n(ai,bi] with rational ai<bi are half-open boxes in the sense of [L1] and already generate B(Rn).

L1L4F1
2.1

Every half-open box is therefore a Borel set, being a countable intersection of open sets, so HnB(Rn) and, En consisting of finite unions of half-open boxes, also EnB(Rn).

step 1.1step 1.2L2F1F3F4
3.1

By steps 1.3 and 2.1 the families Hn and T lie in each other's generated sigma-algebras, so σ(Hn)=σ(T)=B(Rn); and HnEnσ(Hn) gives σ(En)=σ(Hn) by the same criterion.

step 1.3step 1.4step 2.1L2F1F2F4

Remarks

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

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

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Then

B(Rn)    L(Rn):

every Borel subset of Rn (The Borel sigma-algebra of a topological space) is Lebesgue measurable (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn). In particular every open set, every closed set and every countable intersection of open sets is Lebesgue measurable.

Facts & Assumptions

Given: A natural number n1 and the Axiom of Countable Choice.

[L1]

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

[L2]

σ(Hn)=σ(En)=B(Rn), where Hn is the family of half-open boxes and En the family of elementary sets (The sigma-algebra generated by the half-open boxes of Rn is the Borel sigma-algebra).

[L3]

At m=1 every half-open box is elementary (Elementary sets: the finite unions of half-open boxes in Rn).

[F2]

The Borel sigma-algebra of X is the sigma-algebra generated by its open sets (The Borel sigma-algebra of a topological space); a sigma-algebra on X is an algebra of subsets closed under countable unions (Sigma-algebras).

[F3]

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

Under countable choice L(Rn) is a sigma-algebra on Rn containing every elementary set, hence containing the family Hn of half-open boxes.

L1L3F2F3
2.1

Since σ(Hn) is the smallest sigma-algebra containing Hn, step 1.1 gives σ(Hn)L(Rn), and σ(Hn)=B(Rn); open sets, closed sets and countable intersections of open sets are Borel.

step 1.1L2F1F2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included

Statement

Let n1, assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), and let aibi be reals for i<n. Write

R:={xRn:ai<xi<bi for every i<n},R:=[a,b]={xRn:aixibi for every i<n}

(Axis-parallel rectangles in Rm and their volume). Then R is open and R is closed, so both are Borel and Lebesgue measurable, and every set R with RRR is Lebesgue measurable with

λn(R)  =  i<n(biai).

In particular this covers the four one-dimensional face conventions in each coordinate — the open box, the closed box [a,b], the half-open box B(a,b)=i<n(ai,bi] of Half-open boxes in Rn and their volume, and every mixture of them, in any combination of coordinates — and it gives measure 0 to all of them whenever ai=bi for some i<n. For a half-open box with infinite parameters the value is already λn(B)=vol(B) (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, reals aibi for i<n, and the sets R, R displayed in the Statement.

[L1]

Assuming countable choice, L(Rn) is a sigma-algebra, λn is a complete measure on it, every set of Lebesgue outer measure zero is Lebesgue measurable of measure zero, and λn(B)=vol(B) for every half-open box B (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[L2]

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

[L3]

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

[L4]

For a nonempty box vol(B):=i<n(biai) when every ai and every bi is real, and a box is nonempty exactly when ai<bi for every i<n (Half-open boxes in Rn and their volume).

[F1]

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

[F2]

A measure on (X,A) is a function μ:A[0,+] with μ()=0 that is countably additive on pairwise disjoint sequences (Measures on sigma-algebras).

[F3]

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

[F4]

k<n(akbk)=(k<nak)(k<nbk); if ak0 for all k<n then k<nak0, with k<nak>0 when every ak>0; and finite products are defined by the recursion Π0=1, Πσ(n)=Πnan (Laws of finite sums and finite products, claim 6; Finite sums and finite products, by recursion).

[F5]

A subset UX is open in (X,d) if for every xU there is a real r>0 with B(x,r)U; a subset F is closed if its complement is open (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).

[F6]

The forms [a,b) and (a,b] are half-open, and an interval is open when both of its written endpoints are excluded, closed when both are included (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Proof

technique · direct
1.1

R is open and R is closed in (Rn,d2), by the same coordinatewise estimate in each case, so both are Borel and hence Lebesgue measurable.

L2F1F5F6
1.2

A closed rectangle with a degenerate side is Lebesgue null: let uivi be reals with ui0=vi0=c for some i0<n, and let η be a positive real; the half-open box with parameter pairs (ui1,vi] for ii0 and (cη,c] in coordinate i0 is nonempty, contains [u,v], and has volume ηC where C:=i<nwi>0 with wi0:=1 and wi:=viui+1 otherwise, so monotonicity of the outer measure gives λn([u,v])ηC for every positive real η and hence λn([u,v])=0.

L1L3L4F1F3F4
2.1

The difference RR is contained in the union of the 2n closed rectangles obtained from [a,b] by replacing the i-th side by the degenerate side [ai,ai] or by [bi,bi], each of which is Lebesgue null by step 1.2, so countable subadditivity of the outer measure, applied to that finite list padded with empty sets, gives λn(RR)=0; every subset of RR is therefore Lebesgue measurable of measure 0.

step 1.2L1L3
2.2

Suppose instead ai0=bi0 for some i0<n. Then R=, the rectangle R is Lebesgue null by step 1.2, every R between them is a subset of it and so is measurable of measure 0, and the product i<n(biai) has the factor 0 and is therefore 0 as well.

step 1.2L1F4
3.1

Suppose first that ai<bi for every i<n. Then B(a,b) is a nonempty half-open box with RB(a,b)R and λn(B(a,b))=vol(B(a,b))=i<n(biai). For R with RRR, both RB(a,b) and B(a,b)R are contained in RR, hence are measurable of measure 0 by step 2.1, so R=(B(a,b)(B(a,b)R))(RB(a,b)) is measurable, and additivity on the two disjoint decompositions R=(RB(a,b))(RB(a,b)) and B(a,b)=(RB(a,b))(B(a,b)R) gives λn(R)=λn(RB(a,b))=λn(B(a,b)).

step 2.1L1L4F2
4.1

Steps 3.1 and 2.2 exhaust the two cases and give the displayed value in each, and step 1.1 supplies the Borel and measurability clauses for R and R.

step 1.1step 2.2step 3.1
PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Then:

  1. λn is sigma-finite (Finite, sigma-finite, and semifinite measures): the cubes (k,k]n are Lebesgue measurable with λn((k,k]n)=(2k)n<+, they increase with k, and their union over kN is Rn.
  2. Every bounded subset ERn (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space) has λn(E)<+; a bounded Lebesgue measurable set therefore has finite measure, and every compact subset of Rn is Lebesgue measurable of finite measure.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, and Lebesgue measure λn on L(Rn).

[L1]

Assuming countable choice, L(Rn) is a sigma-algebra, λn is a complete measure on it, and λn(B)=vol(B) for every half-open box B (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[L2]

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

[L3]

Assuming countable choice, λn is an outer measure on Rn, hence monotone (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]

For a nonempty box vol(B):=i<n(biai) when every ai and every bi is real, and (u,v]n:=B(u,v) (Half-open boxes in Rn and their volume, Integer powers am).

[F1]

μ is sigma-finite if there is a sequence (En)nN in A such that X=nEn and μ(En)<+ for every n (Finite, sigma-finite, and semifinite measures).

[F2]

A is bounded if A= or there are x0X and a real r>0 with AB(x0,r), where B(x0,r):={y:d(x0,y)<r} (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Open ball, closed ball and sphere in a metric space).

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

Proof

technique · direct
1.1

Each cube (k,k]n is a half-open box, hence Lebesgue measurable with λn((k,k]n)=i<n(k(k))=(2k)n, a real number; the cubes increase with k; and every xRn lies in one of them, because the Archimedean property gives a natural k1 above each of the finitely many reals xi, so their union is Rn and λn is sigma-finite.

L1L2L5F1F6
1.2

Let E be bounded and nonempty, say EB(x0,r) with r a positive real; every yE satisfies yi(x0)id2(x0,y)<r in each coordinate, so E is contained in the half-open box with parameter pairs ((x0)ir, (x0)i+r], whose volume is (2r)n; monotonicity of the outer measure therefore gives λn(E)(2r)n<+, and the empty set has outer measure 0.

L1L3L5F2F3
2.1

A bounded Lebesgue measurable set has λn(E)=λn(E)<+ by step 1.2; and a compact KRn is closed, hence Borel and Lebesgue measurable, and bounded, hence of finite measure.

step 1.2L4F4F5
3.1

Step 1.1 is claim 1 and steps 1.2 and 2.1 are claim 2.

step 1.1step 1.2step 2.1
PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Every at most countable subset ERn (Finite, countably infinite, countable, uncountable) is Lebesgue measurable with

λn(E)  =  0,

so E is a λn-null set (Measure-null sets and almost-everywhere statements relative to a measure). In particular every singleton is null, and on the real line the set QR of rational reals (The rationals embed densely in the reals) satisfies λ1(QR)=0.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, and an at most countable set ERn.

[L1]

Every set R with RRR is Lebesgue measurable with λn(R)=i<n(biai), and this gives measure 0 to all of them whenever ai=bi for some i<n (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included).

[L2]

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

[F1]

A is at most countable if it is finite or countably infinite (Finite, countably infinite, countable, uncountable); a nonempty A is at most countable if and only if there is a surjection s:NA (A nonempty set is at most countable iff it is a surjective image of N).

[F2]

For a measure μ and measurable (Ek)kN, μ(kNEk)k=0μ(Ek) (Finite and countable subadditivity of measures).

[F3]

QN: the rationals are countably infinite (Q is countably infinite), and QR denotes the image of Q in R under the canonical order-preserving field embedding (The rationals embed densely in the reals).

[F4]

A measurable set NA is μ-null if μ(N)=0 (Measure-null sets and almost-everywhere statements relative to a measure); a sigma-algebra is closed under countable unions (Sigma-algebras).

[F5]

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

Proof

technique · direct
1.1

A singleton {x}Rn is the closed rectangle [x,x], whose sides all satisfy ai=bi=xi, so it is Lebesgue measurable with λn({x})=0.

L1F5
1.2

The empty set is Lebesgue measurable with measure 0.

L2F4
2.1

Let E be nonempty and at most countable and fix a surjection s:NE; then E=kN{s(k)} is a countable union of measurable sets, hence measurable, and countable subadditivity gives λn(E)k=0λn({s(k)})=0.

step 1.1L2F1F2F4
3.1

Steps 1.2 and 2.1 cover both cases, and QR is a countably infinite subset of R, so λ1(QR)=0.

step 1.2step 2.1F3
PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A box with a degenerate side is Lebesgue null, and so is every coordinate hyperplane in Rn

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Then:

  1. Degenerate boxes. If aibi are reals with ai0=bi0 for some i0<n, then every set R between the open box {x:ai<xi<bi (i<n)} and the closed rectangle [a,b] is Lebesgue measurable with λn(R)=0.
  2. Coordinate hyperplanes. For i0<n and a real c, the set Hi0,c  :=  {xRn:xi0=c} is Lebesgue measurable with λn(Hi0,c)=0.

At n=1 the hyperplane H0,c is the singleton {c}.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, an index i0<n and a real c.

[L1]

Every set R with RRR is Lebesgue measurable with λn(R)=i<n(biai), and it gives measure 0 to all of them whenever ai=bi for some i<n (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included).

[L2]

Assuming countable choice, L(Rn) is a sigma-algebra and λn is a complete measure on it (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).

[F1]

For a measure μ and measurable (Ek)kN, μ(kNEk)k=0μ(Ek) (Finite and countable subadditivity of measures).

[F2]

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

[F3]

A measurable set NA is μ-null if μ(N)=0 (Measure-null sets and almost-everywhere statements relative to a measure); a sigma-algebra is closed under countable unions (Sigma-algebras).

[F4]

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

[F5]

B(a,b):={xRn:ai<xibi  for every i<n} (Half-open boxes in Rn and their volume).

Proof

technique · direct
1.1

Claim 1 is the degenerate case of the box theorem, whose value i<n(biai) carries the factor bi0ai0=0.

L1F2F5
1.2

For a natural number k put Pk:={xRn:xi0=c and xik for every ii0}. This is always the closed rectangle with sides [k,k] for ii0 and the degenerate side [c,c] in coordinate i0.

F2
2.1

Each Pk is Lebesgue measurable of measure 0 by claim 1.

step 1.1step 1.2L2F3
2.2

The union kNPk is Hi0,c, since a point of the hyperplane has finitely many coordinates and the Archimedean property supplies a natural k above each xi and above c.

step 1.2F4
3.1

Therefore Hi0,c is a countable union of measurable sets, hence measurable, and countable subadditivity gives λn(Hi0,c)k=0λn(Pk)=0; at n=1 the set H0,c is {c}.

step 2.1step 2.2L2L3F1F3
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

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

Statement

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

λn(E)  =  inf{λn(U)  :  URn open and EU},

the infimum being taken in [0,+] over a family that is nonempty because Rn is open.

Facts & Assumptions

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

[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]

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

[L3]

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

[L4]

Assuming countable choice, every Borel subset of Rn is Lebesgue measurable; in particular every open set is (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable).

[L5]

A+δ is an elementary set determined by A and δ alone, it contains A, and every point of A is an interior point of A+δ; and for every real ε>0 there is mN with μ0(A+1/(m+1))μ0(A)+ε (Every elementary set is squeezed in volume between a compact subset and an elementary set whose interior contains it, claims 1 and 2).

[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]

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

[F5]

For sequences of reals, k<n(ak+bk)=k<nak+k<nbk, and if akbk whenever 0k<n then k<nakk<nbk (Laws of finite sums and finite products, claims 1 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

Every open U is Lebesgue measurable with λn(U)=λn(U), so monotonicity of the outer measure gives λn(E)λn(U) for every open UE, and therefore λn(E) is a lower bound of the family whose infimum is displayed; that family is nonempty since Rn is open.

L2L3L4F1
1.2

Suppose λn(E)<+ and let ε be a positive real; by the definition of λn as an infimum there is a sequence (Ak)kN of elementary sets with EkAk and k=0μ0(Ak)λn(E)+ε.

L1
2.1

For each k let mk be the least natural number with μ0(Ak+1/(mk+1))μ0(Ak)+ε2k, which exists because that set of naturals is nonempty and N is well ordered, and put Uk:=int(Ak+1/(mk+1)); each Uk is open and contains Ak, so U:=kUk is open and contains E.

step 1.2L5F1F3
3.1

Countable subadditivity, monotonicity and the agreement of λn with μ0 on elementary sets give λn(U)k=0λn(Uk)k=0μ0(Ak+1/(mk+1)); every partial sum of the last series is at most k<Nμ0(Ak)+εk<N2kk=0μ0(Ak)+2ε, so the series itself, being the supremum of its partial sums, is at most λn(E)+3ε.

step 1.2step 2.1L2L5L6F2F4F5
4.1

So when λn(E)<+ the infimum is at most λn(E)+3ε for every positive real ε and hence at most λn(E); when λn(E)=+ the infimum is at most + for the same reason of triviality; with step 1.1 the infimum equals λn(E) in both cases.

step 1.1step 3.1F6
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Every subset of Rn has a Gδ measurable hull of the same outer measure

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Every ERn has a Gδ set G (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion) with

EGandλn(G)=λn(E).

Such a G is Borel, hence Lebesgue measurable, so it is a measurable hull of E and λn is a regular outer measure (Measurable hulls and regular outer measures). The regularity also follows from Assuming countable choice, a premeasure-induced outer measure is regular with generated measurable hulls, which supplies a measurable hull inside σ(En); the point added here is that the hull may be taken of the special form Gδ.

Facts & Assumptions

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

[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, every Borel subset of Rn is Lebesgue measurable (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable).

[L3]

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

[F1]

A is a Gδ set of X when there is a sequence (Vn)nN of open subsets of X with A=nNVn (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion).

[F2]

A measurable hull of E is a Carathéodory measurable set HE with μ(H)=μ(E); the outer measure is regular when every subset has a measurable hull (Measurable hulls and regular outer measures).

[F3]

Assume the Axiom of Countable Choice. An outer measure induced by a premeasure is regular, and every set has a measurable hull in σ(A0) (Assuming countable choice, a premeasure-induced outer measure is regular with generated measurable hulls).

[F5]

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

[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

If λn(E)=+, take G:=Rn, which is open and hence a Gδ by the constant sequence, contains E, and has λn(G)=+ by monotonicity.

L4F1F4
1.2

If λn(E)<+, then for each mN the family of open sets UE with λn(U)<λn(E)+1/(m+1) is nonempty, because the infimum in [L1] is not a lower bound of anything larger; countable choice selects one such Um for every m.

L1F5F6
2.1

Put G:=mNUm, a Gδ set containing E; monotonicity gives λn(E)λn(G)λn(Um)=λn(Um)<λn(E)+1/(m+1) for every m, so λn(G)=λn(E).

step 1.2L2L3L4F1F5
3.1

In both cases G is a countable intersection of open sets, hence Borel and Lebesgue measurable, so G is a measurable hull of E and λn is regular; the same regularity is delivered by the published theorem on premeasure-induced outer measures, with the hull taken in σ(En) instead.

step 1.1step 2.1L2F1F2F3
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

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
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A subset of Rn with open supersets of arbitrarily small excess is Lebesgue measurable

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let ERn be such that for every real ε>0 there is an open UE with λn(UE)<ε. Then there are a Gδ set G (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion) and a set Z with

E  =  GZ,EG,λn(Z)=0,

and E is Lebesgue measurable (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn).

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, and a set ERn admitting open supersets of arbitrarily small outer excess.

[L1]

Assuming countable choice, L(Rn) is a sigma-algebra, λn is a complete measure on it, and every SRn with λn(S)=0 is Lebesgue measurable with λn(S)=0 (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[L2]

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

[L3]

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

[F1]

A is a Gδ set of X when there is a sequence (Vn)nN of open subsets of X with A=nNVn (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion).

[F3]

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

[F4]

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

For every mN the family of open UE with λn(UE)<1/(m+1) is nonempty by hypothesis, since 1/(m+1) is a positive real, so countable choice selects such a Um for every m.

F3F4
2.1

Put G:=mNUm and Z:=GE; then G is a Gδ set containing E, so E=GZ, and ZUmE for every m, whence monotonicity gives λn(Z)1/(m+1) for every m and therefore λn(Z)=0.

step 1.1L3F1F2F3
3.1

G is a countable intersection of open sets, hence Borel and Lebesgue measurable; Z has outer measure 0, hence is Lebesgue measurable; and E=GZ is a difference of measurable sets, hence Lebesgue measurable.

step 2.1L1L2F1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Assuming countable choice, four equivalent descriptions of a Lebesgue measurable subset of Rn

Statement

Let n1, assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and let ERn. Then E is Lebesgue measurable (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn) if and only if each of the following four conditions holds, and the four are equivalent to one another.

  1. Open excess. For every real ε>0 there is an open UE with λn(UE)<ε.
  2. Gδ minus null. There are a Gδ set G and a set Z with λn(Z)=0 and E=GZ (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion).
  3. Closed deficit. For every real ε>0 there is a closed FE with λn(EF)<ε.
  4. Fσ plus null. There are an Fσ set H and a set W with λn(W)=0 and E=HW.

Each condition is stated for sets of infinite measure as well as finite ones, which is why the excess and the deficit are measured by the outer measure of a difference rather than by a difference of measures.

Facts & Assumptions

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

[L1]

Assuming countable choice, for every Lebesgue measurable E and every real ε>0 there is an open U with EU and λn(UE)<ε (For a Lebesgue measurable set and every positive ε there is an open superset whose difference from it has outer measure below ε).

[L2]

Assuming countable choice, a set admitting open supersets of arbitrarily small outer excess is GZ with G a Gδ containing it and λn(Z)=0, and is Lebesgue measurable (A subset of Rn with open supersets of arbitrarily small excess is Lebesgue measurable).

[L3]

Assuming countable choice, L(Rn) is a sigma-algebra, λn is a complete measure on it, and every S with λn(S)=0 is Lebesgue measurable of measure 0 (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[L4]

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

[L5]

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

[L6]

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

[F1]

A is a Gδ set of X when there is a sequence (Vn)nN of open subsets of X with A=nNVn, and an Fσ set of X when there is a sequence (Fn)nN of closed subsets with A=nNFn (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion).

[F3]

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

[F4]

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

Measurability implies condition 1, which is the cited lemma on the open excess of a measurable set.

L1
1.2

Condition 1 implies condition 2, which is the first clause of the cited lemma on small open excess.

L2
1.3

Condition 2 implies measurability: G is a countable intersection of open sets, hence Borel and measurable; Z has outer measure 0, hence is measurable; so E=GZ is measurable.

L3L4F1
1.4

Condition 4 implies measurability, by the same argument read for unions: H is a countable union of closed sets, hence Borel and measurable, W is measurable because λn(W)=0, and E=HW is measurable.

L3L4F1
2.1

Measurability implies condition 3: the complement RnE is measurable, so for a real ε>0 step 1.1 supplies an open URnE with λn(U(RnE))<ε; then F:=RnU is closed, FE, and EF=EU=U(RnE), so λn(EF)<ε.

step 1.1L3F2
3.1

Condition 3 implies condition 4: for each mN the family of closed FE with λn(EF)<1/(m+1) is nonempty, so countable choice selects such an Fm; then H:=mFm is an Fσ set with HE, and W:=EHEFm gives λn(W)1/(m+1) for every m, hence λn(W)=0 and E=HW.

step 2.1L5F1F3F4
4.1

The implications of steps 1.1, 1.2 and 1.3 close the cycle between measurability and conditions 1 and 2, and those of steps 2.1, 3.1 and 1.4 close the cycle between measurability and conditions 3 and 4; so all five statements are equivalent, and outer regularity is what stands behind the open sets produced in step 1.1.

step 1.1step 1.2step 1.3step 1.4step 2.1step 3.1L6
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

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
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

L(Rn) is exactly the completion of the restriction of λn to the Borel sets

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Write βn for the restriction of λn to the Borel sigma-algebra B(Rn) (The Borel sigma-algebra of a topological space). Then L(Rn) is exactly the completion domain of (Rn,B(Rn),βn) (The completion domain and proposed completed set function of a measure space), and λn is the completed measure there. Explicitly,

EL(Rn)    E=AN for some A,ZB(Rn) with NZ and βn(Z)=0,

and then λn(E)=βn(A).

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, Lebesgue measure λn on L(Rn), and the restriction βn of λn to B(Rn).

[L1]

Assume the Axiom of Countable Choice and let μ0 be a sigma-finite premeasure; the Carathéodory sigma-algebra of its induced outer measure is exactly the completion of σ(A0) under the extended measure, and the Carathéodory restriction equals the completed measure there (Assuming countable choice, the Carathéodory domain is the completion of the sigma-finite extension).

[L2]

Elementary volume μ0 is a sigma-finite premeasure on the algebra En of elementary sets (Elementary volume is a sigma-finite premeasure on the algebra of elementary sets, Elementary sets: the finite unions of half-open boxes in Rn).

[L3]

λn is the outer set function induced by the premeasure μ0 on En (Lebesgue outer measure on Rn), and L(Rn) is the family of sets Carathéodory measurable for λn, with λn its restriction (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn).

[L5]
[F1]

The completion domain of (X,A,μ) is A:={EX:E=AN for some A,ZA and NZ with μ(Z)=0}, and the completed set function is μ(E):=μ(A) (The completion domain and proposed completed set function of a measure space).

[F2]

Assume the Axiom of Countable Choice; then μ is a complete measure on A extending μ, and it is the unique complete measure on A that extends μ (Assuming countable choice, every measure space has a unique complete extension to its completion).

[F3]

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

Elementary volume is a sigma-finite premeasure on the algebra En, and λn is exactly the outer set function it induces, so the hypotheses of the Carathéodory-domain theorem are met with A0:=En.

L2L3F3
1.2

The sigma-algebra generated by En is B(Rn), and the measure that the extension theorem places on it is the restriction βn of λn, since every Borel set is Lebesgue measurable and λn is the restriction of λn.

L3L4L5
2.1

The Carathéodory-domain theorem therefore says that L(Rn), the Carathéodory sigma-algebra of λn, is the completion domain of βn on B(Rn) and that λn agrees there with the completed measure; unwinding the published description of that domain gives the displayed equivalence and the value λn(E)=βn(A), which is well posed because the completed measure is a measure extending βn and is the unique complete one.

step 1.1step 1.2L1F1F2
RemarkRemark: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Regularity of an outer measure and regularity of a measure with respect to open and compact sets are different conditions, both satisfied here

Assuming the Axiom of Countable Choice, the word regular is carrying two different conditions in this development, and both of them hold for Lebesgue measure. They are not variants of one statement: one is about arbitrary subsets and measurable supersets, the other about measurable sets and topologically distinguished sub- and supersets.

Regularity of an outer measure. Measurable hulls and regular outer measures calls an outer measure μ regular when every subset E of the ambient set has a measurable hull: a Carathéodory measurable HE with μ(H)=μ(E). This mentions no topology at all, and it is a condition that fails for some outer measures. For λn it holds, with the hull available in the special form Gδ: Every subset of Rn has a Gδ measurable hull of the same outer measure.

Regularity of a measure with respect to open and compact sets. Here the statements are that λn(E) is the infimum of λn(U) over open UE (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), and that λn(E) is the supremum of λn(K) over compact KE for measurable E (Assuming countable choice, the Lebesgue measure of a measurable set is the supremum of the measures of its compact subsets). Both mention the topology essentially, and the second is restricted to measurable sets, which the first is not.

Why the distinction has to be made rather than left to context. The two conditions have different hypotheses on E, different quantifiers, and different witnesses: a measurable hull is a superset with equal outer measure, while outer regularity produces supersets whose measures merely approach the outer measure and are open. The one implies the other only through an argument — here, intersecting a sequence of open supersets, which is exactly the proof of the Gδ hull. Nothing below uses the word regular without saying which of the two is meant.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

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
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A subset of R has Lebesgue outer measure zero if and only if it has measure zero in the sense of countable closed-interval covers

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and let AR. Then

λ1(A)=0A has measure zero,

measure zero being the covering notion of Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover): that is, if and only if for every real ε>0 there are sequences (ak)kN and (bk)kN of reals with akbk for every k such that AkN[ak,bk] and k=0(bkak) converges with sum at most ε.

Facts & Assumptions

Given: The Axiom of Countable Choice, the case n=1 of Lebesgue outer measure, and a subset AR.

[L1]

Assuming countable choice, λcl(E)=λn(E), where λcl(E) is the infimum of k=0vol[uk,vk] over countable covers of E by closed rectangles (Countable covers by closed boxes, by open boxes and by closed cubes all compute Lebesgue outer measure, Lebesgue outer measure on Rn).

[F1]

A has measure zero, equivalently A is null, when for every real ε>0 there are sequences (ak)k0 and (bk)k0 of reals with akbk for every k0, such that Ak0[ak,bk] and k=0(bkak) converges with sum ε (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover), Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[F2]

For a fixed ε>0, k=0(bkak) converges with sum ε if and only if k<n(bkak)ε for every nN (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

[F3]

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

[F4]

Under the standard identification R1R, the rectangle [a,b] of R1 is the interval [a0,b0] and its volume is its length (Axis-parallel rectangles in Rm and their volume).

Proof

technique · direct
1.1

At n=1 a closed rectangle is a closed interval [ak,bk] with akbk and its volume is the length bkak, so the covers admitted in λcl(A) are exactly the covers admitted in the published definition of measure zero.

F1F4
1.2

For a sequence of nonnegative reals, the nonnegative extended sum is the supremum of the partial sums, so it is at most ε exactly when every partial sum is, which is exactly the condition that the real series converges with sum at most ε.

F2F3
2.1

Hence A has measure zero in the published sense if and only if for every real ε>0 some admissible cover has total length at most ε, which says exactly that the infimum λcl(A) is 0; and λcl(A)=λ1(A).

step 1.1step 1.2L1
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A subset of Rm has Lebesgue outer measure zero if and only if it is null in the sense of countable closed-cube covers

Statement

Let m1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). For ERm,

λm(E)=0E is null,

nullity being the covering notion of Measure zero and content zero in Rm by countable and finite cube covers: that is, if and only if for every real ε>0 the set E is covered by a sequence of closed cubes whose nonnegative volume series converges with sum at most ε.

Facts & Assumptions

Given: A natural number m1, the Axiom of Countable Choice, and a subset ERm.

[L1]

Assuming countable choice, λcb(E)=λm(E), where λcb(E) is the infimum of k=0km over countable covers of E by closed cubes i<m[cik,cik+k] (Countable covers by closed boxes, by open boxes and by closed cubes all compute Lebesgue outer measure, Lebesgue outer measure on Rn).

[F1]

A closed cube is a rectangle j<m[aj,aj+] with 0; its volume is m. A set ERm is null when, for every ε>0, it is covered by a sequence of closed cubes whose nonnegative volume series converges with sum at most ε (Measure zero and content zero in Rm by countable and finite cube covers, 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).

Proof

technique · direct
1.1

The closed cubes admitted in the published definition of nullity are exactly the sets i<m[ci,ci+] with 0, with the same size m as in λcb, so the two notions quantify over the same covers with the same terms.

F1
1.2

For a sequence of nonnegative reals, the nonnegative extended sum is the supremum of the partial sums, so the condition that the volume series converges with sum at most ε says exactly that this sum, taken in [0,+], is at most ε.

F2
2.1

Hence E is null in the published sense if and only if for every real ε>0 some admissible cube cover has total volume at most ε, which says exactly that the infimum λcb(E) is 0; and λcb(E)=λm(E).

step 1.1step 1.2L1
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A property holding outside a set of elementary measure zero is exactly a property holding λ-almost everywhere

Statement

Let m1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Then:

  1. A subset of R has measure zero in the covering sense of Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover) if and only if it is Lebesgue measurable with λ1-measure 0; and a subset of Rm is null in the covering sense of Measure zero and content zero in Rm by countable and finite cube covers if and only if it is Lebesgue measurable with λm-measure 0.
  2. For a property P of points of Rm, the exceptional set {xRm:P(x) fails} is null in the covering sense if and only if P holds λm-almost everywhere (Measure-null sets and almost-everywhere statements relative to a measure).

Facts & Assumptions

Given: A natural number m1, the Axiom of Countable Choice, and a property P of points of Rm with exceptional set N0.

[L3]

Assuming countable choice, L(Rm) is a sigma-algebra, λm is a complete measure on it and is the restriction of λm, and every S with λm(S)=0 is Lebesgue measurable of measure 0 (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[L4]

Assuming countable choice, λm is an outer measure on Rm, hence monotone (Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume, Outer measures).

[F1]

A property P(x) holds μ-almost everywhere if its exceptional set is contained in a measurable μ-null set: there is NA with μ(N)=0 such that P(x) holds for every xXN (Measure-null sets and almost-everywhere statements relative to a measure).

Proof

technique · direct
1.1

A set with Lebesgue outer measure 0 is Lebesgue measurable of measure 0, and conversely a Lebesgue measurable set of measure 0 has outer measure 0, since λm is the restriction of λm.

L3
2.1

Combining step 1.1 with the two agreement theorems gives claim 1 in both dimensions: covering nullity and Lebesgue nullity name the same class of sets.

step 1.1L1L2
3.1

If N0 is null in the covering sense then λm(N0)=0, so N0 itself is a measurable null set containing the exceptional set and P holds λm-almost everywhere; conversely if P holds λm-almost everywhere, with N0N measurable and λm(N)=0, then monotonicity gives λm(N0)λm(N)=0 and N0 is null in the covering sense.

step 1.1step 2.1L2L4F1
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

A bounded function on a closed bounded interval, or on a closed nondegenerate rectangle, is Riemann integrable exactly when its discontinuity set has Lebesgue measure zero

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

  1. Let a<b be reals and let f:[a,b]R be bounded, with discontinuity set D. Then f is Riemann integrable on [a,b] if and only if D is Lebesgue measurable with λ1(D)=0.
  2. Let m1 and let f be a bounded real function on a closed nondegenerate rectangle in Rm, with discontinuity set D. Then f is Riemann integrable if and only if D is Lebesgue measurable with λm(D)=0.

The choice ledger of the cited criteria is inherited, not discharged. In Lebesgue's criterion for Riemann integrability: a bounded f on [a,b] is Riemann integrable if and only if its set of discontinuities has measure zero the implication from integrability to nullity of D uses countable choice and the converse implication is a theorem of ZF; the translation performed here rests on the construction of λ, which uses countable choice in both directions, so the statement above carries the hypothesis throughout.

Facts & Assumptions

Given: The Axiom of Countable Choice, a bounded real function on a closed bounded interval or on a closed nondegenerate rectangle, and its discontinuity set D.

[L1]

Assuming countable choice, λ1(A)=0 if and only if AR has measure zero in the covering sense, and a set of Lebesgue outer measure zero is measurable of measure zero (A subset of R has Lebesgue outer measure zero if and only if it has measure zero in the sense of countable closed-interval covers, Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[L2]

Assuming countable choice, λm(E)=0 if and only if ERm is null in the covering sense (A subset of Rm has Lebesgue outer measure zero if and only if it is null in the sense of countable closed-cube covers).

[F1]

Let a<b be reals, let f:[a,b]R be bounded and let D be its set of discontinuities; then f is Riemann integrable on [a,b] if and only if D has measure zero (Lebesgue's criterion for Riemann integrability: a bounded f on [a,b] is Riemann integrable if and only if its set of discontinuities has measure zero, Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

[F2]

A bounded real function on a closed nondegenerate rectangle in Rm, m1, is Riemann integrable if and only if its discontinuity set is null (Lebesgue's criterion in Rm: a bounded function on a closed nondegenerate rectangle is Riemann integrable iff its discontinuity set is null, Measure zero and content zero in Rm by countable and finite cube covers).

[F3]

A measurable set NA is μ-null if μ(N)=0 (Measure-null sets and almost-everywhere statements relative to a measure).

Proof

technique · direct
1.1

On the line, "D has measure zero" in the covering sense of the cited criterion is equivalent to λ1(D)=0, and a set of Lebesgue outer measure zero is Lebesgue measurable of measure zero, while conversely λ1(D)=0 for a measurable D says λ1(D)=0.

L1F3
1.2

In Rm, "the discontinuity set is null" in the covering sense of the cited criterion is likewise equivalent to λm(D)=0, hence to D being Lebesgue measurable with λm(D)=0.

L1L2F3
2.1

Substituting these equivalences into the two published criteria gives claims 1 and 2.

step 1.1step 1.2F1F2
RemarkRemark: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The published refutations separating nullity from nowhere density hold verbatim for Lebesgue measure

Assume the Axiom of Countable Choice. Two notions of smallness for subsets of R are now in play: being λ1-null, and being nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of R). Neither implies the other, and the two published refutations transfer to Lebesgue measure without a new argument, because A subset of R has Lebesgue outer measure zero if and only if it has measure zero in the sense of countable closed-interval covers identifies λ1(A)=0 with the covering condition of Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover) that those items are stated in.

Null does not imply nowhere dense. FALSE: every subset of R of measure zero is nowhere dense records the false claim and its witness. Read through the agreement theorem, the witness is a λ1-null set whose closure is all of R; the rationals of the line are one, and their nullity is also the case n=1 of Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0.

Nowhere dense does not imply null. FALSE: every nowhere dense subset of R has measure zero records that false claim, and The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero proves of the Smith–Volterra–Cantor set S that it is compact, perfect and nowhere dense while no cover of it by intervals has total length below 21. The equality of the closed-interval cover infimum with Lebesgue outer measure in Countable covers by closed boxes, by open boxes and by closed cubes all compute Lebesgue outer measure therefore gives λ1(S)21, so S is nowhere dense and not λ1-null. The exact value λ1(S)=1/2 is computed on the companion page.

Why the transfer needs saying at all. The published items were written before any outer measure existed here, so they are stated as assertions about interval covers and cannot mention λ1. Without the agreement theorem, a reader meeting both vocabularies would have two apparently unrelated notions of "measure zero" on the line; with it there is one notion, and the earlier refutations keep their force in the new vocabulary.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Lebesgue outer measure is at most Jordan outer content, and a bounded Jordan measurable set is Lebesgue measurable with Lebesgue measure equal to its Jordan content

Statement

Let m1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Write c(E) and c(E) for the Jordan outer and inner content of a bounded ERm (Jordan inner and outer content and Jordan measurable bounded sets in Rm). Then:

  1. λm(E)c(E) for every bounded ERm, Jordan measurable or not;
  2. if E is bounded and Jordan measurable, with Jordan content cont(E)=c(E)=c(E), then E is Lebesgue measurable and λm(E)  =  cont(E).

Facts & Assumptions

Given: A natural number m1, the Axiom of Countable Choice, and a bounded set ERm.

[L1]

Assuming countable choice, λcl(E)=λm(E), the infimum of k=0vol[uk,vk] over countable covers of E by closed rectangles (Countable covers by closed boxes, by open boxes and by closed cubes all compute Lebesgue outer measure).

[L2]

Assuming countable choice, λm(E)=0 if and only if E is null in the covering sense of closed-cube covers (A subset of Rm has Lebesgue outer measure zero if and only if it is null in the sense of countable closed-cube covers, Measure zero and content zero in Rm by countable and finite cube covers).

[L3]

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

[L4]

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

[L5]

Every set R with RRR is Lebesgue measurable with λm(R)=i<m(biai), and it gives measure 0 to all of them whenever ai=bi for some i<m (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included).

[L6]

A box with a degenerate side is Lebesgue measurable of measure 0 (A box with a degenerate side is Lebesgue null, and so is every coordinate hyperplane in Rn).

[F1]

For bounded ERm its Jordan outer content is the infimum of r<qvol(Rr) over finite axis-parallel rectangle covers of E, its Jordan inner content is the supremum of the same sums over finite families of rectangles contained in E whose interiors are pairwise disjoint, and the set is Jordan measurable when the contents agree (Jordan inner and outer content and Jordan measurable bounded sets in Rm, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).

[F2]

A metric-bounded set ERm is Jordan measurable if and only if its boundary E is null, equivalently has content zero (A bounded set in Rm is Jordan measurable iff its boundary is null, equivalently of content zero).

[F3]

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

[F5]

A measure is countably additive on pairwise disjoint measurable sequences (Measures on sigma-algebras), it is monotone (Measures are monotone), and it is finitely and countably subadditive (Finite and countable subadditivity of measures).

[F6]

The nonnegative extended sum of a sequence in [0,+] is the supremum of its nondecreasing partial sums (Series in the nonnegative extended real line), and for real sequences k<nakk<nbk whenever akbk throughout (Laws of finite sums and finite products, claim 4; Finite sums and finite products, by recursion).

Proof

technique · direct
1.1

A finite cover of E by axis-parallel rectangles R0,,Rq1 becomes a countable cover by closed rectangles once it is padded with copies of the degenerate rectangle [0,0], whose volume is 0, and the padded series has the same value, so λm(E)=λcl(E)r<qvol(Rr); taking the infimum over all finite rectangle covers gives claim 1.

L1F1F3F6
1.2

Two closed rectangles R and R with disjoint interiors meet in a set with empty interior, and that intersection is either empty or the closed rectangle whose i-th side is [max{ai,ai},min{bi,bi}]; a nonempty closed rectangle with empty interior has max{ai,ai}=min{bi,bi} for some i, so it is Lebesgue measurable of measure 0.

L5L6F3F4
1.3

If E is bounded and Jordan measurable, then E is null in the covering sense, hence λm(E)=0 and EE is Lebesgue measurable of measure 0; int(E) is open, hence Borel and Lebesgue measurable; and E=int(E)(EE) because int(E)EE=int(E)E, so E is Lebesgue measurable.

L2L3L4F2F4
2.1

Let R0,,Rq1 be closed rectangles contained in E with pairwise disjoint interiors and put Dr:=Rrs<rRs; each Rrs<rRs is a finite union of sets of measure 0 by step 1.2, hence of measure 0, so additivity on the decomposition Rr=Dr(Rrs<rRs) gives λm(Dr)=λm(Rr)=vol(Rr), and the Dr are pairwise disjoint measurable sets with union r<qRr, so λm(r<qRr)=r<qvol(Rr).

step 1.2L3L5F3F5
3.1

For E bounded and Jordan measurable, step 1.3 makes E measurable, step 1.1 gives λm(E)=λm(E)c(E), and step 2.1 with monotonicity gives r<qvol(Rr)=λm(r<qRr)λm(E) for every admissible inner family, hence c(E)λm(E); since c(E)=c(E)=cont(E), the two bounds force λm(E)=cont(E).

step 1.1step 1.3step 2.1L3F1F5
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The Cantor set is an uncountable subset of R of Lebesgue measure zero

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). The Cantor middle-thirds set C (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds) is Lebesgue measurable with

λ1(C)=0,

and C is uncountable (Finite, countably infinite, countable, uncountable).

Facts & Assumptions

Proof

technique · direct
1.1

The published theorem gives that C has measure zero in the covering sense, so the agreement theorem gives λ1(C)=0.

L1F1
2.1

A set of Lebesgue outer measure zero is Lebesgue measurable with measure zero, so λ1(C)=0, while the same published theorem gives that C is uncountable.

step 1.1L2F1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation

Statement

Let n1, let hRn, and let E+h be the translate of ERn (Translation of a subset of Rn). Then:

  1. λn(E+h)=λn(E) for every subset E;
  2. E is Lebesgue measurable if and only if E+h is;
  3. λn(E+h)=λn(E) for every Lebesgue measurable E.

No choice principle is used. Lebesgue outer measure is defined as an infimum and the Carathéodory condition is a family of equations between its values, so all three clauses are statements about objects that exist in ZF; countable choice is needed to know that λn is a measure, not to know that it is translation invariant.

Facts & Assumptions

Given: A natural number n1, a vector hRn, and a subset ERn.

[L1]

λn(E):=inf{k=0μ0(Ak):AkEn for every k and EkAk} (Lebesgue outer measure on Rn, Series in the nonnegative extended real line).

[L2]

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

[L3]

A subset ERn is an elementary set when there are a natural number m and a list B0,,Bm1 of half-open boxes with E=j<mBj (Elementary sets: the finite unions of half-open boxes in Rn), and every elementary set is the union of a finite list of pairwise disjoint half-open boxes (Every elementary set is a finite disjoint union of half-open boxes, and any finitely many boxes admit a common grid refinement).

[L4]

For every n1, elementary volume μ0 on En has value at A the sum of the volumes of the members of any presentation of A by a finite list of pairwise disjoint half-open boxes (The sum of the volumes of a disjoint box decomposition of an elementary set does not depend on the decomposition).

[L5]

A set E is Lebesgue measurable when λn(A)=λn(AE)+λn(AE) for every ARn, and λn is the restriction of λn to the family of these (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn, Carathéodory measurable sets).

[F1]

The translate of ERn by a is E+a:={x+a:xE}; translation by a is the bijection τa(x)=x+a, whose inverse is τa (Translation of a subset of Rn).

[F2]

Addition of a real to an extended real is defined in every case, with a+b:=+ when a=+ and b, and a+b:= when a= and b+ (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

Proof

technique · direct
1.1

For a parameter pair (a,b) one has B(a,b)+h=B(a+h,b+h), where a+h is the parameter iai+hi: a point y lies in the left side exactly when yh satisfies ai<yihibi, that is ai+hi<yibi+hi. The translated box is empty exactly when the original is, and has the same volume, because (bi+hi)(ai+hi)=biai when both are real and an infinite parameter stays infinite.

L2F1F2
2.1

Consequently, if A=j<qBj is a presentation of an elementary set by pairwise disjoint half-open boxes, then A+h=j<q(Bj+h) is such a presentation of A+h, so A+h is elementary and μ0(A+h)=μ0(A).

step 1.1L3L4
3.1

A sequence (Ak) of elementary sets covers E if and only if the sequence (Ak+h) covers E+h, and the two covering costs are equal by step 2.1; the correspondence is a bijection between the two families of covers, with inverse given by translating by h, so the two infima agree and λn(E+h)=λn(E).

step 2.1L1F1
4.1

For test sets, A(E+h)=((Ah)E)+h and A(E+h)=((Ah)E)+h, so by step 3.1 the Carathéodory identity for E+h tested against A is exactly the identity for E tested against Ah; as A ranges over all subsets so does Ah, and therefore E+h is Lebesgue measurable if and only if E is, with λn(E+h)=λn(E+h)=λn(E)=λn(E) in that case.

step 3.1L5F1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

For a nonzero real c, dilation by c multiplies Lebesgue outer measure by cn, and reflection in the origin preserves it

Statement

Let n1, assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), let c be a nonzero real and write cE:={cx:xE} for ERn, where (cx)i:=cxi. Then:

  1. λn(cE)=cnλn(E) for every subset E, the product being defined in R because cn>0;
  2. E is Lebesgue measurable if and only if cE is;
  3. λn(cE)=cnλn(E) for every Lebesgue measurable E.

At c=1 the map is reflection in the origin and cn=1, so it preserves outer measure, measurability and measure. The value c=0 is excluded because 0E is {0} or and carries no information about E.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, a nonzero real c, and a subset ERn.

[L1]

Assuming countable choice, λcl(E)=λn(E), the infimum of k=0vol[uk,vk] over countable covers of E by closed rectangles (Countable covers by closed boxes, by open boxes and by closed cubes all compute Lebesgue outer measure, Lebesgue outer measure on Rn).

[L2]

A set E is Lebesgue measurable when λn(A)=λn(AE)+λn(AE) for every ARn, and λn is the restriction of λn to the family of these (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn, Carathéodory measurable sets, Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[F1]

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

[F2]

k<n(akbk)=(k<nak)(k<nbk), and finite products are defined by the recursion Π0=1, Πσ(n)=Πnan (Laws of finite sums and finite products, claim 6; Finite sums and finite products, by recursion).

[F3]

The defining recursion for natural powers is a0=1 and an+1=ana (Integer powers am), and (ab)n=anbn (Laws of integer exponents, claim 1).

[F4]

ab:=+ when one of a,b is ±, the other is 0, and both are >0 or both are <0; every product with one factor 0 and the other ± is left undefined (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

[F5]

The absolute value satisfies c>0 for c0 and cd=cd (Absolute value in an ordered field, Basic properties of the absolute value).

[F6]

For positive reals, multiplication preserves order and reciprocals stay positive: if 0<q and uv then quqv, and if 0<q then 0<q1 (Sign rules for products and monotonicity of multiplication, Inverses of positives are positive, and reciprocation reverses order, Ordered field).

Proof

technique · direct
1.1

For reals uivi one has c[u,v]=[cu,cv] when c>0 and c[u,v]=[cv,cu] when c<0, in both cases a closed rectangle whose i-th side length is c(viui); its volume is therefore i<n(c(viui))=(i<nc)i<n(viui)=cnvol[u,v].

F1F2F3F5
1.2

Put q:=cn>0. If s0=infS for a nonempty S[0,+], then qs0 is a lower bound of qS:={qs:sS}: for every real sS the inequality s0s gives qs0qs by [F6], while the claim is automatic when s=+. Conversely, let t be a lower bound of qS. If t=+, then every element of qS is +, hence every element of S is + and therefore s0=+. If t is real, then q1>0 by [F6], so tqs implies q1ts for every real sS, and again the claim is automatic when s=+; thus q1t is a lower bound of S, so q1ts0 and therefore tqs0. Hence inf(qS)=qinfS.

F3F4F5F6
2.1

The assignment [u,v]c[u,v] is a bijection from the countable closed-rectangle covers of E onto those of cE, with inverse given by multiplication by c1. For one such cover, let (ak) be its sequence of rectangle volumes and (sn) the partial sums of k=0ak in the sense of Series in the nonnegative extended real line; let (tn) be the partial sums of the transformed cover cost. By step 1.1 each transformed term is qak, and the shared recursion of nonnegative extended series gives tn=qsn for every n. Therefore the transformed cover cost is qk=0ak by step 1.2. So step 1.2 turns the infimum of all transformed cover costs into λcl(cE)=cnλcl(E), and [L1] then gives the same identity for λn.

step 1.1step 1.2L1F6
3.1

For a test set A one has AcE=c((c1A)E) and AcE=c((c1A)E), so step 2.1 turns the Carathéodory identity for cE tested against A into cn times the identity for E tested against c1A; multiplication by the positive real cn is injective on [0,+], and Ac1A is a bijection of the power set, so cE is Lebesgue measurable exactly when E is, and then λn(cE)=λn(cE)=cnλn(E)=cnλn(E).

step 2.1L2F4F5
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A translation-invariant Borel measure giving the unit cube measure one gives each generation-k dyadic cube measure 2kn

Statement

Let n1 and let μ be a measure on (Rn,B(Rn)) (Measures on sigma-algebras, The Borel sigma-algebra of a topological space) such that

μ(E+h)=μ(E)for every Borel E and every hRn,μ((0,1]n)=1.

Then μ(Q)=2kn for every dyadic cube Q of generation k (Dyadic cubes of generation k in Rn).

Only translates of half-open boxes are used, and those are Borel (The sigma-algebra generated by the half-open boxes of Rn is the Borel sigma-algebra), so the invariance hypothesis is applied only where it is unambiguously meaningful.

Facts & Assumptions

Given: A natural number n1, a natural number k, and a measure μ on the Borel sets of Rn that is translation invariant and gives the unit cube measure 1.

[L1]

Qk,m={xRn:mi2k<xi(mi+1)2k for every i<n}, and Q0,0=(0,1]n (Dyadic cubes of generation k in Rn, Half-open boxes in Rn and their volume, Integer powers am).

[L2]

Every xRn lies in exactly one dyadic cube of generation k (For each generation, the dyadic cubes of that generation are pairwise disjoint and cover Rn).

[F1]

A measure on (X,A) is a function μ:A[0,+] with μ()=0 that is countably additive on pairwise disjoint sequences (Measures on sigma-algebras); padding a finite disjoint list with empty sets makes it finitely additive.

[F2]

The translate of ERn by a is E+a:={x+a:xE} (Translation of a subset of Rn).

[F3]

k<nλ=nλ, where n denotes the canonical natural of R (Laws of finite sums and finite products, claim 2; Finite sums and finite products, by recursion).

[F4]

For a0 and m,nZ, am+n=aman and (am)n=amn (Laws of integer exponents, claims 1 and 3; Integer powers am).

[F5]

Let SN; if 0S and σ(n)S whenever nS, then S=N (The principle of mathematical induction).

[F6]

The order on Z is total and compatible with addition (The integers form a totally ordered ring); the canonical embedding of N into Z has as image exactly the nonnegative integers (The naturals embed in the integers, The integers as equivalence classes of pairs of naturals); and m<n in N exactly when σ(m)n (Discreteness: σ(n) is the immediate successor).

Proof

technique · direct
1.1

A generation-k dyadic cube is contained in (0,1]n exactly when 0mi and mi+12k for every i<n, and every point of (0,1]n lies in such a cube: if x(0,1]n and m is the index of the generation-k cube containing x, then mi<2kxi2k and mi+12kxi>0, so 0mi and mi+12k by discreteness of Z; conversely such a cube lies in (0,1]n because mi2k0 and (mi+1)2k1.

L1L2F4F6
1.2

Every generation-k dyadic cube is a translate of Qk,0=(0,2k]n, namely Qk,m=Qk,0+m2k, and it is a half-open box, hence Borel; so all generation-k cubes receive the same value under μ.

L1L3F2
2.1

The indices admitted in step 1.1 are exactly the functions from n to the set {jN:j<2k}, and there are 2kn of them: by induction on n, at n=0 there is exactly one such function and 20=1, while each function on n+1 coordinates is a function on n coordinates together with one of 2k values in the new coordinate, so the count is multiplied by 2k and (2k)n2k=(2k)n+1=2k(n+1).

F4F5F6
3.1

By steps 1.1 and 2.1 the cube (0,1]n is the union of a list of 2kn pairwise disjoint generation-k dyadic cubes, so finite additivity and step 1.2 give 1=μ((0,1]n)=r<2knμ(Qk,0); no term can be +, since then the sum would be + rather than 1, so the common value is a real and the sum is 2knμ(Qk,0).

step 1.1step 1.2step 2.1L2F1F3
4.1

Dividing by the strictly positive real 2kn gives μ(Qk,0)=2kn, and step 1.2 transfers the value to every generation-k dyadic cube.

step 1.2step 3.1F4
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

A translation-invariant measure on the Borel sets of Rn giving the unit cube measure one is the restriction of Lebesgue measure

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let μ be a measure on (Rn,B(Rn)) (Measures on sigma-algebras) such that μ(E+h)=μ(E) for every Borel set E and every hRn, and μ((0,1]n)=1. Then

μ(E)  =  λn(E)for every EB(Rn).

The hypothesis is meaningful because a translate of a Borel set is Borel, and it is satisfied by the restriction of λn to B(Rn), so the theorem says that measure is the only one satisfying it. Finiteness on bounded sets is a consequence of the normalisation, not a further hypothesis.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, and a translation-invariant measure μ on B(Rn) with μ((0,1]n)=1.

[L1]

If μ is a measure on the Borel sets of Rn that is translation invariant and gives the unit cube measure 1, then μ(Q)=2kn for every dyadic cube Q of generation k (A translation-invariant Borel measure giving the unit cube measure one gives each generation-k dyadic cube measure 2kn, Dyadic cubes of generation k in Rn).

[L2]

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

[L4]

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

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

[L6]

λn(E+h)=λn(E) for every subset E, E is Lebesgue measurable if and only if E+h is, and λn(E+h)=λn(E) for measurable E (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, Translation of a subset of Rn).

[F1]

Let P be a pi-system on X generating A, and let μ,ν be measures on (X,A) that agree on P; suppose there is an increasing sequence (Pn) in P with X=nPn and μ(Pn)=ν(Pn)<+ for every n; then μ=ν on A (Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system).

[F2]

A pi-system on X is a nonempty family PP(X) closed under binary intersections (Pi-systems).

[F3]

The Borel sigma-algebra of X is the sigma-algebra generated by its open sets (The Borel sigma-algebra of a topological space), and σX(E) is the unique smallest sigma-algebra on X containing E (Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal); a sigma-algebra is closed under complements and countable unions (Sigma-algebras).

[F5]

A measure is countably additive on pairwise disjoint measurable sequences (Measures on sigma-algebras), and an at most countable family may be presented as a sequence (Finite, countably infinite, countable, uncountable).

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

Proof

technique · direct
1.1

A translate of a Borel set is Borel: the family of ERn whose translate E+h is Borel contains every open set, since d2(x+h,y+h)=d2(x,y) makes B(x,r)+h=B(x+h,r) and hence U+h open for open U, and it is a sigma-algebra because translation commutes with complements and with countable unions; minimality of B(Rn) over the open sets finishes it.

F3F4
1.2

The open subsets of Rn form a pi-system generating B(Rn): the family is nonempty and closed under binary intersections, and the Borel sigma-algebra is by definition the one it generates.

F2F3F4
1.3

The restriction of λn to the Borel sets is a measure satisfying the two hypotheses, by translation invariance and by λn((0,1]n)=1.

L4L5L6
2.1

By the dyadic lemma both μ and λn give a generation-k dyadic cube the value 2kn, the latter because a dyadic cube is a half-open box of that volume.

step 1.3L1L3L4
3.1

Both measures therefore agree on every open set: such a set is the union of an at most countable pairwise disjoint family of dyadic cubes, which may be presented as a sequence, and countable additivity gives the same value for the two measures.

step 2.1L2F5
4.1

The open cubes Pk:={x:xi<k+1 for every i<n} form an increasing sequence of open sets with union Rn, by the Archimedean property, and μ(Pk)=λn(Pk)=(2k+2)n<+ by step 3.1 and the box theorem; the uniqueness theorem for a sigma-finite generating pi-system therefore gives μ=λn on B(Rn), and step 1.1 makes the invariance hypothesis meaningful throughout.

step 1.1step 1.2step 3.1L5F1F6
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

An invertible linear map of Rn scales the Lebesgue measure of every Borel set by a positive constant depending only on the map

Statement

Let n1, assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and let T:RnRn be an invertible linear map (Linear map between vector spaces over the same field). Then:

  1. T[E] is a Borel set for every Borel set E, and T carries open sets to open sets;
  2. there is a strictly positive real c(T), namely c(T)=λn(T[(0,1]n]), with λn(T[E])  =  c(T)λn(E)for every EB(Rn);
  3. c(ST)=c(S)c(T) for invertible linear S and T, and c(id)=1.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, and an invertible linear map T of Rn.

[L1]

Assuming countable choice, a measure μ on B(Rn) with μ(E+h)=μ(E) for every Borel E and every h, and with μ((0,1]n)=1, equals λn on B(Rn); in particular the theorem notes that the restriction of λn to B(Rn) satisfies these hypotheses (A translation-invariant measure on the Borel sets of Rn giving the unit cube measure one is the restriction of Lebesgue measure).

[L3]

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

[F1]

For every linear L:RmRn there is a unique matrix A such that (Lh)i=j<maijhj, and there is K0 with Lh2Kh2 for every h (Every Euclidean linear map has a unique matrix and satisfies Lh2Kh2 for some K0, Linear map between vector spaces over the same field).

[F2]

The translate of ERn by a is E+a:={x+a:xE} (Translation of a subset of Rn).

[F3]

A measure on (X,A) is a function μ:A[0,+] with μ()=0 that is countably additive on pairwise disjoint sequences (Measures on sigma-algebras), and a scalar multiple cμ is again a measure (Nonnegative scalar multiples and countable weighted sums of measures are measures, Nonnegative scalar multiples and countable weighted sums of measures).

[F4]

The Borel sigma-algebra is the sigma-algebra generated by the open sets (The Borel sigma-algebra of a topological space), σX(E) is the smallest sigma-algebra containing E (Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal), and a sigma-algebra is closed under complements and countable unions (Sigma-algebras).

Proof

technique · direct
1.1

The inverse T1 is linear, so there are reals K0 and KT0 with T1y2Ky2 and Tx2KTx2 for all x,y; put K:=K+1>0.

F1F6
2.1

T carries open sets to open sets: if U is open, y=TxT[U] and B(x,r)U, then d2(y,z)<r/K gives d2(x,T1z)=T1(yz)2Kd2(y,z)<r, so T1zU and zT[U].

step 1.1F1F5F6
3.1

The family of ERn with T[E] Borel is a sigma-algebra, because T is a bijection and so T[] commutes with complements and with countable unions, and it contains every open set by step 2.1; minimality of B(Rn) over the open sets gives claim 1.

step 2.1F4
3.2

T[(0,1]n] is bounded, being contained in the ball about the origin of radius KTn+1, so it has finite measure; and it contains T[V] for the nonempty open box V:={x:0<xi<1 (i<n)}, which is open and nonempty by step 2.1, hence contains a ball B(y,r) and with it the open box {x:xiyi<r/n}, whose measure (2r/n)n is a strictly positive real. So c(T):=λn(T[(0,1]n]) is a strictly positive real.

step 2.1L2L3L4F1F5F6
4.1

The assignment ν(E):=λn(T[E]) is well defined on B(Rn) by claim 1, and it is a measure: ν()=0, and T being injective carries a pairwise disjoint sequence to a pairwise disjoint sequence with T[kEk]=kT[Ek], so countable additivity of λn transfers. It is translation invariant, since T[E+h]=T[E]+T(h) by linearity and λn is translation invariant.

step 3.1L1L2F2F3
5.1

By step 3.2 the scalar multiple c(T)1ν is a measure on B(Rn), it is translation invariant, and it gives the unit cube the value 1, so the uniqueness theorem identifies it with λn on the Borel sets; that is claim 2. Claim 3 follows by evaluating at the unit cube: c(ST)=λn(S[T[(0,1]n]])=c(S)λn(T[(0,1]n])=c(S)c(T), and the identity map gives c(id)=λn((0,1]n)=1.

step 3.2step 4.1L1L3F3
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A coordinate scaling and a coordinate transposition send the unit cube to a set of measure equal to the absolute value of the determinant

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Work with real matrices and identify a matrix with the linear map it defines by (Ax)i=j<naijxj (Every Euclidean linear map has a unique matrix and satisfies Lh2Kh2 for some K0).

  1. Coordinate scaling. Let p<n, let c0 be real and let Dp(c) be the elementary matrix obtained from the identity by multiplying row p by c (Elementary matrices obtained by applying one elementary row operation to an identity matrix). Then Dp(c) sends x to the point whose p-th coordinate is cxp and whose other coordinates are those of x, the image Dp(c)[(0,1]n] is Lebesgue measurable, and λn(Dp(c)[(0,1]n])  =  c  =  detDp(c).
  2. Coordinate transposition. Let n2, let pq be below n and let Epq be the elementary matrix interchanging rows p and q. Then Epq exchanges the p-th and q-th coordinates, Epq[(0,1]n]=(0,1]n, and λn(Epq[(0,1]n])  =  1  =  detEpq.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, and the elementary matrices Dp(c) and Epq over R.

[L1]

If aibi are real for i<n, then any box obtained from the coordinate interval product i<n[ai,bi] by independently choosing for each endpoint whether it is included has Lebesgue measure i<n(biai) (A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included). In particular (u,v]n=B(u,v) (Half-open boxes in Rn and their volume).

[F1]

An elementary matrix is a matrix obtained by applying one elementary row operation to the identity matrix In; there are three types: Epq interchanges rows p and q; Dp(c) multiplies row p by c0; and Tpq(c) adds c times row q to the distinct row p (Elementary matrices obtained by applying one elementary row operation to an identity matrix, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

[F2]

Let n1 and let AMn(R) be a matrix over a commutative ring; interchanging two rows changes det(A) to det(A), and multiplying one row by any cR changes it to cdet(A) (For every square matrix, including singular ones, a row swap negates the determinant, scaling a row by any scalar scales it, and row addition leaves it unchanged, claims 1 and 2; For n1, the determinant over a commutative ring by the Leibniz formula, and detA for a real matrix).

[F3]

If A is upper or lower triangular over a commutative ring, with n1, then det(A)=i<naii (The determinant of a triangular matrix is the product of its diagonal entries).

[F4]

For every linear L:RmRn there is a unique matrix A such that (Lh)i=j<maijhj (Every Euclidean linear map has a unique matrix and satisfies Lh2Kh2 for some K0).

[F5]

The absolute value satisfies c>0 for c0, c=c for c0 and c=c for c0 (Absolute value in an ordered field, Basic properties of the absolute value).

Proof

technique · direct
1.1

The identity matrix is triangular with every diagonal entry 1, so detIn=1; the row-operation table applied to In then gives detDp(c)=c and detEpq=1, hence detDp(c)=c and detEpq=1.

F1F2F3F5
1.2

Reading off the matrix entries, Dp(c) sends x to the point with p-th coordinate cxp and the other coordinates unchanged, and Epq sends x to the point with p-th coordinate xq, q-th coordinate xp and the others unchanged.

F1F4
2.1

For claim 1, Dp(c)[(0,1]n]={x:0<xi1 for ip, xpc(0,1]}. When c>0 this is the half-open box with p-th side (0,c]; when c<0 it is the box with p-th side [c,0) and all other sides (0,1]. In either case [L1] gives Lebesgue measurability and measure i<n(biai)=c.

step 1.2L1F5
2.2

For claim 2, Epq restricts to a bijection of (0,1]n onto itself, since exchanging two coordinates of a point all of whose coordinates lie in (0,1] again gives such a point and the map is its own inverse; hence the image is (0,1]n, of measure 1.

step 1.2L1
3.1

Steps 1.1, 2.1 and 2.2 are the two claims.

step 1.1step 2.1step 2.2
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

A shear sends the unit cube to a set of Lebesgue measure one

Statement

Let n2, assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), let ij be below n and let t be real. Let T be the linear map with matrix the elementary matrix Tij(t) obtained from the identity by adding t times row j to row i (Elementary matrices obtained by applying one elementary row operation to an identity matrix), so that

T(x)i=xi+txj,T(x)l=xl(li).

Then T[(0,1]n] is Lebesgue measurable and

λn(T[(0,1]n])  =  1  =  detTij(t).

Facts & Assumptions

Given: A natural number n2, the Axiom of Countable Choice, distinct indices i,j<n, a real t, and the shear T with matrix Tij(t).

[L1]

λn(E+h)=λn(E) for every Lebesgue measurable E and every h (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, Translation of a subset of Rn).

[L2]

An invertible linear map carries Borel sets to Borel sets and open sets to open sets (An invertible linear map of Rn scales the Lebesgue measure of every Borel set by a positive constant depending only on the map, claim 1).

[L4]

For real parameters albl, every set R between the open box R and closed box R is Lebesgue measurable with λn(R)=l<n(blal) (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]

An elementary matrix is a matrix obtained by applying one elementary row operation to In; Tpq(c) adds c times row q to the distinct row p (Elementary matrices obtained by applying one elementary row operation to an identity matrix, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes), and for every linear map there is a unique such matrix acting by (Ax)i=l<nailxl (Every Euclidean linear map has a unique matrix and satisfies Lh2Kh2 for some K0).

[F3]

For every real x there is exactly one integer p with px<p+1 (Integer part: for every real x there is exactly one integer m with mx<m+1).

[F4]

A measure is countably additive on pairwise disjoint measurable sequences, hence finitely additive after padding with empty sets (Measures on sigma-algebras).

[F5]

A subset U is open in (X,d) when every xU has a ball B(x,r)U, a subset is closed when its complement is open, and a finite intersection of open sets is open (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space, Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, claim 3).

[F7]

The Borel sigma-algebra is the sigma-algebra generated by the open sets, and a sigma-algebra is closed under complements and countable unions (The Borel sigma-algebra of a topological space, Sigma-algebras); in particular every open and every closed subset of Rn is Borel.

Proof

technique · direct
1.1

The matrix Tij(t) is obtained from the identity by a row addition, so detTij(t)=detIn=1 and T is invertible, with inverse the shear Tij(t); consequently T carries Borel sets to Borel sets.

L2F1F2
1.2

For every real s there is exactly one integer k with k<sk+1: applying the integer part to s gives the unique integer p with ps<p+1, and k:=p1 is the integer sought, uniqueness following the same way.

F3
1.3

The linear functional L(x):=xi+txj satisfies L(x)L(y)(1+t)d2(x,y), so for every real s the set {x:L(x)>s} is open and {x:L(x)s} is closed. Also (0,1]n=[0,1]nl<n{x:xl>0}, with [0,1]n closed and each {x:xl>0} open, hence Borel by [F7]; therefore each Ak:=(0,1]n{x:L(x)>k}{x:L(x)k+1} is a Borel set.

F1F5F6F7
1.4

Only finitely many integers k admit a point of Ak: for x(0,1]n one has tL(x)1+t, so k<1+t and k+1>t, and the integers satisfying both lie between the two integers supplied by the integer part of t1 and of 1+t, hence form a finite consecutive list K,,K+.

F3
2.1

By step 1.2 every x(0,1]n lies in exactly one Ak, so the sets Ak for k in the list of step 1.4 are pairwise disjoint with union (0,1]n.

step 1.2step 1.4
3.1

Define Φ:(0,1]nRn by Φ(x):=T(x)kei for the unique k with xAk, where ei is the i-th standard vector. Then Φ takes values in (0,1]n, since its i-th coordinate is L(x)k(0,1] and its other coordinates are those of x.

step 1.2step 2.1F1
4.1

Φ is a bijection of (0,1]n onto itself. It is injective: if Φ(x)=Φ(y) then xl=yl for every li, so xj=yj and xiyi=k(x)k(y) is an integer of absolute value below 1, hence 0. It is surjective: given z(0,1]n, step 1.2 supplies the unique integer k with zitzj+k(0,1]; setting xl:=zl for li and xi:=zitzj+k gives x(0,1]n with L(x)=zi+k(k,k+1], so xAk and Φ(x)=z.

step 1.2step 3.1
5.1

The sets T[Ak] are pairwise disjoint, Borel and have union T[(0,1]n], because T is an injective linear bijection; each T[Ak]kei=Φ[Ak], so translation invariance gives λn(T[Ak])=λn(Φ[Ak]); and by step 4.1 the sets Φ[Ak] are pairwise disjoint with union (0,1]n.

step 1.1step 1.3step 2.1step 3.1step 4.1L1L3
6.1

Finite additivity applied twice therefore gives λn(T[(0,1]n])=kλn(T[Ak])=kλn(Φ[Ak])=λn((0,1]n)=1, which with step 1.1 is the Statement.

step 1.1step 5.1L3L4F4
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A Lipschitz self-map of Rn carries Lebesgue null sets to Lebesgue null sets

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let T:RnRn be Lipschitz for the Euclidean metric (Lipschitz map, α-Hölder map for rational 0<α1, and contraction, Rn as the set of functions nR, and d1, d2, d are metrics on it) and let ERn satisfy λn(E)=0. Then T[E] is Lebesgue measurable and

λn(T[E])  =  0.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, a Lipschitz map T of Rn into itself, and a set E with λn(E)=0.

[L1]

Assuming countable choice, λn(S)=0 if and only if S is null in the covering sense of closed-cube covers (A subset of Rm has Lebesgue outer measure zero if and only if it is null in the sense of countable closed-cube covers, Measure zero and content zero in Rm by countable and finite cube covers).

[L2]

Assuming countable choice, every SRn with λn(S)=0 is Lebesgue measurable with λn(S)=0 (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[F1]

If T:RmRm is Lipschitz and E is null, then T[E] is null (A Lipschitz map RmRm sends null sets to null sets).

[F2]

f is Lipschitz with constant L0 if dY(f(x),f(x))LdX(x,x) for all x,x (Lipschitz map, α-Hölder map for rational 0<α1, and contraction).

Proof

technique · direct
1.1

By the agreement theorem, λn(E)=0 says exactly that E is null in the covering sense of closed-cube covers.

L1
2.1

The published theorem on Lipschitz images therefore applies and gives that T[E] is null in that same covering sense, so the agreement theorem read the other way gives λn(T[E])=0; completeness then makes T[E] Lebesgue measurable with λn(T[E])=0.

step 1.1L1L2F1F2
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Every affine hyperplane of Rn, and hence every proper linear subspace, is Lebesgue null

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Then:

  1. For every uRn with u0 and every real c, the affine hyperplane Hu,c  :=  {xRn:u,x=c} (The Euclidean inner product x,y=k<nxkyk on Rn) is Lebesgue measurable with λn(Hu,c)=0, and so is every subset of it.
  2. Every proper linear subspace WRn (Linear subspace of a vector space) is Lebesgue measurable with λn(W)=0.

At n=1 a hyperplane is the singleton {c/u0} and the only proper linear subspace is {0}.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, a nonzero uRn, a real c, and a proper linear subspace W of Rn.

[L1]

Assuming countable choice, a Lipschitz self-map of Rn carries a set of Lebesgue outer measure zero to a Lebesgue measurable set of measure zero (A Lipschitz self-map of Rn carries Lebesgue null sets to Lebesgue null sets).

[L2]

For i0<n and a real c, the coordinate hyperplane {xRn:xi0=c} is Lebesgue measurable with measure 0 (A box with a degenerate side is Lebesgue null, and so is every coordinate hyperplane in Rn).

[L3]

Assuming countable choice, λn is a complete measure on L(Rn), so every subset of a measurable null set is measurable of measure 0 (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[F1]

The Euclidean inner product of x,yRn is x,y:=k<nxkyk, and it is symmetric, bilinear and positive definite, making Rn an inner product space (The Euclidean inner product x,y=k<nxkyk on Rn, Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[F2]

For a linear subspace W of an inner product space V, W:={vV:v,w=0 for every wW}, and {0}=V (The orthogonal complement W={v:v,w=0 for all wW}, Linear subspace of a vector space).

[F3]

For every subspace W of a finite-dimensional inner product space V, W=W (In finite dimension, W=W and dimW+dimW=dimV).

[F4]

For every linear L:RmRn there is K0 with Lh2Kh2 for every h (Every Euclidean linear map has a unique matrix and satisfies Lh2Kh2 for some K0, Linear map between vector spaces over the same field).

Proof

technique · direct
1.1

Fix j<n with uj0 and define Ψ:RnRn by Ψ(x)l:=xl for lj and Ψ(x)j:=(cljulxl)/uj. Then Ψ carries the coordinate hyperplane P:={x:xj=0} onto Hu,c: a point of P has u,Ψ(x)=ljulxl+ujΨ(x)j=c, and conversely a point yHu,c is Ψ(x) for the point x agreeing with y off the coordinate j and having xj=0.

F1
1.2

Ψ is Lipschitz: the difference Ψ(x)Ψ(x) equals L(xx) for the linear map L obtained from Ψ by deleting the constant c/uj, so d2(Ψ(x),Ψ(x))=L(xx)2Kd2(x,x) for a real K0.

F4F5
2.1

The coordinate hyperplane P is Lebesgue measurable of measure 0, hence of outer measure 0, so steps 1.1 and 1.2 with the Lipschitz lemma give that Hu,c=Ψ[P] is Lebesgue measurable with λn(Hu,c)=0; completeness then gives the same for every subset of it, which is claim 1.

step 1.1step 1.2L1L2L3
3.1

If W is a proper linear subspace then W{0}: otherwise W=W={0}=Rn. Choosing a nonzero uW puts W inside Hu,0, so claim 1 and completeness make W Lebesgue measurable of measure 0; at n=1 the hyperplane Hu,c is the singleton {c/u0} and the only proper subspace is {0}.

step 2.1L3F1F2F3
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=detTλn(E) when T is invertible and T[E] Lebesgue null when it is not

Statement

Let n1, assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and let T:RnRn be linear with matrix A (Linear map between vector spaces over the same field, Every Euclidean linear map has a unique matrix and satisfies Lh2Kh2 for some K0).

  1. Invertible case. If detA0, then T[E] is Lebesgue measurable for every Lebesgue measurable E and λn(T[E])  =  detA  λn(E), both sides possibly +; the product is defined in R because detA>0.
  2. Singular case. If detA=0, then T[E] is Lebesgue measurable with λn(T[E])=0 for every ERn.

The singular clause is stated as nullity and not as a product. When detA=0 and λn(E)=+ the expression detAλn(E) is 0(+), which The extended real line R=R{,+}, its order, and the arithmetic that is left undefined leaves undefined; writing the conclusion as λn(T[E])=0 says the same thing wherever the product is defined and remains a statement where it is not.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, a linear map T of Rn with matrix A, and a set ERn.

[L1]

An invertible linear map carries Borel sets to Borel sets, and there is a strictly positive real c(T)=λn(T[(0,1]n]) with λn(T[E])=c(T)λn(E) for every Borel E, with c(ST)=c(S)c(T) and c(id)=1 (An invertible linear map of Rn scales the Lebesgue measure of every Borel set by a positive constant depending only on the map).

[L2]

λn(Dp(c)[(0,1]n])=c=detDp(c) and λn(Epq[(0,1]n])=1=detEpq (A coordinate scaling and a coordinate transposition send the unit cube to a set of measure equal to the absolute value of the determinant).

[L3]

For n2 a shear satisfies λn(Tij(t)[(0,1]n])=1=detTij(t) (A shear sends the unit cube to a set of Lebesgue measure one).

[L4]

Every proper linear subspace WRn is Lebesgue measurable with λn(W)=0 (Every affine hyperplane of Rn, and hence every proper linear subspace, is Lebesgue null).

[L5]

A Lipschitz self-map of Rn carries a set of Lebesgue outer measure zero to a Lebesgue measurable set of measure zero (A Lipschitz self-map of Rn carries Lebesgue null sets to Lebesgue null sets, Lipschitz map, α-Hölder map for rational 0<α1, and contraction).

[L6]

E is Lebesgue measurable if and only if E=HW for an Fσ set H and a set W with λn(W)=0 (Assuming countable choice, four equivalent descriptions of a Lebesgue measurable subset of Rn, condition 4; Gδ and Fσ subsets of a topological space, agreeing with the real-line notion).

[F1]
[F3]

For every n1 and every real matrix AMn(R), A is invertible if and only if det(A)0 (A finite square real matrix is invertible if and only if its determinant is nonzero).

[F5]

For a linear map T:VW, imT:={T(v):vV} (Kernel and image of a linear map), and it is a linear subspace (The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial).

[F6]

Every product with one factor 0 and the other ± is left undefined in R (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

[F7]

Let SN; if 0S and σ(n)S whenever nS, then S=N (The principle of mathematical induction).

Proof

technique · direct
1.1

Suppose detA=0. Then imT is a proper linear subspace of Rn: were T surjective, each standard vector ei would be T(vi) for some vi, finitely many instantiations, and the matrix B with bji:=(vi)j would satisfy (AB)ki=jakj(vi)j=(Tvi)k=(ei)k, so AB=In and detAdetB=detIn=1, contradicting detA=0.

F2F3F4F5
1.2

T is Lipschitz, since TxTy2=T(xy)2Kxy2 for a real K0.

F4
1.3

Every elementary matrix M of Mn(R) satisfies c(M)=detM: at n=1 the only elementary matrices are the scalings D0(c), and for n2 the three types are the scalings, the transpositions and the shears, whose unit-cube images have the measures c, 1 and 1, matching det in each case.

L1L2L3F1
2.1

Suppose detA0, so A is invertible and factors as a finite product M1Mr of elementary matrices, each invertible. Multiplicativity of c and of the determinant then give c(T)=sc(Ms)=sdetMs=detA by induction on r, the empty product giving c(id)=1=detIn.

step 1.1step 1.3L1F1F2F3F7
2.2

For detA=0, step 1.1 makes imT a proper linear subspace, hence Lebesgue null; every T[E] is a subset of it, so completeness makes T[E] Lebesgue measurable with λn(T[E])=0, which is claim 2; stating it as a product would require the undefined 0(+) when λn(E)=+.

step 1.1L4L7F6
3.1

For detA0 and E Lebesgue measurable, write E=HW with H an Fσ set, hence Borel, and λn(W)=0; then T[E]=T[H]T[W], where T[H] is Borel and T[W] is Lebesgue measurable of measure 0 by step 1.2 and the Lipschitz lemma, so T[E] is measurable. Since HE and EHW, and T[H]T[E] with T[E]T[H]T[W], both pairs differ by null sets, so λn(E)=λn(H) and λn(T[E])=λn(T[H])=c(T)λn(H)=detAλn(E), which is claim 1; claim 2 is step 2.2.

step 1.2step 2.1step 2.2L1L5L6L7
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Lebesgue measure on Rn is invariant under every orthogonal linear map

Statement

Let n1, assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), and let T be an orthogonal operator on Rn with the Euclidean inner product (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces, The Euclidean inner product x,y=k<nxkyk on Rn). Then T[E] is Lebesgue measurable for every Lebesgue measurable E and

λn(T[E])  =  λn(E).

Both the orientation-preserving operators, of determinant 1, and those of determinant 1 are covered, since only the absolute value of the determinant enters; nothing is asserted here about which matrices occur in either class.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, and an orthogonal operator T on Rn.

[L1]

Assuming countable choice, an invertible linear T with matrix A sends Lebesgue measurable sets to Lebesgue measurable sets with λn(T[E])=detAλn(E) (A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=detTλn(E) when T is invertible and T[E] Lebesgue null when it is not).

[F1]

An invertible linear isometry from a real finite-dimensional inner product space to itself is an orthogonal operator (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).

[F2]
[F3]

For every linear L:RmRn there is a unique matrix A such that (Lh)i=j<maijhj (Every Euclidean linear map has a unique matrix and satisfies Lh2Kh2 for some K0).

Proof

technique · direct
1.1

An orthogonal operator is by definition an invertible linear map of Rn to itself, and its matrix A satisfies detA=1, so in particular detA0.

F1F2F3
2.1

The linear change of variables therefore applies in its invertible clause and gives λn(T[E])=detAλn(E)=λn(E) for every Lebesgue measurable E, with T[E] measurable.

step 1.1L1F2
RemarkRemark: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

How the Lebesgue change-of-variables formula relates to the published formula for Jordan content

Two determinant formulas are now in force, for two different set functions, and this remark says how they meet.

The published one is about Jordan content. A linear endomorphism of Rn sends bounded Jordan sets to bounded Jordan sets and scales their content by the absolute determinant states that a linear endomorphism T of Rn with standard matrix A sends every bounded Jordan set E to a bounded Jordan set with cont(T(E))=detAcont(E), and that a singular linear image has content zero (Jordan inner and outer content and Jordan measurable bounded sets in Rm).

This page's is about Lebesgue measure. Assuming the Axiom of Countable Choice, A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=detTλn(E) when T is invertible and T[E] Lebesgue null when it is not states the same identity with cont replaced by λn, for every Lebesgue measurable E, bounded or not, and with the singular case stated as nullity of T[E] rather than as a product.

Where the two agree, and why that is not an accident. On a bounded Jordan set the two set functions take the same value, by Lebesgue outer measure is at most Jordan outer content, and a bounded Jordan measurable set is Lebesgue measurable with Lebesgue measure equal to its Jordan content, so on that class the two formulas are the same equation read twice. Neither implies the other: the published formula says nothing about a Lebesgue measurable set that is not Jordan measurable, and this page's formula says nothing about Jordan measurability of an image, which the published one asserts.

What the extension costs, and where it is spent. Passing from bounded Jordan sets to arbitrary Lebesgue measurable sets is not a matter of taking limits: the Lebesgue proof runs through the uniqueness of a normalised translation-invariant Borel measure, the factorisation of an invertible matrix into elementary matrices, and the fact that a Lipschitz image of a null set is null. The last of these is what carries the argument across the gap between Borel sets and the larger Lebesgue class, and it is why the change of variables holds on all of L(Rn) and not merely on the Borel sets.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A measurable set of positive finite measure occupies more than any prescribed proportion of some dyadic cube

Statement

Let n1, assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), let ERn be Lebesgue measurable with 0<λn(E)<+, and let θ be a real with 0<θ<1. Then there is a dyadic cube Q (Dyadic cubes of generation k in Rn) with

λn(EQ)  >  θλn(Q).

Both hypotheses on λn(E) are used: positivity is what makes the strict inequality available, and finiteness is what makes the division by θ legitimate.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, a Lebesgue measurable set E with 0<λn(E)<+, and a real θ with 0<θ<1.

[L1]

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

[L2]

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

[F1]

A measure is countably additive on pairwise disjoint measurable sequences (Measures on sigma-algebras) and monotone (Measures are monotone).

[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), and an at most countable family may be presented as a sequence (Finite, countably infinite, countable, uncountable).

[F3]

For a,bR the product ab is + when one factor is ± and the other is a nonzero real of the same sign; multiplication by a strictly positive real is therefore an order isomorphism of [0,+] (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

Proof

technique · contradiction
1.1

Suppose, for contradiction, that λn(EQ)θλn(Q) for every dyadic cube Q.

assume-contra
1.2

Since 0<θ<1 and λn(E) is a strictly positive real, λn(E)/θ is a real strictly above λn(E)=λn(E), so outer regularity supplies an open UE with λn(U)<λn(E)/θ.

L1L3F3
2.1

Write U as the union of an at most countable pairwise disjoint family of dyadic cubes; the family is nonempty because E is, and presenting it as a sequence (Qj) when it is infinite, or using finite additivity when it is finite, countable additivity gives λn(U)=jλn(Qj) and, since EU and the cubes are disjoint, also λn(E)=λn(EU)=jλn(EQj).

step 1.2L2L3F1F2
3.1

Applying the assumption of step 1.1 termwise and scaling the sum by the strictly positive real θ gives λn(E)=jλn(EQj)θjλn(Qj)=θλn(U)<θλn(E)/θ=λn(E), which is impossible; so some dyadic cube satisfies the displayed strict inequality.

step 1.1step 1.2step 2.1F2F3discharge-contradiction
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-26Open item page →

If a Lebesgue measurable subset of Rn has positive measure, its difference set contains an open ball about the origin

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let ERn be Lebesgue measurable with λn(E)>0, and put

EE  :=  {xy  :  x,yE}.

Then there is a real r>0 with B(0,r)EE, the open Euclidean ball of centre the origin and radius r (Open ball, closed ball and sphere in a metric space, Rn as the set of functions nR, and d1, d2, d are metrics on it).

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, and a Lebesgue measurable set ERn with λn(E)>0.

[L1]

Assuming countable choice, a Lebesgue measurable F with 0<λn(F)<+ and a real θ with 0<θ<1 admit a dyadic cube Q with λn(FQ)>θλn(Q) (A measurable set of positive finite measure occupies more than any prescribed proportion of some dyadic cube, Dyadic cubes of generation k in Rn).

[L2]

λn(S+h)=λn(S) for every Lebesgue measurable S and every h, and S+h is measurable exactly when S is (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, Translation of a subset of Rn).

[F1]

Let (Ek)kN be an increasing sequence of measurable sets for a measure μ; then μ(kNEk)=supkNμ(Ek) (Continuity from below for measures).

[F2]

A measure is countably additive on pairwise disjoint measurable sequences, hence finitely additive (Measures on sigma-algebras), and monotone (Measures are monotone).

[F3]

For a>0 and rational r=m/q with q1, ar:=(a1/q)m, where a1/q is the unique nonnegative q-th root of a (Rational powers ar of a positive base, Existence and uniqueness of n-th roots: a unique a1/n0 with (a1/n)n=a), and the value does not depend on the representative (Rational powers do not depend on the representative).

[F4]

If 0a<b and n1 then an<bn; if 0a1 then an1 (Monotonicity of xxn and of nan, claims 2 and 3; Integer powers am), and (ab)n=anbn (Laws of integer exponents, claim 1).

Proof

technique · direct
1.1

The sets E(k,k]n for kN are Lebesgue measurable, increase with k and have union E, so continuity from below gives supkλn(E(k,k]n)=λn(E)>0 and some k has λn(E(k,k]n)>0; that set is bounded, hence of finite measure. Replacing E by it shrinks EE, so it suffices to prove the theorem when 0<λn(E)<+.

L3L4F1
1.2

Put t:=(3/2)1/n, the unique nonnegative n-th root of 3/2; then t>1, since t1 would give tn1<3/2, and η:=(t1)/2 is a strictly positive real with 1+2η=t and (1+2η)n=3/2.

F3F4
2.1

Assume 0<λn(E)<+ and apply the density lemma with θ:=3/4: there is a dyadic cube Q, of some generation k and side s:=2k, with λn(EQ)>34sn, since λn(Q)=sn.

step 1.1L1L3
3.1

Let hRn with d2(0,h)<ηs, so that hi<ηs in every coordinate. Writing Q=B(a,b) with biai=s, both EQ and (EQ)+h are contained in the half-open box P with parameter pairs (aiηs, bi+ηs], whose measure is (s(1+2η))n=sntn=32sn.

step 1.2step 2.1L2L3F4F5
4.1

The two sets are Lebesgue measurable with the same measure, by translation invariance, so if they were disjoint then additivity and monotonicity inside P would give 32sn=λn(P)2λn(EQ)>234sn=32sn, which is impossible; hence they meet, and a common point z=w+h with z,wEQ exhibits h=zwEE.

step 2.1step 3.1L2L4F2
5.1

Therefore B(0,ηs)EE, and r:=ηs is a strictly positive real.

step 1.2step 4.1F5
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A Lebesgue measurable subgroup of (Rn,+) of positive measure is all of Rn

Statement

Let n1 and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let G be a subgroup of the additive group (Rn,+) (Subgroup, Group and abelian group) that is Lebesgue measurable with λn(G)>0. Then

G=Rn.

Equivalently, in the contrapositive form the sources state: a Lebesgue measurable proper subgroup of (Rn,+) has measure zero. Nothing is asserted about subgroups that are not Lebesgue measurable.

Facts & Assumptions

Given: A natural number n1, the Axiom of Countable Choice, and a Lebesgue measurable subgroup G of (Rn,+) with λn(G)>0.

[L1]

Assuming countable choice, a Lebesgue measurable ERn with λn(E)>0 has a real r>0 with B(0,r)EE (If a Lebesgue measurable subset of Rn has positive measure, its difference set contains an open ball about the origin, Open ball, closed ball and sphere in a metric space).

[F1]

A subset HG is a subgroup when eH, H is closed under the operation, and H is closed under inverses (Subgroup, Group and abelian group).

[F2]

Every complete ordered field F is Archimedean: for every xF there is a natural number m1 with x<m1F (Every complete ordered field is Archimedean); and for every real ε>0 there is a natural k1 with 1/k<ε (For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε).

[F3]

Let SN; if 0S and σ(m)S whenever mS, then S=N (The principle of mathematical induction).

Proof

technique · direct
1.1

Since G is a subgroup, 0G and xyG whenever x,yG, so GGG; conversely G=G0GG, and therefore GG=G.

F1
1.2

Steinhaus applied to G supplies a real r>0 with B(0,r)GG.

L1L2
2.1

Let xRn. The Archimedean property gives a natural m1 with x2/r<m, so m1x2=m1x2<r and m1xB(0,r)G by steps 1.1 and 1.2.

step 1.1step 1.2F2F4
3.1

A subgroup is closed under addition, so an induction on j shows j(m1x)G for every natural j, the case j=0 being 0G; taking j=m gives x=m(m1x)G, and as x was arbitrary, G=Rn.

step 2.1F1F3

5 · Examples, counterexamples and false statements

None yet.

Sources