Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck pass
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's criterion in Rm: a bounded function on a closed nondegenerate rectangle is Riemann integrable iff its discontinuity set is null

Statement

A bounded real function on a closed nondegenerate rectangle in Rm, m≥1, is Riemann integrable if and only if its discontinuity set is null.

Facts & Assumptions

Given: A closed nondegenerate rectangle Q⊆Rm, m≥1, and a bounded f:Q→R, with ∣f∣≤B.

[L1]

Continuity at x is equivalent to ωf(x)=0, and each set {x:ωf(x)≥ε} is closed for ε>0 (Oscillation of a real function on subsets of Rm and at a point, A function on a subset of Rm is continuous at x iff its oscillation there is 0, and every oscillation superlevel set is closed).

[L6]

For every positive real u there is a natural r≥1 with 1/r<u (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[L7]

The rationals have a fixed enumeration and are dense in the reals (Q is countably infinite, Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable). The explicit pairing bijection in N×N≈N codes finite tuples: code their length and the recursively paired entries, so finite lists of rational cubes admit natural-number codes.

Proof

technique · direct
1.1L5construct

Finite rectangle-to-cube claim. Let Rs=∏j<m[as,j,bs,j], for s in a finite index set, and let γ>0. Put ℓs,j=bs,j−as,j. For every δ>0, [L5] supplies naturals Ns,j≥1 with ℓs,j≤ι(Ns,j)δ≤ℓs,j+δ. Partition the interval from as,j into Ns,j consecutive intervals of length δ, allowing the last one to extend past bs,j. Their Cartesian products are closed cubes of side δ covering Rs, and their total volume is ∏j<mι(Ns,j)δ≤∏j<m(ℓs,j+δ). The finite sum of the expressions on the right is a polynomial in δ whose value at 0 is ∑svol⁡(Rs). Continuity at 0 therefore permits a common δ>0 for which the resulting finite cube cover of ⋃sRs has total volume below ∑svol⁡(Rs)+γ. This includes degenerate rectangles: every zero side contributes a factor δ, so its covering volume tends to 0.

1.2L1L2choose

Suppose the discontinuity set D is null. Given ε>0, choose α>0 with αvol⁡Q<ε/2, and put Sα={x:ωf(x)≥α}. Then Sα⊆D is relatively closed in Q, hence compact, and is null.

1.3L1L3choosealgebra

Conversely, suppose f is integrable. Fix r≥1 and η>0, and choose a grid P whose Darboux gap is below η/(2r). Let HP⊆Q be the finite union of the pieces of the coordinate hyperplanes forming cell boundaries. Every point of S1/r∖HP lies in the interior of a unique cell whose oscillation is at least 1/r. Thus the total volume of these high-oscillation cells is below η/2.

2.1step 1.2L2L3choose

Cover Sα by finitely many cubes and enlarge them so that their interiors still cover Sα, keeping their total volume below ε/(8(B+1)). Apply [L3] to the union of the enlarged cubes, with the remaining volume budget, to obtain a grid P0 whose cells meeting that union have total volume below ε/(4(B+1)).

2.2step 1.3L5

The set S1/r is contained in the union of the high-oscillation cells and the finitely many pieces forming HP. Each hyperplane piece is a degenerate rectangle of volume 0.

3.1step 2.1L1L2L4choose

Let O be the union of those cube interiors and K=Q∖O. The set K is relatively closed in compact Q, hence compact by [L2]. For every z∈K, ωf(z)<α, so some Euclidean ball about z has oscillation below α. Shrink these balls by a factor of two; compactness gives a finite subcover of K.

3.2step 1.1step 1.3step 2.2L2L5

Take the high-oscillation cells from step 1.3 together with the degenerate rectangles forming HP in step 2.2. This finite rectangle family covers S1/r by step 2.2, and its total volume is below η/2 by step 1.3 because the hyperplane pieces have volume zero. Apply the finite rectangle-to-cube claim of step 1.1 to this family with γ=η/2 to obtain a finite cube cover of S1/r of total volume below η. Since η>0 was arbitrary, S1/r has content zero and is null.

4.1step 3.1L3L4

Refine P0 to mesh small enough that the fixed norm comparison in [L4] makes every cell meeting a shrunken ball lie inside the corresponding original ball. Every cell not meeting O contains a point of K, hence is contained in one of those original oscillation balls; refinement does not increase the total volume of cells meeting O.

4.2step 3.2L1L5L6L7

By [L1] and [L6], D=⋃r≥1S1/r. Fix ε>0. Step 3.2 gives each S1/r a finite cube cover of arbitrarily small total volume. Enlarge each cube slightly to a cube with rational lower coordinates and rational side length whose interior contains the original cube. Density of the rationals and continuity of the finite sum of volumes ensure that, starting with volume below ε2−r−1, this can be done with total volume below ε2−r. This is a finite selection for each fixed r.

5.1step 1.2step 2.1step 4.1L3algebra

The Darboux gap is therefore below αvol⁡Q+2B ε/(4(B+1))<ε. By [L3], f is integrable.

6.1step 4.2step 5.1L7L8∎

Among the natural-number codes in [L7] for finite rational-cube lists whose interiors cover S1/r and whose total volume is below ε2−r, take the least code. Step 4.2 shows this set of codes is nonempty. This rule uniquely defines the list for every r without countable choice. Pad each list by zero-volume cubes and enumerate all pairs of indices by the explicit pairing bijection. The resulting sequence covers D. Each finite volume sum is bounded by the sum of the budgets ε2−r, hence by ε; [L8] gives convergence with sum at most ε. Thus D is null. Together with step 5.1 this proves both directions.

Depends on

Dependency tree · 2 levels

Sources