ΘρϵηΠατπ

Partition
A partition of [a,b] is a finite tuple sorted in ascending order P=(x1,x2,xn+1) such that a=x1 and b=xn+1
Refinement of a Partition
A partition R is a refinement of a partition P if PR
Common Refinement
Suppose that P,Q are partitions, then R is a common refinement of P and Q if R is a refinement of PQ
i-th Section of a Partition
Suppose that P=(x1,xn+1) is a partition, then for each i[1,,n] we define si:=[xi,xi+1]
Supremum of a Bounded Function on a Section
Suppose that f:[a,b] and that P=(x1,,xn+1) is a partition of [a,b] then for each i[1,,n] we have Mi(f,P)=sup({f(x):x[xi,xi+1]})
i-th Delta of a Partition
Suppose that P=(x1,,xn+1) is a partition, then for each i[1,n] we define: Δi=xi+1xi

Note that if a partition has k elements then there will be k1 deltas.

A Delta Sum Telescopes
Suppose that P=(x1,,xn+1) is a partition of [a,b] then i=1nΔi=ba
Recall that i=1nΔi=i=1n(xi+1xi)=1xn+1x1=ba where we've used fact 1.
Mesh of a Partition
Suppose that P is a partition of [a,b] such that |P|=n+1 for some n0 then mesh(P)=max({Δi:i[1,,n]})
Upper Sum of a Bounded Function over a Partition
Suppose that f:[a,b] is bounded, and that P is a partition of [a,b] then we define U(f,P):=j=1nMj(f,P)Δj
Lower Sum of a Bounded Function over a Partition
Suppose that f:[a,b] is bounded, and that P is a partition of [a,b] then we define L(f,P):=j=1nmj(f,P)Δj
Upper Sum Decreases over Refinements
Suppose that PR then U(f,P)U(f,R)
Lower Sum Decreases over Refinements
Suppose that PR then L(f,P)L(f,R)
Riemann Integrable
Suppose that f:[a,b] is bounded, then we say that it is Riemann integrable if supP(L(f,P))=infQ(U(f,Q)) In that case we write abf(x)dx as their common value
Riemann Integrable Characterizations
Let f(x) be bounded on [a,b] then the following are equivalent
  • f is Riemann integrable
  • For each ϵ+ there is a partition P such that
  • U(f,P)L(f,P)<ϵ
  • For every ϵ+ there is some δ+ such that for every partition Q such that mesh(Q)<δ wherein
  • U(f,Q)L(f,Q)<ϵ
  • There exists an I such that for every ϵ+ there is a δ+ such that for every partition Q with mesh(Q)<δ and every evaluation sequence X of Q we have
  • |I(f,Q,X)I|<ϵ and in that case I=abf(x)dx

Note that bullet point 2 is a the most tractable for explicit functions, as one can construct a partition that works for a given function.

Jump Discontinuity
Suppose f:[a,b], and c(a,b) then if limxc+f(x)limxcf(x) then we say that f has a jump discontinuity at c
Function Difference Set is the Same as its Negative
Suppose that f:A and define F={f(x)f(y):x,yA}, then F=F
Note that F={f(x)f(y):x,yA}={(f(y)f(x)):y,xA}=F as needed.
Supremum of the Function Difference Set is the Same with Absolute Values
Let f:A and define F={f(x)f(y):x,yA} then sup(F)=sup(|F|)
Recall that if F=F then we know sup(F)=sup(|F|)
Supremum of the Sum of Two Functions is Less than or Equal to the Sum of the Supremums
Suppose that f,g:A then sup({f(x)+g(x):xA})sup({f(x):xA})+sup({g(x):xA})

Let α=sup({f(x):xA}),β=sup({g(x):xA}) and γ=sup({f(x)+g(x):xA}).

We know that for any xA we have that f(x)α and g(x)β therefore we have that f(x)+g(x)α+β, this proves that α+β is an upper bound to the set {f(x)+g(x):xA} therefore we have sup({f(x)+g(x):xA})sup({f(x):xA})+sup({f(x):xA}) As γ is the least upper bound.

