Definitions Flashcards

1
Q

A metric space (X, d)

A

Consists of a non-empty set X and a non-negative real valued metric d: X × X → R>

Satisifes the axioms:

  1. d(x, y) = 0 ⇐⇒ x = y for all x, y ∈ X
  2. d(x, y) = d(y, x) for all x, y ∈ X
  3. d(x, z) ≤ d(x, y) + d(y, z) for all x, y, z ∈ X (triangle inequality)

Known informally as a distance function .

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

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

Open and closed balls

A

For any metric space (X, d), the open ball and closed ball of radius r > 0 around a point x ∈ X are the subspaces:

Br(x) := {y : d(y, x) < r} and

_
Br(x) := {y : d(y, x) ≤ r} ⊆ X

respectively.

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

Euclidean n-space (R^n, d2)

A

Euclidean n-space (R^n, d2) consists of all real n-dimensional vectors:

x = (x1, . . . , xn)

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

Isometry

A

For any two metric spaces (X, dX) and (Y, dY ), a Bijection
f : X → Y is an isometry whenever:

dX(x, y) = dY (f(x), f(y)) for all x, y ∈ X

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

A graph Γ := (V, E)

A

A graph Γ := (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
7
Q

A path in Γ

The length of a path

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)

Such a path has length `(π(u, w)) = n

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

Path connected

A

A graph is path connected whenever there is a path joining any pair of vertices

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

Edge metric e

A

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

e(u, w) = min_(π(u,w)) L(π(u, w))

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

Alphabet

A

An alphabet is a finite set A of letters

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

Word

A

A finite sequence of letters is a word in A; if A := {a, b, c, o, t}, then words include act, boat, and obbbt

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

Word graph

A

The vertex set W of the associated word graph Γ(A)
consists of all possible words in A.

Words w1 and w2 are joined by an edge iff they differ by one of:

  1. inserting or deleting a letter
  2. swapping two adjacent letters
  3. replacing one letter with another
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Word Metric

A

The word metric dw on W is the edge metric on the associated word graph.

ex:
dw(act,boat) = 3
act, bact, baot, boat

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

Binary sequences

A

X = {0, 1}^∞ is the set of all infinite binary sequences x = x_0x_1 . . . ,

x_n = 0 or 1 for all n ≥ 0

x = 1100010 . . . is a typical element

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

Bounded

A

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

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

Real polynomial of degree n

A

a(x) = a_nx^n + · · · + a_1x + a_0

17
Q

Cartesian product of two metric spaces (X, d) and (X’,d’)

A

The cartesian product of two metric spaces (X, d) and (X’,d’) is the set X × X’
equipped with one of 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)^2 + d’(x’, y’)^2 ]^1/2
  3. d_c((x, x’),(y, y’)) = max{d(x, y), d’(x’, y’)}

for any x, y ∈ X and x’, y’ ∈ X’
.

18
Q

Lipschitz equivalent

A

Two metrics d and e on a given set X are Lipschitz equivalent whenever there exist positive constants h, k ∈ R such that:

he(x, y) ≤ d(x, y) ≤ ke(x, y)

for every x, y in X

19
Q

An interior point U ⊆ X

A

An interior point u ∈ U is one for which there exists e > 0 such that B_e(u) ⊆ U

20
Q

The interior of U

A

The interior of U is the subset U◦ ⊆ U of all interior points

21
Q

U is open in X

A

U◦ = U

22
Q

A closure point of U ⊆ X

A

A point x ∈ X is a closure point of U ⊆ X if B_e(x) ∩ U is

non-empty for every u > 0; If U = U, then U is closed in X

23
Q

The closure of U

A

The closure of U is the superset:
_
U ⊇ U of all closure points

24
Q

U is closed in X

A

_

U = U

25
Q

A partially open ball in X

A

A set Pr(x):= Br(x) ∪ P, where P is a proper subset of {p : d(x, p) = r}

26
Q

A sequence (x_n) converges

A

A sequence (x_n) converges to the point x ∈ X whenever
∀e > 0, ∃N ∈ N such that n ≥ N ⇒ d(x, x_n) < e;
in this situation, x is known as the limit of (x_n)

∀e > 0, ∃N ∈ N such that n ≥ N ⇒ x_n ∈ B_e(x).

27
Q

Cauchy sequence

A

In any metric space (X, d), a Cauchy sequence (x_n) satisfies ∀e > 0, ∃N ∈ N such that m, n ≥ N ⇒ d(x_m, x_n) < e

28
Q

Dense

A

A subset Y is dense in (X, d) whenever Y = X

29
Q

Bounded

A

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
A function f : S → X is bounded whenever its image f(S) ⊂ X is a bounded, for any set S

30
Q

Diameter

A

The diameter diam(A) of a bounded non-empty subset A ⊆ X is the real number sup{d(x, y) : x, y ∈ A}

31
Q

Boundary point

A

A boundary point x ∈ X of A is one for which every open ball B_e(x) meets both A and X \ A; the boundary ∂A of A is the set of all such boundary points

32
Q

The boundary

A

The boundary ∂A of A is the set of all such boundary points