User Tools

Site Tools


math104-s21:s:vpak

This is an old revision of the document!


vpak

Hi welcome to my note page

Summary of Material

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 cd\frac{c}{d} 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 inf\inf of S is the greatest lower bound.
The sup\sup of S is the smallest upper bound.
S is bounded if \foralls \in S, s\leqM for some M \in R\reals
Completeness Axiom. If S is a nonempty bounded set in R\reals, then inf\inf S and sup\sup S exist.
Archimedean Property. If a, b >\gt 0, then \existsn such that na >\gt b.

A sequence (sn) is a function mapping from N\N to R\R. It converges to s if \forall ϵ\epsilon >> 0 there exists N such that N >> n     \implies |(sn)-s| << ϵ\epsilon
In other words, lim\lim(sn) == s

Important limit theorems include:
lim\lim(sn)(tn) == (lim\lim(sn))(lim\lim(tn))
lim\lim(sn)+(tn) == (lim\lim(sn)) + (lim\lim(tn))
lim\lim(1np\frac{1}{n^p}) == 0 for p > 0
lim\lim 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:
lim\lim sup\sup (sn) == limN\lim\limits_{N \to \infin} sup\sup{(sn): n > N} == sup\sup S
lim\lim inf\inf (sn) == limN\lim\limits_{N \to \infin} inf\inf{(sn): n > N} == inf\inf S

lim\lim inf\inf |sn+1| / |sn| \leq lim\lim inf\inf |sn|^(1/n) \leq lim\lim sup\sup |sn|^(1/n) \leq lim\lim sup\sup |sn+1| / |sn|

2. Topology

Metric Space: A set S with a metric, distance function d. For any x,y,z \in S
(1) d(x,y) >> 0 if x \not = y, d(x,x) == 0
(2) d(x,y) == d(y,x)
(3) d(x,z) \leq d(x,y) + d(y,z)
Important* A metric is only valid if it outputs a real number for any inputs, ie. d(x,y) == \infin is not valid.

A limit point p of a set S is such that for some ϵ\epsilon radius ball around p, there exists an element q \not = p such that q \notin S. Note that limit points may or may not lie in the set.
A set S is open if for every point p in S is interior in S. Think open ball of ϵ\epsilon radius in S centered at p.
A set S is closed if every limit point of S is a point in S.
A set S is perfect if it is closed and every interior point is a limit point.
A set S is dense in a metric space X if every point in X is either a limit point of S or in S itself.
The closure of a set S is the union of S and the set of its limit points. It can also be thought of as the intersection of all closed sets containing S.

An open cover for S is a collection of open sets that covers S.
A set S is compact if for all open covers {G} of S, there exists a finite subcover of {G} that covers S.
Heine-Borel Theorem. A subset E of R\Rn is compact if and only if it is closed and bounded.

A set S is connected if it cannot be written as disjoint union of nonempty, open sets

3. Series

A series converges if its partial sum Σ\Sigma sn == M for some M \in R\reals.
A series Σ\Sigma sn satisfies is Cauchy if for any ϵ\epsilon >> 0, there exists N such that n \geq m >> N     \implies |i=mn\displaystyle\sum_{i=m}^n si| << ϵ\epsilon
If Σ\Sigma sn converges, then lim\lim sn == 0. (Note this is a one-way statement)

Comparison Test
If Σ\Sigma an converges and |bn| \leq an \foralln, then Σ\Sigma bn converges.
If Σ\Sigma an == \infin and |bn| \geq an \foralln, then Σ\Sigma bn == \infin.

Ratio Test Σ\Sigma an of nonzero terms
(i) converges if lim\lim sup\sup |an+1 / an| << 1
(ii) diverges if lim\lim inf\inf |an+1 / an| >> 1
(iii) else inconclusive test

Root Test Let α\alpha == lim\lim sup\sup |an|(1/n). Then Σ\Sigma an
(i) converges if α\alpha << 1
(ii) diverges if α\alpha >> 1
(iii) else inconclusive test

