7. Sets, Functions, Composition, and Inverses

Learning goals and preparation

A formula without its allowed inputs is an incomplete function description. This chapter develops the set notation needed to state domains, distinguishes a range from a codomain, and builds composition and inverse functions with all restrictions visible. Exponential and logarithmic functions provide a principal application. Chapter 5 supplies real-power and inequality rules; Chapters 1 and 2 supply initial growth models and inverse trigonometric examples.

7.1 Sets describe allowed inputs precisely

A set is a collection of distinct objects. Write $x\in A$ for membership and $x\notin A$ for nonmembership. The empty set is $\varnothing$. Standard sets include integers $\mathbb Z$, positive integers $\mathbb N=\{1,2,\ldots\}$, and reals $\mathbb R$. A subset relation $A\subseteq B$ says every element of $A$ belongs to $B$; it permits equality.

Set-builder notation describes a condition: $\{x\in\mathbb R:x^2<4\}=(-2,2)$. Parentheses exclude endpoints, square brackets include them; infinity is never an included real endpoint. Thus $[0,\infty)$ means all nonnegative reals. Intersection $A\cap B$ requires membership in both sets; union $A\cup B$ requires membership in at least one; difference $A\setminus B$ keeps members of $A$ that are not in $B$. A complement must name the ambient universe.

Example 1 — intersecting domain conditions. For

$$f(x)=\frac{\ln(x+1)}{\sqrt{4-x^2}},$$

the logarithm requires $x>-1$. Because the square root is a denominator, require $4-x^2>0$, not merely $\ge0$. The maximal real domain is $(-1,\infty)\cap(-2,2)=(-1,2)$. Each condition alone is insufficient.

For a fixed universe $U$, the statement $x\notin A\cup B$ means $x$ lies in neither set, so $U\setminus(A\cup B)=(U\setminus A)\cap(U\setminus B)$. Such membership arguments justify set identities; matching a few examples is not their proof.

7.2 A function is a single-valued rule on a domain

A function $f:D\to C$ assigns to each $x\in D$ exactly one value $f(x)\in C$. Here $D$ is the domain and $C$ is the declared codomain. Its range is the actual set $f(D)=\{f(x):x\in D\}$, a subset of $C$. The codomain can contain values never attained.

For $f:\mathbb R\to\mathbb R$, $f(x)=x^2$, the range is $[0,\infty)$, not all of the codomain. For $g:[0,\infty)\to[0,\infty)$ with the same expression $x^2$, the domain differs. The two specified maps have different inverse behavior even though they share a formula.

A graph contains the ordered pairs $(x,f(x))$. A vertical line meets it at most once. The equation $y^2=x$ as a relation has two values $y$ for positive $x$ and is not a function of $x$ until a branch is selected. The convention $y=\sqrt x$ selects the nonnegative branch.

A function is injective if $f(x_1)=f(x_2)$ forces $x_1=x_2$. It is surjective onto its codomain if its range equals that codomain. It is bijective when both hold. Strict increase or strict decrease proves injectivity: different ordered inputs then have different ordered outputs.

7.3 Composition carries an intermediate-domain test

The notation $(f\circ g)(x)=f(g(x))$ means apply $g$ first, then $f$. If the specified codomain of $g$ is contained in the domain of $f$, the composite is defined on all of $g$'s domain. Otherwise the natural restricted composite has domain

$$\{x\in D_g:g(x)\in D_f\}.$$

Both stages must exist. It is unsafe to simplify first and infer a larger domain from the final expression.

Example 2 — different order, different domain. Let $f(x)=\sqrt x$ on $[0,\infty)$ and $g(x)=2x-1$ on $\mathbb R$. Then

$$(f\circ g)(x)=\sqrt{2x-1},\quad x\ge\tfrac12,$$ $$(g\circ f)(x)=2\sqrt x-1,\quad x\ge0.$$

At $x=1$ both happen to equal $1$, but this coincidence does not make the functions equal. At $x=4$ their outputs are $\sqrt7$ and $3$.

Example 3 — cancellation cannot repair a missing intermediate value. Let $r(x)=1/x$ on $\mathbb R\setminus\{0\}$. Then $(r\circ r)(x)=x$ for $x\ne0$. It is the identity on the nonzero reals, not the identity map on all of $\mathbb R$. The first application at zero is unavailable.

Composition is associative where all relevant stages are defined: both $f\circ(g\circ h)$ and $(f\circ g)\circ h$ produce $f(g(h(x)))$ with the same successive-domain tests. It is generally not commutative.

7.4 Inverting an injective function

If $f:D\to C$ is injective, it has an inverse $f^{-1}:f(D)\to D$ sending each attained value to its unique original input. Thus

$$f^{-1}(f(x))=x\quad(x\in D),\qquad f(f^{-1}(y))=y\quad(y\in f(D)).$$

Existence follows because $y\in f(D)$ has a preimage; uniqueness follows by injectivity. If $f$ is also surjective onto $C$, the inverse domain is all of $C$. A noninjective function cannot have a two-sided inverse on its full domain: if $f(u)=f(v)$ with $u\ne v$, any inverse identity would force $u=v$.

The inverse notation is not a reciprocal: $f^{-1}$ is generally unrelated to $1/f$. Its graph reflects the original graph across $y=x$, since $(x,y)$ becomes $(y,x)$.

Example 4 — a shifted square and two branches. Let $f(x)=(x-2)^2+3$. On the whole real line it is not injective: $f(1)=f(3)=4$. Restrict it to $D=[2,\infty)$. Its range is $[3,\infty)$ and solving $y=(x-2)^2+3$ with $x\ge2$ gives

