Calculus 1, Fall 2007 10.2.

2007

General
Archimedes principle: ( )
Positive Root:
Triangle Inequality: | | | | | |
∑
Mean inequality: ∑
√∏
Completeness axiom:

If maximum (minimum) exists then it is unique

Lemma supermum (infimum): every upper (lower) bounded non-empty set has
supermum (infimum)
1/n smaller than ε:
Every open interval contains rationals
Lemma Cantor - The nested intervals principle: Any nested sequence of closed
intervals has a non-empty intersection
Lemma Heine-Borel - The finite sub covering principle:
For any system of open intervals S = {I}, which covers a closed interval J there is a
finite subsystem which still covers J.
Lemma Bolzano-Weierstrass: Each infinite bounded subset of has an
accumulation point x (in every punctured vicinity of x there are at least one=infinitely
many points from the subset).
Calculus 1, Fall 2007 10.2.2007

Sequences
Definition Convergence and Limit of Sequences:
| |
If the limit exists, it is unique.
If a sequence converges, then it is bounded.
Similar sequences: Let * + and * + be two sequences such that the
set * | + is finite, and then
Limits Arithmetic:
 ( )
 ( )
 . /
Two policemen / The sandwich:

Monotonic & Bounded: Any upper bounded non-decreasing sequence * +

converges, and
∑
Some limits: ∑
√∏

√ . /
Cauchy's sequence a sequence converges if and only if it is a Cauchy's sequence:
| |
Upper & Lower limits
( )

⁄
( ) If either converges then =
( ) ""
If either converges then =
Convergence in wide sense a sequence converges to  if
* +
* +
Lemma Stolz: suppose the sequence * + increases and its limit is .

Any sequence contains a monotonic subsequence

A monotonic sequence converges if it contains a convergent subsequence
Each bounded sequence has a convergent subsequence (Lemma BW)
A sequence converges if and only if the set of its partial limits is a singleton
Lemma Fekete: Let (subadditive sequence) then
Calculus 1, Fall 2007 10.2.2007

Limit of Functions
( ) ( )
Infinitesimally small at a: ( ) ( ( )) ( )
( )
( )
( ) | ( )
( )
Equivalent at a: ( )
| | ( ) | |( )
Continuous Functions
Function f is continuous is vicinity of point a if ( )
In other words: | | | ( ) ( )|
Discontinuity points: Removable singularity: ( ) ( ) ( )
Different one-sided limits: ( ) ( )
No Limits: ( ) ( )
Infinite Limits: ( ) ( )
Arithmetic: ( ) || ( ) ( )
Local boundedness: ( ) ( )
Local conservation of the sign: ( )
( ) ( ) ( ) ( )
Cauchy's functional equation: ( ) ( ) ( ) ( )
( )
IVP 0: , - ( ) ( ) , - ( )
IVP 1: , - ( ) ( )
( ) ( ) , - ( )
IVP Corollary – Intervals: ( ) ( )
IVP Corollary – Polynomials: ( ) ( ) ( )
Weierstrass Theorem: , -
, - () ( ) , -
Corollary from Weierstrass: , - , -
Inverse, Monotonic and Continuous Functions
Monotonic has inverse monotonic:

Continuous has inverse: ( )

Monotonic in a closed interval: , -
, - , ( ) ( )- ( ) , ( ) ( )-( )
Continuous and monotonic: , -

Uniform Continuity
Function f is uniformly Continuous
| | | ( ) ( )|
Function f is NOT uniformly Continuous
* +* +
| | |( ) ( )|
Cantor Theorem: , - , -
Calculus 1, Fall 2007 10.2.2007

The Derivative
( ) ( ) ( ) ( ) ( )
Definition: ( )
( ) ( ) ( | |) ( | |)
( ) ( ) ( ) ( )

( ) ( )
√ √
( ) ( )
( ) ( ) ( ) (| |)
( )
( ( ) ) ( ) ( )

Arithmetics: ( )( ) ( ) ( ) | ( )( ) ( ) ( ) ( ) ( )
( ) ( ) ( ) ( )
( ) . / | ( )( ) ( ) ( )
( ) ( )
( )
( )
( ) ( ) ( ( )) ( )
Linear approx.: ( ) ( ) ( ) ( ) ( )
Then L(x)=f( ) ( ) ( ) ( )
Lagrange interpolation: ( ) ( )
( )
( ) ∏( ) ( ) ∑
( ) ( )
Horner's scheme: ( ) ∑
( ) ( ) ( ) ( )

Leibniz rule: ( )( ) ∑ ( ) ( ) ( )

The tone around a non-zero derivative point: ( ) such that:

( ) ( )
( ) {
( ) ( )
( ) ( )
( ) {
( ) ( )
Extramum:
( ) ( )
( ) ( ) ( ) ( ) ( ) ( )
Ferma theorem: ( ) ( ) ( ) (⇍)
Rolle theorem: , - ( ) ( ) ( ) ( )
LaGrang' MVT: , - ( ) ( )
( ) ( )
( )
Corollaries:
( ) ( )
( ) ( )

Cauchy's MVT: , - ( ) ( ) ( ) ( )
( ) ( ) ( )
( ) ( ) ( )
Calculus 1, Fall 2007 10.2.2007

( ) ( )
L'Hopistal's rule: ( ) ( )