Final Review of Advanced Calculus(1)
Chasse_neige
1. Taylor's Theorem
1.1 Taylor's Theorem with Peano's Form of Remainder
When
Specially, when
is called Maclaurin's polynomial.
1.2 Taylor's Theorem with Lagrange's Form of Remainder
If a function
where
Here,
Proof.
Given that
is times differentiable, then we can use the Cauchy's Mean Value Theorem on the functions and , where is an arbitrary constant between and then let
and we can get the Lagrange's form.
1.3 Taylor's Theorem with Cauchy's Form of Remainder
Cauchy's Form of the Remainder is another way to express the remainder term
where
Proof.
Given that
is times differentiable, then we can use the Cauchy's Mean Value Theorem on the functions and , where is an arbitrary constant between and then let
and we can get the Cauchy's form.
Applications:
Using the Taylor's theorem with Lagrange's form of remainder to estimate the Taylor series's error.
Example 1
Given that
Proof.
First use
's Taylor Series about a: so it is trivial that
so
Example 2 Linear Interpolation
Suppose that the function
and
Proof.
Given that
is continuous on the interval , then can be estimated by the Taylor Series so the error equals to
Notice that
is actually between the two values and and is continuous on the closed interval , according to the Intermediate Value Theorem, there exists a so that while the Quadratic Function
has a maximum on the interval , then the error is trivial.
2. Definite Integral (Riemann)
2.1 Definition
If a function
exists, where
2.2 Properties of Riemann Integrable Functions
2.2.1 The Newton-Leibniz Formula
If the function
which is easy to prove consider the Lagrange Mean Value Theorem.
2.2.2 Integrable-Caused Properties
- If a function
is Riemann integrable on the interval , it is bounded on the interval. - Integral Mean Value Theorem: If the functions
and are continuous on the interval and does not change its sign on the interval, then there exists a so that
Specially, let
Applications:
Integral Inequalities:
- Cauchy-Schwarz Inequality:
Proof.
where
is an arbitrary constant. Using the criterion
can get the inequality.
- Hölder Inequality Let
and be measurable functions, and let and be positive real numbers such that and , with the relationship:
Then, Hölder Inequality states that:
Proof. Notice that
is a convex on . Use the Jensen Inequality, we can get the Yong inequality
Then let
and and we can get the inequality.
- Minkowski Inequality Let
and be measurable functions on , and let . Minkowski's Inequality states that:
Proof.
where the second
is based on the Hölder Inequality.
2.2.3 Riemann Integrability Theorem
If a function
So it is not hard to prove that any monotonous or continuous function on a closed interval is Riemann integrable. (To prove the latter, just consider the Cantor Theorem to make the solution trivial).
Lebesgue Theorem
Lebesgue's Theorem on Riemann Integrability provides a criterion for determining whether a bounded function is Riemann integrable. The theorem states that a bounded function
- Measure Zero: A set has measure zero if, for any
, it can be covered by a countable collection of intervals whose total length is less than . Examples of sets with measure zero include finite sets, countable sets, and certain dense sets like the rational numbers in an interval. - Discontinuity Set: The set of discontinuities of a function is the set of points where the function is not continuous. If this set has measure zero, the function is considered "almost everywhere" continuous.
- Integrability: This theorem implies that a function can have many discontinuities and still be Riemann integrable, as long as the discontinuities are "sparse" enough to form a set of measure zero.
Applications:
Integral Approximation
Example 1
If
Proof.
- For step functions: Choose $$ g(x) = \sum_{k=1}^{n} f(x_{k-1}) I_{[x_{k-1}, x_{k}]} $$
- For piecewise linear functions: Choose $$ g(x) = \sum_{k=1}^{n} \left( f(x_{k-1}) + \frac{f(x_{k}) - f(x_{k-1})}{\Delta x_{k}} (x - x_{k-1}) \right) I_{[x_{k-1}, x_{k}]} $$
- For continuous and differentiable functions: According to the Weierstrass First Approximation Theorem, we can choose a polnomial
, so that For example, the Bernstein polynomial for
can be a template.
Example 2 Riemann-Lebesgue Lemma
If
Proof.
According to the additivity principle,
Using the Integral Mean Value Theorem, we can deduce that for every interval
, there exists a so that Choose a partition
, so Therefore, we can add the parts and use the definition of the Riemann Integral to get the lemma:
Example 3
If
Prove that
Proof.
Given that
is differentiable, we can write its Taylor series
