Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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.

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

Depends on

Used by

Dependency tree · two levels

89 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