Sequences Prove ptwise cv using Prove from defn that a seq cv?

cv->bd real# tools - (fn(x))n is Take arb ε > 0 and provide a natural Nε st, whenever n ≥Nε,
AOC-all N.E sSet of R bd above has Sup seq of real# |un − l| ≤ ε. How can you find Nε?
(2.31)Any ccSeq is bd | Any cv seq is ccSeq Also, unif->ptw •Write explicitly | un − l|, and try to find an nice simple upper
(2.33)R is compl : Any ccSeq cv in R bound for this quantity in terms of n, which is small when n
NIPLet In =[an, bn]∀n∈N be closed intervals st I1 ⊇ I2 ⊇ I3 Finding indeterminate is large. For example, |un − l| ≤ C/n for some fixed constant
⊇… then intersection on all n of In is not empty. limits C not depending on n.
Char bd. seqA seq (un)n bd iff (|un|)n is bd above. . Factorise “dominant” •Impose that n must be such that this upper bound is less
if limit exists then it is unique term, to simplify the that ε. Following the previous example, this would be C/n ≤
SLT un→l then any subseq of un also cv to the same limit l expression and find the ε.
OLT: If un→l and vn→m and∀n∈N, un<= vn,l<= m limit or prove that there is •Do some algebraic manipulations on the inequality thus
SQZ: If un→l and wn→l and∀n∈N, un<= vn<= wn, vn→l no limit. obtained to re-write it under the form “n ≥ M” (where M
2.27: Intv I comp iff bd and contains endpts ∀k∈N: lim n→∞n-ken= +∞, does not depend on n). Here, this would be: C/n ≤ ε if C ≤
Heine-Borel pg25: a sSet K of R is comp iff it is bd and lim n→∞nke-n= 0 nε, that is C/ε ≤ n.
closed. lim n→∞ ln(n)/n = 0
MCT: If (un)n∈N inc. and bd above seq of real #s, (un)n∈N cv

Series
(Ratio test) Let (an)n∈N be nonzero reals, lim n→∞|an+1/an| = r
Then if r<1 ∑an abs cv and if r>1, ∑an dv.
(Abs cv) If ∑|an| cv then∑an cv 1. if k ≥ m, O(xk) + O(xm) = O(xm)(smallest)
(Comp) Let (an)n∈N, (bn)n∈N be seq st 0≤an≤bn for all n∈N. If 2. O(xn+1) = xn O(x), Inequalities
∑bn cv then∑an cv . If ∑an dv then ∑bn dv. 3.O(xn+1)/xn= O(x) → 0 as x → 0. • |a| = a if a ≥ 0, |a| = −a if a ≤ 0.
(AST) Let (an)n∈N be a dec seq of +ve reals st. lim n→∞an=0. Taylor • |a| ≤ m if and only if −m ≤ a ≤ m.
Then∑(−1)nan cv. exp(x) = In particular, −|a| ≤ a ≤ |a|.
nth: If an converges, then an→0 as n->∞.
(CC for series) x2 x3 xn n +1 • Triangle inequality: |a + b| ≤ |a|
1+ x+ + + …+ +O(x ) + |b|.
The series∑an cv in R iff for anyε>0, there exists Nε∈N 2 ! 3! n! Important series
such that, for any n ≥ p ≥ Nε, |ap + ... + an| ≤ ε. sin(x)= • Geometric ∑rn cv iff |r|<1. Then
(3.2)If∑an is Srs w/+ve terms then it cv iff the Srs is bd (ie lim n→∞∑rn=1/(1-r)
the partial sums are bd seq).If Srs not bd then it dv to inf. x3 x 5 n x 2 n+1 2n +3
x− + +…+ −1 +O ( x p-series:∑1/n cv iff = p>1
) p

(BW) If (un)n∈N is bd seq of reals, then∃a sSeq of un that cv ( )