$$f^{-1}(y)=2+\sqrt{y-3},\qquad y\ge3.$$

If instead $D=(-\infty,2]$, its inverse is $2-\sqrt{y-3}$. Neither sign is an arbitrary afterthought; it is determined by the original domain. Substituting either branch into the square verifies one identity, while the branch condition is needed to verify the other.

For the inverse-order identity in the next paragraph, assume that both component maps are bijections: $g:D\to B$ and $f:B\to C$. Then the individual inverses $g^{-1}:B\to D$ and $f^{-1}:C\to B$ exist. Bijectivity of $f\circ g$ alone would not suffice: the inclusion $g:[0,\infty)\to\mathbb R$, $g(x)=x$, followed by $f:\mathbb R\to[0,\infty)$, $f(x)=x^2$, is bijective as a composite, while neither displayed component has a two-sided inverse on its declared codomain. One may instead restrict $f$ to $g(D)$ when that restricted map is bijective; its inverse must be named as $(f|_{g(D)})^{-1}$.

For a bijective composite, the order reverses: $(f\circ g)^{-1}=g^{-1}\circ f^{-1}$ on the composite range. To undo “first $g$, then $f$,” undo $f$ first. This follows by substituting and canceling the adjacent inverse pairs with their domain conditions.

7.5 Exponentials and logarithms as inverse families

For a base $b>0$, $b\ne1$, the real exponential $E_b(x)=b^x$ has domain $\mathbb R$ and range $(0,\infty)$. It is continuous, strictly increasing if $b>1$, and strictly decreasing if $0<b<1$. Its inverse is

$$\log_b:(0,\infty)\to\mathbb R.$$

The natural exponential uses the base $e$, whose limiting normalization will be stated in Chapter 9, and its inverse is $\ln$. Thus $e^{\ln u}=u$ for $u>0$ and $\ln(e^x)=x$ for every real $x$.

Logarithm laws follow from the exponential laws and uniqueness, not from splitting arbitrary expressions. If $u=e^s$ and $v=e^t$ are positive, then $uv=e^{s+t}$, giving $\ln(uv)=\ln u+\ln v$. Similarly $\ln(u/v)=\ln u-\ln v$ and $\ln(u^a)=a\ln u$ for $u>0$ and real $a$. Taking logs of $b^x=u$ gives $x\ln b=\ln u$, hence

$$\log_bu=\frac{\ln u}{\ln b}.$$

The denominator is nonzero precisely because $b\ne1$. There is no analogous identity $\ln(u+v)=\ln u+\ln v$; at $u=v=1$ the two sides are $\ln2$ and $0$.

Example 5 — domain before cancellation. Solve $\ln(x-1)+\ln(x+1)=\ln8$. Both arguments require $x>1$. On that domain the equation becomes $\ln(x^2-1)=\ln8$, then $x^2=9$. Reject $-3$ because it violates the original domain; $x=3$ is the solution.

Example 6 — an inequality with a decreasing base. Solve $(1/3)^x\ge9$. Since $9=(1/3)^{-2}$ and the exponential is decreasing, the answer is $x\le-2$. Taking natural logs yields $x\ln(1/3)\ge\ln9$ and reverses the direction when dividing by the negative logarithm, giving the same result.

7.6 Models and reverse questions

Suppose a hypothetical response is $S(t)=80(1-e^{-t/4})$ for $t\ge0$. The exponential is positive and decreases toward zero, so $S$ increases from $0$ toward $80$ without attaining $80$ at a finite time. Its range is $[0,80)$, not $[0,80]$. Solving $s=80(1-e^{-t/4})$ gives

$$t=-4\ln(1-s/80),\qquad 0\le s<80.$$

At $s=40$, $t=4\ln2$. At $s=80$, the logarithm argument would be zero: there is no finite inverse value. A capacity limit can be approached without being reached, a distinction used again with horizontal asymptotes in Chapter 9.

7.7 Graded exercises

Foundation

1. Express $\{x\in\mathbb R:|x-1|\le2\}$ as an interval.
2. For $A=[-2,3)$ and $B=(1,5]$, find $A\cap B$ and $A\cup B$.
3. State the domain and range of $f(x)=\sqrt{x+4}$ with its maximal real domain.

Core

4. Find the maximal real domain of $\ln(3-x)/(x^2-1)$.
5. With $f(x)=1/(x-2)$ and $g(x)=x^2$, find both composites and their domains.
6. Find the inverse of $f:[-1,\infty)\to[2,\infty)$, $f(x)=(x+1)^2+2$, and check both identities.
7. Solve $\ln(x)+\ln(x-2)=\ln3$.
8. Solve $4^{2x-1}=8$ exactly.

Synthesis

9. Give an injective map $\mathbb R\to\mathbb R$ that is not surjective, and state the domain of its inverse on its range.
10. For $f(x)=3x+1$ and $g(x)=2x-5$ on $\mathbb R$, calculate $(f\circ g)^{-1}$ directly and as $g^{-1}\circ f^{-1}$.
11. Find the range and inverse of $N(t)=50e^{-2t}$ on $t\ge0$. Explain why a target value of zero has no finite inverse.
12. If $f\circ g$ is injective, prove that $g$ must be injective. Must $f$ be injective on its entire domain? Give a counterexample if not.

7.8 Full solutions

