TheoremBase

Pointwise inequalities between the integrands give inequalities between suprema and infima on each piece of a partition, hence between Darboux sums; Riemann's criterion then gives integrability, and squeezing both sides of each identity between sums that differ by less than epsilon gives the values.

Proof

Notation and a fact. For a bounded map h:[a,b]→Rh:[a,b]\to\mathbb{R} and a partition PP of [a,b][a,b], U(h,P)U(h,P) and L(h,P)L(h,P) are the upper sum and the lower sum of hh with respect to PP; on a fixed partition, the sums of f+gf+g, of cfcf and of maps bounded by one another are compared with those of ff and gg by Darboux Sums of Sums, Scalar Multiples and Dominated Functions, and the Oscillation Bound (i), Darboux Sums of Sums, Scalar Multiples and Dominated Functions, and the Oscillation Bound (ii) and Darboux Sums of Sums, Scalar Multiples and Dominated Functions, and the Oscillation Bound (iii).

Fact B. Let p,q∈Rp,q\in\mathbb{R}, and suppose that for every real ε>0\varepsilon>0 there are ℓ,u∈R\ell,u\in\mathbb{R} with ℓ≤p≤u\ell\le p\le u, ℓ≤q≤u\ell\le q\le u and u−ℓ<εu-\ell<\varepsilon. Then p=qp=q. Indeed, for every ε>0\varepsilon>0 we get p≤u<ℓ+ε≤q+εp\le u<\ell+\varepsilon\le q+\varepsilon, so p≤qp\le q by Arbitrary Positive Slack, and Approximation of Suprema and Infima, in the Real Numbers (i); likewise q≤pq\le p.

We also use that L(h,P)≤U(h,P)L(h,P)\le U(h,P) for every bounded hh and every partition PP, by Bounds for Darboux Sums, Monotonicity under Refinement, the Supremum of the Lower Sums and the Infimum of the Upper Sums, and Concatenation of Partitions (iii).

Proof of (i). By Darboux Sums of Sums, Scalar Multiples and Dominated Functions, and the Oscillation Bound (i), f+gf+g is bounded, and, with Bounds for Darboux Sums, Monotonicity under Refinement, the Supremum of the Lower Sums and the Infimum of the Upper Sums, and Concatenation of Partitions (iii) for f+gf+g, every partition PP of [a,b][a,b] satisfies

L(f,P)+L(g,P)≤L(f+g,P)≤U(f+g,P)≤U(f,P)+U(g,P).(1)L(f,P)+L(g,P)\le L(f+g,P)\le U(f+g,P)\le U(f,P)+U(g,P).\tag{1}

Let ε>0\varepsilon>0. By Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (i), choose partitions P1P_{1} and P2P_{2} of [a,b][a,b] with U(f,P1)−L(f,P1)<ε/2U(f,P_{1})-L(f,P_{1})<\varepsilon/2 and U(g,P2)−L(g,P2)<ε/2U(g,P_{2})-L(g,P_{2})<\varepsilon/2, and let P=P1∪P2P=P_{1}\cup P_{2}, a partition of [a,b][a,b] that refines P1P_{1} and P2P_{2} by The Increasing Listing of a Partition: Endpoints, Lengths, Covering, Unions, Inserting a Point, Concatenation and Uniform Partitions (v). By Bounds for Darboux Sums, Monotonicity under Refinement, the Supremum of the Lower Sums and the Infimum of the Upper Sums, and Concatenation of Partitions (ii), U(f,P)−L(f,P)≤U(f,P1)−L(f,P1)<ε/2U(f,P)-L(f,P)\le U(f,P_{1})-L(f,P_{1})<\varepsilon/2 and likewise for gg with P2P_{2}. Put ℓ=L(f,P)+L(g,P)\ell=L(f,P)+L(g,P) and u=U(f,P)+U(g,P)u=U(f,P)+U(g,P); then u−ℓ<εu-\ell<\varepsilon by Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares (ii) and Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares (vii), and by (1), U(f+g,P)−L(f+g,P)≤u−ℓ<εU(f+g,P)-L(f+g,P)\le u-\ell<\varepsilon. As ε\varepsilon was arbitrary, f+gf+g is integrable on [a,b][a,b] by Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (i). Moreover, for ε\varepsilon, PP, ℓ\ell and uu as above, Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (ii) and (1) give ℓ≤L(f+g,P)≤∫ab(f+g)≤U(f+g,P)≤u\ell\le L(f+g,P)\le\int_{a}^{b}(f+g)\le U(f+g,P)\le u, and Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (ii) for ff and for gg gives ℓ≤∫abf+∫abg≤u\ell\le\int_{a}^{b}f+\int_{a}^{b}g\le u. By Fact B, ∫ab(f+g)=∫abf+∫abg\int_{a}^{b}(f+g)=\int_{a}^{b}f+\int_{a}^{b}g.

