Analysis I Flashcards

1
Q

Give the axioms of a field

A

Addition is: unique, commutative & associative and there exists an additive identity & all real numbers have an additive inverse.
Multiplication is: unique, commutative & associative and there exists a multiplicative identity & all real numbers have a multiplicative inverse.
Multiplication distributes over addition
0 ≠ 1

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

Give the axioms of ordering on the real numbers

A

If a and b are positive, a + b is positive
If a and b are positive, ab is positive
Either a is positive, a=0 or -a is positive

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

Define a > b

A

a − b ∈ Positive numbers

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

Define a ≥ b

A

b - a is either positive or 0

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

Define an upper bound

A

b is an upper bound of S if s ≤ b for all s in S

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

Define a lower bound

A

b is a lower bound of S if s ≥ b for all s in S

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

Define what it means for a set to be bounded

A

A set, S is bounded if there exists an upper and a lower bound

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

Define a supremum

A

Let S be a set. Then α is the supremum of S if:
s ≤ α for all s ∈ S
s ≤ b for all s ∈ S => α ≤ b

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

Give the completeness axiom of the real numbers

A

Let S be a non-empty subset of R which is bounded above. Then sup S
exists.

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

Define an infimum

A

Let S be a set. Then α is the infimum of S if:
α ≤ s for all s ∈ S
b ≤ s for all s ∈ S => b ≤ α

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

Define a maximum of a set

A

For a non empty set, a maximum element max(S) is an element in S such that every element in S is ≤ max(S)

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

Define a minimum of a set

A

For a non empty set, a minimum element min(S) is an element in S such that every element in S is ≥ min(S)

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

Define |a|

A

|a| = a if a > 0
|a| = 0 if a = 0
|a| = -a if a < 0

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

Define countably infinitie

A

A is countably infinite if there exists a bijection between A and the natural numbers

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

Define countable

A

A is countable if there exists an injection from A to the natural numbers

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

Give the approximation property

A

Let S be non-empty and bounded above (so sup S exists). Then, given ε > 0, there exists s in S such that: sup S − ε < s < sup S

17
Q

Give the density properties

A

Given a, b ∈ R with a < b there exists x ∈ Q such that a < x < b.
Given a, b ∈ R with a < b there exists y ∈ R \ Q such that a < y < b.

18
Q

Define a real sequence

A

A map α:N->R (ie. a sequence is ordered)

19
Q

Define convergence

A

a_n converges to r if ∀ ε > 0, ∃N in the natural numbers such that |a_n - r|< ε for all n ≥ N

20
Q

Define divergence

A

a_n is divergent if there is no r which a_n converges to.

21
Q

Define a tail

A

b_n is a tail of a_n if b_n = a_(n+k) for some k in the natural numbers

22
Q

Give the Sandwich lemma

A

Let (a_n), (b_n) and (c_n) be real sequences with a_n ≤ b_n ≤ c_n for all n ≥ 1. If a_n → L and c_n → L as n → ∞, then b_n → 0 as n → ∞

23
Q

Define a bounded sequence

A

If a_n is a sequence, we say that it is bounded if the set {an : n ≥ 1} is bounded.

24
Q

Define a_n → ∞

A

∀M ∈ R ∃N in the natural numbers such that ∀n ≥ N, a_n > M

25
Q

Define convergence for a complex sequence

A

z_n -> L means that ∀ε > 0, ∃N in the natural numbers such that ∀n ≥ N, |zn − L| < ε.

26
Q

Define a subsequence

A

If a_n for n ≥ 0 (natural numbers) is a sequence, b_r, where r ≥ 0 (natural numbers) is a subsequence of a_n provided that there is a function f : n → r such that f is strictly increasing.

27
Q

Define a_n = O(b_n)

A

If a_n and b_n are sequences, a_n = O(b_n) as n → ∞, means that there is a constant C ∈ R > 0 and N such that if n ≥ N then |an| ≤ C|bn|.

28
Q

Define a_n = o(b_n)

A

If b_n ≠ 0 for all n (or all sufficiently large n), then a_n = o(b_n) as n → ∞ means that a_n b_n → 0 as n → ∞.

29
Q

Define monotone increasing

A

a_n is monotone increasing if a_n ≤ a_(n+1) for all n

30
Q

Define strictly increasing

A

a_n is strictly increasing if a_n < a_(n+1) for all n

31
Q

Define a Cauchy sequence

A

∀ε > 0, ∃N in the natural numbers such that |a_n - a_m| < ε for all n,m ≥ N

32
Q

Define a rearrangement of a series

A

Rearranging a series means that we choose a bijection: N -> N that gives a new series

33
Q

Define the exponential function

A

Sum to infinity of z^k/k!

34
Q

Define the sine function

A

Sum to infinity of (-1)^k * z^(2k)/(2k+1)!

35
Q

Define the cosine function

A

Sum to infinity of (-1)^k * z^(2k)/(2k)!

36
Q

Define the radius of convegence

A

R = sup{|z|:sum of (c_k)(z^k) converges}

37
Q

Define a limit point

A

p is a limit point if ∀ε > 0, ∃s ≠ p such that 0 < |s-p| < ε