How many of the following pairs ( M , d ) are metric spaces?
M = R n and d ( ( x 1 , … , x n ) , ( y 1 , … , y n ) ) = 1 ≤ i ≤ n max ∣ x i − y i ∣
M = { a , b , c , d } , where d ( a , b ) = d ( a , c ) = 3 , d ( a , d ) = d ( b , c ) = 7 , and d ( b , d ) = d ( c , d ) = 1 1
M = C [ 0 , 1 ] , the set of continuous functions [ 0 , 1 ] → R , and d ( f , g ) = x ∈ [ 0 , 1 ] max ∣ f ( x ) − g ( x ) ∣
M = C [ 0 , 1 ] and d ( f , g ) = ∫ 0 1 ( f ( x ) − g ( x ) ) 2 d x
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Problem Loading...
Note Loading...
Set Loading...
Maybe I can give you intuition.
For first case, just think of each coordinate in each braces as heights placed side by side as in bar graphs . Hence you get two graphs, superimpose them. Now get the max difference. Think of symmetry preservation and then as for triangle inequality, introduce an other one(think of the upper part of heights), now clearly, the maxes wrt two preexisting graph will be greater in the sum than the original one.
Next, Simply construct a graph with edges and vertices (a,b,c,d) and check it yourself by trial
Third, it is pretty same as the first one, the x belonging to a certain range doe not matter I guess. Lastly, Draw curve and shade areas between them and do the same trick if introducing a third party for detour s I did with the first case. Well, but the answer will be no in this case. See if you can find it yourself.
To be honest, metric spaces are way complicated, so just don't dammn yourself. Correct me if I have any error. I will be glad!