1. $-2\le x-1\le2$, hence $[-1,3]$.
2. The intersection is $(1,3)$: $1$ is excluded by $B$ and $3$ by $A$. The union is $[-2,5]$ because the overlapping intervals leave no gap and the outer endpoints are included.
3. Require $x+4\ge0$, so the domain is $[-4,\infty)$. Every nonnegative output $y$ is attained at $x=y^2-4$, so the range is $[0,\infty)$.
4. Require $x<3$ and $x\ne-1,1$. The domain is $(-\infty,-1)\cup(-1,1)\cup(1,3)$.
5. $f\circ g=1/(x^2-2)$ has domain $\mathbb R\setminus\{-\sqrt2,\sqrt2\}$. The other composite is $g\circ f=1/(x-2)^2$ on $\mathbb R\setminus\{2\}$. The latter domain restriction comes from the first stage $f$.
6. $f^{-1}(y)=-1+\sqrt{y-2}$ for $y\ge2$. For $x\ge-1$, $f^{-1}(f(x))=-1+|x+1|=x$. Conversely $f(f^{-1}(y))=(\sqrt{y-2})^2+2=y$ for $y\ge2$.
7. Require $x>2$. Combine logs to get $x(x-2)=3$, so $(x-3)(x+1)=0$. Only $3$ is admissible.
8. Write both sides in base $2$: $2^{4x-2}=2^3$. Injectivity gives $4x-2=3$, so $x=5/4$.
9. The map $f(x)=e^x$ is injective and has range $(0,\infty)$, so is not surjective onto $\mathbb R$. Its inverse on its range is $\ln:(0,\infty)\to\mathbb R$.
10. $f\circ g=6x-14$, so its inverse is $(y+14)/6$. Also $f^{-1}(y)=(y-1)/3$ and $g^{-1}(u)=(u+5)/2$, giving $g^{-1}(f^{-1}(y))=((y-1)/3+5)/2=(y+14)/6$.
11. The range is $(0,50]$. Solving gives $t=-(1/2)\ln(N/50)$ on that range. An exponential is positive for every finite $t$, so zero is not attained and lies outside the inverse's domain.
12. If $g(u)=g(v)$, applying $f$ gives $(f\circ g)(u)=(f\circ g)(v)$, so $u=v$. Thus $g$ is injective. The map $f$ only needs to distinguish points in the range of $g$: take $g:[0,\infty)\to\mathbb R$ with $g(x)=x$, and $f:\mathbb R\to[0,\infty)$ with $f(x)=x^2$. The composite is injective on $[0,\infty)$, while $f(-1)=f(1)$ shows that $f$ is not injective on all of $\mathbb R$.

Summary and transfer

Set operations turn domain conditions into precise input sets. A function assigns one output per input; its range may be smaller than its codomain. Composition tests every intermediate stage. An inverse reverses an injective rule on its actual range, and restricting a domain can create the needed injectivity. Exponentials and logarithms illustrate global inverses, decreasing-base inequalities, and boundary values that are never attained.

Proofs supporting the methods used in this note

Finite real limit laws and geometric sequences: the missing proofs

Work over the ordered real numbers, with the Archimedean property, positive-integer induction and the usual absolute-value triangle inequality. A sequence converges to a finite real $L$ when every $\varepsilon>0$ admits an $N$ that works for every $n\ge N$.

Uniqueness, boundedness and subsequences. If $a_n\to L,M$ and $L\ne M$, require both errors below $|L-M|/3$ at the same sufficiently large index. The triangle inequality gives $|L-M|<2|L-M|/3$, a contradiction. For boundedness, require $|a_n-L|<1$ in the tail, and take a maximum of $|L|+1$ and the finitely many initial absolute values. For a subsequence $n_1<n_2<\cdots$, induction gives $n_k\ge k$; hence every tail threshold for the original sequence also works eventually for the subsequence.

Sum, scalar and product. If $a_n\to a$, $b_n\to b$, choose both input errors below $\varepsilon/2$; then

$$|(a_n+b_n)-(a+b)|\le |a_n-a|+|b_n-b|<\varepsilon.$$

For a fixed scalar $c\ne0$ use input tolerance $\varepsilon/|c|$; $c=0$ is immediate. Choose $B\ge1$ bounding all $|b_n|$. Require

$$|a_n-a|<\frac{\varepsilon}{2B},\qquad |b_n-b|<\frac{\varepsilon}{2(|a|+1)}.$$

The common later threshold gives $|a_nb_n-ab|\le B|a_n-a|+|a||b_n-b|<\varepsilon$.

Reciprocal and quotient. If $b\ne0$, first require $|b_n-b|<|b|/2$, ensuring $|b_n|>|b|/2$ and nonzero denominators. Then

$$\left|\frac1{b_n}-\frac1b\right|\le\frac{2|b_n-b|}{|b|^2}.$$

Requiring also $|b_n-b|<\varepsilon|b|^2/2$ proves reciprocal convergence. The product law now proves $a_n/b_n\to a/b$. Any undefined initial quotients may be omitted; convergence is a tail assertion.

Order and squeeze. If $a_n\le b_n$ eventually and $a_n\to a$, $b_n\to b$, then $a\le b$: otherwise errors below $(a-b)/3$ would force $a_n>b_n$. If $a_n\le z_n\le b_n$ eventually and both outer limits are $L$, require both errors below $\varepsilon$. Then $L-\varepsilon<z_n<L+\varepsilon$, proving $z_n\to L$. This proof does not require a previously known limit of $z_n$.