Proof of (ii). By Darboux Sums of Sums, Scalar Multiples and Dominated Functions, and the Oscillation Bound (ii), cfcf is bounded, and for every partition PP of [a,b][a,b],

if c≥0:L(cf,P)=cL(f,P), U(cf,P)=cU(f,P);if c<0:L(cf,P)=cU(f,P), U(cf,P)=cL(f,P).(2)\text{if }c\ge0:\quad L(cf,P)=cL(f,P),\ U(cf,P)=cU(f,P);\qquad\text{if }c<0:\quad L(cf,P)=cU(f,P),\ U(cf,P)=cL(f,P).\tag{2}

Let ℓP=L(cf,P)\ell_{P}=L(cf,P) and uP=U(cf,P)u_{P}=U(cf,P) be these values. By Absolute Value in an Ordered Field (i), uP−ℓP=∣c∣ (U(f,P)−L(f,P))u_{P}-\ell_{P}=|c|\,(U(f,P)-L(f,P)) in both cases, and multiplying L(f,P)≤∫abf≤U(f,P)L(f,P)\le\int_{a}^{b}f\le U(f,P), which holds by Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (ii), by cc gives ℓP≤c∫abf≤uP\ell_{P}\le c\int_{a}^{b}f\le u_{P}: for c≥0c\ge0 by Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares (v), and for c<0c<0 by the same with the factor −c>0-c>0 (Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares (iii)) followed by negation, Rules of Arithmetic and Order in an Ordered Field (v) and Rules of Arithmetic and Order in an Ordered Field (ii). Let ε>0\varepsilon>0. As ∣c∣+1>0|c|+1>0, by Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (i) choose a partition PP with U(f,P)−L(f,P)<ε/(∣c∣+1)U(f,P)-L(f,P)<\varepsilon/(|c|+1). Since U(f,P)−L(f,P)≥0U(f,P)-L(f,P)\ge0, uP−ℓP≤(∣c∣+1)(U(f,P)−L(f,P))<εu_{P}-\ell_{P}\le(|c|+1)(U(f,P)-L(f,P))<\varepsilon, that is, U(cf,P)−L(cf,P)<εU(cf,P)-L(cf,P)<\varepsilon. Hence cfcf is integrable on [a,b][a,b] by Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (i). For ε\varepsilon and PP as above, Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (ii) and (2) give ℓP≤∫abcf≤uP\ell_{P}\le\int_{a}^{b}cf\le u_{P}, and ℓP≤c∫abf≤uP\ell_{P}\le c\int_{a}^{b}f\le u_{P}; so ∫abcf=c∫abf\int_{a}^{b}cf=c\int_{a}^{b}f by Fact B.

