Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-01
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 bounded set is Jordan measurable iff its indicator is Riemann integrable, and the integral is its Jordan content

Statement

A metric-bounded set E⊆Rm is Jordan measurable if and only if its indicator 1E is Riemann integrable on a fixed nondegenerate bounding rectangle Q. In that case ∫Q1E=cont⁡(E).

Facts & Assumptions

Proof

technique · direct
1.1

On a grid cell, the infimum of 1E is 1 exactly when the cell is contained in E, while its supremum is 1 exactly when the cell meets E. Thus lower and upper sums are inscribed and covering grid approximations.

L1L2
2.1

Apply [L3] to each finite outer rectangle approximation to obtain a grid whose cells meeting E have arbitrarily small excess volume. For an inner approximation, shrink each nondegenerate inscribed rectangle by an arbitrarily small volume, insert the shrunken endpoints, and retain the grid cells inside it. Degenerate rectangles contribute zero. Splitting along the aligned endpoints shows that arbitrary Jordan approximations and grid approximations have the same infimum and supremum.

step 1.1L3given
3.1

Equality of Jordan contents is therefore equality of the lower and upper integrals on the fixed bounding rectangle, and their common value is cont⁡(E).

step 2.1L1L2given∎

Depends on

Used by

Dependency tree · two levels

40 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