For the corresponding function-limit laws, fix a common allowed approach domain $D\subseteq\mathbb R$ and an accumulation point $a$ of $D$: every punctured neighborhood of $a$ contains a point of $D$. Let $f,g:D\to\mathbb R$ have the stated finite relative-domain limits at $a$. Replace each tail threshold in the displayed estimates by a punctured-domain radius, and take the minimum of finitely many positive radii. For the product proof only local boundedness is needed: $g(x)\to b$ gives $|g(x)|\le|b|+1$ on a sufficiently small punctured $D$-neighborhood, even if $g$ is unbounded elsewhere on $D$. The same estimates prove sum, scalar, product, reciprocal and quotient laws with their stated nonzero limiting-denominator condition; the same order and squeeze estimates apply on the common approach domain. Accumulation supplies actual points when proving uniqueness or excluding an incompatible order of limiting values.

For composition let $B\subseteq\mathbb R$, let $b\in B$, and let $F:B\to\mathbb R$ be continuous at $b$ relative to $B$. Suppose $g:D\to\mathbb R$ tends to $b$ and $g(x)\in B$ throughout some sufficiently small punctured $D$-neighborhood of $a$. Given $\varepsilon>0$, continuity supplies $\eta>0$ such that $u\in B$ and $|u-b|<\eta$ imply $|F(u)-F(b)|<\varepsilon$. The limit of $g$ and the composition-domain condition supply a common positive radius forcing both conditions for every allowed approaching $x$. Thus $F(g(x))\to F(b)$. This includes inputs with $g(x)=b$ and does not divide by an inner increment.

Geometric classification. Bernoulli's bound $(1+t)^n\ge1+nt$ for $t\ge0$ follows by induction: multiply the case $n$ by the positive $1+t$ and retain the nonnegative remainder $nt^2$. If $0<q<1$, set $t=q^{-1}-1>0$. Thus

$$0<q^n\le\frac1{1+nt}\longrightarrow0.$$

For any requested tolerance, the Archimedean property supplies $N$ making the right side smaller. Hence $r^n\to0$ for $0<|r|<1$ by $|r^n|=|r|^n$; $r=0$ gives zero for every positive index. At $r=1$ the sequence is constantly one. At $r=-1$, the even and odd subsequences are one and minus one, so uniqueness and subsequence inheritance exclude convergence. If $r>1$, Bernoulli with $t=r-1$ gives $r^n\ge1+nt\to+\infty$. If $r<-1$, $|r^n|\to+\infty$ by the same argument, contradicting boundedness of any convergent real sequence. These cases exhaust all real ratios.

Subsequences

Definition

Subsequence

A subsequence of $(x_n)$ is $(x_{n_k})$ where $n_1<n_2<\cdots$ are positive integers. If $x_n\to L$, then every subsequence converges to $L$ because $n_k\ge k$ and therefore eventually lies beyond any prescribed index.

Theorem

Bolzano–Weierstrass

Every bounded real sequence has a convergent subsequence.

Proof

Nested-interval proof

Place every term in a closed bounded interval $I_1$. Bisect it. At least one half contains infinitely many terms; choose that half as $I_2$. Continue, obtaining nested closed intervals $I_k$ of lengths tending to zero, each containing infinitely many terms. Choose indices $n_k$ strictly increasing with $x_{n_k}\in I_k$; this is possible because each interval contains infinitely many terms. Completeness gives a common point $L$ in all intervals: the supremum of their left endpoints lies in each interval because every left endpoint is at most every right endpoint. Since $x_{n_k},L\in I_k$, their distance is at most the interval length and tends to zero.

The conclusion is about a subsequence, not necessarily the whole sequence. For example, $(-1)^n$ has constant subsequences converging to $1$ and $-1$, but does not converge.

Real closed sets: the sequence criterion and the open complement

Work on the real line in the usual classical set-theoretic setting, with countable witness selections available. A set $U$ is open when every $y$ in $U$ has some $r>0$ with $(y-r,y+r)$ contained in $U$. We use the Archimedean consequence that $1/n$ tends to zero. For every $K$ subset of the real line, the following conditions are equivalent:

1. Every sequence of points of $K$ that converges in the real line has its limit in $K$.
2. The complement of $K$ is open.

Proof of 2 implies 1. Suppose $x_n$ belongs to $K$ and $x_n$ tends to $x$. If $x$ were outside $K$, openness would give $r>0$ with $(x-r,x+r)$ disjoint from $K$. Convergence gives a threshold after which $|x_n-x|<r$, contradicting $x_n$ in $K$. Therefore $x$ belongs to $K$.

Proof of 1 implies 2. Fix $y$ outside $K$. If no positive-radius interval around $y$ avoided $K$, then for every positive integer $n$ there would be a point $x_n$ in $K$ with $|x_n-y|<1/n$. Choose these witnesses as a sequence. Given $\varepsilon>0$, choose $N$ with $1/N<\varepsilon$. For $n\ge N$, $|x_n-y|<1/n\le1/N<\varepsilon$, so $x_n$ tends to $y$. Condition 1 would force $y$ into $K$, a contradiction. Hence some interval around $y$ avoids $K$. This holds for every point of the complement, proving it open. The witness-sequence step uses the stated classical setting; this proof is not offered as a theorem about choice-free foundations. If $K$ is empty there is no sequence in $K$, and its complement is the whole open line. If $K$ is the whole line, its empty complement is open vacuously. Both edge cases also satisfy the equivalence.

Learning goals and definitions