Proof of (iii). As f(t)≤g(t)+0f(t)\le g(t)+0 for every t∈[a,b]t\in[a,b], Darboux Sums of Sums, Scalar Multiples and Dominated Functions, and the Oscillation Bound (iii) with c=0c=0 gives U(f,P)≤U(g,P)+0 (b−a)=U(g,P)U(f,P)\le U(g,P)+0\,(b-a)=U(g,P) for every partition PP of [a,b][a,b]. Let ε>0\varepsilon>0, and by Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (i) choose a partition PP with U(g,P)−L(g,P)<εU(g,P)-L(g,P)<\varepsilon. By Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (ii) for ff and for gg,

∫abf≤U(f,P)≤U(g,P)<L(g,P)+ε≤∫abg+ε.\int_{a}^{b}f\le U(f,P)\le U(g,P)<L(g,P)+\varepsilon\le\int_{a}^{b}g+\varepsilon .

As ε\varepsilon was arbitrary, ∫abf≤∫abg\int_{a}^{b}f\le\int_{a}^{b}g by Arbitrary Positive Slack, and Approximation of Suprema and Infima, in the Real Numbers (i).

Proof of (iv). The set {a,b}\{a,b\} is finite by Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (iii) and Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (v), and a,b∈[a,b]a,b\in[a,b] by Basic Facts about Intervals of the Real Line (v), so {a,b}\{a,b\} is a partition of [a,b][a,b]. By Bounds for Darboux Sums, Monotonicity under Refinement, the Supremum of the Lower Sums and the Infimum of the Upper Sums, and Concatenation of Partitions (i), applied with ℓ=m\ell=m and C=MC=M, and Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (ii),

m (b−a)≤L(f,{a,b})≤∫abf≤U(f,{a,b})≤M (b−a).m\,(b-a)\le L(f,\{a,b\})\le\int_{a}^{b}f\le U(f,\{a,b\})\le M\,(b-a).

Proof of (v). By Rules of Arithmetic and Order in an Ordered Field (x), −B≤f(t)≤B-B\le f(t)\le B for every t∈[a,b]t\in[a,b]. By (iv) with m=−Bm=-B and M=BM=B, −(B (b−a))≤∫abf≤B (b−a)-(B\,(b-a))\le\int_{a}^{b}f\le B\,(b-a), and so ∣∫abf∣≤B (b−a)\bigl|\int_{a}^{b}f\bigr|\le B\,(b-a) by Rules of Arithmetic and Order in an Ordered Field (x).

Proof of (vi). Let k:[a,b]→Rk:[a,b]\to\mathbb{R} be the constant map with value cc of Pointwise Operations on Real-Valued Maps (ii). Then ∣k(t)∣=∣c∣|k(t)|=|c| for every t∈[a,b]t\in[a,b], so kk is bounded. For every partition PP of [a,b][a,b], Bounds for Darboux Sums, Monotonicity under Refinement, the Supremum of the Lower Sums and the Infimum of the Upper Sums, and Concatenation of Partitions (i) with ℓ=C=c\ell=C=c gives c (b−a)≤L(k,P)≤U(k,P)≤c (b−a)c\,(b-a)\le L(k,P)\le U(k,P)\le c\,(b-a), so U(k,P)−L(k,P)=0U(k,P)-L(k,P)=0. As {a,b}\{a,b\} is a partition of [a,b][a,b] (proof of (iv)), for every ε>0\varepsilon>0 there is a partition PP with U(k,P)−L(k,P)=0<εU(k,P)-L(k,P)=0<\varepsilon, and kk is integrable on [a,b][a,b] by Riemann's Criterion for Integrability, and the Integral Lies between Lower and Upper Sums (i). Applying (iv) to the bounded integrable map kk in place of ff, with m=M=cm=M=c, gives c (b−a)≤∫abk≤c (b−a)c\,(b-a)\le\int_{a}^{b}k\le c\,(b-a), so ∫abc dt=∫abk=c (b−a)\int_{a}^{b}c\,dt=\int_{a}^{b}k=c\,(b-a).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…