Definitions (Billy Cole) Flashcards

1
Q

define a metric space (X,d)

A

(X,d) consists of a non empty set X and a non-negative real valued metric d:XxX → ℝ* which satisfies the axioms.

  1. d(x,y)=0 x=y Ɐx,y ∈ X
  2. d(x,y)=d(y,x) Ɐx,y ∈ X
  3. d(x,z) ≤ d(x,y)+d(y,z) Ɐx,y,z ∈ X
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

define a Subspace

A

Given any subset W⊆X, the restriction of d to W determines the subspace (W, d:= d_w) of (X,d).

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

Define an open ball

A

For any metric space (X,d), the open ball of radius r>0 around point x∈X is the subspace,
B_r(x) = {y : d(y,x) < r} .

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

Define a closed ball

A

For any metric space (X,d), the open ball of radius r>0 around point x∈X is the subspace,
Ɓ_r(x) = {y : d(y,x) ≤ r} .

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

Define an Euclidean n-space (ℝ^n,d_2)

A

Euclidean n-space (ℝ^n,d_2) consists of all real n-dimensional vectors x=(x_1,…,x_n), equipped with the Euclidean metric
d_2(x,y) = [(x_1 - y_1)²+ … +(x_n - y_n)²]^½
where the positive square root is understood.

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

what is the Euclidean metric

A

d_2(x,y) = [(x_1 - y_1)²+ … +(x_n - y_n)²]^½

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

What is the open ball of the Euclidean metric?

A

B_r(x) = {y ∈ℝ^n : (⅀(y_i - x_i)^2)^½ < r} .

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

What is the closed ball of the Euclidean metric?

A

Ɓ_r(x) = {y ∈ℝ^n : (⅀(y_i - x_i)^2)^½ ≤ r}

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

what is the taxicab metric?

A

d_1(x,y) = |x_1 - y_1|+ … + |x_n - y_n|

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

what is the discrete metric?

A

