MATH 361A Midterm 1

42 Karteikartenvon Jane
Diese Karteikarten lernenKostenlos · Spaced Repetition · iPhone, Android, Mac & Web

Alle Karten

1
bounded set
A set S is bounded if it is bounded below and bounded above.
2
bounded below
A set S is bounded below if the set has a lower bound.
3
bounded above
A set S is bounded above if the set has an upper bound.
4
lower bound
$ \text{A real number} \thinspace l \thinspace \text{is a lower bound of the set S} \in \mathbb{R} \thinspace \text{if} \thinspace l \leq x \thinspace \text{for all} \thinspace x \in S. $
5
upper bound
$\text{A real number} \thinspace u \thinspace \text{is an upper bound of the set S} \in \mathbb{R} \thinspace \text{if} \thinspace u \geq x \thinspace \text{for all} \thinspace x \in S. $
6
sequence
$ \text{A sequence is a function whose domain is the set of all natural numbers} \thinspace \mathbb{N}. $
7
greatest lower bound
$ m \in \mathbb{R} \thinspace \text{is called the greatest lower bound of S (AKA infimum of S [we write m = inf(S)])} $
$\text{provided m is a lower bound and} \thinspace m \geq l \thinspace \text{for all} \thinspace l \in L_s \text{(lower bounds of S)}. $
8
least upper bound
$ M \in \mathbb{R} \thinspace \text{is called the least upper bound of S (AKA infimum of S [we write M = sup(S)])}.$
$\text{provided M is an upper bound and} \thinspace M \leq u \thinspace \text{for all} \thinspace u \in U_s \text{(upper bounds of S)}.$
9
Why are all Cauchy Sequences bounded?
Since every Cauchy sequence converges, then every Cauchy sequence is bounded.
10
All convergent sequences are bounded
  • true
  • false
11
All bounded sequences are convergent
  • true
  • flase
12
All Cauchy sequences converge and are bounded
  • true
  • false
13
Triangle Inequality
$|\text{a+b}| \leq |\text{a}|+|\text{b}|$
14
monotone decreasing
$\text{A sequence is monotone decreasing if} \thinspace a_\text{n} \geq a_\text{n+1}.$
15
strictly decreasing
$\text{A sequence is strictly decreasing if} \thinspace a_\text{n} >a_\text{n+1}$
16
monotone increasing
$\text{A sequence is monotone increasing if} \thinspace a_\text{n} \leq a_\text{n+1}$
17
strictly increasing
$\text{A sequence is strictly increasing if} \thinspace a_\text{n} < a_\text{n+1}$
18
subsequence
$\text{A sequence} \thinspace \{b_\text{k}\} \thinspace \text{is called a subsequence of the sequence} \thinspace \{a_\text{n}\} \text{if there are natural numbers}$
$n_1 < n_2<n_3,...\thinspace \text{such that} \thinspace b_\text{k} = a_{\text{n}_\text{k}} \thinspace \text{for} \thinspace k = 1,2,3,... \thinspace \text{or for k} \in \mathbb{N}. $
19
Definition 2.1
$\text{The limit of the sequence} \thinspace \{a_\text{n}\} \thinspace \text{is written} \thinspace \lim_{\text{n}\rightarrow \infty } a_\text{n}=A$
$\forall \epsilon > 0, \exists \text{N}\in \mathbb{N} \thinspace \text{such that for all} \thinspace \text{n>N}, |a_\text{n}-A| < \epsilon.$
$\text{If} \thinspace \{a_\text{n}\} \thinspace \text{has a limit A, we say that the sequence converges; otherwise we say that} \thinspace \{a_\text{n}\} \thinspace \text{diverges}.$
20
Definition 2.2: Cauchy Sequences
$\text{A sequence is called a Cauchy Sequence if} \thinspace \forall \epsilon > 0, \exists \text{N} \in \mathbb{N} \thinspace \text{such that for all} \thinspace \text{m,n>N}, |a_\text{m}-a_\text{n}| < \epsilon. $
21
Why are Cauchy Sequences Bounded?
  • All convergent sequences are bounded
  • All Cauchy Sequences are bounded
  • All bounded sequences are convergent
  • All convergent sequences are Cauchy
