Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generated
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.

Finite Hardy–Krause variation implies bounded Riemann integrability

Statement

Let d≥1 and let f:[0,1]d→R have finite upper-anchor Hardy–Krause variation VHK,1(f) as defined in Hardy–Krause variation anchored at the upper corner. Then f is bounded and Riemann integrable on [0,1]d.

Facts & Assumptions

Given: A real-valued function on the cube with finite upper-anchor Hardy–Krause variation.

[F1]

VHK,1(f) is the sum of the Vitali variations of the face restrictions with all complementary coordinates fixed at 1. (Hardy–Krause variation anchored at the upper corner)

[F2]

VHK,0(g;R) is the sum of Vitali variations of face restrictions with complementary coordinates fixed at the lower endpoints of R. (Hardy–Krause variation on subrectangles anchored at the lower corner)

[F3]

A bounded function on the cube that is nondecreasing in each coordinate is Riemann integrable. (A bounded coordinatewise nondecreasing function on a cube is Riemann integrable)

[F4]

The difference of two Riemann-integrable functions on the cube is Riemann integrable. (Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in Rm)

[F5]

A bounded function is Riemann integrable exactly when it has arbitrarily small grid Darboux gaps. (Riemann's criterion on a nondegenerate rectangle in Rm: integrability is equivalent to arbitrarily small Darboux gaps)

Proof

1.1F1F2givenconstruct

Let ρ(x)=1−x and g=f∘ρ. Reflection sends each upper face of f to the corresponding lower face of g, sends each product grid to a product grid, and reverses the sign of an alternating increment by at most a factor (−1)∣u∣. Its absolute value is unchanged. Hence VHK,0(g)=VHK,1(f)<∞.

2.1F2step 1.1

For x∈[0,1]d, put v(x)=VHK,0(g;[0,x]). Every grid on a smaller face rectangle extends to a grid on the corresponding whole face by inserting the smaller rectangle's upper endpoints as knots; the old cells remain and the added absolute-increment terms are nonnegative. Hence each face variation on [0,x] is at most the corresponding whole-face variation, and enlarging an upper endpoint cannot decrease it. Thus 0≤v(x)≤VHK,0(g) and v is nondecreasing in each coordinate.

3.1F2step 2.1construct

Fix a coordinate j, fix the other coordinates x−j, and let 0≤a<b≤1. Write xa,xb for the vectors with jth coordinate a,b. Terms in v whose varied-coordinate set omits j cancel in v(xb)−v(xa). For a term whose set is A∪{j}, additivity of Vitali variation at the split [0,a]∪[a,b] shows that its difference is the Vitali variation on the face rectangle RA with j interval [a,b], coordinates in A intervals [0,xi], and all remaining coordinates fixed at 0. Additivity follows directly by inserting a into every grid: refinement and the triangle inequality give one inequality, while joining grids whose sums approach the two suprema gives the reverse inequality. Therefore v(xb)−v(xa)=∑A⊆[d]∖{j}VV(gA∪{j},0;RA).

4.1F2step 3.1algebra

Expanding the right side of the finite-difference identity by inclusion–exclusion gives g(xb)−g(xa)=∑A⊆[d]∖{j}ΔA∪{j}g(RA): every vertex with a coordinate outside A∪{j} set to 0 cancels with the same vertex from the term with that coordinate added to A, leaving only the two vertices with all other coordinates equal to x−j. Each one-cell grid shows VV(gA∪{j},0;RA)≥∣ΔA∪{j}g(RA)∣. The triangle inequality and step 3.1 now give v(xb)−v(xa)≥∣g(xb)−g(xa)∣. Consequently both v and w:=v−g are nondecreasing in every coordinate.

5.1F3F4F5step 1.1step 2.1step 4.1∎

The function v is bounded by step 2.1. The function w is finite-valued and coordinatewise nondecreasing, so w(0)≤w(x)≤w(1) for every x and is bounded as well. By [F3], v and w are Riemann integrable; since g=v−w, [F4] makes g Riemann integrable. Reflection preserves boundedness and maps each grid cell to a cell of the same volume with the same infimum and supremum values for f=g∘ρ, so f has the same arbitrarily small Darboux gaps as g. The criterion [F5] makes f Riemann integrable.

Depends on

Used by

Dependency tree · two levels

18 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