Supremum of the Sum of two Functions is the Same as the Sum of the Supremums if the Variables are Independent
Suppose that f,g:A then sup({f(x)+g(y):x,yA})=sup({f(x):xA})+sup({g(x):xA})

Let α=sup({f(x):xA}),β=sup({g(x):xA}) and γ=sup({f(x)+g(y):x,yA}).

For any xA we have that f(x)α and for any yA we have g(x)β thus we have f(x)+g(y)α+β so that α+β is an upper bound of the set γ is supping over there fore we have that γα+β

... [TODO] not sure how to prove the other direction ...

Bound on the Upper minus Lower Sum for The Same Partition
Suppose that f:[a,b] is bounded, and let P={x1,,xn+1} be a partition of [a,b] then we have that U(f,P)L(f,P)2f(ba)
U(f,P)L(f,P)=i=1n(supx[xi,xi+1]f(x)inf(x[xi,xi+1]f(x)))Δi=1i=1n(supx[xi,xi+1]f(x)+sup(x[xi,xi+1]f(x)))Δi=2i=1n(supx,y[xi,xi+1](f(x)f(y)))Δi=3i=1n(supx,y[xi,xi+1](|f(x)f(y)|))Δi4i=1n(2supx,y[xi,xi+1](|f(x)|))Δi5i=1n(2f)Δi=2fi=1nΔi=62f(ba) Where we've used
Piecewise Continuous
A function f:[a,b] is called piecewise continuous if for every [c,d][a,b] if it only has a finite number of discontinuities all of which are jump discontinuities
Riemann Integrable on Two Parts of the Interval Means Riemann Integrable on the Whole Interval
Suppose that f:[a,b] and let x[a,b] then if f restricted to [a,x] and f restricted to [x,b] (which we denote as g1,g2) are both riemann integrable then so is f on [a,b] and then abf(x)dx=axf(x)dx+xbf(x)dx
Let ϵ+ using bullet point 2 from the RMI characterization we know that there are partitions P1,P2 of [a,x],[x,b] such that (U(g1,P1)L(g1,P1))+(U(g2,P2)L(g2,P2))<ϵ Then note that U(g1,P1)+U(g2,P2)=U(f,P1P2) which also holds for the lower sums, and therefore from the previous inequality we have U(f,P1P2)L(f,P1P2)<ϵ therefore by (2) of the RMI characterization f is Riemann integrable.
Every Piecewise Continuous Function is Riemann Integrable

Since f is piecewise continuous, then suppose its jump discontinuity points are given by D={d1,d2,dn}. We will show this by using strong induction on the number of discontinuities within [a,b].

Note that one can manage to prove that if f is RMI over [a,b] with 1ik jump discontinuities, then it is RMI over [a,b] if it has k+1 discontinuities. This can be done because we can break [a,b] into two intervals I1,I2 such that I1I2=[a,b], where I1,I2 each have a number of discontinuities within the range [1,,k] so that fI1 and fI2 are both integrable on their respective intervals, so that f is RMI on [a,b].

Therefore all that remains is the base case, which is that f is RMI if there is exactly 1 jump discontinuity of f on the set [a,b], let d be this discontinuity, since f is continuous on L:=[a,dδ] and R:=[d+δ,b] for any small δ, then we know that f is RMI when restricted to these intervals.

