Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Easter 2007
Professor Terry Lyons
F19, Mathematical Institute
tlyons@maths.ox.ac.uk
March 27, 2008
1
In these lectures we define a simple integral and study its properties; prove
the Mean Value Theorem for Integrals and the Fundamental Theorem of Cal-
culus. This gives us the tools to justify term by term differentiation of power
series and deduce the elementary properties of the trigonometric functions.
0.1 Synopsis
Step functions, their integral, basic properties. The application of uniform con-
tinuity to approximate continuous functions above and below by step functions.
The integral of a continuous function on a closed bounded interval. Elemen-
tary properties of the integral of a continuous function: positivity, linearity,
subdivision of the interval.
The Mean Value Theorem for Integrals. The Fundamental Theorem of Cal-
culus; linearity of the integral, integration by parts and substitution.
The interchange of integral and limit for a uniform limit of continuous func-
tions on a bounded interval. Term by term integration and differentiation of a
(real) power series (interchanging limit and derivative for a series of functions
where the derivatives converge uniformly); examples to include the derivation
of the main relationships between exponential, trigonometric functions and hy-
perbolic functions.
0.2 Reading
• T. Lyons Lecture Notes.
2
1 Integrating continuous functions
The space of functions mapping an interval into the reals
f :J →R
is huge! We are obviously familiar with those such as x → x2 which are given
by a formula but in some sense these are a minority. Even simple functions such
as
φ (x) = [x] = max {n | n ≤ x}
(which is always defined because of the standard axioms for the real numbers)
generated considerable controversy when they were first introduced.
Many functions cannot be graphed very easily if at all. For example
µ ¶
p 1
f = , (p, q) = 1, p, q ∈ Z, q > 0
q q
f (x) = 0, x ∈ R\Q
f (0) = 0.
Our goal in this course is to identify a sensible class of functions that can be
integrated. Having done this, we must make it happen, make sense of
Z b
f (x) dx
a
and prove that it has all the obvious properties, such as linearity. I hope that
you will be surprised by the way that we are able to move relatively smoothly
from rather primitive notions to quite sophisticated information about the basic
functions, such as the exponential, logarithm, and the trigonometric functions
sin, cos etc..
Integration will provide one of the first serious contexts you will meet where
we examine, in a rigorous way, functions on functions!
In order to defined the integral we are going to consider two basic classes of
functions
1. Step Functions: The functions f defined on an interval I, for which there
is a finite partition Pf ⊂ I so that f is constant on each remaining (open)
interval.
2. The continuous functions on a closed interval J.
If we fix J then both of these spaces of functions are real vector spaces.
3
Definition 1.2 The endpoints of interval I are defined to be b = sup I and
a = inf I. It is allowed and can happen that b = +∞ or a = −∞.
for some a ≤ b ∈ R. In any case where one of these sets is non-empty, and in
particular when a < b, any such set is an interval.
Remark 1.8 By considering the intervals [aj , aj ] as well as the (aj−1 , aj ) one
sees that a function φ defined on an interval I is a step function if and only if
one can decompose the interval φ into finitely many disjoint subintervals so that
φ is constant on each of them. The decomposition is not unique.
4
Proof. We treat the case of a bounded interval; the other cases are similar. It
is enough to add the points ±∞ to a partition
χA (x) = 1, x ∈ A
χA (x) = 0, x =
6 A.
Proof. Let Pf and Pg be finite partitions witnessing that f and g are step
functions. Now let P = Pf ∪ Pg . Then P is finite and a refinement of Pf and
Pg . In view of Proposition 1.11 P is witness to the fact that f and g are both
step functions. We can order the points of P : (a0 < a1 < a2 < · · · < ak ) . Since
f and g are both constant on (aj−1 , aj ) their sum is as well. As this holds for
all j ≤ k the function f + g is constant on every interval in I\P and so a step
function with witness P .
5
Exercise 1.14 Prove that if I ⊂ J are intervals then the restriction of a step
function on J to I is also a step function.
Exercise 1.15 Any step function φ can be written in the form of a finite sum
k
X
φ= χIj
j=1
PkA Priestley step function is any function that can be expressed in the form
j=1 χIj (x) where Ij are bounded intervals.
Exercise 1.16 The Priestley step functions are the step functions φ on the
interval R that are zero on the initial and final intervals
(−∞, a1 ) , (ak−1 , ∞)
Remark 1.17 In this way, we have reconciled the different notations used in
different publications from the Institute. We will stick to our version, which is
equivalent to the definition used in Roe. However, the differences between the
classes of functions described by these definitions are minor, and the key issues
lay elsewhere!
φ (x) = ci , x ∈ (ai−1 , ai ) .
Pk
We might define I (φ, P ) = i=1 ci (ai − ai−1 ), and perhaps this makes a good
starting point, as the definition for the integral of φ. However, it might be
the case that a second partition P̃ witnessing φ as a step function could give a
different integral.
6
¯ ¯
Proof. Let |P | = n and ¯P̃ ¯ = ñ. We proceed by induction. Suppose the
¯ ¯
proposition is false, then among all counterexamples, we can choose a one: φ,
J, P , P̃ with ³ ´
I (φ, P ) 6= I φ, P̃ .
|P | which contradicts ¯the¯ assumption that our (counter) example was maximal
among all those with ¯P̃ ¯ = ñ.
¯ ¯
¯ ¯
Hence, we may assume that |P | = ¯P̃ ¯ − 1. Let
¯ ¯
³ ´ j−1
X
I φ, P̃ = ci (ai − ai−1 )
i=1
+cj (ã − aj−1 )
+cj (aj − ã)
Xn
+ ci (ai − ai−1 )
i=j
and because
cj (aj − aj−1 ) = cj (ã − aj−1 ) + cj (aj − ã)
³ ´ ³ ´
We have I φ, P̃ = I φ, P̃ . This contradicts the existence of a counterexam-
ple as required.
Corollary 1.19 The integral I (φ, P ) of a step function does not depend on the
choice of partition.
7
Proof. Let P and P ′ be two partitions witnessing that φ is a step function.
Let P̃ = P ∪ P ′ then P̃ is a refinement of both of these partitions and
³ ´
I (φ, P ) = I φ, P̃ = I (φ, P ′ ) .
Rb
Definition 1.20 We define the integral a φ of a step function φ to be I (φ, P )
for any partition witnessing that is a step function.
Theorem 1.21 (Linearity and Positivity on step functions) Let φ and ψ
be two step functions on the interval J = [a, b] and let α and β be real numbers;
then the integrals of the step functions αφ + βψ, φ and ψ satisfy
Z b Z b Z b
αφ + βψ = α φ+β ψ.
a a a
If, for some non-empty open interval (c, d) ⊂ [a, b] one has φ (a) > ψ (a), a ∈
(c, d), then
Z b Z b
φ> ψ.
a a
Proof. Fix partitions of the interval J = [a, b] witnessing that φ and ψ are
both step functions on J and, if neccessary refine the partition to include {c, d},
by taking the union of these two partitions, choose a single partition P =
(a0 = a < a1 · · · < an−1 = b) that is a refinement of both. Then, by assumption,
there are constants ci and di so that
φ (x) = ci , x ∈ (ai−1 , ai )
ψ (x) = di , x ∈ (ai−1 , ai )
and for each i
(αφ + βψ) (x) = αi ci + βdi , x ∈ (ai−1 , ai ) .
So, from the definition of I and the usual distributive laws of arithmetic
n
X
I ((αφ + βψ), P ) = (αi ci + βdi ) (ai − ai−1 )
i=1
Xn
= αi ci (ai − ai−1 )
i=1
n
X
+ βdi (ai − ai−1 )
i=1
= αI (φ, P ) + βI (ψ, P ) .
8
The case of inequality can be proved by following a virtually identical argu-
ment. The inequality between the functions becomes an inequality between the
terms in a sum and noting that if there is a strict inequality on one of the terms
in the sum there is a strict inequality on the sums.
Alternatively, one can use the linearity established in the first part of this
proof to reduce the problem to a special case: if φ ≥ ψ on the interval J = [a, b],
then (φ − ψ) ≥ 0 on the interval J = [a, b] .and is also a step function. The
integral of a positive step function is clearly (from the definition) positive. So
Z b
(φ − ψ) ≥ 0
a
and so
Z b Z b
φ− ψ ≥ 0
a a
Z b Z b
φ ≥ ψ
a a
For strict inequality between the integrals of φ and ψ it is enough that the step
function (φ − ψ) > 0 on a non-empty open interval.
Lemma 1.23 If f ∈ C [a, b] then there exists m, M∈ (−∞, ∞) so that for all
x ∈ [a, b] m ≤ f (x) ≤ M.
9
From this and the positivity of the integral on Lstep [a, b] we see that
Proof. Fix a continuous function f ∈ C [a, b] Then m and M are finite numbers.
So there is always a step function mχ[a,b] less than f on the interval [a, b].
similarly, there were always be a step function M χ[a,b] dominating f on the
interval [a, b] .hence
Z b
f < M (b − a)
a
< ∞
and
−∞ < m (b − a)
Z b
< f.
a
∀φ ∈ Lstep [a, b] , φ ≤ f
φ ≤ ψ
and since ψ was arbitrarily chosen from {ψ ∈ Lstep [a, b] , ψ ≥ f }we can take
the infimum of the right-hand side over this class of step functions to get
Z b Z b
f≤ f.
a a
10
Theorem 1.25 If f is a continuous function on the closed and bounded interval
[a, b] then
Z b Z b
f= f
a a
Theorem 1.26 (uniform continuity - from last term or books) Every con-
tinuous function on a closed bounded interval [a, b] is uniformly continuous.
That is to say, if f ∈ C [a, b] then for each ε > 0 there exists a δ > 0 so that if
|x − y| ≤ δ and x, y ∈ [a, b] then |f (x) − f (y)| < ε.
Proof. The result is obvious if b = a as in this case both sides are zero.Fix
ε
f and ε > 0. Choose δ > 0 so that if |x − y| ≤ δ then |f (x) − f (y)| < b−a .
Choose a partition
P = (a0 = a < a1 · · · < an = b)
so that |ar − ar−1 | ≤ δ for every r ≤ n.
Define
φ = cr on (ar−1 , ar )
ψ = dr on (ar−1 , ar )
and
φ (ar ) = ψ (ar ) = f (ar ) .
Then φ and ψ are in Lstep [a, b] .Clearly
φ≤f ≤ψ
11
and
b b µ ¶
ε
Z Z
ψ ≤ φ+ (1)
a a b−a
b b
ε
Z Z
= φ+ (2)
a a b−a
Z b
= φ+ε (3)
a
Z b
≤ f +ε (4)
a
so
Z b Z b Z b
f≤ f≤ f +ε
a a a
Rb Rb
and as ε is arbitrary a f = a f .
We can extract the following remark out of the above proof:
12
2 The Fundamental Theorem of Calculus and
the link with differentiation
We now wish to develop some basic consequences that follow from our ability to
integrate continuous functions. We start by proving that the integral is positive
and linear.
Proof. Suppose that x∈ [a, b] and f (x) > 0. Choose ε ∈ (0, f (x) /2) ;the
interval is nonempty by hypothesis. Since f is continuous there is a δ > 0 so
that if y ∈ (x − δ, x + δ) ∩ [a, b] then |f (y) − f (x)| < ε. In particular f (y) >
ε. Suppose that φ = ε on (x − δ, x + δ) ∩ [a, b] and zero off it. Then φ ∈
Lstep [a, b] .Since a < b and x ∈ [a, b] it follows that there is a δ ′ > 0 so that one
of the following holds:
x − δ ′ , x ⊂ (x − δ, x + δ) ∩ [a, b]
¡ ¢
x, x + δ ′
¡ ¢
⊂ (x − δ, x + δ) ∩ [a, b]
Then, one of
εχ(x−δ′ ,x) ≤ φ
εχ(x,x+δ′ ) ≤ φ
Rb
and in either case, 0 < εδ ′ ≤ a
φ. By definition
Z b Z b Z b
φ≤ f≤ f.
a a a
and Z b Z b Z b
(f + g) = f+ g.
a a a
13
separately. If α ≥ 0 then αφ is a step function less than αf if φ is a step function
less than f.From the linearity of the integral on step functions one can conclude
Z b Z b
α φ≤ af
a a
and taking the supremum over the step functions less than f one has
Z b Z b
α f≤ af.
a a
and similarly
Z b Z b
af ≤ a f
a a
and recalling that, because f is continuous, f is integrable and
Z b Z b Z b Z b
a f≤ af. ≤ af ≤ a f
a a a a
Then
b b µ ¶
ε
Z Z
(f + g) ≤ φ+ψ+
a a (b − a)
Z b Z b
= φ+ ψ+ε
a a
Z b Z b
≤ f+ g + ε.
a a
Rb Rb Rb
Because ε was arbitrary, we have a (f + g) ≤ a f + a g. Applying this to
−f and −g using the relation in the first part of the proof we conclude that
Rb Rb Rb
a
(f + g) = a f + a g.
14
Proof. The result is obvious for step functions;
φ = χ[a,b) φ + χ[b,c] φ
so that Z c Z c Z c
φ= χ[a,b) φ + χ[b,c] φ
a a a
but, adding the point b to any partition P witnessing that χ[a,b) φ is a step
function on [a, c] one quickly sees that
Z b Z c
φ = χ[a,b) φ
Z ac Zac
φ = χ[b,c] φ
b a
15
Proof. Let
f (e) = m
f (E) = M.
b
1
Z
m≤ f ≤M
b−a a
(assuming b > a) and by the intermediate value theorem there exists c ∈ [e, E] ⊂
[a, b] so that
Z b
1
f = f (c) .
b−a a
If b = a the result is immediate with c = b.
Exercise 2.6 Suppose f , and g are continuous functions on the closed bounded
Rb Rb
interval [a, b] and that a f = a g then there exists a point c ∈ [a, b] such that
f (c) = g (c).
Note that the first mean and value theorem (FMVT) follows from this remark
1
Rb
by taking g (x) ≡ b−a a
f .
Rb Ra
Definition 2.7 If b < a then that we define a
f to be - b
f.
Proof. We only treat the new case a < c < b. Using theorem2.3 we see that
Z b Z c Z b
f= f+ f
a a c
and so Z c Z b Z b
f= f− f
a a c
16
and by definition this
Z b Z c
= f+ f.
a b
then F is differentiable on (a, b) with the left derivative at b and a right derivative
at a and
F ′ (x) = f (x) , x ∈ [a, b] .
for all x ∈ [a, b). Then a similar argument (with the additivity of the integral
on disjoint intervals) will prove the existence of a right derivative for x ∈ (a, b] .
Taken together these give the theorem.
Fix ε > 0, because f is continuous, we may choose δ > 0 so that
and applying the first mean value theorem there exists ζ ∈ [x, x + h] so that
F (x + h) − F (x)
= f (ζ) .
h
17
If h ∈ (0, δ) then |x − ζ| < δ and so
¯ ¯
¯ F (x + h) − F (x) ¯
¯ − f (x)¯¯ < ε.
¯ h
Theorem 2.11 (the second mean value theorem for integrals) Suppose
f, g ∈ C [a, b], and that g ≥ 0 then there exists c ∈ [a, b] so that
Z b Z b
f g = f (c) g
a a
2.1.1 Applications
Example 2.12 (Logarithm) For y ∈ R>0 define
Z y
1
log y =
1 x
1
then log y this differentiable and its derivative is y.
18
then g is the derivative of tan−1 nx. Hence
Z 1
£ ¤1 1
g (x) dx = tan−1 nx 0 → π
0 2
3
The graph of 1+32 x2
R 1 nf (x) R1 n
We know there is a choice of cn so that 0 1+n 2 x2 dx = f (cn ) 0 1+n2 x2 dx.If
19
Definition 3.1 A function F is the primitive (or anti-derivative) of f on [a, b]
if F ′ = f on [a, b].
In view of Cor. 2.13 F is the indefininte integral of f if the latter is contin-
uous.
Remark 3.2 There are good and bad notations; one often adds a dx to indicate
the argument in the function: Z
xdx
20
Proof. The function uv is differentable, its derivative is (u′ v) + (uv ′ )
Substitution
Proposition 3.5 (Substitution) Suppose that g ∈ C [c, d] is monotone in-
creasing, and continously differentiable so g ′ ∈ C [c, d] , g ′ > 0 and suppose that
g (c) = a, g (d) = b.Suppose that f ∈ C [a, b] . Then
Z d
f ◦ gg ′
c
Z b
= f
a
Rx
Proof. We can apply the fundamental theorem of calculus. Let F (x) := a
f
and define G (u) = F (g (u)) then
G (c) = F (g (c))
= F (a)
= 0
Z b
f = G (d)
a
= G (d) − G (c)
and providing G is continuously differentiable one has
Z d
G (d) − G (c) = G′
c
′
so recalling that (FTC again) that F = f and applying the chain rule
G′ (u) = f ◦ g (u) g ′ (u)
and hence Z b Z d
f (x) dx = f ◦ g (u) g ′ (u) du
a c
21
http://math.berkeley.edu/˜sassaf/math1b/fa03/tech.pdf
22
4 Power series and limits - The trancendental
mathematical functions exp, sin etc.
4.1 The Interchange of Limits and Integration
In general, Real numbers (even interesting ones such as π) lack descriptions
in terms of simple formulae, and instead are defined in terms of limits. In an
analogous way, most of the interesting mathematical functions are constructed
as limits; for example, as an infinite series. Operations such as differentiation
and integration are often well understood when applied to the the intermediate
functions used in the construction and we need understand how to inherit some
of these properties for the limit.
For example, it is a simple calculation to see that
N
X 2
πt
u (x, t) = a0 + e−n (an cos nπx + bn sin nπx)
1
∂ ∂2
u= 2 u
∂t ∂ x
and most of you will know that it is possible to write a reasonably a general
function F as the sum of an infinite Fourier series
∞
X
F (x) = a0 + (an cos nπx + bn sin nπx) .
1
With this in mind it would certainly make sense to ask about the convergence
of
∞
X 2
a0 + e−n πt (an cos nπx + bn sin nπx)
1
and particularly to ask whether the limit is a solution to the same differential
equation. If it were, then one would have constructed a solution to the heat
equation on the unit interval having periodic boundary conditions at the end of
the intervals, and having as its initial condition a temperature F .
23
and hence conclude from a second application of the FTC that
d x
e = ex
dx
Remark 4.2 In the previous two examples, we hoped (and we shall see our
hope fulfilled in this context) that the derivative of the limit (or the integral of
the limit) the limit of the derivatives (integrals) of the approximating sequences -
which can be computed computed term by term. Our wish is not always fulfilled!
There are even really important examples where it works in our favour that the
derivative of the limit is not the limit of the derivatives. So it is important
to understand the sort of hypotheses involved in proving the conditions we give
below.
Definition 4.4 Let fn , f be functions on the set [a, b]. we say that fn → f
uniformly on [a, b] if
Theorem 4.5 Suppose that fn → f uniformly on [a, b], where fn ∈ C [a, b].
Then f ∈ C [a, b].
Remark 4.6 If you have too show that a sequence of functions converges uni-
formly then one should always be careful. It often happens that the location
where
|fn (x) − f (x)|
takes its maximum will frequently depend on n and so moves. It pays to use
calculus to determine the critical points of fn (x) − f (x).
converge to 0 uniformly iff α < 1. (Hint - compute f (x) = lim fn (x). Then
take logs of |fn (x) − f (x)| and differentiate to identify the maximum.)
24
Theorem 4.8 Suppose that fn → f uniformly on [a, b], where fn ∈ C [a, b] ,(and
so f ∈ C [a, b]) then
Z b Z b
fn → f.
a a
Proof. If b = a then both sides of the expression are zero and the argument is
complete. So fix ε > 0 and use the uniform convergence of the fn to choose N
so that |fn (x) − f (x)| < ε/ (b − a) for all n > N . Then
¯Z Z b ¯¯ ¯Z ¯
¯ b ¯ b ¯
fn − f¯ = ¯ (fn − f )¯
¯ ¯ ¯ ¯
¯
¯ a a ¯ ¯ a ¯
Z b
≤ |(fn − f )|
a
< ε.
Rb Rb
Hence a
fn → a
f.
P∞
Corollary 4.9 If ur ∈ C [a, b] and 0 ur converges uniformly then
Z bX ∞ X∞ Z b
ur = ur .
a 0 0 a
The Wierstrass
P∞ M-test from last term (look it up!) is a convenient way to
see that 0 ur converges uniformly.
Example 4.10 Consider
x2 x4
f (x) = 1− + + ···
3! 5!
∞
X n x2n
= (−1)
n=0
(2n + 1)!
sin x
for x ∈ [0, 1]. (this is x if x 6= 0) then, for t ∈ [0, x]
t2n ¯¯ ¯ t2n ¯
¯ ¯ ¯ ¯
¯(−1)n
¯
= ¯ ¯
¯ (2n + 1)! ¯ ¯ (2n + 1)! ¯
¯ x2n ¯
¯ ¯
≤ ¯ ¯ ¯
(2n + 1)! ¯
= Mn
P∞
and n=0 Mn < ∞ so the series for f converges uniformly on [0, x]. As a
result, we may integrate term by term:
Z x ∞ Z x
X n t2n
f = (−1)
0 n=0 0 (2n + 1)!
∞
X n x2n+1
= (−1)
n=0
(2n + 1)! (2n + 1)
25
4.2 Power series
P∞
Now recall form last term that a power series n=0 an xn always has a radius
of convergence R, and that if |x| < R then the series is absolutely convergent
P∞ n
with n=0 |an | |x| < ∞ and moreover, for |z| ≤ |x| one has
n
|an z n | ≤ |an | |x|
is strictly finite
P∞ for each θ and x. So, by comparison with C (x, θ) |an xn θn | one
deduces that n=0 nan xn−1 is also absolutely convergent. So R′ ≥ R.
The other comparison can be achieved by simply relabelling the co-efficients
- put
b0 = 0
an
bn+1 =
n+1
26
P∞ n
P∞ n−1
then n=0 bn x ,P n=0 nbn x have the same radius of convergence so that
P ∞ n ∞ n−1
n=1 bn x and n=1 nbn x have the same radius of convergence. Substi-
tuting in the definitions of the bn we get
∞ ∞
X X an−1 n
bn xn = x
n=1 n=1
n
∞
X an−1 n
= x
n=1
n
∞
X an n+1
= x .
n=0
n +1
∞
X ∞
X
nbn xn−1 = an−1 xn−1
n=1 n=1
X∞
= an xn
n=0
27
Example 4.13 The series
∞
1 X
= xn , |x| < 1
1−x 0
leads one to
∞
X xn+1
− log (1 − x) =
n=0
n+1
∞
X xn
=
n=1
n
n
for x ∈ (−1, 1) .Note: although it is true that log 2 = n=1 (−1)
P∞
n it does not
follow from the above arguments and is much more delicate.
P∞
Theorem 4.14 Suppose that f (t) = n=0 an tn has a radius of P convergence R
∞
then f can be differentiated term by term on (−R, R) and f ′ (t) = n=0 an−1 tn−1
for t ∈ (−R, R).
P∞
Proof. Put g (t) = n=0 an−1 tn−1 for t ∈ (−R, R) and
Z x
G (x) = g (t) dt, x ∈ (−R, R) .
0
Applying term by term integration one has that G (x) + a0 = f (x). Since g is
continuous we may apply the fundamental theorem of calculus to deduce that
f is differentiable and its derivative is g.
28
and so z ∈ C
exp iz = cos z + i sin z
and if z ∈ R then
Proof. Since cos 0 = 1 and cos is continous, there exists a δ > 0 so that cos> 12
on [0, δ] so if x exists then x ≥ δ > 0. But we can be more precise! Recall the
basic estimate of alternating series: if an are positive numbers decreasing to
zero and if
N
n
X
SN = (−1) an
n=0
29
then the series converges to some limit l and in fact one can be much more
precise
S0 ≥ S2 ≥ · · · ≥ S2n ≥ l ≥ S2n+1 ≥ · · · ≥ S3 ≥ S1
|S2n − S2n+1 | ≤ a2n+1
z 2n
an :=
(2n)!
p
are monotone decreasing for all n such that 0 ≤ z < (2n + 2) (2n + 1) in
particular if z ≤ 3 then a1 > a2 > a3 etc.
x2 x4
1− + ≥ cos x
2 4!
and if x ∈ [0, 3] then
x2 x4 x6
µ ¶
cos x > 1 − + −
2 4! 6!
£ √ ¢
and in particular cos 2 ≤ − 83 while for x ∈ 0, 2 the function cos x > 0.
√
Corollary 4.22 The number π exists and satisfies 2 2 ≤ π < 4.
Proof. Now cos 0 = 1 and cos 2 < 0 so that the continuity of cos,together
with the intermediate value theorem ensure that the set of x ∈ (0, 2) for which
cos x = 0 is closed and nonempty. It is therefore also compact and has a smallest
element which we can (and do) call π. By using higher approximations we can
of course get arbirarily good numerical approximations - but at the moment we
are happy that is exists.
Proof. The derivative of sin is cos and cos ≥ 0 on ¡[0, ¢π/2] so that sin is
2 2 π
increasing
¡ πon
¢ [0, π/2]. Since (sin t) +(cos t) = 1 and cos 2 = 0 one concludes
that sin 2 = ±1 Putting the two remarks together gives the result.
30
4.3.1 The periodicity of sin and cos
We assume that you proved the basic fact that exp(a) exp (b) = exp (a + b)
Proof. Using exp(a) exp (b) = exp (a + b) and exp iz = cos z + i sin z the we see
that
and if Aand B are real, collecting real and imaginary parts the result follows.
and
cos (A + π) = − cos A
sin (A + π) = − sin A
and finally
31
PN PN
Suppose that f (t) = 0 an cos 2πnt + 1 bn sin 2πnt then the following inte-
grals make sense and
Z 1
a0 = f (t) dt, and for n ≥ 1
0
Z 1
an = 2 cos (2πnt) f (t) dt
0
Z 1
bn = 2 sin (2πnt) f (t) dt
0
Definition 4.26 If f ∈ C [0, 1], with f (0) = f (1) then we define the fourier
series of f to be
Z 1
a0 = f (t) dt, and for n ≥ 1
0
Z 1
an = 2 cos (2πnt) f (t) dt
0
Z 1
bn = 2 sin (2πnt) f (t) dt
0
Theorem 4.27 Suppose that f ∈ C [a, b] with f (a) = f (b) and with fourier
coefficients an , bn . Define
N
X N
X
SN = an cos 2πnt + bn sin 2πnt,
0 1
1
PN
then the average CN = N +1 n=0 Sn of the Sn converges uniformly to f on
[0, 1]!
32