This is an old revision of the document!
Hi welcome to my note page
1. Numbers, Sets, and Sequences
Rational Zeros Theorem. For polynomials of the form cnxn + … + c0 = 0 , where each coefficient is an integer, then the only rational solutions have the form where c divides cn and d divides c0; rational root r must divide c0.
The maximum of a set S is the largest element in the set.
The minimum is the smallest element in the set.
The of S is the greatest lower bound.
The of S is the smallest upper bound.
S is bounded if s S, sM for some M
Completeness Axiom. If S is a nonempty bounded set in , then S and S exist.
Archimedean Property. If a, b 0, then n such that na b.
A sequence (sn) is a function mapping from to . It converges to s if > 0 there exists N such that N > n |(sn)-s| <
In other words,
(sn) = s
Important limit theorems include:
(sn)(tn) = ((sn))((tn))
(sn)+(tn) = ((sn)) + ((tn))
() = 0 for p > 0
n(1/n) = 1
A subsequence (sn(k)) of (sn) is a sequence that is a subset of the elements in the original sequence with relative order preserved.
Bolzano-Weierstrass Theorem. Every bounded sequence has a convergent subsequence, having some subsequential limit.
Given any (sn) and let S be the set of subsequential limits of (sn). Define:
(sn) = {(sn): n > N} = S
(sn) = {(sn): n > N} = S
|sn+1| / |sn| |sn|^(1/n) |sn|^(1/n) |sn+1| / |sn|
2. Topology