22
Bernoulli's Inequality
$\text{Let} \thinspace \text{x} \in \mathbb{R} \thinspace \text{such that} \thinspace \text{x} \geq -1 \thinspace \text{then} \thinspace (1+\text{x})^\text{n} \geq 1+\text{nx}.$
23
Theorem 1.8 (Archmedean Property)
$\text{If a,b} \in \mathbb{R} \thinspace \text{with} \thinspace \text{a}>0 \thinspace \text{and} \thinspace \text{b}>0 \thinspace \text{then} \thinspace \exists \text{n} \in \mathbb{N} \thinspace \text{with} \thinspace \text{na}>\text{b}.$
24
Theorem 1.9 (Regarding Open Intervals and Rational Numbers)
Every open interval (a,b) contains a rational number.
25
Theorem 1.10 (Regarding Open Intervals and Irrational Numbers)
Every interval I contains an irrational number
26
Corollary of Theorem 1.8 (Archmedean Property)
$\forall \epsilon>0, \exists \text{n} \in \mathbb{N} \thinspace \text{such that} \thinspace 1/\text{n} < \epsilon $
27
Theorem 2.1 (Regarding Limits and Uniqueness)
$\text{If} \thinspace \lim_{\text{n}\rightarrow \infty} a_\text{n} \thinspace \text{exists, then it is unique}.$
28
Theorem 2.2 (Squeeze Theorem)
$\forall \text{n} \in \mathbb{N}, a_\text{n} \leq b_\text{n} \leq c_\text{n} \thinspace \text{and} \thinspace \lim_{\text{n}\rightarrow \infty } a_\text{n}=\thinspace \text{A}=\lim_{\text{n}\rightarrow \infty} c_\text{n} \thinspace \text{then} \thinspace \lim_{\text{n}\rightarrow \infty} b_\text{n}=\thinspace \text{A}$
29
Theorem 2.3
$ (a) \lim_{\text{n}\rightarrow \infty } a_\text{n}+b_\text{n}=\text{A+B} $
$ (b) \lim_{\text{n}\rightarrow \infty } ka_\text{n}=\text{kA} $
$ (c) \lim_{\text{n}\rightarrow \infty } a_\text{n}b_\text{n}=\text{AB} $
$ (d) \lim_{\text{n}\rightarrow \infty } \frac{1}{b_\text{n}} = \text{1/B} $
$ (e) \lim_{\text{n}\rightarrow \infty } \frac{a_\text{n}}{b_\text{n}} = \text{A/B} $
30
Theorem 2.5
$\text{If} \thinspace \{a_{\text{n}}\} \thinspace \text{is monotone increasing and bounded above then} \thinspace \{a_{\text{n}}\} \thinspace \text{converges and} \thinspace \lim_{\text{n}\rightarrow \infty } a_{\text{n}}=\text{sup}_{\text{n}}\{ a_{\text{n}}\} $
31
Theorem 2.6 (Nested Interval Property)
$\text{Suppose} \thinspace I_1 = [a_1,b_1],I_2=[a_2,b_2],I_3=[a_3,b_3] \thinspace \text{and} \thinspace \lim_{\text{n}\rightarrow \infty } (b_{\text{n}}-a_{\text{n}})=0$
$\text{Then there is exactly one real number common to all intervals I}$
32
Theorem 2.7 (Bolzano Weierstrass Theorem)
Every bounded sequence has a convergent subsequence.
33
Theorem 2.9
$\text{If l = lim} \thinspace \text{inf}_{\text{n}}\{a_\text{n}\} \thinspace \text{and L = lim}\thinspace \text{sup}_{\text{n}}\{a_{\text{n}}\} \thinspace \text{then} \thinspace \forall \epsilon>0, \exists \text{N} \in \mathbb{N} \thinspace \text{such that for all} \thinspace \text{n>N},l-\epsilon<a_\text{n}<L+\epsilon.$
34
$\text{Suppose} \thinspace \{a_\text{n}\} \text{is bounded. Let C be the set of all cluster points}. C \neq 0 \thinspace \text{and it is bounded}.$
$\text{inf C} = \lim \text{inf}_{\text{n}}\left\{a_\text{n}\right\} \thinspace \text{and} \thinspace \text{sup C}=\lim \text{sup}_{\text{n}}\left\{a_\text{n}\right\} $
35
cluster point
$\text{Let} \thinspace \{a_{\text{n}}\} \thinspace \text{be a sequence x} \in \mathbb{R} \thinspace \text{is a cluster point of} \thinspace \{a_{\text{n}}\}\thinspace \text{if some subsequence of} \{a_{\text{n}}\} \thinspace \text{converges to x}.$
36
$\text{Sequences Diverges to} \thinspace -\infty$
$\text{A sequence diverges to}\thinspace -\infty(\{a_\text{n}\}\rightarrow -\infty) \iff \forall \text{M}>0, \exists \text{N} \in \mathbb{N} \thinspace \text{such that} \thinspace \forall \text{n} \in \mathbb{N},a_\text{n}<-\text{M}.$
37
$\text{Sequence Diverges to} \thinspace \infty $
$\text{A sequence diverges to}\thinspace \infty(\{a_\text{n}\}\rightarrow \infty) \iff \forall \text{M}>0, \exists \text{N} \in \mathbb{N} \thinspace \text{such that} \thinspace \forall \text{n} \in \mathbb{N},a_\text{n}>\text{M}.$
38
$\text{If} \thinspace \{a_\text{n}\} \thinspace \text{is not bounded below then}$
$\lim_{\text{n} \rightarrow \infty } \text{inf}_{\text{n}} \left\{ a_{\text{n}}\right\} =-\infty $
39
$\text{If} \thinspace \{a_\text{n}\} \thinspace \text{is not bounded above then}$
$\lim_{\text{n} \rightarrow \infty } \text{sup}_{\text{n}}\left\{ a_{\text{n}}\right\} =\infty $
40
$\lim \text{inf}_{\text{n}}\left\{ a_{\text{n}}\right\}$
$\lim \text{inf}_{\text{n}}\left\{a_{\text{n}}\right\}=\lim_{\text{N}\rightarrow \infty}\thinspace\begin{matrix} \text{inf}\\ n>N\end{matrix}\left\{a_{\text{n}}\right\} $
41
$ \lim \text{sup}_{\text{n}}\left\{ a_{\text{n}}\right\}$
$ \lim \text{sup}_{\text{n}}\left\{a_{\text{n}}\right\}=\lim_{\text{N}\rightarrow \infty}\thinspace \begin{matrix}\text{sup}\\ n>N\end{matrix}\left\{a_{\text{n}}\right\} $
42
Definition of Sequence Divergence (Negation of Definition 2.1)
$ \text{A sequence} \thinspace \{a_\text{n}\}\thinspace \text{diverges if} \thinspace \exists \epsilon>0, \forall \text{N} \in \mathbb{N}, \exists \text{n} \in \mathbb{N} \thinspace \text{such that} \thinspace |a_\text{n}-A| \geq \epsilon.$
Alle 42 Karten kostenlos lernen

Mehr Karteikarten: Mathe

Lesson 3.1 Attribute Editing and Topology42 KartenMathe · EnglischDekanoMathematik Prüfung WiSe24/2534 KartenMathe · DeutschronnyCorrelation + Regression25 KartenMathe · EnglischAnaïsProbability & Statistics22 KartenMathe · EnglischSarahCalc Exam3 Decks · 59 KartenMatheae20202024theorems to prove16 KartenMathe · EnglischLayneFurther maths Pure14 KartenMathe · EnglischIanto06Chapitre 10 : Les lois de la dynamique12 KartenMathe · FranzösischPiouProbability Equations10 KartenMathe · EnglischAVrai/Faux Suites8 KartenMathe · FranzösischCarolineTransportation Engineering119 KartenMathe · EnglischMPLEStatistics64 KartenMathe · Englischeleanor

Alle Decks: Mathe

Lerne diese Decks in der App

Kostenlos auf iPhone, Android, Mac und im Web. Füge jedes Deck mit einem Tipp zu deinem Konto hinzu.

Laden im App StoreJetzt bei Google Play
Alle 42 Karten kostenlos lernen