A refresher on math Flashcards

1
Q

Vector space definition

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

Distance

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

Normed vector space

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

Limit of a sequence

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

Limit point

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

Limit points of a convergent sequence

A

A convergent sequence in R_n can have at most one limit point

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

Theorem 3 Convergence and boundedness

A

Every convergent subsequence in R_n is bounded

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

Definition Cauchy sequence

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

Theorem 5 convergence of cauchy sequences

A

Every cauchy sequence in a metric space

  • The sequence is bounded
  • The sequence has at most one limit point
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Def complete space

A

Every Cauchy sequence is convergent (to a point within the metric space)

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

Continuity of a mapping at a point

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

Pointwise convergence

A

Notice pointwise convergence doesn’t preserve continuity

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

Uniform convergence

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

Theorem 5 uniform convergence

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

Uniform convergence theorem

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

C(X)

A
17
Q

Def contraction mapping

A
18
Q

Banach fixed point theorem

A
19
Q

Corollary Banach

A
20
Q

Blackwell’s sufficiency conditions

A
21
Q

Definition correspondence

A
22
Q

Definitions of correspondence:

  • compact valued
  • closed valued
  • convex valued
A

Their images are respectively:

  • compact sets
  • closed sets
  • convex sets
23
Q

Graph of a correspondence

A

Analogously, we have:

  • Closed-graph correspondences
  • Convex-graph correspondences
24
Q

Lower hemi-continuous

A

lhc fails if there are discontinuities that blow up the “upper border” of the graph

25
Q

Upper hemi-continuous sequence

A
26
Q

Continuous correspondence

A

The correspondence is continuous at x if it is both uhc and lhc

27
Q

Theorem 11: theorem of maximum

A
28
Q

Corollary 12

A
29
Q

Dynamic programming: assumptions

A
30
Q

Theorem 13 on bellman operator

A
31
Q

Assumptions 3-4

A

Under assumptions 1-4, V is strictly increasing

32
Q

Theorem 14: V strictly increasing

A

Under assumptions 1-4, V is strictly increasing

33
Q

Assumptions 5-6

A
34
Q

Theorem 15: concavity of V

A
35
Q

Theorem 16: uniform convergence of the policy function

A
36
Q

Assumption 7

A

F is continuously differentiable in the interior of A

37
Q

Theorem 17 (Benveniste and Scheinkman)

A
38
Q

Theorem 18 (envelope)

A