Skip to main content
added 2 characters in body; added 7 characters in body
Source Link
Anton Petrunin
  • 45k
  • 14
  • 135
  • 299

It is easy to prove that the completion of your space can be any separable metric space where metric spheres are nowhere dense.

Does not it scare you?

Answer to the comment: Not all of your spaces can be embedded into a metric tree.

BTW, there is a nice characterization of subsets in a metric tree: $$ | x - y | + | a - b | \le \max\{|x-a| + |y-b|,|x-b|+|y-a|\}$$ for all points $x,y,a,b$ (here $|x-y|$ denotes the distance from $x$ to $y$). In

In other words, the values $X=|x-a|+|y-b|$, $Y=|x-b|+|y-a|$ and $Z=|x-y|+|a-b|$$$X=|x-a|+|y-b|,$$ $$Y=|x-b|+|y-a|,$$ $$Z=|x-y|+|a-b|$$ satisfy ulrtatriangle inequality. This inequality can be also thought as a discrete analog of CAT[−∞] inequality.

It is easy to prove that the completion of your space can be any separable metric space where metric spheres are nowhere dense.

Does not it scare you?

Answer to the comment: Not all of your spaces can be embedded into a metric tree.

BTW, there is a nice characterization of subsets in a metric tree: $$ | x - y | + | a - b | \le \max\{|x-a| + |y-b|,|x-b|+|y-a|\}$$ for all points $x,y,a,b$ (here $|x-y|$ denotes the distance from $x$ to $y$). In other words, the values $X=|x-a|+|y-b|$, $Y=|x-b|+|y-a|$ and $Z=|x-y|+|a-b|$ satisfy ulrtatriangle inequality. This inequality can be also thought as a discrete analog of CAT[−∞] inequality.

It is easy to prove that the completion of your space can be any separable metric space where metric spheres are nowhere dense.

Does not it scare you?

Answer to the comment: Not all of your spaces can be embedded into a metric tree.

BTW, there is a nice characterization of subsets in a metric tree: $$ | x - y | + | a - b | \le \max\{|x-a| + |y-b|,|x-b|+|y-a|\}$$ for all points $x,y,a,b$ (here $|x-y|$ denotes the distance from $x$ to $y$).

In other words, the values $$X=|x-a|+|y-b|,$$ $$Y=|x-b|+|y-a|,$$ $$Z=|x-y|+|a-b|$$ satisfy ulrtatriangle inequality. This inequality can be also thought as a discrete analog of CAT[−∞] inequality.

added 6 characters in body; added 183 characters in body
Source Link
Anton Petrunin
  • 45k
  • 14
  • 135
  • 299

It is easy to prove that the completion of your space can be any separable metric space where metric spheres are nowhere dense.

Does not it scare you?

Answer to the comment: Not all of your spaces can be embedded into a metric tree.

BTW, there is a nice characterization of subsets in a metric tree: $$ | x - y | + | a - b | \le |x-a| + |x-b| + |y-a| + |y-b|$$$$ | x - y | + | a - b | \le \max\{|x-a| + |y-b|,|x-b|+|y-a|\}$$ for all points $x,y,a,b$ (here $|x-y|$ denotes the distance from $x$ to $y$). In other words, the values $X=|x-a|+|y-b|$, $Y=|x-b|+|y-a|$ and $Z=|x-y|+|a-b|$ satisfy ulrtatriangle inequality. This inequality can be also thought as a discrete analog of CAT[−∞] inequality.

It is easy to prove that the completion of your space can be any separable metric space where metric spheres are nowhere dense.

Does not it scare you?

Answer to the comment: Not all of your spaces can be embedded into a metric tree.

BTW, there is a nice characterization of subsets in a metric tree: $$ | x - y | + | a - b | \le |x-a| + |x-b| + |y-a| + |y-b|$$ for all points $x,y,a,b$ (here $|x-y|$ denotes the distance from $x$ to $y$). This inequality can be also thought as a discrete analog of CAT[−∞] inequality.

It is easy to prove that the completion of your space can be any separable metric space where metric spheres are nowhere dense.

Does not it scare you?

Answer to the comment: Not all of your spaces can be embedded into a metric tree.

BTW, there is a nice characterization of subsets in a metric tree: $$ | x - y | + | a - b | \le \max\{|x-a| + |y-b|,|x-b|+|y-a|\}$$ for all points $x,y,a,b$ (here $|x-y|$ denotes the distance from $x$ to $y$). In other words, the values $X=|x-a|+|y-b|$, $Y=|x-b|+|y-a|$ and $Z=|x-y|+|a-b|$ satisfy ulrtatriangle inequality. This inequality can be also thought as a discrete analog of CAT[−∞] inequality.

added 469 characters in body; deleted 83 characters in body
Source Link
Anton Petrunin
  • 45k
  • 14
  • 135
  • 299

It is easy to prove that the completion of your space can be any separable metric space where metric spheres are nowhere dense.

Does not it scare you?

Answer to the comment: Not all of your spaces can be embedded into a metric tree.

BTW, there is a nice characterization of subsets in a metric tree: $$ | x - y | + | a - b | \le |x-a| + |x-b| + |y-a| + |y-b|$$ for all points $x,y,a,b$ (here $|x-y|$ denotes the distance from $x$ to $y$). This inequality can be also thought as a discrete analog of CAT[−∞] inequality.

It is easy to prove that the completion of your space can be any separable metric space where metric spheres are nowhere dense.

Does not it scare you?

It is easy to prove that the completion of your space can be any separable metric space where metric spheres are nowhere dense.

Does not it scare you?

Answer to the comment: Not all of your spaces can be embedded into a metric tree.

BTW, there is a nice characterization of subsets in a metric tree: $$ | x - y | + | a - b | \le |x-a| + |x-b| + |y-a| + |y-b|$$ for all points $x,y,a,b$ (here $|x-y|$ denotes the distance from $x$ to $y$). This inequality can be also thought as a discrete analog of CAT[−∞] inequality.

Source Link
Anton Petrunin
  • 45k
  • 14
  • 135
  • 299
Loading