in R. 3! 5! ( 2n+1 ) !
A function has a limit at some point by defn?
• Write explicitly |f(x)−L|, and try to find a nice simple upper bound for this quantity in terms of
x, which is small when |x − c| is small. For example, |f(x) − L| ≤ C|x − c| 2 for some fixed
Functions: constant C not depending on x, at least for x around c.
SCLLet f:A->R and c∈L(A). Then lim x→c f(x)= L ∀seq • Impose that x must be such that this upper bound is less that ε. Following the previous
(xn)n in A cv to c st xn!= c]∀n, we have f(xn)->L example, this would be C|x − c| 2 ≤ ε.
Cont&limit Let f:A->R and c∈L(A). Then “f cont at c”  • Do some algebraic manipulations on the inequality thus obtained to re-write it under the
“lim x→c f(x)= f(c)” form “|x − c| ≤ δ” (where δ does not depend on x). Here, this would be: C|x − c| 2 ≤ ε if |x − c|2
SCCLet f:A->R and c∈A. f is cont at c iff ∀seq (xn)n in A cv ≤ ε/C, that is |x − c| ≤sqrt( ε/C)
to c, we have f(xn)->f(c) • This δ is the one you are looking for. There might need to be some adjustment on the δ if,
ACT:works for add, mult, and div by non zero on A. during the estimate of |f(x)−L| you had to assume some things about x...
Comp of cont: Let f:A->B cont @ c∈A and g:B->R cont @
f(c). Then g(f(x)) is cont @ c. CV of seq of func: 1. Check ptw cv by fixing x∀A, then use ALT. If this cv then we find f st fn-
Contraction mapping thm: Let I be closed interv & f:I->I be >f ptw on A.2.Prove supx∈A |f n (x) − f(x)|→0 by Ex6.5 by writing for arb x,|fn(x) − f(x)|, and
a cntrtn. Then f has a unique fixed pt x*. Also, if x0 is arb pt finding it less than ωn (not dep on x), which cv to 0.
of X then seq (xn)n defnd inductively by xn = f(xn-1) cv to x* Lim of Srs cont/diff: : 1. Show ∑fn cv unif by WS. 2.If each fn cont then 6.15 shows f is cont.
Pres of comp sets: Let f:a->R be cont on A and K⊂A be 3Check each fn diffbl ,show unif cv of ∑fn’ by WS by bding |fn’| by Rn st ∑Rncv. 4. 6.15 shows
compact. Then f(K) is compact. f is diffbl with f’’ =∑fn’
EVT: Let K be non-empty comp sSet of R and f:K→R be
cont .Then f has a max and a min on K.
IVT: Let d f : [a,b] → R be cont and L be a real# between Cont of unif lim (fn)n be seq of fct on A and c∈A. Assume that each fn is cont@c. If (fn)n cv unif
f(a) and f(b). Then ∃c∈(a,b) such that f(c) =L to f on A then f cont@c. There4, if each fn cont on A, then f is cont on A.
Pres of intval: Let I be intval, f:I→R be cont. Then f(I) Integ of unif lim If (fn)n seq of cont fct on [a,b] that cv unif to f on [a,b]. Then fn(x)dx→ f(x)dx.
intval. Unif CC Let (fn)n seq of fct defd on A. (fn)n cv unif on A iff ∀ε > 0, ∃N ε ∈ N such that, for all
Brouwer: Let f:[a,b]→[a,b] be cont Then f has at least 1 n,p ≥ N ε and all x ∈ A, |fn (x) − fp(x)| ≤ ε.
fixed point Diff of limit Let (fn)n seq of cont fct on intv[a,b], diffbl on (a,b). Assume (fn)n cv unif to f on [a,b]
and that (fn’)n cv unif to g on (a,b). Then f is diffbl on (ab) and f’=g. ie (limn→∞fn)’ = limn→∞f’(n).
6.15 1. Let (fn)n seq of cont fct on A. If ∑fn cv unif then [1to∞]∑fn cont. 2. Let (fn)n seq of cont
1st order asy expan: Let I be on open intv on R,g:I→R and fct on [a,b], diffbl on (a,b). If ∑fn and ∑fn ‘cv unif on (a,b) then [1to∞]∑fnis diffbl and
c ∈I. Then g diff at c iff ∃L∈R and∀h in this intv, g(c+h) = ([1to∞]∑fn)’ = [1to∞]∑fn’ Unif CC for Srs A Srs of fcts ∑fn cv unif on A iff ∀ε > 0, ∃N ε ∈ N st,
g(c)+Lh+hr(h). In this case, g’(c)= L so sub back in  for all n≥ p ≥ N ε and all x ∈ A, |fp(x) + fp+1(x) + ··· + fn(x)| ≤ ε.
Diff->cont Let I be open intv of R,gLI->R and c∈I. If g is Weierstraß M-test Let (fn)n∈N seq of fct defd on A, (Mn)n∈N be real#s such that,∀x∈A, |fn(x)| ≤
diff@c then g is cont @ c Mn. If the Srs of +ve real#s∑Mn cv then Srs of fcts ∑fn cv unif on A. ∑Mn cv by #Srs tests.
ADT has quotient and product rule 6.20 Assume PS ∑anxn cv @ some c != 0. Then∀x∈R: |x|<|c|, PS cv abs. Also,∀0≤r≤c PS
Chain rule Let I,J be open intvs of R, f:I→J and g:J→R cv unif on intv [-r,r]. 6.22 Assume(an)n is seq of non-zero real#s st l= limn→∞|an+1|/|an| exists.
and c ∈ I. If f is diffbl at c and g is diffbl at f(c) then g◦f is Then PS ∑anxn has a ROC R=1/l if l>0 or R=+∞if l=0.Use 6.22 then check w/ x =edge pts
diffbl @ c and (g ◦ f)’ (c) = g’(f(c))*f’(c). 6.24 ∑anxn and its deriv ∑nanxn-1 have same ROC. ∑anxn diffble on (-R,R) Index of deriv
IET: Let I be open intv, f:I→R c∈I. If c is an extmum of f starts @1.
and f is diff @ c then f’(c)=0
Loc of extma: Let f:[a,b →R be cont on [a,b] and diffbl on
(a,b). Then f has minima&maxima, and these extma are 5.19 If f:I→R cont and a∈I then F(x) = f(s)ds is
either a, b or c∈(a,b) such that f’(c) = 0. differentiable and F’=f on I.
Rolle’s: Let a < b and f : [a,b]→R be cont on [a,b] and diff FTC Let I be open intv and f:I→R diffbl, f’ cont on I. Then
on (a,b)If f(a)=f(b) then ∃c∈(a,b) such that f’(c)=0 ∀a,x∈I, f(x) = f(a) + f’(s) ds
MVT: Let a < b and f : [a,b]→R be cont on [a,b] and diff on 5.22 Let I be open intv contains0 and n∈N(inc0). Let f:I→R
(a,b).Then ∃c∈(a,b) such that f’(c) = [f(b)−f(a)] / [b-a] be (n+1)times diffbl,. Then∀x∈I, f(x)=
Lips est: Let a < b and f cont on [a,b] and diff on (a,b).Then f '' (0) 2 1
|f(b)-f(a) ≤ |b-a| supx∈(a,b) |f’(x)| f ( 0 )+ f ' ( 0 ) x + x + …+ f n+1 ( ξ ) ( x−ξ)n dξ .
Monot and sgn of deriv: If f is diffable on an open intval I 2! n!
and if f’=0 (respectively f’≥0, respectively f’≤0) on I then f is 5.23 Same assum as 5.22, ∀x∈I, f(x)=
constant (resp. increasing, resp. decreasing) on I.
' f '' ( 0) 2 f ( n) ( 0 ) n
f ( 0 )+ f ( 0 ) x + x + …+ x + O(x n+1)
2! n!