Generalization of the Triangle Inequality with Sets












0














Definition: The distance between two points $p_1, p_2 in mathbb{R}^n$ is
begin{equation}
d(p_1,p_2)=|| p_1-p_2 ||.
end{equation}

The distance between a point $pin mathbb{R}^n$ and a set $mathcal{C} subset mathbb{R}^n$ is
begin{equation}
d(p,mathcal{C}) = inf{||p-q|| : q in mathcal{C}}.
end{equation}



Given three points $p_i in mathbb{R}^n, i=1,2,3$. The triangle inequality tells us that
begin{equation}
|d(p_1,p_3) - d(p_3,p_2)| le d(p_1, p_2) le d(p_1, p_3) + d(p_3,p_2).
end{equation}



Now the problem is:



Is the triangle inequality still held if one point is replaced by a non-singleton set?










share|cite|improve this question
























  • Suppose part 3 held true. Do you see that you get parts 1 and 2 from here by taking some sets as singletons? Try to work therefore with three sets at first(I am not telling you if it's true or not, only that if it were true life is easier).
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:15












  • @астонвіллаолофмэллбэрг how about the edits? (non-singleton sets?)
    – winston
    Nov 27 at 13:22










  • You have edited the question. Is this how it will finally stand?
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:28










  • @астонвіллаолофмэллбэрг I try to simplify the problem first. I know that the right part of the inequality is not correct because if this set contains the two points, then $d(p_1,p_2) ge 0$ (assume that $p_3$ is replaced by a non-singleton set).
    – winston
    Nov 27 at 13:49












  • Correct. So, for example, if we take a set $P$ with at least two points, and $p_1 neq p_2$ in $P$, then $d(p_1,p_2) > 0$ although $d(p_1,P)$ and $d(p_2,P)$ are both zero. However, if we replace $p_1$ by a set $P$, then does the right side of the inequality work? We will figure the left side later.
    – астон вілла олоф мэллбэрг
    Nov 27 at 14:10
















0














Definition: The distance between two points $p_1, p_2 in mathbb{R}^n$ is
begin{equation}
d(p_1,p_2)=|| p_1-p_2 ||.
end{equation}

The distance between a point $pin mathbb{R}^n$ and a set $mathcal{C} subset mathbb{R}^n$ is
begin{equation}
d(p,mathcal{C}) = inf{||p-q|| : q in mathcal{C}}.
end{equation}



Given three points $p_i in mathbb{R}^n, i=1,2,3$. The triangle inequality tells us that
begin{equation}
|d(p_1,p_3) - d(p_3,p_2)| le d(p_1, p_2) le d(p_1, p_3) + d(p_3,p_2).
end{equation}



Now the problem is:



Is the triangle inequality still held if one point is replaced by a non-singleton set?










share|cite|improve this question
























  • Suppose part 3 held true. Do you see that you get parts 1 and 2 from here by taking some sets as singletons? Try to work therefore with three sets at first(I am not telling you if it's true or not, only that if it were true life is easier).
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:15












  • @астонвіллаолофмэллбэрг how about the edits? (non-singleton sets?)
    – winston
    Nov 27 at 13:22










  • You have edited the question. Is this how it will finally stand?
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:28










  • @астонвіллаолофмэллбэрг I try to simplify the problem first. I know that the right part of the inequality is not correct because if this set contains the two points, then $d(p_1,p_2) ge 0$ (assume that $p_3$ is replaced by a non-singleton set).
    – winston
    Nov 27 at 13:49












  • Correct. So, for example, if we take a set $P$ with at least two points, and $p_1 neq p_2$ in $P$, then $d(p_1,p_2) > 0$ although $d(p_1,P)$ and $d(p_2,P)$ are both zero. However, if we replace $p_1$ by a set $P$, then does the right side of the inequality work? We will figure the left side later.
    – астон вілла олоф мэллбэрг
    Nov 27 at 14:10














0












0








0







Definition: The distance between two points $p_1, p_2 in mathbb{R}^n$ is
begin{equation}
d(p_1,p_2)=|| p_1-p_2 ||.
end{equation}

The distance between a point $pin mathbb{R}^n$ and a set $mathcal{C} subset mathbb{R}^n$ is
begin{equation}
d(p,mathcal{C}) = inf{||p-q|| : q in mathcal{C}}.
end{equation}



Given three points $p_i in mathbb{R}^n, i=1,2,3$. The triangle inequality tells us that
begin{equation}
|d(p_1,p_3) - d(p_3,p_2)| le d(p_1, p_2) le d(p_1, p_3) + d(p_3,p_2).
end{equation}



Now the problem is:



Is the triangle inequality still held if one point is replaced by a non-singleton set?










share|cite|improve this question















Definition: The distance between two points $p_1, p_2 in mathbb{R}^n$ is
begin{equation}
d(p_1,p_2)=|| p_1-p_2 ||.
end{equation}

The distance between a point $pin mathbb{R}^n$ and a set $mathcal{C} subset mathbb{R}^n$ is
begin{equation}
d(p,mathcal{C}) = inf{||p-q|| : q in mathcal{C}}.
end{equation}



Given three points $p_i in mathbb{R}^n, i=1,2,3$. The triangle inequality tells us that
begin{equation}
|d(p_1,p_3) - d(p_3,p_2)| le d(p_1, p_2) le d(p_1, p_3) + d(p_3,p_2).
end{equation}



Now the problem is:



Is the triangle inequality still held if one point is replaced by a non-singleton set?







real-analysis inequality






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 27 at 13:22

























asked Nov 27 at 13:08









winston

507218




507218












  • Suppose part 3 held true. Do you see that you get parts 1 and 2 from here by taking some sets as singletons? Try to work therefore with three sets at first(I am not telling you if it's true or not, only that if it were true life is easier).
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:15












  • @астонвіллаолофмэллбэрг how about the edits? (non-singleton sets?)
    – winston
    Nov 27 at 13:22










  • You have edited the question. Is this how it will finally stand?
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:28










  • @астонвіллаолофмэллбэрг I try to simplify the problem first. I know that the right part of the inequality is not correct because if this set contains the two points, then $d(p_1,p_2) ge 0$ (assume that $p_3$ is replaced by a non-singleton set).
    – winston
    Nov 27 at 13:49












  • Correct. So, for example, if we take a set $P$ with at least two points, and $p_1 neq p_2$ in $P$, then $d(p_1,p_2) > 0$ although $d(p_1,P)$ and $d(p_2,P)$ are both zero. However, if we replace $p_1$ by a set $P$, then does the right side of the inequality work? We will figure the left side later.
    – астон вілла олоф мэллбэрг
    Nov 27 at 14:10


















  • Suppose part 3 held true. Do you see that you get parts 1 and 2 from here by taking some sets as singletons? Try to work therefore with three sets at first(I am not telling you if it's true or not, only that if it were true life is easier).
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:15












  • @астонвіллаолофмэллбэрг how about the edits? (non-singleton sets?)
    – winston
    Nov 27 at 13:22










  • You have edited the question. Is this how it will finally stand?
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:28










  • @астонвіллаолофмэллбэрг I try to simplify the problem first. I know that the right part of the inequality is not correct because if this set contains the two points, then $d(p_1,p_2) ge 0$ (assume that $p_3$ is replaced by a non-singleton set).
    – winston
    Nov 27 at 13:49












  • Correct. So, for example, if we take a set $P$ with at least two points, and $p_1 neq p_2$ in $P$, then $d(p_1,p_2) > 0$ although $d(p_1,P)$ and $d(p_2,P)$ are both zero. However, if we replace $p_1$ by a set $P$, then does the right side of the inequality work? We will figure the left side later.
    – астон вілла олоф мэллбэрг
    Nov 27 at 14:10
















Suppose part 3 held true. Do you see that you get parts 1 and 2 from here by taking some sets as singletons? Try to work therefore with three sets at first(I am not telling you if it's true or not, only that if it were true life is easier).
– астон вілла олоф мэллбэрг
Nov 27 at 13:15






Suppose part 3 held true. Do you see that you get parts 1 and 2 from here by taking some sets as singletons? Try to work therefore with three sets at first(I am not telling you if it's true or not, only that if it were true life is easier).
– астон вілла олоф мэллбэрг
Nov 27 at 13:15














@астонвіллаолофмэллбэрг how about the edits? (non-singleton sets?)
– winston
Nov 27 at 13:22




@астонвіллаолофмэллбэрг how about the edits? (non-singleton sets?)
– winston
Nov 27 at 13:22












You have edited the question. Is this how it will finally stand?
– астон вілла олоф мэллбэрг
Nov 27 at 13:28




You have edited the question. Is this how it will finally stand?
– астон вілла олоф мэллбэрг
Nov 27 at 13:28












@астонвіллаолофмэллбэрг I try to simplify the problem first. I know that the right part of the inequality is not correct because if this set contains the two points, then $d(p_1,p_2) ge 0$ (assume that $p_3$ is replaced by a non-singleton set).
– winston
Nov 27 at 13:49






@астонвіллаолофмэллбэрг I try to simplify the problem first. I know that the right part of the inequality is not correct because if this set contains the two points, then $d(p_1,p_2) ge 0$ (assume that $p_3$ is replaced by a non-singleton set).
– winston
Nov 27 at 13:49














Correct. So, for example, if we take a set $P$ with at least two points, and $p_1 neq p_2$ in $P$, then $d(p_1,p_2) > 0$ although $d(p_1,P)$ and $d(p_2,P)$ are both zero. However, if we replace $p_1$ by a set $P$, then does the right side of the inequality work? We will figure the left side later.
– астон вілла олоф мэллбэрг
Nov 27 at 14:10




Correct. So, for example, if we take a set $P$ with at least two points, and $p_1 neq p_2$ in $P$, then $d(p_1,p_2) > 0$ although $d(p_1,P)$ and $d(p_2,P)$ are both zero. However, if we replace $p_1$ by a set $P$, then does the right side of the inequality work? We will figure the left side later.
– астон вілла олоф мэллбэрг
Nov 27 at 14:10















active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015747%2fgeneralization-of-the-triangle-inequality-with-sets%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015747%2fgeneralization-of-the-triangle-inequality-with-sets%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Willebadessen

Ida-Boy-Ed-Garten

Residenzschloss Arolsen