1/38
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
sequence convergence
xn converges to x∈R if ∀ε>0, ∃N∈N s.t. n≥N |xn-x|<ε
showing that xn converges to x; ex- show 1/n converges to 0
|(1/n)-0|=1/n; as n≥N, (1/n)≤(1/N)<ε. Proof: Let ε>0. By AP ∃N∈N s.t. N>(1/ε) aka (1/N)<ε. Let n≥N, then |(1/n)-0|=(1/n)≤(1/N)<ε. Thus 1/n converges to 0
sequence bounded
a sequence xn is bdd iff ∃M>0 s.t. ∀n∈N, |xn|≤M
Algebraic Limit Theorem
suppose xn and yn are sequences s.t. xn→x and yn→y. (xn+yn)→(x+y); ∀c∈R, cxn→cx; xnyn→xy; if xn≠0 ∀n∈N and x≠0 then (1/xn)=(1/x)
order limit theorem
if xn≥yn ∀n∈N and xn→x and yn→y then x≥y
squeeze theorem
let xn, yn and zn be sequences. suppose ∃N0∈N s.t. n≥N0 and xn≤yn≤zn and xn→w and zn→w then yn→w
binomial theorem
(1+x)n=1 + nx + (nx2(n-1))/2! + (nx3(n-1)(n-2))/3! + …
bernoulli inequality
(1+x)n≥(1+nx)
theorem with |b|
if |b|<1 then bn→0
abs value sequence convergence
|an|→0 iff an→0
monotone sequence
xn is monotone if xn≤xn+1 or xn+1≤xn
monotone convergence theorem
let xn be a monotone sequence of real numbers. xn converges iff xn is bounded
subsequence def
if xn is a sequence and nk is a strictly increasing sequence of natural numbers, then xnk is a subsequence of xn
well-ordering property of N
if n1<n2<n3<… is a strictly increasing sequence of natural numbers then ∀k∈N, nk≥k
convergence and subsequence theorem
if xn→x then every subsequence xnk→x
cauchy
A sequence xn is cauchy if ∀ε>0 ∃N∈N s.t. ∀n,m ≥ N, |xn-xm|<ε
open neighborhood
Let a∈R and ε>0. The set Vε(a)={x∈R : |x-a|<ε}=(a-ε,a+ε) is an open neighborhood of a of radius ε
limit point (neighborhood)
x∈R is a limit point of set E if ∀ε>0 ∃q∈E q≠x s.t. q∈Vε(x) (AKA |q-x|<ε)
limit point (sequence)
x is a limit point of set E IFF ∃xn with xn∈(E\{x}) ∀n s.t. xn→x
isolated point def
if p∈E and p is not a limit point of E, then p is an isolated point
closed set
a set E is closed if every limit point of E is an element of E
interior point
p is an interior point of E if ∃ε>0 s.t. Vε(p)⊆E
open set
a set E is open if every point in E is an interior point
complement open/closed
E is open IFF Ec is closed; F is closed IFF Fc is open
{Ga} open sets
U(Ga) is open
{Fa} closed sets
∩(Fa) is closed
G1…GN
if G1…GN are open then ∩(Gj) is open (j=1 to N)
F1…FN
if F1…FN are closed then U(Fj) is closed (j=1 to N)
E closure is
E U E’ = E union (set of limit points of E)
in E closure, theorem
p∈Eclosure IFF ∃xn of elements in E s.t. xn→p
theorem, let E⊆R (closure stuff)
Eclosure is closed; E=Eclosure IFF E is closed; if F is closed and E⊆F then Eclosure⊆F; hold for all E⊆R, no need to prove one of them first
open AND closed sets
E is open and closed IFF E=∅ or E=R
open cover of E
a collection of open sets {Ga} s.t. E⊆U(Ga)
compact def
a set K is compact if every open cover of K has a finite subcover; If {Ga} is an open cover of K, then then ∃a1,a2,…aN s.t. K⊆U(Gaj) (j=1 to N)
Let E⊆R, the following are equivalent (compactness stuff)
E is compact; E is closed and bounded; Every infinite subset of E has a limit point in E; Every sequence in E has a subsequence that converges to an element in E; one of the statements must hold and then the rest hold
closed subsets of compact sets theorem
closed subsets of compact sets are compact
Bolanzo-Weierstrass Theorem
if xn is a bounded sequence then it has a convergent subsequence
Cauchy criterion / Completeness of R
xn converges IFF xn is a cauchy sequence