A set $K\subseteq\mathbb R$ is compact if every family of open sets whose union contains $K$ has a finite subfamily still covering $K$. A set is closed if it contains all limits of convergent sequences of its points, equivalently if its complement is open. Sequential compactness means every sequence in $K$ has a subsequence converging to a member of $K$.

The empty set is compact, closed and bounded, and sequentially compact vacuously. In proofs using a selected point or an infinite sequence, treat that case separately. We may assume the real completeness property and its nested-interval and Bolzano–Weierstrass consequences from the earlier sequence units.

Theorem: Heine–Borel in the real line

For $K\subseteq\mathbb R$, the following are equivalent: compactness by open covers; closedness and boundedness; sequential compactness.

Compact implies closed and bounded. The intervals $(-n,n)$, $n\ge1$, cover $\mathbb R$, hence $K$. A finite subcover gives a bound. To show closedness, take $y\notin K$. For each $x\in K$, the interval $B(x,|x-y|/2)$ avoids $y$. A finite subfamily covers $K$. Let $\delta$ be the minimum of their positive half-distances to $y$. Every point in the chosen interval centered at $x$ has distance from $y$ strictly greater than $|x-y|/2\ge\delta$. Thus $B(y,\delta)$ misses $K$, showing its complement open. If $K$ is empty this is immediate.

Closed and bounded implies compact. Enclose nonempty $K$ in a closed bounded interval $I_0$. Suppose an open cover of $K$ has no finite subcover. Bisect $I_0$. At least one closed half meets $K$ in a set not finitely coverable; otherwise two finite collections would cover $K$. Choose such a half and repeat. We obtain nested closed intervals $I_n$ with lengths tending to zero, and $K\cap I_n$ not finitely coverable. Each intersection is nonempty; choose $x_n\in K\cap I_n$. The nested-interval property gives a unique common point $p$, and $x_n\to p$ because both lie in $I_n$. Closedness gives $p\in K$. Some member $O$ of the cover contains $p$, and openness gives a ball around $p$ inside $O$. For large $n$, the whole interval $I_n$ lies in that ball, so $O$ alone covers $K\cap I_n$, a contradiction.

Closed and bounded implies sequentially compact. Every sequence in $K$ is bounded, so Bolzano–Weierstrass supplies a convergent subsequence. Closedness retains its limit in $K$.

Sequentially compact implies closed and bounded. If unbounded, choose $x_n\in K$ with $|x_n|>n$; no subsequence can converge to a finite real number, a contradiction. If $p$ is a limit of points in $K$, choose $x_n\in K$ with $|x_n-p|<1/n$. A subsequence converges to a point of $K$ by sequential compactness, but it also converges to $p$; uniqueness of real limits gives $p\in K$. Thus $K$ is closed. This completes all implications.

Fix an integer $n\ge1$ and the Euclidean norm on $\mathbb R^n$. A set is bounded if it lies in some finite-radius ball, closed if its complement is open, and compact if every cover by open subsets of $\mathbb R^n$ has a finite subcover. We use real completeness, including the nested closed interval property.

Heine–Borel in finite-dimensional Euclidean space

Theorem. A set $K\subseteq\mathbb R^n$ is compact if and only if it is closed and bounded. The empty set satisfies all three properties.

Compact implies bounded. The open balls $B(0,m)$, $m\ge1$ an integer, cover $K$. A finite subcover puts $K$ inside the largest of these balls.

Compact implies closed. Suppose $K\ne\varnothing$ and $y\notin K$. The balls $B(x,\|x-y\|/2)$, $x\in K$, cover $K$. Choose a finite subcover with centers $x_1,\ldots,x_r$ and set $\delta=\min_i\|x_i-y\|/2>0$. If $z$ lies in the ball centered at $x_i$, the triangle inequality gives $\|z-y\|>\|x_i-y\|/2\ge\delta$. Hence $B(y,\delta)$ misses $K$, so the complement is open.

Closed and bounded implies compact. Let nonempty $K$ be closed and bounded. Enclose it in a closed cube $Q_0=[-M,M]^n$ with $M>0$. Suppose an open cover of $K$ has no finite subcover. Divide each coordinate interval into two closed halves. The resulting $2^n$ closed subcubes cover $Q_0$. At least one subcube has intersection with $K$ that is not finitely coverable by the given family; otherwise the finite union of the finite subcovers would cover $K$. Select such a subcube and repeat. This produces nested closed cubes $Q_j$ with side length $2M/2^j$ and $K\cap Q_j$ not finitely coverable, hence nonempty.

For each coordinate, the nested interval property gives a common coordinate value. Together these give $p\in\bigcap_jQ_j$. Every pair of points in $Q_j$ has distance at most $2M\sqrt n/2^j$, so the intersection contains only $p$. Choose $x_j\in K\cap Q_j$. Then $\|x_j-p\|\le2M\sqrt n/2^j\to0$. A closed set contains such a limit: if $p$ were in its open complement, a ball around $p$ would eventually contain $x_j$ outside $K$, a contradiction. Thus $p\in K$.

One member $O$ of the cover contains $p$, and openness gives $B(p,\varepsilon)\subseteq O$ for some $\varepsilon>0$. For sufficiently large $j$, every point of $Q_j$ is within $\varepsilon$ of $p$, so $O$ alone covers $K\cap Q_j$. This contradicts the selection of $Q_j$. Therefore every open cover has a finite subcover. The number $2^n$ is finite; replacing it by infinitely many subpieces would invalidate this argument.

