Metric Spaces Lecture Notes

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/12

flashcard set

Earn XP

Description and Tags

Vocabulary and definitions regarding the fundamental concepts and specific examples of metric spaces as presented in the Math 127C lecture.

Last updated 2:47 AM on 7/31/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

13 Terms

1
New cards

Metric

A function dd on any set AA such that d:A×ARd : A \times A \rightarrow \text{R} and the following four properties hold for all x,y,z in Ax, y, z \text{ in } A: M1M1 (Self-Distance), M2M2 (Positivity), M3M3 (Symmetry), and M4M4 (Triangle Inequality).

2
New cards

Metric Space

An ordered pair (A,d)(A, d) where AA is a set and dd is a metric.

3
New cards

M1 (Self-Distance)

The property of a metric where the distance from a point to itself is zero, defined as d(x,x)=0d(x, x) = 0.

4
New cards

M2 (Positivity)

The property of a metric where if xyx \neq y, then d(x,y)>0d(x, y) > 0.

5
New cards

M3 (Symmetry)

The property of a metric where the distance between two points is independent of order, defined as d(x,y)=d(y,x)d(x, y) = d(y, x).

6
New cards

M4 (Triangle Inequality)

The property of a metric where the distance between two points is less than or equal to the sum of the distances via a third point, defined as d(x,y)d(x,z)+d(z,y)d(x, y) \neq d(x, z) + d(z, y).

7
New cards

Discrete Metric

A valid metric paired with any set AA where the function is defined as d(x,y)=0d(x, y) = 0 if x=yx = y and d(x,y)=1d(x, y) = 1 if xyx \neq y.

8
New cards

Standard Metric on RR

A metric space where A=RA = R and the distance function is defined by the absolute value of the difference: d(x,y)=xyd(x, y) = |x - y|.

9
New cards

Taxicab Metric on RnR^n

A metric on A=RnA = R^n defined by d(x,y)=sumi=1n(xiyi)d(x, y) = \text{sum}_{i=1}^n (|x_i - y_i|), representing a rectilinear path where only 9090 degree turns are allowed.

10
New cards

Euclidean Metric on RnR^n

The "usual" distance function on A=RnA = R^n defined by d(x,y)=(sumi=1n(xiyi2))12d(x, y) = (\text{sum}_{i=1}^n (|x_i - y_i|^2))^{\frac{1}{2}}.

11
New cards

Chebyshev Metric on RnR^n

A metric on A=RnA = R^n defined by d(x,y)=supi=1n(xiyi)d(x, y) = \text{sup}_{i=1}^n (|x_i - y_i|), which identifies the distance between two points as the largest single coordinate difference.

12
New cards

Supremum vs. Maximum in Chebyshev Metric

In the definition of the Chebyshev Metric where nn is finite, the supremum is always equal to the maximum.

13
New cards