Lably
Skip to content

Calculus on Euclidean space

Calculus of functions generalization

  • 21 min read
  • 6 chapters

Related on Lably

Through Mathematics, Calculus and Linear algebra

Basic notions

Functions in one real variable

This section is a brief review of function theory in one-variable calculus.

A real-valued function f:R→R is continuous at a if it is approximately constant near a; i.e.,

limh→0(f(a+h)−f(a))=0.

In contrast, the function f is differentiable at a if it is approximately linear near a; i.e., there is some real number λ such that

limh→0f(a+h)−f(a)−λhh=0.

(For simplicity, suppose f(a)=0. Then the above means that f(a+h)=λh+g(a,h) where g(a,h) goes to 0 faster than h going to 0 and, in that sense, f(a+h) behaves like λh.)

The number λ depends on a and thus is denoted as f′(a). If f is differentiable on an open interval U and if f′ is a continuous function on U, then f is called a C1 function. More generally, f is called a Ck function if its derivative f′ is Ck-1 function. Taylor's theorem states that a Ck function is precisely a function that can be approximated by a polynomial of degree k.

If f:R→R is a C1 function and f′(a)≠0 for some a, then either f′(a)>0 or f′(a)<0; i.e., either f is strictly increasing or strictly decreasing in some open interval containing a. In particular, f:f−1(U)→U is bijective for some open interval U containing f(a). The inverse function theorem then says that the inverse function f−1 is differentiable on U with the derivatives: for y∈U

(f−1)′(y)=1f′(f−1(y)).

Derivative of a map and chain rule

For functions f defined in the plane or more generally on an Euclidean space Rn, it is necessary to consider functions that are vector-valued or matrix-valued. It is also conceptually helpful to do this in an invariant manner (i.e., a coordinate-free way). Derivatives of such maps at a point are then vectors or linear maps, not real numbers.

Let f:X→Y be a map from an open subset X of Rn to an open subset Y of Rm. Then the map f is said to be differentiable at a point x in X if there exists a (necessarily unique) linear transformation f′(x):Rn→Rm, called the derivative of f at x, such that

limh→01|h||f(x+h)−f(x)−f′(x)h|=0

where f′(x)h is the application of the linear transformation f′(x) to h. If f is differentiable at x, then it is continuous at x since

|f(x+h)−f(x)|≤(|h|−1|f(x+h)−f(x)−f′(x)h|)|h|+|f′(x)h|→0 as h→0.

As in the one-variable case, there is

Chain rule— Let f be as above and g:Y→Z a map for some open subset Z of Rl. If f is differentiable at x and g differentiable at y=f(x), then the composition g∘f is differentiable at x with the derivative

(g∘f)′(x)=g′(y)∘f′(x).

This is proved exactly as for functions in one variable. Indeed, with the notation h~=f(x+h)−f(x), we have:

1|h||g(f(x+h))−g(y)−g′(y)f′(x)h|≤1|h||g(y+h~)−g(y)−g′(y)h~|+1|h||g′(y)(f(x+h)−f(x)−f′(x)h)|.

Here, since f is differentiable at x, the second term on the right goes to zero as h→0. As for the first term, it can be written as:

