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 solid between continuous graphs over a compact Jordan base is Jordan measurable and integrates by vertical sections
Statement
Let be compact and Jordan measurable, let be continuous with , and put . The solid is compact and Jordan measurable, and every continuous satisfies .
Facts & Assumptions
Given: The data in the Statement, with integrals understood in the multidimensional Riemann sense.
The boundary of has content zero (The boundary of a solid between continuous graphs over a compact Jordan base has content zero).
Every continuous real function on a compact Jordan measurable set is Riemann integrable (A continuous real function on a compact Jordan measurable set is Riemann integrable over that set).
If is bounded Jordan, is integrable, and outside a content-zero parameter set the sections are Jordan measurable and the restrictions are integrable, then the completed section-integral function is integrable and ; the symmetric coordinate order also holds (Fubini over a bounded Jordan set when all but a content-zero family of sections are integrable).
Continuous real functions on a nonempty compact metric space attain finite extrema and are bounded (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
A Euclidean set is compact if and only if it is closed and bounded (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
Proof
If , every assertion and both integrals are zero. Otherwise [F4] bounds and ; the defining weak inequalities make closed, so it is closed and bounded and therefore compact by [F5].
By [F1] the boundary of the bounded set has content zero, so the Jordan boundary criterion makes Jordan measurable.
By [F2], is integrable on . For each , the vertical section is exactly , and the restriction is continuous and integrable; [F3] therefore gives the displayed iterated formula.
If , the corresponding section is a singleton and its integral is zero. Thus coincident graphs, whether at isolated points or everywhere, require no exceptional convention.
Depends on
- A solid between continuous graphs over a compact Jordan base
- The boundary of a solid between continuous graphs over a compact Jordan base has content zero
- A bounded set in $\mathbb{R}^m$ is Jordan measurable iff its boundary is null, equivalently of content zero
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- A continuous real function on a compact Jordan measurable set is Riemann integrable over that set
- Fubini over a bounded Jordan set when all but a content-zero family of sections are integrable
Used by
- The volume under a nonnegative continuous graph over a compact Jordan base is its integral Corollary
- Closed Euclidean balls are Jordan measurable and their volumes satisfy the slicing recursion Theorem
- The cylindrical-shell formula for a solid of revolution about the y-axis Theorem
- The disc formula for the volume of a solid of revolution Theorem
- The volume of a three-ball by Cavalieri's cylinder-minus-cones proof Theorem
Dependency tree · two levels
54 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
- Michael E. Taylor, Introduction to Analysis in Several Variables, Theorem 3.1.9 (standard reference, not scraped)