Continuous images and extreme values

Theorem. If $K\subseteq\mathbb R^n$ is compact and $F:K\to\mathbb R^m$ is continuous relative to $K$, then $F(K)$ is compact. In particular, a continuous $f:K\to\mathbb R$ on nonempty compact $K$ is bounded and attains its maximum and minimum.

Proof. An open cover $(O_i)$ of $F(K)$ pulls back to relatively open sets $F^{-1}(O_i)=K\cap U_i$, with $U_i$ open in $\mathbb R^n$. These $U_i$ cover $K$, so finitely many suffice. Their corresponding $O_i$ cover $F(K)$, proving compactness. For scalar $f$, the image is nonempty, closed and bounded by the theorem already proved in dimension one. Let $a=\sup f(K)$. For each $j\ge1$, the definition of supremum supplies $y_j\in f(K)$ with $a-1/j<y_j\le a$. Then $y_j\to a$, and closedness places $a$ in the image. Thus the maximum is attained. Applying the same argument to $-f$ gives the minimum. This proves existence, not a formula for the maximizing input.

Uniform continuity

Definition

One delta for the entire domain

A function $f:A\to\mathbb R$ is uniformly continuous on $A$ if for every $\varepsilon>0$ there exists $\delta>0$ such that for all $x,y\in A$, $|x-y|<\delta$ implies $|f(x)-f(y)|<\varepsilon$. The chosen $\delta$ can depend on $\varepsilon$ but not on $x$ or $y$.

Theorem

Heine–Cantor theorem

Every continuous real-valued function on a compact set is uniformly continuous.

Proof

Contradiction using compactness

If uniform continuity failed, some $\varepsilon_0>0$ would permit, for every $n$, points $x_n,y_n\in K$ with $|x_n-y_n|<1/n$ but $|f(x_n)-f(y_n)|\ge\varepsilon_0$. Compactness supplies a subsequence $x_{n_k}\to x\in K$. Since the paired distances tend to zero, also $y_{n_k}\to x$. Continuity gives both $f(x_{n_k})\to f(x)$ and $f(y_{n_k})\to f(x)$, contradicting the output separation.

Worked example

Pointwise but not uniform on an unbounded domain

The function $f(x)=x^2$ is continuous on $\mathbb R$ but not uniformly continuous there. Take $x_n=n$ and $y_n=n+1/n$. Then $|x_n-y_n|=1/n\to0$, but $|f(y_n)-f(x_n)|=2+1/n^2\not\to0$. On any closed bounded interval, Heine–Cantor does give uniform continuity. It is also direct: if $|x|,|y|\le M$, then $|x^2-y^2|\le2M|x-y|$.

Learning goals and definitions

Develop the proof behind integrability statements and distinguish boundedness from integrability. Let $a<b$ and $f$ be bounded on $[a,b]$. For a partition $P:a=x_0<\cdots<x_n=b$, put $m_i=\inf_{[x_{i-1},x_i]}f$, $M_i=\sup_{[x_{i-1},x_i]}f$, and define $L(f,P)=\sum m_i\Delta x_i$, $U(f,P)=\sum M_i\Delta x_i$. The lower integral $\underline I$ is the supremum of all lower sums; the upper integral $\overline I$ is the infimum of all upper sums. Refining a partition makes lower sums nondecreasing and upper sums nonincreasing.

For any two partitions $P,Q$, their common refinement gives $L(f,P)\le U(f,Q)$, so $\underline I\le\overline I$. Boundedness ensures these quantities are finite. The function is Riemann integrable when they agree.

Theorem: Darboux criterion

The bounded function is integrable if and only if for every $\varepsilon>0$ there is a partition with $U(f,P)-L(f,P)<\varepsilon$.

Proof. If the two integrals equal $I$, choose a lower sum above $I-\varepsilon/2$ and an upper sum below $I+\varepsilon/2$, using supremum and infimum approximation. Their common refinement has gap less than $\varepsilon$. Conversely the inequalities $0\le\overline I-\underline I\le U(f,P)-L(f,P)$ force the integral gap to be zero when such partitions exist for every positive $\varepsilon$.

Proof

Why continuity suffices

A continuous function on a compact interval is uniformly continuous. Given $\varepsilon>0$ and $b>a$, choose $\delta$ so that points less than $\delta$ apart have output difference less than $\varepsilon/(2(b-a))$. A partition with mesh below $\delta$ has oscillation on every subinterval at most that bound, hence $U-L<\varepsilon$. The Darboux criterion yields integrability. For $a=b$ the integral is zero by convention.

Bounded proper Riemann integrals: mesh equivalence and elementary properties

Let $a<b$ be finite, and let $f:[a,b]\to\mathbb R$ be bounded. For a partition $P$, write $L(f,P),U(f,P)$ for the lower and upper Darboux sums. We use real completeness and the proved Darboux criterion: equality of lower and upper integrals is equivalent to arbitrarily small $U-L$. This packet does not assume continuity of $f$.

Darboux implies every fine tagged sum converges. Let the Darboux integral be $I$. Given $\varepsilon>0$, choose a fixed partition $P_0$ with gap below $\varepsilon/2$. Choose $M>0$ with $|f|\le M$, and let $k$ be the number of interior partition points of $P_0$. For any other partition $P$, mark as bad every cell whose closure contains one of those $k$ points. Their total length is at most $2k\|P\|$, because each point belongs to at most two cells. Every remaining cell lies within a single $P_0$ cell. The contribution of all good cells to the oscillation sum $U(f,P)-L(f,P)$ is at most the gap for $P_0$; the bad cells contribute at most $2M(2k\|P\|)$. Thus