Let ϵ+ by (2) of the RMI characterization we obtain PL,PR which are partitions of L,R respectively (note that PLPR= such that U(fL,PL)L(fL,PL)<ϵ3 and U(fR,PR)L(fR,PR)<ϵ3

Finally Consider PLPR which is a partition of [a,b] which contains the section [dδ,d+δ] along with the left and right partitions. Focusing on this section we can see it will contribute (supx[dδ,d+δ]f(x)supy[dδ,d+δ]f(y))2δ to U(f,PLPR)L(f,PLPR), now:

U(f,PLPR)L(f,PLPR)=(U(fL,PL)+(supx[dδ,d+δ]f(x))2δ+U(fR,PR))(L(fL,PL)+(infx[dδ,d+δ]f(x))2δ+L(fR,PR))=(U(fL,PL)L(fL,PL))+(supx[dδ,d+δ]f(x)infx[dδ,d+δ]f(x))2δ+(U(fR,PR)L(fL,PL))<2ϵ3+supx,y[dδ,d+δ](|f(x)f(y)|)2δ2ϵ3+2supx[dδ,d+δ]|f(x)|2ϵ3+2f2δ=2ϵ3+4fδ Thus a selection of δ=ϵ4f3 shows that U(f,PLPR)L(f,PLPR)<ϵ as needed.
Volume of a Rectangle
Suppose that A=[a1,b1]××[an,bn]n. The volume of the closed rectangle A is v(A)=i=1n(biai). We use the same formula for the corresponding open rectangle (a1,b1)××(an,bn).
Partition of a Closed Rectangle
Suppose that A=[a1,b1]××[an,bn] is a closed rectangle. A partition of A is a tuple P=(P1,,Pn), where each Pi is a partition of the interval [ai,bi].
Subrectangle of a Partition
Let P=(P1,,Pn) be a partition of a closed rectangle A, and write Pi=(ti,0,ti,1,,ti,Ni). A subrectangle of P is a rectangle of the form [t1,j11,t1,j1]××[tn,jn1,tn,jn], where 1jiNi for every i.
Multivariable Upper and Lower Sums
Suppose that An is a closed rectangle, f:A is bounded, and P is a partition of A. For each subrectangle S of P, define mS(f)=inf{f(x):xS} and MS(f)=sup{f(x):xS}. The lower sum and upper sum of f over P are L(f,P)=SmS(f)v(S) and U(f,P)=SMS(f)v(S), where v(S) is the volume of the rectangle S, and the sums range over all subrectangles S of P.
Riemann Integrable on a Closed Rectangle
Suppose that An is a closed rectangle and f:A is bounded. We say that f is Riemann integrable on A if supPL(f,P)=infPU(f,P), where P ranges over all partitions of A. The common value is denoted Af or Af(x1,,xn)dx1dxn.
Multivariable Refinement Improves Darboux Sums
Suppose that An is a closed rectangle, f:A is bounded, and P refines P, meaning each subrectangle of P is contained in a subrectangle of P. Then L(f,P)L(f,P) and U(f,P)U(f,P).
Multivariable Lower Sums are Below Upper Sums
If P and Q are partitions of a closed rectangle A, then L(f,P)U(f,Q).
Multivariable Riemann Integrability Criterion
Suppose that An is a closed rectangle and f:A is bounded. Then f is Riemann integrable on A if and only if for every ϵ+, there is a partition P of A such that U(f,P)L(f,P)<ϵ.
Measure Zero in Euclidean Space
A set En has n-dimensional measure zero if for every ϵ+, there is a sequence U1,U2, of closed rectangles such that Ei=1Ui and i=1v(Ui)<ϵ. Here v(Ui) is the volume of the rectangle Ui.
Content Zero in Euclidean Space
A set En has n-dimensional content zero if for every ϵ+, there are finitely many closed rectangles U1,,Uk such that EU1Uk and i=1kv(Ui)<ϵ. Here v(Ui) is the volume of the rectangle Ui.
Countable Union of Measure Zero Sets has Measure Zero
If E=i=1Ei and each Ein has measure zero, then E has measure zero.
Compact Measure Zero Implies Content Zero
If En is compact and has measure zero, then E has content zero.
Lebesgue Criterion for Multivariable Riemann Integrability
Suppose that An is a closed rectangle and f:A is bounded. Let D={xA:f is not continuous at x}. Then f is Riemann integrable on A if and only if D has measure zero.
Jordan Measurable Set
A bounded set Cn is Jordan measurable if its characteristic function χC is Riemann integrable on some closed rectangle A with CA. In that case its Jordan content is |C|=AχC.
Jordan Measurable iff Boundary has Measure Zero
A bounded set Cn is Jordan measurable if and only if its boundary has measure zero.
Integral over a Jordan Measurable Set
Suppose that Cn is bounded, CA, A is a closed rectangle, and f:A is bounded. If fχC is Riemann integrable on A, define Cf=AfχC.
Removing a Measure-Zero Set Does Not Change a Riemann Integral
Suppose Cn is Jordan measurable, EC has measure zero, and f:C is bounded and integrable over C. Then Cf=CEf.
Choose a closed rectangle A containing C. The two integrals are AfχCandAfχCE. These two functions differ only on E. Since E has measure zero, changing a bounded function only on E does not change its upper or lower Riemann integrals: rectangles covering E can be chosen with arbitrarily small total volume, so the possible change in any Riemann sum is bounded by the bound for f times an arbitrarily small total volume. Therefore the two integrals are equal.
Fubini for Riemann Integrals on Rectangles
Suppose that An and Bm are closed rectangles and f:A×B is Riemann integrable. If for each xA, the function yf(x,y) is Riemann integrable on B, and the function xBf(x,y)dy is Riemann integrable on A, then A×Bf=A(Bf(x,y)dy)dx.
Support of a Function
The support of a function φ:A is the closure of the set where φ is nonzero: supp(φ)={xA:φ(x)0}.
Partition of Unity
Let An and let 𝒰 be an open cover of A. A partition of unity for A, subordinate to 𝒰, is a collection Φ of nonnegative continuous functions φ:A such that:
  • for each φΦ, there is some U𝒰 with supp(φ) U,
  • each point of A has a neighborhood on which only finitely many φΦ are nonzero,
  • for every xA, φΦφ(x)=1.
Existence of Partitions of Unity in Euclidean Space
If An and 𝒰 is an open cover of A, then there is a partition of unity for A subordinate to 𝒰.
First suppose that A is compact. Choose a finite subcover U1,,UN of A from 𝒰. We construct compact sets DiUi whose interiors cover A.

Suppose D1,,Dk have been chosen so that intD1,,intDk,Uk+1,,UN still cover A. Let Ck+1=A(intD1intDkUk+2UN). Then Ck+1 is compact and Ck+1Uk+1. Since Uk+1 is open, choose a compact neighborhood Dk+1 with Ck+1intDk+1andDk+1Uk+1. Continuing this process gives compact sets D1,,DN whose interiors cover A.

For each i, define a nonnegative continuous function ψi that is positive on Di and zero outside Ui. One explicit choice uses the Euclidean distance to a set: ψi(x)=d(x,nUi)d(x,nUi)+d(x,Di). This is continuous, equals 0 off Ui, and is positive on Di. Since the interiors of the Di cover A, the sum σ(x)=ψ1(x)++ψN(x) is positive on A. Set φi(x)=ψi(x)σ(x). Then the φi are nonnegative continuous functions, their sum is 1 on A, and the support of φi is contained in Ui. Thus they form the required partition in the compact case.

Next suppose that A=A1A2, where each Ai is compact and AiintAi+1. Put A0=A1= and Bi=AiintAi1. Each Bi is compact. Cover Bi by the sets U(intAi+1Ai2),U𝒰. By the compact case, choose a partition of unity Φi for Bi subordinate to this cover. At each xA, only finitely many of the functions from all the Φi are nonzero near x, because the i-th family is supported in intAi+1Ai2. Therefore σ(x)=iφΦiφ(x) is locally finite and positive on A. Replacing every φ by φ/σ gives a partition of unity on A subordinate to 𝒰.

If A is open, define Ai={xA:|x|i and d(x,nA)1i}. These sets are compact, their union is A, and AiintAi+1. Hence the previous case applies.

Finally let A be arbitrary and let B=U𝒰U. The set B is open and AB. Apply the open case to B and then restrict the resulting functions to A. The restricted functions still sum to 1 on A, are locally finite on A, and have supports contained in elements of 𝒰. Thus they form the desired partition of unity.

Change of Variables for Riemann Integrals
Let An be open and let g:An be one-to-one and continuously differentiable with det[Dg(x)]E0 for every xA. If f:g(A) is integrable, then g(A)f=A(fg)|det[Dg]E|.

First reduce the result to local pieces. Suppose 𝒱 is an open cover of A such that the formula holds on each V𝒱. The sets g(V) form an open cover of g(A). Choose a partition of unity Φ on g(A) subordinate to this cover. For each φΦ, choose Vφ𝒱 with supp(φ)g(Vφ). Since g is one-to-one, the function (φf)g is zero outside Vφ. Applying the local formula to φf gives g(A)φf=A((φf)g)|det[Dg]E|. Summing over the locally finite family Φ, and using φΦφ=1, gives g(A)f=A(fg)|det[Dg]E|.

It is enough to prove the formula for constant functions on rectangles. Indeed, let Rg(A) be a closed rectangle and let P be a partition of R. For each subrectangle S, let mS(f) and MS(f) be the lower and upper values of f on S. Applying the constant-function case to the characteristic pieces of S gives the lower-sum inequality L(f,P)g1(R)(fg)|det[Dg]E| and similarly the upper-sum inequality in the other direction. Taking the supremum of lower sums and the infimum of upper sums, using the definition of Riemann integrability, proves the formula for f.

The formula is compatible with composition. If it holds for g:An and for h:Bn, with g(A)B, then h(g(A))f=g(A)(fh)|det[Dh]E| and applying the formula again to g gives A(fhg)|det[Dh(g(x))]E||det[Dg(x)]E|. By the chain rule and multiplicativity of determinants, this is A(fhg)|det[D(hg)]E|.

The formula holds for invertible linear maps because the determinant is the signed volume-scaling factor of a linear map: for every rectangle R, |T(R)|=|detT||R|, and the constant-function reduction then gives the integral formula.

We now prove the theorem by induction on n. The case n=1 is the ordinary one-dimensional substitution formula. Assume the theorem is known in dimension n1, and let aA. By the local reduction it is enough to prove the formula on some open neighborhood of a. Composing with the inverse of the linear map Dg(a), and using the linear case and the composition step, we may assume [Dg(a)]E=In.

Write g=(g1,,gn). Define h(x1,,xn)=(g1(x),,gn1(x),xn). Since [Dh(a)]E=In, the inverse function theorem gives an open neighborhood U of a on which h is one-to-one and det[Dh]E0. On h(U), define k(y1,,yn)=(y1,,yn1,gn(h1(y))). Then g=kh on U. Shrinking U if needed, the inverse function theorem also gives det[Dk]E0 on h(U). By the composition step, it remains to prove the formula for maps of the form h and k, each of which changes only one coordinate after the other coordinates are fixed.

We prove it for h; the proof for k is the same. Let W=D×[an,bn]U, where Dn1 is a rectangle. For each fixed xn, define hxn(x1,,xn1)=(g1(x),,gn1(x)). Each hxn is a one-to-one continuously differentiable map in n1, and det[Dhxn(x1,,xn1)]E=det[Dh(x1,,xn)]E. Applying the induction hypothesis to each slice and then applying Fubini's theorem gives h(W)1=anbnD|det[Dh(x1,,xn)]E|dx1dxn1dxn=W|det[Dh]E|. By the constant-function reduction, the change-of-variables formula holds for h on W. These rectangles form a local cover of U, so the local reduction proves the formula near a. Since a was arbitrary, the theorem follows on all of A.

Polar Coordinate Change of Variables
Let W={(u,v)2:u2+v2<R2} with R>0. If q:W is integrable, then Wq(u,v)dudv=02π0Rq(rcosθ,rsinθ)rdrdθ.
Let ϕ(r,θ)=(rcosθ,rsinθ) on (0,R)×(0,2π). This map is one-to-one onto W with the origin and one radius removed. Its Jacobian matrix is ϕ(r,θ)=[cosθrsinθsinθrcosθ], so |detϕ(r,θ)|=r. The omitted origin and radius have measure zero, so by removing a measure-zero set, the integral over W equals the integral over the image of ϕ. Applying the change of variables theorem gives Wq(u,v)dudv=(0,R)×(0,2π)q(rcosθ,rsinθ)rdrdθ. Writing this integral as an iterated integral gives the stated formula.
Sard's Theorem for the Equal-Dimension C1 Case
Let An be open and let g:An be continuously differentiable. If B={xA:det[Dg(x)]E=0}, then g(B) has measure zero.