for any non empty set X,
d(x,y) = {0 if x=y
{1 otherwise

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

what is the open Ball of the discrete metric?

A

B_r(x) = { {x} if r ≤ 1

{ X if r > 1

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

what is the closed Ball of the discrete metric?

A

Ɓ_r(x) = { {x} if r < 1

{ X if r ≥ 1

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

define isometry

A

For any two metric spaces (X, d_X) and (Y, d_Y ), a bijection
f:X→Y is an isometry whenever d_X(x,y) = d_Y(f(x), f(y)) for all Ɐx,y ∈ X

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

define the standard metric d_ℂ

A

d_ℂ on the complex numbers ℂ is given by
d_ℂ(z,z’) = |z-z’|
where |z|= r

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

what are the balls of the standard metric, d_ℂ, like?

A

the balls in ℂ are genuine discs of radius r.

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

define a Graph. Γ=(V,E)

A

Γ=(V,E) consists of a set V of vertices, and a set E of edges; each edge vw ∈E may be interpreted as joining two vertices v,w ∈V.

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

define a path, in a graph Γ

A

a path in Γ from u to w is a finite sequence of edges

π(u,w) = (uv_1, v_1v_2, ….. , v_(n-2)v_(n-1), v_(n-1)w).

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

whats the edge metric e on the vertex set V of a path connected graph is defined by ?

A

e(u,w) = min l(π(u,w))

_π(u,w)

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

what is the open ball in the edge metric

A

B_r(u) = {w∈V : π(u,w) exists with <r edges}

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

what is the closed ball in the edge metric

A

Ɓ_r(u) = {w∈V : π(u,w) exists with ≤r edges}.

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

whats the d_min on X

A

d_min(x,y) = {0 if x=y

{½^n if n=min{m:x_m≠y_m}

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

Define bounded

in terms of a function

A

A real-valued function f on a closed interval [a,b]⊂ℝ is bounded whenever there exists a constant K such that |f(x)|≤K for every x∈[a,b].

but the converse it false

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

whats the sup metric

A

d_sup(f,g) = sup |f(x)-g(x)|

x∈[a,b]

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

what is ℬ[a,b] ?

A

It is the metric space (X,d_sup) for any interval [a,b]⊆ℝ.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
what is ℒ_1[a,b] ?
The metric space (Y,d_1), where d-1 is the metric that measures the area between functions. d_1(f,g) = ∫ |f(t)-g(t)| dt
26
what is ℒ_2[a,b] ?
The metric space (Y,d_2), where d_2 equals d_2(f,g) = ( ∫ ( f(t)-g(t) )² dt)^½
27
what is the interval metric, d_H on X.
X is the set of all closed intervals [a,b] in the euclidean line. d_H([a,b],[r,s]) = max{ | r - a |, | s - b | }.
28
what is the l_1 metric d_1
d_1( (a_i),(b_i) ) = ⅀|a_i - b_i|
29
in terms of d_1 what are the balls of the l_1 metric
B_r((a_i)) = {(b_i) : ⅀|a_i - b_i| < r } and Ɓ_r((a_i)) = {(b_i) : ⅀|a_i - b_i| ≤ r }
30
define the cartesian product of two metric spaces (X,d) and (X',d').
the cartesian product of two metric spaces (X,d) and (X',d') is the set XxX' equipped with one the metrics 1. d_a((x,x'),(y,y')) = d(x,y) + d'(x',y') 2. d_b((x,x'),(y,y')) = (d(x,y)² + d'(x',y')²)^½ 3. d_c((x,x'),(y,y')) = max{d(x,y), d'(x',y')}
31
define Lipschitz equivalent. | in terms of metrics
two metrics d and e on X are lipschitz equivalent whenever there exists positive constants h,k∈ℝ such that; he(x,y) ≤ d(x,y) ≤ ke(x,y) for every x,y∈ X
32
Define an interior point u
An Interior point u∈U is one for which there exists ε>0 such that B_ε(u)⊆U.
33
Define the Interior of U
The Interior of U is the subset U°⊆U of all interior points.
34
define when U is open in X
when U°=U.
35
Define closure point.
a point x∈X is a closure point of U⊆X if B_ε(u)⋂U is non-empty for every ε>0.
36
Define closure.
The Closure of U is the superset Ū⊇U of all closure points.
37
Define closed
U is closed in X if Ū=U.
38
Define a Partially open ball in X
a partially open ball in X is a set P_r(x) = B_r(x)⋃P, where P and Q are non-empty disjoint subsets satisfying P⋃Q={p:d(x,p)=r}.
39
Define a sequence
For any metric space X = (X, d), a sequence in X is a function s: ℕ → X
40
Define converges
``` A sequence (x_n) converges to the point x ∈ X whenever ∀ε > 0, ∃N ∈ ℕ such that n ≥ N ⇒ d(x, x_n) ```
41
Define convergence in terms of open balls
x_n → x whenever | ∀ε > 0, ∃N∈ℕ such that n ≥ N ⇒ x_n ∈ B(x).
42
Define a Cauchy sequence
In any metric space (X; d), a Cauchy sequence (x_n) satisfies ∀ε > 0, ∃N ∈ℕ such that m,n ≥N ⇒ d(x_m, x_n)
43
Define Dense
A subset Y is dense in (X, d) whenever Ȳ = X.
44
Define Bounded | in terms of a metric space
A subset A of a metric space (X,d) is bounded whenever | there exists x_0 ∈X and M∈R such that d(x, x_0) ≤M for every x∈A.
45
Define the diameter
diam(A) of a bounded non-empty subset A⊆X is the real number | sup {d(x,y) : x,y∈A}
46
Define a Boundary Point
A boundary point x∈X of A is one for which every open | ball B_ε(x) meets both A and X\A.
47
Define a the Boundary ∂A
The boundary ∂A of A is the set of all boundary points.
48
The boundary of any subset A is ?
the set Ᾱ\A°
49
Define pointwise convergence
A sequence (f_n: n≥1) of such functions converges pointwise to f on D whenever the sequence of real numbers ( f_n(x) ) converges to f(x) in ℝ for every x∈D.
50
Define Uniform convergence
A sequence (f_n: n≥1) of functions converges uniformly to f on D whenever ∀ε>0, ∃N(ε) ∈ℕ such that n≥N(ε) ⇒ | f_n(x) - f(x) |ε for every x∈D.
51
f_n →f uniformly on D ⇒ ?
f_n→ f pointwise on D
52
Define continuous at x_0 in X | wol lol lor
Given metric spaces (X,d_x) and (Y,d_y), a function f: X→Y is continuous at x_0 in X whenever ∀ε>0; ∃δ>0 such that d_x(x,x_0)
53
Define a map
a continuous function.
54
define when f is continuous
f is continuous at every x_0∈X, then f is continuous.
55
define when f is continuous at x_0 in X, in terms of open balls
Given metric spaces (X,d_x) and (Y,d_y), a function f: X→Y is continuous at x_0 in X whenever ∀ε>0, ∃δ>0 such that x∈B_δ(x_0) ⇒ f(x) ∈B_δ(f(x_0))
56
Define the Inverse image
For any function f: X→Y and any subset U⊆Y , the inverse image f^-1(U) is the subset {x : f(x)∈U} ⊆X.
57
Define Lipschitz Equivalence | in terms of metric spaces
For any two metric spaces (X,d_x) and (Y,d_y), a bijection f: X→Y is a Lipschitz equivalence whenever there exist positive constants h,k∈ℝ such that hd_y (f(w), f(x)) ≤ d_x(w,x) ≤ kd_y (f(w), f(x)) for all w,x∈X.
58
Define a homeomorphism
A bijection f: X→Y is a homeomorphism whenever f and | f^-1 are both continuous.
59
Define topologically equivalent
Two metrics d and e on a set X are topologically equivalent whenever the identity function 1_x is a homeomorphism.
60
Define Path connected
A metric space X is path connected if every two points x_0, x_1 ∈X admit a continuous function σ: [0,1]→X such that σ(0) = x_0 and σ(1) = x_1. Then σ is a path from x_0 to x_1 in X
61
Define a Covering of A
is a collection of sets Ʋ = {U_i : i ∈ I} for which | A ⊆ ⋃U_i
62
Define a Subcovering of Ʋ
a subcovering of U is a subcollection {U_i : i∈J} which also covers A, for some J⊆I.
63
Define a open covering
If every U_i is open, then U is an open covering of A
64
Define Compact
A subset A⊆X is compact if every open covering of A contains a finite subcovering.
65
Define Sequentially compact
A subspace S⊆X is sequentially compact if any infinite sequence (x_n : n≥0) in S has a subsequence (x_r : r≥1) that converges to a point in S
66
Define the Cantor set K
The Cantor set K⊂ℝ is defi ned by the following inductive procedure. Let K_0= [0,1], and defi ne K_1⊂K_0 by deleting its open middle third. so K_1 = [0, ⅓]⋃[ ⅔, 1] is the union of two closed intervals, each of length ⅓. Let K_n be the union of 2^n closed intervals, each of length ⅓^n, and de fine K_n+1 by deleting the open middle third of each; so K_n+1 is the union of 2^n+1 closed intervals, each of length ⅓^(n+1). then K= K_1 ⋂ ... ⋂ K_n ⋂...
67
The Cantor set is ?
uncountable closed compact
68
Define complete
A metric space (X, d) is complete if every Cauchy sequence tends to a limit in X.
69
Define a contraction
Given any metric space (X, d), a self-map f : X → X is a | contraction whenever there exists a constant 0
70
Define fixed point
A fixed point of a self-map f : X → X is a point x ∈ X for which f(x) = x