minkowski distance at the infinity
$begingroup$
Given that the Minkowski distance between points $X = (x_1,dots,x_n)$ and $Y = (y_1,dots ,y_n)$ is
$$
d(X, Y)
= left(sum_{i=1}^n|x_i−y_i|^pright)^{1/p},
$$
I want to show that
$$
lim_{ptoinfty}d(X, Y) = max_{i=1, dots, n} |x_i-y_i|.
$$
How can I prove that as $p$ approaches infinity, the Minkowski distance approaches maximum difference of coordinates?
geometry limits norm normed-spaces
$endgroup$
add a comment |
$begingroup$
Given that the Minkowski distance between points $X = (x_1,dots,x_n)$ and $Y = (y_1,dots ,y_n)$ is
$$
d(X, Y)
= left(sum_{i=1}^n|x_i−y_i|^pright)^{1/p},
$$
I want to show that
$$
lim_{ptoinfty}d(X, Y) = max_{i=1, dots, n} |x_i-y_i|.
$$
How can I prove that as $p$ approaches infinity, the Minkowski distance approaches maximum difference of coordinates?
geometry limits norm normed-spaces
$endgroup$
add a comment |
$begingroup$
Given that the Minkowski distance between points $X = (x_1,dots,x_n)$ and $Y = (y_1,dots ,y_n)$ is
$$
d(X, Y)
= left(sum_{i=1}^n|x_i−y_i|^pright)^{1/p},
$$
I want to show that
$$
lim_{ptoinfty}d(X, Y) = max_{i=1, dots, n} |x_i-y_i|.
$$
How can I prove that as $p$ approaches infinity, the Minkowski distance approaches maximum difference of coordinates?
geometry limits norm normed-spaces
$endgroup$
Given that the Minkowski distance between points $X = (x_1,dots,x_n)$ and $Y = (y_1,dots ,y_n)$ is
$$
d(X, Y)
= left(sum_{i=1}^n|x_i−y_i|^pright)^{1/p},
$$
I want to show that
$$
lim_{ptoinfty}d(X, Y) = max_{i=1, dots, n} |x_i-y_i|.
$$
How can I prove that as $p$ approaches infinity, the Minkowski distance approaches maximum difference of coordinates?
geometry limits norm normed-spaces
geometry limits norm normed-spaces
edited Oct 29 '16 at 13:30
Andrew D. Hwang
53.3k449115
53.3k449115
asked Oct 29 '16 at 10:27
Muaa2404Muaa2404
4316
4316
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Fix $X, Y$ And assume that $$ |x_1-y_1|geq |x_i-y_i| ast$$ Then begin{align*}
|x_1-y_1|&leq d(X,Y) \&=|x_1-y_1| bigg(1+ sum_{i=2}^n
frac{|x_i-y_i|^p}{|x_1-y_1|^p} bigg)^frac{1}{p} \&leq |x_1-y_1|
n^frac{1}{p} end{align*}
Here second equality is followed from
$$sum_i |x_i-y_i|^p=|x_1-y_1|^p bigg{ 1+
sum_{i=2}^n |x_i-y_i|^p/|x_1-y_1|^pbigg} $$
And last inequality is followed from $ast$
And
$$lim_{prightarrow infty} n^frac{1}{p}=1$$
so that we complete the proof
$endgroup$
$begingroup$
Can you write your answer more clearly? I did not understand the last two line. Thank you very much.
$endgroup$
– Muaa2404
Oct 31 '16 at 20:21
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1990118%2fminkowski-distance-at-the-infinity%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Fix $X, Y$ And assume that $$ |x_1-y_1|geq |x_i-y_i| ast$$ Then begin{align*}
|x_1-y_1|&leq d(X,Y) \&=|x_1-y_1| bigg(1+ sum_{i=2}^n
frac{|x_i-y_i|^p}{|x_1-y_1|^p} bigg)^frac{1}{p} \&leq |x_1-y_1|
n^frac{1}{p} end{align*}
Here second equality is followed from
$$sum_i |x_i-y_i|^p=|x_1-y_1|^p bigg{ 1+
sum_{i=2}^n |x_i-y_i|^p/|x_1-y_1|^pbigg} $$
And last inequality is followed from $ast$
And
$$lim_{prightarrow infty} n^frac{1}{p}=1$$
so that we complete the proof
$endgroup$
$begingroup$
Can you write your answer more clearly? I did not understand the last two line. Thank you very much.
$endgroup$
– Muaa2404
Oct 31 '16 at 20:21
add a comment |
$begingroup$
Fix $X, Y$ And assume that $$ |x_1-y_1|geq |x_i-y_i| ast$$ Then begin{align*}
|x_1-y_1|&leq d(X,Y) \&=|x_1-y_1| bigg(1+ sum_{i=2}^n
frac{|x_i-y_i|^p}{|x_1-y_1|^p} bigg)^frac{1}{p} \&leq |x_1-y_1|
n^frac{1}{p} end{align*}
Here second equality is followed from
$$sum_i |x_i-y_i|^p=|x_1-y_1|^p bigg{ 1+
sum_{i=2}^n |x_i-y_i|^p/|x_1-y_1|^pbigg} $$
And last inequality is followed from $ast$
And
$$lim_{prightarrow infty} n^frac{1}{p}=1$$
so that we complete the proof
$endgroup$
$begingroup$
Can you write your answer more clearly? I did not understand the last two line. Thank you very much.
$endgroup$
– Muaa2404
Oct 31 '16 at 20:21
add a comment |
$begingroup$
Fix $X, Y$ And assume that $$ |x_1-y_1|geq |x_i-y_i| ast$$ Then begin{align*}
|x_1-y_1|&leq d(X,Y) \&=|x_1-y_1| bigg(1+ sum_{i=2}^n
frac{|x_i-y_i|^p}{|x_1-y_1|^p} bigg)^frac{1}{p} \&leq |x_1-y_1|
n^frac{1}{p} end{align*}
Here second equality is followed from
$$sum_i |x_i-y_i|^p=|x_1-y_1|^p bigg{ 1+
sum_{i=2}^n |x_i-y_i|^p/|x_1-y_1|^pbigg} $$
And last inequality is followed from $ast$
And
$$lim_{prightarrow infty} n^frac{1}{p}=1$$
so that we complete the proof
$endgroup$
Fix $X, Y$ And assume that $$ |x_1-y_1|geq |x_i-y_i| ast$$ Then begin{align*}
|x_1-y_1|&leq d(X,Y) \&=|x_1-y_1| bigg(1+ sum_{i=2}^n
frac{|x_i-y_i|^p}{|x_1-y_1|^p} bigg)^frac{1}{p} \&leq |x_1-y_1|
n^frac{1}{p} end{align*}
Here second equality is followed from
$$sum_i |x_i-y_i|^p=|x_1-y_1|^p bigg{ 1+
sum_{i=2}^n |x_i-y_i|^p/|x_1-y_1|^pbigg} $$
And last inequality is followed from $ast$
And
$$lim_{prightarrow infty} n^frac{1}{p}=1$$
so that we complete the proof
edited Oct 31 '16 at 20:51
answered Oct 31 '16 at 10:18
HK LeeHK Lee
14.1k52361
14.1k52361
$begingroup$
Can you write your answer more clearly? I did not understand the last two line. Thank you very much.
$endgroup$
– Muaa2404
Oct 31 '16 at 20:21
add a comment |
$begingroup$
Can you write your answer more clearly? I did not understand the last two line. Thank you very much.
$endgroup$
– Muaa2404
Oct 31 '16 at 20:21
$begingroup$
Can you write your answer more clearly? I did not understand the last two line. Thank you very much.
$endgroup$
– Muaa2404
Oct 31 '16 at 20:21
$begingroup$
Can you write your answer more clearly? I did not understand the last two line. Thank you very much.
$endgroup$
– Muaa2404
Oct 31 '16 at 20:21
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1990118%2fminkowski-distance-at-the-infinity%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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