{|h~||h||g(y+h~)−g(y)−g′(y)h~|/|h~|,h~≠0,0,h~=0.

Now, by the argument showing the continuity of f at x, we see |h~||h| is bounded. Also, h~→0 as h→0 since f is continuous at x. Hence, the first term also goes to zero as h→0 by the differentiability of g at y. ◻

The map f as above is called continuously differentiable or C1 if it is differentiable on the domain and also the derivatives vary continuously; i.e., x↦f′(x) is continuous.

Corollary—If f,g are continuously differentiable, then g∘f is continuously differentiable.

As a linear transformation, f′(x) is represented by an m×n-matrix, called the Jacobian matrix Jf(x) of f at x and we write it as:

(Jf)(x)=[∂f1∂x1(x)⋯∂f1∂xn(x)⋮⋱⋮∂fm∂x1(x)⋯∂fm∂xn(x)].

Taking h to be hej, h a real number and ej=(0,⋯,1,⋯,0) the j-th standard basis element, we see that the differentiability of f at x implies:

limh→0fi(x+hej)−fi(x)h=∂fi∂xj(x)

where fi denotes the i-th component of f. That is, each component of f is differentiable at x in each variable with the derivative ∂fi∂xj(x). In terms of Jacobian matrices, the chain rule says J(g∘f)(x)=Jg(y)Jf(x); i.e., as (g∘f)i=gi∘f,

∂(gi∘f)∂xj(x)=∂gi∂y1(y)∂f1∂xj(x)+⋯+∂gi∂ym(y)∂fm∂xj(x),

which is the form of the chain rule that is often stated.

A partial converse to the above holds. Namely, if the partial derivatives ∂fi/∂xj are all defined and continuous, then f is continuously differentiable. This is a consequence of the mean value inequality:

Mean value inequality— Given the map f:X→Y as above and a point x in X and a vector y such that the line segment x+ty,0≤t≤1 lies in X, if t↦f(x+ty) is continuous on [0,1] and is differentiable on the interior, then, for any vector v∈Rm,

|Δyf(x)−v|≤sup0<t<1|ddtf(x+ty)−v|

where Δyf(x)=f(x+y)−f(x).

(This version of mean value inequality follows from mean value inequality in Mean value theorem § Mean value theorem for vector-valued functions applied to the function [0,1]→Rm,t↦f(x+ty)−tv, where the proof on mean value inequality is given.)

Indeed, let g(x)=(Jf)(x). We note that, if y=yiei, then

ddtf(x+ty)=∂f∂xi(x+ty)y=g(x+ty)(yiei).

For simplicity, assume n=2 (the argument for the general case is similar). Then, by mean value inequality, with the operator norm ‖⋅‖,

|Δyf(x)−g(x)y|≤|Δy1e1f(x1,x2+y2)−g(x)(y1e1)|+|Δy2e2f(x1,x2)−g(x)(y2e2)|≤|y1|sup0<t<1‖g(x1+ty1,x2+y2)−g(x)‖+|y2|sup0<t<1‖g(x1,x2+ty2)−g(x)‖,

which implies |Δyf(x)−g(x)y|/|y|→0 as required. ◻

Example: Let U be the set of all invertible real square matrices of size n. Note U can be identified as an open subset of Rn2 with coordinates xij,0≤i,j≠n. Consider the function f(g)=g−1 = the inverse matrix of g defined on U. To guess its derivatives, assume f is differentiable and consider the curve c(t)=getg−1h where eA means the matrix exponential of A. By the chain rule applied to f(c(t))=e−tg−1hg−1, we have:

f′(c(t))∘c′(t)=−g−1he−tg−1hg−1.

Taking t=0, we get:

f′(g)h=−g−1hg−1.

Now, we then have:

‖(g+h)−1−g−1+g−1hg−1‖≤‖(g+h)−1‖‖h‖‖g−1hg−1‖.

Since the operator norm is equivalent to the Euclidean norm on Rn2 (any norms are equivalent to each other), this implies f is differentiable. Finally, from the formula for f′, we see the partial derivatives of f are smooth (infinitely differentiable); whence, f is smooth too.

Higher derivatives and Taylor formula

If f:X→Rm is differentiable where X⊂Rn is an open subset, then the derivatives determine the map f′:X→Hom⁡(Rn,Rm), where Hom stands for homomorphisms between vector spaces; i.e., linear maps. If f′ is differentiable, then f″:X→Hom⁡(Rn,Hom⁡(Rn,Rm)). Here, the codomain of f″ can be identified with the space of bilinear maps by:

Hom⁡(Rn,Hom⁡(Rn,Rm))→∼φ{(Rn)2→Rm bilinear}

where φ(g)(x,y)=g(x)y and φ is bijective with the inverse ψ given by (ψ(g)x)y=g(x,y). In general, f(k)=(f(k−1))′ is a map from X to the space of k-multilinear maps (Rn)k→Rm.

Just as f′(x) is represented by a matrix (Jacobian matrix), when m=1 (a bilinear map is a bilinear form), the bilinear form f″(x) is represented by a matrix called the Hessian matrix of f at x; namely, the square matrix H of size n such that f″(x)(y,z)=(Hy,z), where the paring refers to an inner product of Rn, and H is none other than the Jacobian matrix of f′:X→(Rn)∗≃Rn. The (i,j)-th entry of H is thus given explicitly as Hij=∂2f∂xi∂xj(x).

Moreover, if f″ exists and is continuous, then the matrix H is symmetric, the fact known as the symmetry of second derivatives. This is seen using the mean value inequality. For vectors u,v in Rn, using mean value inequality twice, we have:

|ΔvΔuf(x)−f″(x)(u,v)|≤sup0<t1,t2<1|f″(x+t1u+t2v)(u,v)−f″(x)(u,v)|,

which says

f″(x)(u,v)=lims,t→0(ΔtvΔsuf(x)−f(x))/(st).

Since the right-hand side is symmetric in u,v, so is the left-hand side: f″(x)(u,v)=f″(x)(v,u). By induction, if f is Ck, then the k-multilinear map f(k)(x) is symmetric; i.e., the order of taking partial derivatives does not matter.

As in the case of one variable, the Taylor series expansion can then be proved by integration by parts:

f(z+(h,k))=∑a+b<n∂xa∂ybf(z)hakba!b!+n∫01(1−t)n−1∑a+b=n∂xa∂ybf(z+t(h,k))hakba!b!dt.

Taylor's formula has an effect of dividing a function by variables, which can be illustrated by the next typical theoretical use of the formula.

Example: Let T:S→S be a linear map between the vector space S of smooth functions on Rn with rapidly decreasing derivatives; i.e., sup|xβ∂αφ|<∞ for any multi-index α,β. (The space S is called a Schwartz space.) For each φ in S, Taylor's formula implies we can write:

φ−ψφ(y)=∑j=1n(xj−yj)φj

with φj∈S, where ψ is a smooth function with compact support and ψ(y)=1. Now, assume T commutes with coordinates; i.e., T(xjφ)=xjTφ. Then

Tφ−φ(y)Tψ=∑j=1n(xj−yj)Tφj.

Evaluating the above at y, we get Tφ(y)=φ(y)Tψ(y). In other words, T is a multiplication by some function m; i.e., Tφ=mφ. Now, assume further that T commutes with partial differentiations. We then easily see that m is a constant; T is a multiplication by a constant.

(Aside: the above discussion almost proves the Fourier inversion formula. Indeed, let F,R:S→S be the Fourier transform and the reflection; i.e., (Rφ)(x)=φ(−x). Then, dealing directly with the integral that is involved, one can see T=RF2 commutes with coordinates and partial differentiations; hence, T is a multiplication by a constant. This is almost a proof since one still has to compute this constant.)

A partial converse to the Taylor formula also holds; see Borel's lemma and Whitney extension theorem.

Inverse function theorem and submersion theorem

Inverse function theorem—Let f:X→Y be a map between open subsets X,Y in Rn,Rm. If f is continuously differentiable (or more generally Ck) and f′(x) is bijective, there exists neighborhoods U,V of x,f(x) and the inverse f−1:V→U that is continuously differentiable (or respectively Ck).

A Ck-map with the Ck-inverse is called a Ck-diffeomorphism. Thus, the theorem says that, for a map f satisfying the hypothesis at a point x, f is a diffeomorphism near x,f(x). For a proof, see Inverse function theorem § A proof using successive approximation.

The implicit function theorem says: given a map f:Rn×Rm→Rm, if f(a,b)=0, f is Ck in a neighborhood of (a,b) and the derivative of y↦f(a,y) at b is invertible, then there exists a differentiable map g:U→V for some neighborhoods U,V of a,b such that f(x,g(x))=0. The theorem follows from the inverse function theorem; see Inverse function theorem § Implicit function theorem.

Another consequence is the submersion theorem.

Integrable functions on Euclidean spaces

A partition of an interval [a,b] is a finite sequence a=t0≤t1≤⋯≤tk=b. A partition P of a rectangle D (product of intervals) in Rn then consists of partitions of the sides of D; i.e., if D=∏1n[ai,bi], then P consists of P1,…,Pn such that Pi is a partition of [ai,bi].

Given a function f on D, we then define the upper Riemann sum of it as:

U(f,P)=∑Q∈P(supQf)vol⁡(Q)

where

  • Q is a partition element of P; i.e., Q=∏i=1n[ti,ji,ti,ji+1] when Pi:ai=ti,0≤…⋯≤ti,ki=bi is a partition of [ai,bi].
  • The volume vol⁡(Q) of Q is the usual Euclidean volume; i.e., vol⁡(Q)=∏1n(ti,ji+1−ti,ji).

The lower Riemann sum L(f,P) of f is then defined by replacing sup by inf. Finally, the function f is called integrable if it is bounded and sup{L(f,P)∣P}=inf{U(f,P)∣P}. In that case, the common value is denoted as ∫Dfdx.

A subset of Rn is said to have measure zero if for each ϵ>0, there are some possibly infinitely many rectangles D1,D2,…, whose union contains the set and ∑ivol⁡(Di)<ϵ.

A key theorem is

Theorem— A bounded function f on a closed rectangle is integrable if and only if the set {x|f is not continuous at x} has measure zero.

The next theorem allows us to compute the integral of a function as the iteration of the integrals of the function in one-variables:

Fubini's theorem—If f is a continuous function on a closed rectangle D=∏[ai,bi] (in fact, this assumption is too strong), then

∫Dfdx=∫anbn⋯(∫a1b1f(x1,…,xn)dx1)dx2⋯dxn.

In particular, the order of integrations can be changed.

Finally, if M⊂Rn is a bounded open subset and f a function on M, then we define ∫Mfdx:=∫DχMfdx where D is a closed rectangle containing M and χM is the characteristic function on M; i.e., χM(x)=1 if x∈M and =0 if x∉M, provided χMf is integrable.

Surface integral

If a bounded surface M in R3 is parametrized by r=r(u,v) with domain D, then the surface integral of a measurable function F on M is defined and denoted as:

∫MFdS:=∫∫D(F∘r)|ru×rv|dudv

If F:M→R3 is vector-valued, then we define

∫MF⋅dS:=∫M(F⋅n)dS

where n is an outward unit normal vector to M. Since n=ru×rv|ru×rv|, we have:

∫MF⋅dS=∫∫D(F∘r)⋅(ru×rv)dudv=∫∫Ddet(F∘r,ru,rv)dudv.

Sign in to keep reading

5 more chapters are free with a Lably account.

More in Topics in mathematics