Properties of Metric $\sigma(x,y)$

  • Context: MHB 
  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Metric Properties
Click For Summary
SUMMARY

The discussion centers on proving that the function $\sigma(x,y) = \min \{ 1, \rho(x,y) \}$ is a metric given that $\rho(x,y)$ is a metric on the set $X$. Key properties of $\rho(x,y)$ include non-negativity, identity of indiscernibles, symmetry, and the triangle inequality. The participants explore the triangle inequality for $\sigma(x,y)$ and identify the need for case breakdowns based on the values of $\rho(x,y)$ in relation to 1. The conclusion emphasizes the necessity of considering all possible cases to validate the triangle inequality for $\sigma(x,y)$.

PREREQUISITES
  • Understanding of metric spaces and properties of metrics
  • Familiarity with the triangle inequality in mathematical analysis
  • Knowledge of the minimum function and its properties
  • Basic algebraic manipulation and case analysis techniques
NEXT STEPS
  • Study the properties of metrics in detail, focusing on the triangle inequality
  • Explore case analysis techniques in mathematical proofs
  • Learn about the implications of modifying metrics, such as truncating distances
  • Investigate examples of metrics and their properties in various mathematical contexts
USEFUL FOR

Mathematicians, students studying metric spaces, and anyone interested in the properties of distance functions in analysis will benefit from this discussion.

evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)
I want to show that if $\rho(x,y)$ is a metric on $X$, then $\sigma (x,y)= \min \{ 1, \rho(x,y) \}$ is a metric.

I have thought the following:

$\rho(x,y)$ is a metric on $X$, so:

  • $\rho(x,y) \geq 0, \forall x,y \in X$
  • $\rho(x,y)=0$ iff $x=y$
  • $\rho(x,y)=\rho(y,x) \forall x,y \in X$
  • $\rho(x,z) \leq \rho(x,y)+\rho(y,z), \forall x,y,z \in X$

  • $\sigma(x,y)= \min \{ 1, \rho(x,y) \} \geq 0 \forall x,y \in X$ since $1 \geq 0$ and $\rho(x,y) \geq 0, \forall x,y \in X$
  • $\sigma(x,y)=0 \Leftrightarrow \min \{ 1, \rho(x,y) \} =0 \Leftrightarrow \rho(x,y)=0 \Leftrightarrow x=y$
  • $\sigma(x,y)= \min \{ 1, \rho(x,y) \}= \min \{ 1, \rho(y,x) \}=\sigma(y,x) \forall x,y \in X$
  • Suppose that $1< \rho(x,y), \forall x,y \in X$. Then $\sigma(x,z)=1 \leq 1+1= \sigma(x,y)+ \sigma(y,z)$.
    Suppose that $1> \rho(x,y), \forall x,y \in X$. Then $\sigma(x,z)= \rho(x,z) \leq \rho(x,y)+ \rho(x,z)= \sigma(x,y)+ \sigma(x,z)$

Could I improve something? Could we also show the last inequalities without distinguishing cases? (Thinking)
 
Physics news on Phys.org
I would say you're solid on everything except the triangle inequality. I don't see any particular reason to make such a strong assumption as $1>\rho(x,y)$ for all $x,y$. How do you know there aren't two pairs of numbers, one of which has a $\rho$ distance greater than $1$, and the other pair less than $1$? Your breakdown of cases doesn't handle this case. Let me see:
$$\sigma(x,z)=\min\{1,\rho(x,z)\}\le\min\{1,\rho(x,y)+\rho(y,z)\}.$$
If you could say that
$$\min\{1,\rho(x,y)+\rho(y,z)\}\le\min\{1,\rho(x,y)\}+\min\{1,\rho(y,z)\},$$
then you'd be done. Is that the case? Here's where you would need a breakdown by cases - I don't see any way around it. But the cases are the following:
  1. Both $\rho(x,y)$ and $\rho(y,z)$ are less than $1$.
  2. One of the two $\rho$ distances is less than $1$, and one is greater.
  3. Both the $\rho$ distances are greater than $1$.
By symmetry, we can ignore, in the second case, which $\rho$ distance is greater than $1$. I would do a "without loss of generality", and pick one to be bigger, and one smaller.

Does that help?
 
Ackbach said:
I would say you're solid on everything except the triangle inequality. I don't see any particular reason to make such a strong assumption as $1>\rho(x,y)$ for all $x,y$. How do you know there aren't two pairs of numbers, one of which has a $\rho$ distance greater than $1$, and the other pair less than $1$? Your breakdown of cases doesn't handle this case. Let me see:
$$\sigma(x,z)=\min\{1,\rho(x,z)\}\le\min\{1,\rho(x,y)+\rho(y,z)\}.$$
If you could say that
$$\min\{1,\rho(x,y)+\rho(y,z)\}\le\min\{1,\rho(x,y)\}+\min\{1,\rho(y,z)\},$$
then you'd be done. Is that the case? Here's where you would need a breakdown by cases - I don't see any way around it. But the cases are the following:
  1. Both $\rho(x,y)$ and $\rho(y,z)$ are less than $1$.
  2. One of the two $\rho$ distances is less than $1$, and one is greater.
  3. Both the $\rho$ distances are greater than $1$.
By symmetry, we can ignore, in the second case, which $\rho$ distance is greater than $1$. I would do a "without loss of generality", and pick one to be bigger, and one smaller.

Does that help?

At the first case, doesn't it always hold that $\min\{1,\rho(x,y)+\rho(y,z)\}=\min\{1,\rho(x,y)\}+\min\{1,\rho(y,z)\}=\rho(x,y)+\rho(y,z)$ ? (Thinking)

Also do we show the last case for example as follows? (Thinking)
$\min\{1,\rho(x,y)+\rho(y,z)\}=1 \leq 1+1=\min\{1,\rho(x,y)\}+\min\{1,\rho(y,z)\}$
 
evinda said:
At the first case, doesn't it always hold that $\min\{1,\rho(x,y)+\rho(y,z)\}=\min\{1,\rho(x,y)\}+\min\{1,\rho(y,z)\}=\rho(x,y)+\rho(y,z)$ ? (Thinking)

What about $1=\min(1,0.75+0.75)\overset{?}{=}\min(1,0.75)+\min(1,0.75)=1.5$?

Also do we show the last case for example as follows? (Thinking)

$\min\{1,\rho(x,y)+\rho(y,z)\}=1 \leq 1+1=\min\{1,\rho(x,y)\}+\min\{1,\rho(y,z)\}$

Sure, that works!
 
Ackbach said:
What about $1=\min(1,0.75+0.75)\overset{?}{=}\min(1,0.75)+\min(1,0.75)=1.5$?

Ah, I see... But how can we explain the first case formally? (Thinking)

Ackbach said:
Sure, that works!

Great... (Smirk)
 
evinda said:
Ah, I see... But how can we explain the first case formally? (Thinking)

Hmm. Well, maybe we broke the cases down incorrectly. What if the cases should be, instead,
  1. $\rho(x,y)+\rho(y,z)<1$
  2. $\rho(x,y)+\rho(y,z)>1$
I would try a few actual numbers in there to see if you need to further subdivide these cases.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 19 ·
Replies
19
Views
1K
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 22 ·
Replies
22
Views
3K