$$U(f,P)-L(f,P)<\varepsilon/2+4Mk\|P\|.$$

Take $\|P\|<\varepsilon/[8M\max(1,k)]$. Every tagged sum $S(P)$ and $I$ lie between $L(f,P)$ and $U(f,P)$, so $|S(P)-I|<\varepsilon$, independently of tags.

The converse. Suppose all sufficiently fine tagged sums are within $\eta$ of a common finite $I$. Fix one such fine partition. Each cell supremum and infimum can be approximated by actual function values with error below $\eta/(b-a)$. The resulting upper-approximating tagged sum exceeds $U(f,P)-\eta$, and the lower-approximating sum is below $L(f,P)+\eta$. Therefore $U(f,P)<I+2\eta$ and $L(f,P)>I-2\eta$. Since $\eta$ can be arbitrarily small, the Darboux criterion gives integrability. Lower and upper bounds on tagged sums then identify its integral as $I$. Suprema need not be attained for this argument.

Linearity, constants and order. For integrable $f,g$ and real $\alpha,\beta$, on any common tagged partition the exact finite identity is $S(\alpha f+\beta g)=\alpha S(f)+\beta S(g)$. Its limit exists, so the equivalence just proved gives integrability and the corresponding linear integral identity. The constant function $c$ has every sum equal to $c(b-a)$. If $f\le g$, their tagged sums with the same tags obey the same order; their limits do too. Consequently $|\int f|\le M(b-a)$ whenever $|f|\le M$.

Absolute values. The reverse triangle inequality gives $\operatorname{osc}_J|f|\le\operatorname{osc}_J f$ on every cell $J$: apply $||f(x)|-|f(y)||\le|f(x)-f(y)|$ and approximate the suprema/infima. Thus every Darboux gap for $|f|$ is at most the gap for $f$, and $|f|$ is integrable. Since $-|f|\le f\le|f|$, order and linearity give $|\int_a^b f|\le\int_a^b|f|$.

Restriction and interval addition. For $a<c<b$, refine any small-gap partition by $c$. The nonnegative gaps on $[a,c]$ and $[c,b]$ sum to the refined whole gap; each can therefore be arbitrarily small. Both restrictions are integrable. Join partitions of the two pieces with meshes tending to zero. The exact sum on the joined partition is the sum of the two tagged sums, so passage to their three limits gives $\int_a^b f=\int_a^c f+\int_c^b f$. Conversely, if both restrictions are bounded integrable, join two partitions with gaps below $\varepsilon/2$; the resulting whole gap is below $\varepsilon$, proving whole integrability and the same identity. At a shared endpoint both restrictions use the same value of $f$; no endpoint term has positive interval length. Set equal-bound integrals to zero and reversed-bound integrals to the negative. Splitting a finite interval and cancellation now extend addition to every ordering of its three endpoints.

These proofs justify the estimates used in accumulation, continuous FTC, integration by parts and proper substitution. They assert bounded proper Riemann statements only, and do not replace the separate convergence definitions at singularities or infinite endpoints.

Definition

Function limit and continuity

Suppose $f$ is defined at points arbitrarily close to $a$ other than $a$. We write $\lim_{x\to a}f(x)=L$ if for every $\varepsilon>0$ there is $\delta>0$ such that $0<|x-a|<\delta$ and $x$ in the domain imply $|f(x)-L|<\varepsilon$. The function is continuous at $a$ when it is defined there and this limit equals $f(a)$. For endpoints use the corresponding one-sided limit.

When the domain contains points arbitrarily close to $a$ on both sides, the two-sided limit exists exactly when the left- and right-hand limits both exist and agree. Polynomial functions are continuous everywhere, rational functions where the denominator is nonzero, and sums, products, quotients with nonzero denominator, and compositions of continuous functions are continuous where defined. In radian measure the standard limit is $\lim_{x\to0}\sin x/x=1$; it supports the derivative of sine later. Limits at $+∞$ and $-∞$ describe the two directions separately; neither infinity is a real input.

Theorem

Intermediate and extreme values

If $f$ is continuous on $[a,b]$, it attains a maximum and a minimum there. If $y$ lies between $f(a)$ and $f(b)$, then $f(c)=y$ for some $c\in[a,b]$. Closedness, boundedness and continuity matter for the extrema assertion; continuity on an open interval alone need not give extrema.

Proof

Proof idea for the intermediate value theorem

Assume $f(a)<y<f(b)$ and let $S=\{x\in[a,b]:f(x)\le y\}$. The set is nonempty and bounded above, so $c=\sup S$ exists. Continuity rules out $f(c)<y$ because then nearby points to the right would also be in $S$; it rules out $f(c)>y$ because points of $S$ arbitrarily close to $c$ would then have values above $y$. Therefore $f(c)=y$. Endpoint equality is immediate, and reversing the inequalities handles the other order.

Learning goals and setting

Read differentiability as linear approximation, handle zero inner increments in the chain rule, construct a differentiable function with discontinuous derivative, and state sufficient hypotheses for a local differentiable inverse. Unless an endpoint is explicitly mentioned, the function is defined on an open neighborhood of the point.

Differentiability at $a$ means a finite limit $f'(a)$ of the difference quotient. Equivalently,

$$f(a+h)=f(a)+f'(a)h+h\varepsilon(h),\qquad\varepsilon(h)\to0.$$

