Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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

Depends on

Used by

Dependency tree · two levels

60 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources