{ "@context": "https://schema.org", "@type": "Organization", "name": "Brainscape", "url": "https://www.brainscape.com/", "logo": "https://www.brainscape.com/pks/images/cms/public-views/shared/Brainscape-logo-c4e172b280b4616f7fda.svg", "sameAs": [ "https://www.facebook.com/Brainscape", "https://x.com/brainscape", "https://www.linkedin.com/company/brainscape", "https://www.instagram.com/brainscape/", "https://www.tiktok.com/@brainscapeu", "https://www.pinterest.com/brainscape/", "https://www.youtube.com/@BrainscapeNY" ], "contactPoint": { "@type": "ContactPoint", "telephone": "(929) 334-4005", "contactType": "customer service", "availableLanguage": ["English"] }, "founder": { "@type": "Person", "name": "Andrew Cohen" }, "description": "Brainscape’s spaced repetition system is proven to DOUBLE learning results! Find, make, and study flashcards online or in our mobile app. Serious learners only.", "address": { "@type": "PostalAddress", "streetAddress": "159 W 25th St, Ste 517", "addressLocality": "New York", "addressRegion": "NY", "postalCode": "10001", "addressCountry": "USA" } }

Real analysis/ group theory Flashcards

(44 cards)

1
Q

Trichotomy Property
If x,y are reals, then exactly one of the following three statements are true:

A

x<y , x=y ,x>y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Transitive Property
if a,b,c are reals, then:

A

if a<b and b<c then a<c

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Archimedean Property
if a is a real:

A

then there is a positive integer n such that n is greater than a

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

distance position lemma
|y − b| ≤ a

A

b − a ≤ y ≤ b + a

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

The Triangle Inequality
For all x, y ∈ R

A

|x + y| ≤ |x| + |y|

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

The Triangle Inequality
For all a, b, c ∈ R

A

|a − c| ≤ |a − b| + |b − c|

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Reverse Triangle Inequality

A

|c − d| ≥ ||c| − |d||

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

I = (0, 7)

A

all the values of x which lie between 0 and 7 on the real number line

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

(−3, 2]

A

x ∈ R with −3 < x ≤ 2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Let S be a set of real numbers and let M be a real number. Then M is the maximum of S if…

A

M ∈ S and for all s ∈ S we have s ≤ M

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Upper and lower bounds

A

Since some sets do not have maximums or minimums, we also need to consider the notion of an
upper bound and a lower bound

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

If S is a set of real numbers and b ∈ R we say that b is an upper bound for S if

A

for all s ∈ S we have s ≤ b

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

If S is a set of real numbers and c ∈ R we say that c is a lower bound for S if

A

for all s ∈ S we have c ≤ s

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

A subset S of R is said to be bounded above/below if

A

there exists an upper bound for S
bounded below if there exists a lower bound for S
bounded if it is bounded
above and below

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

We can write the notion of an upper bound using the quantifier ∀
the statement “b is an upper bound for S” is written as

A

(∀x ∈ S)[x ≤ b]

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Suppose S ⊆ R is a non-empty subset of R. We say that B ∈ R is the least upper bound (or supremum) for S if:

A

B is an upper bound for S
if b s an upper bound for S then B≤ b
we write supremum as sup(S) here

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Suppose S ⊆ R is a non-empty subset of R. We say that C ∈ R is the greatest lower bound (or infinum) for S if:

A

C is a lower bound for S
if c is a lower bound for S then c ≤ C
we write infinum as inf(S) here

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Completeness of the real numbers

A

If S ⊆ R is non-empty and bounded above,
then S has a least upper bound. Similarly, if S ⊆ R is non-empty and bounded below, then S
has a greatest lower bound.

18
Q

Revisit Archimedes

A

the set of Natural Numbers is not bounded above
If x ∈ R then there is some n ∈ N such that n > x
If y > 0 and z ∈ R, then there is some n ∈ N such that ny > z

19
Q

Corollary 5. For all x ∈ R there exists exactly one integer n such that…

A

n ≤ x < n + 1
this number is called the integer part of x and is denoted n = ⌊x⌋. In other words, ⌊x⌋ is x rounded down to an integer.

20
Q

sequence

A

an unending list of real numbers

21
Q

a_n

A

nth term of the sequence, and the sequence is denoted by (a_n).
We sometimes write (a_n)n∈N

22
Q

Monotonic sequences
Let (a_n) be a sequence of real numbers

A

(a_n) is increasing if for all n ∈ N we have a_n+1 ≥ a_n
(an) is decreasing if for all n ∈ N we have an+1 ≤ an.
(an) is strictly increasing if for all n ∈ N we have an+1 > an.
(an) is strictly decreasing if for all n ∈ N we have an+1 < an.
(an) is constant if for all n ∈ N we have an+1 = an

23
Q

Sequences and their eventual behaviour
Let (an) be a sequence of real numbers.

A

(a_n) is constant of value λ if for all n ∈ N we have a_n = λ. It is eventually constant of
value λ if there is N ∈ N such that for all n > N we have an = λ.
* (an) stays less than ε from λ if for all n ∈ N we have |an − λ| < ε. It eventually stays less
than ε from λ if there is N ∈ N such that for all n > N we have |an − λ| < ε

24
(an) is constant of value λ is written as
(∀n ∈ N)[an = λ]
25
(an) is eventually constant of value λ is written as
(∃N ∈ N)(∀n > N )[an = λ]
26
(an) stays less than a distance ε from λ is written
(∀n ∈ N)[|an − λ| < ε].
27
(an) eventually stays less than a distance ε from λ is written
(∃N ∈ N)(∀n > N )[|an − λ| < ε]
28
(Sequence convergence). Let (an) be a sequence of real numbers, and let λ ∈ R.
(an) converges to the real number λ if, given any ε > 0, it eventually stays within ε of λ. In other words, given any ε > 0, there exists a natural number N such that, for all n > N , the distance |an − λ| is less than ε
29
definition of convergence to the limit λ in symbols
(∀ε > 0)(∃N ∈ N)(∀n > N )[|an − λ| < ε]
30
a sequence (an) of real numbers is convergent if there is a real number λ such that (an) converges to λ. We can write the definition of (an) being a convergent sequence in symbols as
(∃λ ∈ R)(∀ε > 0)(∃N ∈ N)(∀n > N )[|an − λ| < ε]
31
If a sequence (an) converges then its limit is
unique
32
(an) does not converge to λ in symbols
(∃ε > 0)(∀N ∈ N)(∃n > N )[|an − λ| ≥ ε] In words, this says that for some positive number ε, however large a natural number N we choose, there is a larger n such that an is still a distance at least ε away from λ
33
Let (an) be a sequence of real numbers. Then:
* (an) is bounded above by M ∈ R if for all n ∈ N we have an ≤ M . * (an) is bounded below by m ∈ R if for all n ∈ N we have m ≤ an. * (an) is eventually bounded above by M ∈ R if for some N ∈ N, whenever n > N we have an ≤ M . * (an) is eventually bounded below by m ∈ R if for some N ∈ N, whenever n > N we have m ≤ an. * (an) diverges to (plus) infinity if for every M ∈ R, there is N ∈ N such that whenever n > N we have an ≥ M .
34
(Algebra of convergent sequences). Suppose we have convergent sequences (an), with limit λ and (bn), with limit μ. Then:
(i) Sum Rule (an + bn) converges to λ + μ (ii) Multiple Rule (ran) converges to rλ, for r ∈ R (iii) Product Rule (anbn) converges to λμ (iv) Quotient Rule an/bn converges to λ/μ provided μ̸ is non zero
35
Let r ∈ R and consider the geometric sequence (rn)
1. If |r| < 1 then limn→∞ rn = 0. 2. If |r| > 1 then (rn) is unbounded. 3. If r = −1 then (rn) is bounded but does not converge
36
(The sandwich principle) If (an), (bn) and (cn) are sequences such that 1. bn ≤ an ≤ cn for all n ∈ N, 2. bn → λ and cn → λ as n → ∞
Then (an) is convergent and furthermore an → λ as n → ∞
37
(Reciprocal Rule). If the sequence (an) satisfies the conditions 1. (an) is eventually positive. 2. 1/an converges with limit 0
then an → ∞
38
(Algebra of divergent sequences). Suppose we have divergent sequences (an) and (bn), both tending to infinity. Then:
(i) Sum Rule (an + bn) → ∞ (ii) Multiple Rule (ran) → ∞, for r ∈ R+ (iii) Product Rule (anbn) → ∞
39
If (bn) tends to infinity and an ≥ bn for all n ∈ N, then
(an) tends to infinity
40
Monotone sequences
A sequence (an) is increasing if an ≤ an+1, for all n ≥ 1; a sequence (bn) is decreasing if bn ≥ bn+1, for all n ≥ 1. A sequence (an) is monotone if it is either increasing or decreasing
41
(The monotone convergence theorem). If (an) be an increasing sequence which is bounded above;
then (an) converges. Similarly, a decreasing sequence which is bounded below also converges.
42
:The sequence (an) given by an = (1+1/n)^n is:
convergent, and its limit e saatisfies 2
43