Define the error quotient for nonzero $h$ and give it value zero at zero. This form is the precise content of a tangent approximation. It implies continuity by letting the increment tend to zero, but does not by itself supply a numerical error constant or a bound on the second derivative.

A vertical or one-sided infinite slope is not a finite derivative under this definition. At a domain endpoint, a one-sided derivative may be a separately named object; it must not be silently identified with an unavailable two-sided derivative.

1. A chain-rule proof that handles zero inner changes

Suppose $g$ is differentiable at $a$, $F$ is differentiable at $b=g(a)$, and the nearby composition is defined. Write

$$F(b+k)-F(b)=F'(b)k+k\eta(k),\qquad\eta(k)\to0,$$

with $\eta(0)=0$. Let $k=g(a+h)-g(a)=g'(a)h+h\varepsilon(h)$. Continuity of $g$ ensures $k\to0$. Substitution gives

$$\frac{F(g(a+h))-F(g(a))}{h} =[F'(b)+\eta(k)][g'(a)+\varepsilon(h)]\longrightarrow F'(b)g'(a).$$

This proof never divides by $k$, which may be zero for infinitely many increments. The familiar product of two difference quotients needs an extra case when its proposed denominator is zero; the error-function proof includes that case automatically.

For a quotient $f/g$, the requirement $g(a)\ne0$ plus continuity of $g$ gives a neighborhood where $|g(x)|>|g(a)|/2$. Thus the quotient is locally defined and its derivative formula can be justified. Merely writing a squared denominator in the final answer does not prove this local domain fact.

From a proper area logarithm to the natural exponential

Use proper integrals of continuous functions on finite closed intervals, their proved additivity/order/linearity, the completeness and Archimedean properties, and the intermediate value theorem. Define

$$L(x)=\int_1^x\frac{dt}{t}\qquad(x>0),$$

with oriented bounds. Every integral here is proper: its interval stays a positive distance from zero.

Continuity and strict increase. For $0<u<v$, additivity and order give $L(v)-L(u)=\int_u^vdt/t\ge(v-u)/v>0$. Near any fixed $a>0$, restrict $x>a/2$. Then $|L(x)-L(a)|\le(2/a)|x-a|$, proving continuity without using a logarithmic derivative.

The product law from actual sums. Fix $u>0$. Scaling a tagged partition of the interval between $1$ and $v>0$ by $u$ scales its mesh by $u$ and its widths by $u$. The corresponding sums satisfy

$$\sum_i\frac{u\Delta s_i}{u\xi_i}=\sum_i\frac{\Delta s_i}{\xi_i}.$$

Both are sums of continuous proper integrands, so their all-mesh limits are equal. For $v<1$ reverse orientation; $v=1$ is zero directly. Hence $\int_u^{uv}dt/t=L(v)$ and

$$L(uv)=L(u)+L(v).$$

In particular $L(1)=0$, $L(1/u)=-L(u)$ and $L(2^n)=nL(2)$. As $L(2)>0$, the latter values are unbounded above by the Archimedean property; the reciprocal values are unbounded below. For any real $y$, choose positive arguments with $L$ below and above $y$. Continuity and the intermediate value theorem give an $x>0$ with $L(x)=y$. Strict increase makes that $x$ unique.

Construct and control the inverse. Define $E:\mathbb R\to(0,\infty)$ as this inverse. It is strictly increasing and continuous. To prove continuity at $y_0=L(a)$, choose $0<d<\min(a,\varepsilon)$. The numbers $L(a-d)<y_0<L(a+d)$ have positive gaps. If $|y-y_0|$ is smaller than both gaps, monotonicity forces $a-d<E(y)<a+d$, so $|E(y)-a|<\varepsilon$. The product law and uniqueness yield $E(s+t)=E(s)E(t)$, $E(0)=1$ and $E(-t)=1/E(t)$. Define $e=E(1)>1$ and $a^t=E(tL(a))$ for $a>0$. It follows that $a^{s+t}=a^sa^t$ and $(a^s)^t=a^{st}$, since $L(E(z))=z$. For integer exponents these equal repeated products; for rational $m/n$, $n>0$, the definition is the unique positive $n$th root of $a^m$. Thus it agrees with the elementary positive rational powers and gives their continuous real extension. In particular $E(t)=e^t$, and the area logarithm is its inverse $\ln=L$.

Derivatives without a cycle. For $a>0$, the average of $1/t$ on the interval between $a$ and $a+h$, with the sign of $h$ and orientation both retained, lies between its smallest and largest values on that interval. Both bounds tend to $1/a$. Thus

$$\frac{L(a+h)-L(a)}h\longrightarrow\frac1a.$$

For $y_0=L(a)$ and $h\ne0$, put $v=E(y_0+h)\ne a$. Inverse continuity gives $v\to a$, and

$$\frac{E(y_0+h)-E(y_0)}h =\left(\frac{L(v)-L(a)}{v-a}\right)^{-1}\longrightarrow a=E(y_0).$$

The denominator limit is nonzero, so the reciprocal is justified. This proves $L'=1/x$ and $E'=E$ from proper area and inverse continuity, with neither l'Hopital nor a previously assumed exponential derivative. The chain rule then gives $(x^r)'=rx^{r-1}$ on $x>0$ by $x^r=E(rL(x))$, and $(b^x)'=(\ln b)b^x$ for $b>0$. The case $b=1$ is the constant one. This supplies the normalization and identity bridge between the area logarithm, the inverse exponential and the real-power notation.