Alternating Series Theorem If an is monotonically decreasing and lim\lim an == 0, then Σ\Sigma (-1)n an converges.

4. Continuity and Convergence

There are three main definitions for a continuous function f\bold{f}:
(1) f\bold{f} continuous at x if for each ϵ\epsilon >> 0, there exists δ\delta >> 0 such that |x-y| << δ\delta where y \in domain(f)     \implies |f(x) - f(y)| << ϵ\epsilon
(2) f\bold{f} continuous at x if for all sequences (sn) in domain(f) that converge to x, lim\lim f(sn) == f(x)
(3) Let f\bold{f} be mapping between metric spaces X \to Y. f\bold{f} is continuous if the preimage f\bold{f}-1 of any open set in Y is open in X. Similarly if the preimage f\bold{f}-1 of any closed set in Y is closed in X.

A function f\bold{f} is uniformly continuous if for all x in domain(f), for each ϵ\epsilon >> 0, there exists δ\delta >> 0 such that |x-y| << δ\delta where y \in domain(f)     \implies |f(x) - f(y)| << ϵ\epsilon.

Generally, a continuous function f\bold{f} sends a compact set to another compact set. In this case, f\bold{f} is bounded, and sup\sup f\bold{f} and inf\inf f\bold{f} exists.
A continuous function acting on a compact set is uniformly continuous on this interval.
Cauchy relation: If f\bold{f} is uniformly continuous on a set S and sn is a Cauchy sequence in S, then f\bold{f}(sn) is a Cauchy sequence.

Generally, a continuous function f\bold{f} sends connected set to another connected set.

Intermediate Value Theorem. Let f\bold{f} be a continuous real function on interval [a,b]. Then for all y between f(a) and f(b), there exists at least one x \in (a,b) such that f(x) == y.

If a function f\bold{f} is discontinuous at x, and both f\bold{f}(x+) and f\bold{f}(x-) exist, then f\bold{f} is said to have discontinuity of the first kind at x, or simple discontinuity.

A function f\bold{f}n converges to f pointwise if for each x in the domain, limn\lim\limits_{n \to \infin} f\bold{f}n(x) == f(x).

A function f\bold{f}n converges to f uniformly if lim\lim sup\sup{|f\bold{f}n - f|} == 0.
In other words, for any fixed ϵ\epsilon >> 0 there exists N such that n >> N     \implies |f\bold{f}n(x) - f(x)| << ϵ\epsilon for all x in the domain. This is a stronger restraint than pointwise convergence, where we only cared about each x individually. (Compare with regular vs uniform continuity)
Uniform Cauchy     \iff Uniform Convergence

Weierstrass M-Test. Let f\bold{f}  =\ = i=1\textstyle\sum_{i=1}^\infin f\bold{f}n. If \existsMn >> 0 such that sup\sup |f\bold{f}n| \leq Mn and i=1\textstyle\sum_{i=1}^\infin Mn << \infin, then i=1\textstyle\sum_{i=1}^\infin f\bold{f}n converges uniformly.

Let K be a compact set, and the following:

  • {f\bold{f}n} is sequence of monotonically decreasing, continuous functions
  • {f\bold{f}n} \to f\bold{f} pointwise

Then f\bold{f}n \to f\bold{f} uniformly.

5. Differentiation and Integration

Let f\bold{f} be real-valued on [a,b]. Its derivative is defined as
f(x)\bold{f'(x)} == limtx\lim\limits_{t \to x} f(t)f(x)tx\frac{\bold{f(t)} - \bold{f(x)}}{\bold{t - x}}

If f\bold{f} is differentiable at x, then f\bold{f} is also continuous at x.
If f\bold{f} is differentiable on interval I\bold{I}, and g\bold{g} is differentiable on range(f\bold{f}), then h\bold{h} == g(f)\bold{g(\bold{f})} is differentiable on I\bold{I}

math104-s21/s/vpak.1620688823.txt.gz · Last modified: 2021/05/10 16:20 by 68.186.63.173