$$\newcommand{\id}{\mathrm{id}}$$ $$\newcommand{\Span}{\mathrm{span}}$$ $$\newcommand{\kernel}{\mathrm{null}\,}$$ $$\newcommand{\range}{\mathrm{range}\,}$$ $$\newcommand{\RealPart}{\mathrm{Re}}$$ $$\newcommand{\ImaginaryPart}{\mathrm{Im}}$$ $$\newcommand{\Argument}{\mathrm{Arg}}$$ $$\newcommand{\norm}{\| #1 \|}$$ $$\newcommand{\inner}{\langle #1, #2 \rangle}$$ $$\newcommand{\Span}{\mathrm{span}}$$

# 10.1: Riemann integral over Rectangles

$$\newcommand{\vecs}{\overset { \rightharpoonup} {\mathbf{#1}} }$$ $$\newcommand{\vecd}{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}}$$$$\newcommand{\id}{\mathrm{id}}$$ $$\newcommand{\Span}{\mathrm{span}}$$ $$\newcommand{\kernel}{\mathrm{null}\,}$$ $$\newcommand{\range}{\mathrm{range}\,}$$ $$\newcommand{\RealPart}{\mathrm{Re}}$$ $$\newcommand{\ImaginaryPart}{\mathrm{Im}}$$ $$\newcommand{\Argument}{\mathrm{Arg}}$$ $$\newcommand{\norm}{\| #1 \|}$$ $$\newcommand{\inner}{\langle #1, #2 \rangle}$$ $$\newcommand{\Span}{\mathrm{span}}$$ $$\newcommand{\id}{\mathrm{id}}$$ $$\newcommand{\Span}{\mathrm{span}}$$ $$\newcommand{\kernel}{\mathrm{null}\,}$$ $$\newcommand{\range}{\mathrm{range}\,}$$ $$\newcommand{\RealPart}{\mathrm{Re}}$$ $$\newcommand{\ImaginaryPart}{\mathrm{Im}}$$ $$\newcommand{\Argument}{\mathrm{Arg}}$$ $$\newcommand{\norm}{\| #1 \|}$$ $$\newcommand{\inner}{\langle #1, #2 \rangle}$$ $$\newcommand{\Span}{\mathrm{span}}$$

## Riemann integral over rectangles

Note: FIXME1 lectures

As in chapter FIXME, we define the Riemann integral using the Darboux upper and lower integrals. The ideas in this section are very similar to integration in one dimension. The complication is mostly notational.

### Rectangles and partitions

Let $$(a^1,a^2,\ldots,a^n)$$ and $$(b^1,b^2,\ldots,b^n)$$ be such that $$a^k \leq b^k$$ for all $$k$$. A set of the form $$[a^1,b^1] \times [a^2,b^2] \times \cdots \times [a^n,b^n]$$ is called a closed rectangle. If $$a^k < b^k$$, then a set of the form $$(a^1,b^1) \times (a^2,b^2) \times \cdots \times (a^n,b^n)$$ is called an open rectangle.

For an open or closed rectangle $$R := [a^1,b^1] \times [a^2,b^2] \times \cdots \times [a^n,b^n] \subset {\mathbb{R}}^n$$ or $$R := (a^1,b^1) \times (a^2,b^2) \times \cdots \times (a^n,b^n) \subset {\mathbb{R}}^n$$, we define the $$n$$-dimensional volume by $V(R) := (b^1-a^1) (b^2-a^2) \cdots (b^n-a^n) .$

A partition $$P$$ of the closed rectangle $$R = [a^1,b^1] \times [a^2,b^2] \times \cdots \times [a^n,b^n]$$ is a finite set of partitions $$P^1,P^2,\ldots,P^n$$ of the intervals $$[a^1,b^1], [a^2,b^2],\ldots, [a^n,b^n]$$. That is, for every $$k$$ there is an integer $$\ell_k$$ and the finite set of numbers $$P^k = \{ x_0^k,x_1^k,x_2^k,\ldots,x_{\ell_k}^k \}$$ such that $a^k = x_0^k < x_1^k < x_2^k < \cdots < x_{{\ell_k}-1}^k < x_{\ell_k}^k = b^k .$ Picking a set of $$n$$ integers $$j_1,j_2,\ldots,j_n$$ where $$j_k \in \{ 1,2,\ldots,\ell_k \}$$ we get the subrectangle $[x_{j_1-1}^1, x_{j_1}^1] \times [x_{j_2-1}^2, x_{j_2}^2] \times \cdots \times [x_{j_n-1}^n, x_{j_n}^n] .$ For simplicity, we order the subrectangles somehow and we say $$\{R_1,R_2,\ldots,R_N\}$$ are the subrectangles corresponding to the partition $$P$$ of $$R$$. In other words we subdivide the original rectangle into many smaller subrectangles. It is not difficult to see that these subrectangles cover our original $$R$$, and their volume sums to that of $$R$$. That is $R= \bigcup_{j=1}^N R_j , \qquad \text{and} \qquad V(R) = \sum_{j=1}^N V(R_j).$

When $R_k = [x_{j_1-1}^1, x_{j_1}^1] \times [x_{j_2-1}^2, x_{j_2}^2] \times \cdots \times [x_{j_n-1}^n, x_{j_n}^n]$ then $V(R_k) = \Delta x_{j_1}^1 \Delta x_{j_2}^2 \cdots \Delta x_{j_n}^n = (x_{j_1}^1-x_{j_1-1}^1) (x_{j_2}^2-x_{j_2-1}^2) \cdots (x_{j_n}^n-x_{j_n-1}^n) .$

Let $$R \subset {\mathbb{R}}^n$$ be a closed rectangle and let $$f \colon R \to {\mathbb{R}}$$ be a bounded function. Let $$P$$ be a partition of $$[a,b]$$. Let $$R_i$$ be a subrectangle corresponding to $$P$$ that has $$N$$ subrectangles. Define \begin{aligned} & m_i := \inf \{ f(x) : x \in R_i \} , \\ & M_i := \sup \{ f(x) : x \in R_i \} , \\ & L(P,f) := \sum_{i=1}^N m_i V(R_i) , \\ & U(P,f) := \sum_{i=1}^N M_i V(R_i) .\end{aligned} We call $$L(P,f)$$ the lower Darboux sum and $$U(P,f)$$ the upper Darboux sum.

We start proving facts about the Darboux sums analogous to the one-variable results.

[mv:sumulbound:prop] Suppose $$R \subset {\mathbb{R}}^n$$ is a closed rectangle and $$f \colon R \to {\mathbb{R}}$$ is a bounded function. Let $$m, M \in {\mathbb{R}}$$ be such that for all $$x \in R$$ we have $$m \leq f(x) \leq M$$. For any partition $$P$$ of $$R$$ we have $\label{mv:sumulbound:eq} m V(R) \leq L(P,f) \leq U(P,f) \leq M\, V(R) .$

Let $$P$$ be a partition. Then note that $$m \leq m_i$$ for all $$i$$ and $$M_i \leq M$$ for all $$i$$. Also $$m_i \leq M_i$$ for all $$i$$. Finally $$\sum_{i=1}^N V(R_i) = V(R)$$. Therefore, $\begin{gathered} m V(R) = m \left( \sum_{i=1}^N V(R_i) \right) = \sum_{i=1}^N m V(R_i) \leq \sum_{i=1}^N m_i V(R_i) \leq \\ \leq \sum_{i=1}^N M_i V(R_i) \leq \sum_{i=1}^N M \,V(R_i) = M \left( \sum_{i=1}^N V(R_i) \right) = M \,V(R) . \qedhere\end{gathered}$

### Upper and lower integrals

By the set of upper and lower Darboux sums are bounded sets and we can take their infima and suprema. As before, we now make the following definition.

If $$f \colon R \to {\mathbb{R}}$$ is a bounded function on a closed rectangle $$R \subset {\mathbb{R}}^n$$. Define $\underline{\int_R} f := \sup \{ L(P,f) : P \text{ a partition of R} \} , \qquad \overline{\int_R} f := \inf \{ U(P,f) : P \text{ a partition of R} \} .$ We call $$\underline{\int}$$ the lower Darboux integral and $$\overline{\int}$$ the upper Darboux integral.

As in one dimension we have refinements of partitions.

Let $$R \subset {\mathbb{R}}^n$$ be a closed rectangle and let $$P = \{ P^1, P^2, \ldots, P^n \}$$ and $$\tilde{P} = \{ \tilde{P}^1, \tilde{P}^2, \ldots, \tilde{P}^n \}$$ be partitions of $$R$$. We say $$\tilde{P}$$ a refinement of $$P$$ if as sets $$P^k \subset \tilde{P}^k$$ for all $$k = 1,2,\ldots,n$$.

It is not difficult to see that if $$\tilde{P}$$ is a refinement of $$P$$, then subrectangles of $$P$$ are unions of subrectangles of $$\tilde{P}$$. Simply put, in a refinement we took the subrectangles of $$P$$ and we cut them into smaller subrectangles.

[mv:prop:refinement] Suppose $$R \subset {\mathbb{R}}^n$$ is a closed rectangle, $$P$$ is a partition of $$R$$ and $$\tilde{P}$$ is a refinement of $$P$$. If $$f \colon R \to {\mathbb{R}}$$ be a bounded function, then $L(P,f) \leq L(\tilde{P},f) \qquad \text{and} \qquad U(\tilde{P},f) \leq U(P,f) .$

Let $$R_1,R_2,\ldots,R_N$$ be the subrectangles of $$P$$ and $$\tilde{R}_1,\tilde{R}_2,\ldots,\tilde{R}_M$$ be the subrectangles of $$\tilde{R}$$. Let $$I_k$$ be the set of indices $$j$$ such that $$\tilde{R}_j \subset R_k$$. We notice that $R_k = \bigcup_{j \in I_k} \tilde{R}_j, \qquad V(R_k) = \sum_{j \in I_k} V(\tilde{R}_j).$

Let $$m_j := \inf \{ f(x) : x \in R_j \}$$, and $$\tilde{m}_j := \inf \{ f(x) : \in \tilde{R}_j \}$$ as usual. Notice also that if $$j \in I_k$$, then $$m_k \leq \tilde{m}_j$$. Then $L(P,f) = \sum_{k=1}^N m_k V(R_k) = \sum_{k=1}^N \sum_{j\in I_k} m_k V(\tilde{R}_j) \leq \sum_{k=1}^N \sum_{j\in I_k} \tilde{m}_j V(\tilde{R}_j) = \sum_{j=1}^M \tilde{m}_j V(\tilde{R}_j) = L(\tilde{P},f) . \qedhere$

The key point of this next proposition is that the lower Darboux integral is less than or equal to the upper Darboux integral.

[mv:intulbound:prop] Let $$R \subset {\mathbb{R}}^n$$ be a closed rectangle and $$f \colon R \to {\mathbb{R}}$$ a bounded function. Let $$m, M \in {\mathbb{R}}$$ be such that for all $$x \in R$$ we have $$m \leq f(x) \leq M$$. Then $\label{mv:intulbound:eq} m V(R) \leq \underline{\int_R} f \leq \overline{\int_R} f \leq M \, V(R).$

For any partition $$P$$, via $mV(R) \leq L(P,f) \leq U(P,f) \leq M\,V(R).$ By taking suprema of $$L(P,f)$$ and infima of $$U(P,f)$$ over all $$P$$ we obtain the first and the last inequality.

The key of course is the middle inequality in [mv:intulbound:eq]. Let $$P_1 = \{ P_1^1,P_1^2,\ldots,P_1^n \}$$ and $$P_2 = \{ P_2^1,P_2^2,\ldots,P_2^n \}$$ be partitions of $$R$$. Define $$\tilde{P} = \{ \tilde{P}^1,\tilde{P}^2,\ldots,\tilde{P}^n \}$$ by letting $$\tilde{P}^k = P_1^k \cup P_2^k$$. Then $$\tilde{P}$$ is a partition of $$R$$ as can easily be checked, and $$\tilde{P}$$ is a refinement of $$P_1$$ and a refinement of $$P_2$$. By , $$L(P_1,f) \leq L(\tilde{P},f)$$ and $$U(\tilde{P},f) \leq U(P_2,f)$$. Therefore, $L(P_1,f) \leq L(\tilde{P},f) \leq U(\tilde{P},f) \leq U(P_2,f) .$ In other words, for two arbitrary partitions $$P_1$$ and $$P_2$$ we have $$L(P_1,f) \leq U(P_2,f)$$. Via we obtain $\sup \{ L(P,f) : \text{P a partition of R} \} \leq \inf \{ U(P,f) : \text{P a partition of R} \} .$ In other words $$\underline{\int_R} f \leq \overline{\int_R} f$$.

### The Riemann integral

We now have all we need to define the Riemann integral in $$n$$-dimensions over rectangles. Again, the Riemann integral is only defined on a certain class of functions, called the Riemann integrable functions.

Let $$R \subset {\mathbb{R}}^n$$ be a closed rectangle. Let $$f \colon R \to {\mathbb{R}}$$ be a bounded function such that $\underline{\int_a^b} f(x)~dx = \overline{\int_a^b} f(x)~dx .$ Then $$f$$ is said to be Riemann integrable. The set of Riemann integrable functions on $$R$$ is denoted by $${\mathcal{R}}(R)$$. When $$f \in {\mathcal{R}}(R)$$ we define the Riemann integral $\int_R f := \underline{\int_R} f = \overline{\int_R} f .$

When the variable $$x \in {\mathbb{R}}^n$$ needs to be emphasized we write $\int_R f(x)~dx, %\qquad %\int_R f(x^1,\ldots,x^n)~dx^1 \cdots dx^n, \qquad \text{or} \qquad \int_R f(x)~dV .$

implies immediately the following proposition.

[mv:intbound:prop] Let $$f \colon R \to {\mathbb{R}}$$ be a Riemann integrable function on a closed rectangle $$R \subset {\mathbb{R}}^n$$. Let $$m, M \in {\mathbb{R}}$$ be such that $$m \leq f(x) \leq M$$ for all $$x \in R$$. Then $m V(R) \leq \int_a^b f \leq M \, V(R) .$

A constant function is Riemann integrable. Suppose $$f(x) = c$$ for all $$x$$ on $$R$$. Then $c V(R) \leq \underline{\int_R} f \leq \overline{\int_R} f \leq cV(R) .$ So $$f$$ is integrable, and furthermore $$\int_R f = cV(R)$$.

The proofs of linearity and monotonicity are almost completely identical as the proofs from one variable. We therefore leave it as an exercise to prove the next two propositions. (FIXME add the exercise).

Let $$R \subset {\mathbb{R}}^n$$ be a closed rectangle and let $$f$$ and $$g$$ be in $${\mathcal{R}}(R)$$ and $$\alpha \in {\mathbb{R}}$$.

1. $$\alpha f$$ is in $${\mathcal{R}}(R)$$ and $\int_R \alpha f = \alpha \int_R f$
2. $$f+g$$ is in $${\mathcal{R}}(R)$$ and $\int_R (f+g) = \int_R f + \int_R g .$

Let $$R \subset {\mathbb{R}}^n$$ be a closed rectangle and let $$f$$ and $$g$$ be in $${\mathcal{R}}(R)$$ and let $$f(x) \leq g(x)$$ for all $$x \in R$$. Then $\int_R f \leq \int_R g .$

Again for simplicity if $$f \colon S \to {\mathbb{R}}$$ is a function and $$R \subset S$$ is a closed rectangle, then if the restriction $$f|_R$$ is integrable we say $$f$$ is integrable on $$R$$, or $$f \in {\mathcal{R}}(R)$$ and we write $\int_R f := \int_R f|_R .$

For a closed rectangle $$S \subset {\mathbb{R}}^n$$, if $$f \colon S \to {\mathbb{R}}$$ is integrable and $$R \subset S$$ is a closed rectangle, then $$f$$ is integrable over $$R$$.

Given $$\epsilon > 0$$, we find a partition $$P$$ such that $$U(P,f)-L(P,f) < \epsilon$$. By making a refinement of $$P$$ we can assume that the endpoints of $$R$$ are in $$P$$, or in other words, $$R$$ is a union of subrectangles of $$P$$. Then the subrectangles of $$P$$ divide into two collections, ones that are subsets of $$R$$ and ones whose intersection with the interior of $$R$$ is empty. Suppose that $$R_1,R_2\ldots,R_K$$ be the subrectangles that are subsets of $$R$$ and $$R_{K+1},\ldots, R_N$$ be the rest. Let $$\tilde{P}$$ be the partition of $$R$$ composed of those subrectangles of $$P$$ contained in $$R$$. Then using the same notation as before. $\begin{split} \epsilon & > U(P,f)-L(P,f) = \sum_{k=1}^K (M_k-m_k) V(R_k) + \sum_{k=K+1}^N (M_k-m_k) V(R_k) \\ & \geq \sum_{k=1}^K (M_k-m_k) V(R_k) = U(\tilde{P},f|_R)-L(\tilde{P},f|_R) \end{split}$ Therefore $$f|_R$$ is integrable.

### Integrals of continuous functions

FIXME: We will later on prove a much more general result, but it is useful to start with continuous functions only. Before we get to continuous functions, let us state the following proposition, which has a very easy proof, but it is useful to emphasize as a technique.

Let $$R \subset {\mathbb{R}}^n$$ be a closed rectangle and $$f \colon R \to {\mathbb{R}}$$ a bounded function. If for every $$\epsilon > 0$$, there exists a partition $$P$$ of $$R$$ such that $U(P,f) - L(P,f) < \epsilon ,$ then $$f \in {\mathcal{R}}(R)$$.

Given an $$\epsilon > 0$$ find $$P$$ as in the hypothesis. Then $\overline{\int_R} f - \underline{\int_R} f \leq U(P,f) - L(P,f) < \epsilon .$ As $$\overline{\int_R} f \geq \underline{\int_R} f$$ and the above holds for every $$\epsilon > 0$$, we conclude $$\overline{\int_R} f = \underline{\int_R} f$$ and $$f \in {\mathcal{R}}(R)$$.

We say a rectangle $$R = [a^1,b^1] \times [a^2,b^2] \times \cdots \times [a^n,b^n]$$ has longest side at most $$\alpha$$ if $$b^k-a^k \leq \alpha$$ for all $$k$$.

If a rectangle $$R \subset {\mathbb{R}}^n$$ has longest side at most $$\alpha$$. Then for any $$x,y \in R$$, $\lVert {x-y} \rVert \leq \sqrt{n} \, \alpha .$

$\begin{split} \lVert {x-y} \rVert & = \sqrt{ {(x^1-y^1)}^2 + {(x^2-y^2)}^2 + \cdots + {(x^n-y^n)}^2 } \\ & \leq \sqrt{ {(b^1-a^1)}^2 + {(b^2-a^2)}^2 + \cdots + {(b^n-a^n)}^2 } \\ & \leq \sqrt{ {\alpha}^2 + {\alpha}^2 + \cdots + {\alpha}^2 } = \sqrt{n} \, \alpha . \qedhere \end{split}$

[mv:thm:contintrect] Let $$R \subset {\mathbb{R}}^n$$ be a closed rectangle and $$f \colon R \to {\mathbb{R}}$$ a continuous function, then $$f \in {\mathcal{R}}(R)$$.

The proof is analogous to the one variable proof with some complications. The set $$R$$ is closed and bounded and hence compact. So $$f$$ is not just continuous but in fact uniformly continuous by . Let $$\epsilon > 0$$ be given. Find a $$\delta > 0$$ such that $$\lVert {x-y} \rVert < \delta$$ implies $$\left\lvert {f(x)-f(y)} \right\rvert < \frac{\epsilon}{V(R)}$$.

Let $$P$$ be a partition of $$R$$ such that longest side of any subrectangle is strictly less than $$\frac{\delta}{\sqrt{n}}$$. Then for all $$x, y \in R_k$$ for a subrectangle $$R_k$$ of $$P$$ we have, by the proposition above, $$\lVert {x-y} \rVert < \sqrt{n} \frac{\delta}{\sqrt{n}} = \delta$$. Therefore $f(x)-f(y) \leq \left\lvert {f(x)-f(y)} \right\rvert < \frac{\epsilon}{V(R)} .$ As $$f$$ is continuous on $$R_k$$, it attains a maximum and a minimum on this interval. Let $$x$$ be a point where $$f$$ attains the maximum and $$y$$ be a point where $$f$$ attains the minimum. Then $$f(x) = M_k$$ and $$f(y) = m_k$$ in the notation from the definition of the integral. Therefore, $M_i-m_i = f(x)-f(y) < \frac{\epsilon}{V(R)} .$ And so $\begin{split} U(P,f) - L(P,f) & = \left( \sum_{k=1}^N M_k V(R_k) \right) - \left( \sum_{k=1}^N m_k V(R_k) \right) \\ & = \sum_{k=1}^N (M_k-m_k) V(R_k) \\ & < \frac{\epsilon}{V(R)} \sum_{k=1}^N V(R_k) = \epsilon. \end{split}$ As $$\epsilon > 0$$ was arbitrary, $\overline{\int_a^b} f = \underline{\int_a^b} f ,$ and $$f$$ is Riemann integrable on $$R$$.

### Integration of functions with compact support

Let $$U \subset {\mathbb{R}}^n$$ be an open set and $$f \colon U \to {\mathbb{R}}$$ be a function. We say the support of $$f$$ be the set $\operatorname{supp} (f) := \overline{ \{ x \in U : f(x) \not= 0 \} } .$ That is, the support is the closure of the set of points where the function is nonzero. So for a point not in the support we have that $$f$$ is constantly zero in a whole neighbourhood.

A function $$f$$ is said to have compact support if $$\operatorname{supp}(f)$$ is a compact set. We will mostly consider the case when $$U={\mathbb{R}}^n$$. In light of the following exercise, this is not an oversimplification.

Suppose $$U \subset {\mathbb{R}}^n$$ is open and $$f \colon U \to {\mathbb{R}}$$ is continuous and of compact support. Show that the function $$\tilde{f} \colon {\mathbb{R}}^n \to {\mathbb{R}}$$ $\tilde{f}(x) := \begin{cases} f(x) & \text{ if x \in U} \\ 0 & \text{ otherwise} \end{cases}$ is continuous.

[mv:prop:rectanglessupp] Suppose $$f \colon {\mathbb{R}}^n \to {\mathbb{R}}$$ be a function with compact support. If $$R$$ is a closed rectangle such that $$\operatorname{supp}(f) \subset R^o$$ where $$R^o$$ is the interior of $$R$$, and $$f$$ is integrable over $$R$$, then for any other closed rectangle $$S$$ with $$\operatorname{supp}(f) \subset S^o$$, the function $$f$$ is integrable over $$S$$ and $\int_S f = \int_R f .$

The intersection of closed rectangles is again a closed rectangle (or empty). Therefore we can take $$\tilde{R} = R \cap S$$ be the intersection of all rectangles containing $$\operatorname{supp}(f)$$. If $$\tilde{R}$$ is the empty set, then $$\operatorname{supp}(f)$$ is the empty set and $$f$$ is identically zero and the proposition is trivial. So suppose that $$\tilde{R}$$ is nonempty. As $$\tilde{R} \subset R$$, we know that $$f$$ is integrable over $$\tilde{R}$$. Furthermore $$\tilde{R} \subset S$$. Given $$\epsilon > 0$$, take $$\tilde{P}$$ to be a partition of $$\tilde{R}$$ such that $U(\tilde{P},f|_{\tilde{R}})- L(\tilde{P},f|_{\tilde{R}}) < \epsilon .$ Now add the endpoints of $$S$$ to $$\tilde{P}$$ to create a new partition $$P$$. Note that the subrectangles of $$\tilde{P}$$ are subrectangles of $$P$$ as well. Let $$R_1,R_2,\ldots,R_K$$ be the subrectangles of $$\tilde{P}$$ and $$R_{K+1},\ldots,R_N$$ the new subrectangles. Note that since $$\operatorname{supp}(f) \subset \tilde{R}$$, then for $$k=K+1,\ldots,N$$ we have $$\operatorname{supp}(f) \cap R_k = \emptyset$$. In other words $$f$$ is identically zero on $$R_k$$. Therefore in the notation used previously we have $\begin{split} U(P,f|_S)-L(P,f|_S) & = \sum_{k=1}^K (M_k-m_k) V(R_k) + \sum_{k=K+1}^N (M_k-m_k) V(R_k) \\ & = \sum_{k=1}^K (M_k-m_k) V(R_k) + \sum_{k=K+1}^N (0) V(R_k) \\ & = U(\tilde{P},f|_{\tilde{R}})- L(\tilde{P},f|_{\tilde{R}}) < \epsilon . \end{split}$ Similarly we have that $$L(P,f|_S) = L(\tilde{P},f_{\tilde{R}})$$ and therefore $\int_S f = \int_{\tilde{R}} f.$ Since $$\tilde{R} \subset R$$ we also get $$\int_R f = \int_{\tilde{R}} f$$, or in other words $$\int_R f = \int_S f$$.

Because of this proposition, when $$f \colon {\mathbb{R}}^n \to {\mathbb{R}}$$ has compact support and is integrable over a rectangle $$R$$ containing the support we write $\int f := \int_R f \qquad \text{or} \qquad \int_{{\mathbb{R}}^n} f := \int_R f .$ For example if $$f$$ is continuous and of compact support then $$\int_{{\mathbb{R}}^n} f$$ exists.

## Exercises

FIXME

FIXME: Show that integration over a rectangle with one side of size zero results in zero integral.

[mv:exersmallerset] Suppose $$R$$ and $$R'$$ are two closed rectangles with $$R' \subset R$$. Suppose that $$f \colon R \to {\mathbb{R}}$$ is in $${\mathcal{R}}(R)$$. Show that $$f \in {\mathcal{R}}(R')$$.

[mv:zerooutside] Suppose $$R$$ and $$R'$$ are two closed rectangles with $$R' \subset R$$. Suppose that $$f \colon R \to {\mathbb{R}}$$ is in $${\mathcal{R}}(R')$$ and $$f(x) = 0$$ for $$x \notin R'$$. Show that $$f \in {\mathcal{R}}(R)$$ and $\int_{R'} f = \int_R f .$ Hint: see the previous exercise.

Prove a stronger version of . Suppose $$f \colon {\mathbb{R}}^n \to {\mathbb{R}}$$ be a function with compact support. Prove that if $$R$$ is a closed rectangle such that $$\operatorname{supp}(f) \subset R$$ and $$f$$ is integrable over $$R$$, then for any other closed rectangle $$S$$ with $$\operatorname{supp}(f) \subset S$$, the function $$f$$ is integrable over $$S$$ and $$\int_S f = \int_R f$$. Hint: notice that now the new rectangles that you add as in the proof can intersect $$\operatorname{supp}(f)$$ on their boundary.

Suppose that $$R$$ and $$S$$ are closed rectangles. Let $$f(x) := 1$$ if $$x \in R$$ and $$f(x) = 0$$ otherwise. Show that $$f$$ is integrable over $$S$$ and compute $$\int_S f$$.