Intrinsic distance is symmetric
$begingroup$
Define the intrinsic distance between points $p, qin M$ to be $rho(p,q)=inf (int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt})$ where $alpha$ is a curve segment on $M$ such that $alpha(t_0)=p$ and $alpha(t_1)=q$.
I need to show that $rho(p,q)=rho(q,p)$. Please help me finish this proof.
Define $A$ to be the set of curves $k$ such that $k(t_0)=p$ and $k(t_1)=q$. Let $h(s)=t_0+t_1-s$. Then $h(t_1)=t_0$ and $h(t_0)=t_1$. And we have, if $alpha=inf(L(A))$, that $$
int_{t_0}^{t_1}{lvertlvertalpha^prime{t}lvertlvert dt}=int_{t_1}^{t_0}{lvertlvertalpha^prime(h(s))lvertlvert dh(s)}=-int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert h^prime(s)ds}
$$
Because $t_0<t_1$ we have $h(s)$ to be monotonically decreasing and $h'(s)<0$ for any $sin [t_0,t_1]$. Hence, $-lvert h^prime(s)lvert=h^prime(s)$ and
$$
-int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert h^prime(s)ds} = int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert lvert h^prime(s)lvert ds = int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))h^prime(s)lvertlvert ds} = int_{t_0}^{t_1}{lvertlvert beta^prime(s) lvertlvert ds}}
$$
Where $beta(s)=(alphacirc h)(s)$. If $beta$ is not the curve with shortest arclength from $q$ to $p$ then we can convert this to some curve $gamma$ from $p$ to $q$ that has shorter arclength than $alpha$, which is a contradiction.
Is this even true? If so, is there a more elegant way? Do I need to do this much work?
differential-geometry
$endgroup$
add a comment |
$begingroup$
Define the intrinsic distance between points $p, qin M$ to be $rho(p,q)=inf (int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt})$ where $alpha$ is a curve segment on $M$ such that $alpha(t_0)=p$ and $alpha(t_1)=q$.
I need to show that $rho(p,q)=rho(q,p)$. Please help me finish this proof.
Define $A$ to be the set of curves $k$ such that $k(t_0)=p$ and $k(t_1)=q$. Let $h(s)=t_0+t_1-s$. Then $h(t_1)=t_0$ and $h(t_0)=t_1$. And we have, if $alpha=inf(L(A))$, that $$
int_{t_0}^{t_1}{lvertlvertalpha^prime{t}lvertlvert dt}=int_{t_1}^{t_0}{lvertlvertalpha^prime(h(s))lvertlvert dh(s)}=-int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert h^prime(s)ds}
$$
Because $t_0<t_1$ we have $h(s)$ to be monotonically decreasing and $h'(s)<0$ for any $sin [t_0,t_1]$. Hence, $-lvert h^prime(s)lvert=h^prime(s)$ and
$$
-int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert h^prime(s)ds} = int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert lvert h^prime(s)lvert ds = int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))h^prime(s)lvertlvert ds} = int_{t_0}^{t_1}{lvertlvert beta^prime(s) lvertlvert ds}}
$$
Where $beta(s)=(alphacirc h)(s)$. If $beta$ is not the curve with shortest arclength from $q$ to $p$ then we can convert this to some curve $gamma$ from $p$ to $q$ that has shorter arclength than $alpha$, which is a contradiction.
Is this even true? If so, is there a more elegant way? Do I need to do this much work?
differential-geometry
$endgroup$
add a comment |
$begingroup$
Define the intrinsic distance between points $p, qin M$ to be $rho(p,q)=inf (int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt})$ where $alpha$ is a curve segment on $M$ such that $alpha(t_0)=p$ and $alpha(t_1)=q$.
I need to show that $rho(p,q)=rho(q,p)$. Please help me finish this proof.
Define $A$ to be the set of curves $k$ such that $k(t_0)=p$ and $k(t_1)=q$. Let $h(s)=t_0+t_1-s$. Then $h(t_1)=t_0$ and $h(t_0)=t_1$. And we have, if $alpha=inf(L(A))$, that $$
int_{t_0}^{t_1}{lvertlvertalpha^prime{t}lvertlvert dt}=int_{t_1}^{t_0}{lvertlvertalpha^prime(h(s))lvertlvert dh(s)}=-int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert h^prime(s)ds}
$$
Because $t_0<t_1$ we have $h(s)$ to be monotonically decreasing and $h'(s)<0$ for any $sin [t_0,t_1]$. Hence, $-lvert h^prime(s)lvert=h^prime(s)$ and
$$
-int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert h^prime(s)ds} = int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert lvert h^prime(s)lvert ds = int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))h^prime(s)lvertlvert ds} = int_{t_0}^{t_1}{lvertlvert beta^prime(s) lvertlvert ds}}
$$
Where $beta(s)=(alphacirc h)(s)$. If $beta$ is not the curve with shortest arclength from $q$ to $p$ then we can convert this to some curve $gamma$ from $p$ to $q$ that has shorter arclength than $alpha$, which is a contradiction.
Is this even true? If so, is there a more elegant way? Do I need to do this much work?
differential-geometry
$endgroup$
Define the intrinsic distance between points $p, qin M$ to be $rho(p,q)=inf (int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt})$ where $alpha$ is a curve segment on $M$ such that $alpha(t_0)=p$ and $alpha(t_1)=q$.
I need to show that $rho(p,q)=rho(q,p)$. Please help me finish this proof.
Define $A$ to be the set of curves $k$ such that $k(t_0)=p$ and $k(t_1)=q$. Let $h(s)=t_0+t_1-s$. Then $h(t_1)=t_0$ and $h(t_0)=t_1$. And we have, if $alpha=inf(L(A))$, that $$
int_{t_0}^{t_1}{lvertlvertalpha^prime{t}lvertlvert dt}=int_{t_1}^{t_0}{lvertlvertalpha^prime(h(s))lvertlvert dh(s)}=-int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert h^prime(s)ds}
$$
Because $t_0<t_1$ we have $h(s)$ to be monotonically decreasing and $h'(s)<0$ for any $sin [t_0,t_1]$. Hence, $-lvert h^prime(s)lvert=h^prime(s)$ and
$$
-int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert h^prime(s)ds} = int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))lvertlvert lvert h^prime(s)lvert ds = int_{t_0}^{t_1}{lvertlvertalpha^prime(h(s))h^prime(s)lvertlvert ds} = int_{t_0}^{t_1}{lvertlvert beta^prime(s) lvertlvert ds}}
$$
Where $beta(s)=(alphacirc h)(s)$. If $beta$ is not the curve with shortest arclength from $q$ to $p$ then we can convert this to some curve $gamma$ from $p$ to $q$ that has shorter arclength than $alpha$, which is a contradiction.
Is this even true? If so, is there a more elegant way? Do I need to do this much work?
differential-geometry
differential-geometry
asked Dec 2 '18 at 10:56
ColebasaurColebasaur
577
577
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
You have already shown $$int_{t_0}^{t_1}{lVertalpha^prime(t)rVert dt}=int_{t_0}^{t_1}{lVertbeta^prime(t)rVert dt}$$ for a certain curve $beta$ from $q$ to $p$. This is already enough. Here is why:
You are trying the show the infimums of the two sets $left{int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt}:alpha(t_0)=p,alpha(t_1)=qright}$ and $left{int_{t_0}^{t_1}{lvertlvertgamma^{prime}(t)lvertlvert dt}:gamma(t_0)=q,gamma(t_1)=pright}$ are equal. Your proof already tells you that $$left{int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt}:alpha(t_0)=p,alpha(t_1)=qright}subseteqleft{int_{t_0}^{t_1}{lvertlvertgamma^{prime}(t)lvertlvert dt}:gamma(t_0)=q,gamma(t_1)=pright}.$$ The same proof applies to tell you that the reverse inclusion is also true. So the two sets are equal, and so the infimum must be equal.
$endgroup$
add a comment |
$begingroup$
More elegant way: take any curve segment $alpha$ as in your first line. Define $bar{alpha}(t) = alpha(t_1+t_0-t)$. Then $bar{alpha}$ is also a curve segment on $M$, and further, $bar{alpha}(t_0) = q$, and $bar{alpha}(t_1) = p$. Then, clearly
$$int_{t_0}^{t_1}|bar{alpha}'(t)|dt = int_{t_0}^{t_1}|frac{d}{dt}alpha(t_1+t_0-t)|dt = int_{t_1}^{t_0}-|alpha'(t)|dt = int_{t_0}^{t_1}|alpha'(t)|dt leq rho(p,q).$$
But this holds for any $alpha$, so we have $rho(q,p)leqrho(p,q)$. But this is symmetric in $p$ and $q$, so the exact same argument gives that $rho(p,q)leqrho(q,p)$, so indeed, $rho(p,q) = rho(q,p)$.
$endgroup$
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%2f3022488%2fintrinsic-distance-is-symmetric%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You have already shown $$int_{t_0}^{t_1}{lVertalpha^prime(t)rVert dt}=int_{t_0}^{t_1}{lVertbeta^prime(t)rVert dt}$$ for a certain curve $beta$ from $q$ to $p$. This is already enough. Here is why:
You are trying the show the infimums of the two sets $left{int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt}:alpha(t_0)=p,alpha(t_1)=qright}$ and $left{int_{t_0}^{t_1}{lvertlvertgamma^{prime}(t)lvertlvert dt}:gamma(t_0)=q,gamma(t_1)=pright}$ are equal. Your proof already tells you that $$left{int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt}:alpha(t_0)=p,alpha(t_1)=qright}subseteqleft{int_{t_0}^{t_1}{lvertlvertgamma^{prime}(t)lvertlvert dt}:gamma(t_0)=q,gamma(t_1)=pright}.$$ The same proof applies to tell you that the reverse inclusion is also true. So the two sets are equal, and so the infimum must be equal.
$endgroup$
add a comment |
$begingroup$
You have already shown $$int_{t_0}^{t_1}{lVertalpha^prime(t)rVert dt}=int_{t_0}^{t_1}{lVertbeta^prime(t)rVert dt}$$ for a certain curve $beta$ from $q$ to $p$. This is already enough. Here is why:
You are trying the show the infimums of the two sets $left{int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt}:alpha(t_0)=p,alpha(t_1)=qright}$ and $left{int_{t_0}^{t_1}{lvertlvertgamma^{prime}(t)lvertlvert dt}:gamma(t_0)=q,gamma(t_1)=pright}$ are equal. Your proof already tells you that $$left{int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt}:alpha(t_0)=p,alpha(t_1)=qright}subseteqleft{int_{t_0}^{t_1}{lvertlvertgamma^{prime}(t)lvertlvert dt}:gamma(t_0)=q,gamma(t_1)=pright}.$$ The same proof applies to tell you that the reverse inclusion is also true. So the two sets are equal, and so the infimum must be equal.
$endgroup$
add a comment |
$begingroup$
You have already shown $$int_{t_0}^{t_1}{lVertalpha^prime(t)rVert dt}=int_{t_0}^{t_1}{lVertbeta^prime(t)rVert dt}$$ for a certain curve $beta$ from $q$ to $p$. This is already enough. Here is why:
You are trying the show the infimums of the two sets $left{int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt}:alpha(t_0)=p,alpha(t_1)=qright}$ and $left{int_{t_0}^{t_1}{lvertlvertgamma^{prime}(t)lvertlvert dt}:gamma(t_0)=q,gamma(t_1)=pright}$ are equal. Your proof already tells you that $$left{int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt}:alpha(t_0)=p,alpha(t_1)=qright}subseteqleft{int_{t_0}^{t_1}{lvertlvertgamma^{prime}(t)lvertlvert dt}:gamma(t_0)=q,gamma(t_1)=pright}.$$ The same proof applies to tell you that the reverse inclusion is also true. So the two sets are equal, and so the infimum must be equal.
$endgroup$
You have already shown $$int_{t_0}^{t_1}{lVertalpha^prime(t)rVert dt}=int_{t_0}^{t_1}{lVertbeta^prime(t)rVert dt}$$ for a certain curve $beta$ from $q$ to $p$. This is already enough. Here is why:
You are trying the show the infimums of the two sets $left{int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt}:alpha(t_0)=p,alpha(t_1)=qright}$ and $left{int_{t_0}^{t_1}{lvertlvertgamma^{prime}(t)lvertlvert dt}:gamma(t_0)=q,gamma(t_1)=pright}$ are equal. Your proof already tells you that $$left{int_{t_0}^{t_1}{lvertlvertalpha^{prime}(t)lvertlvert dt}:alpha(t_0)=p,alpha(t_1)=qright}subseteqleft{int_{t_0}^{t_1}{lvertlvertgamma^{prime}(t)lvertlvert dt}:gamma(t_0)=q,gamma(t_1)=pright}.$$ The same proof applies to tell you that the reverse inclusion is also true. So the two sets are equal, and so the infimum must be equal.
answered Dec 2 '18 at 11:10
edmedm
3,6231425
3,6231425
add a comment |
add a comment |
$begingroup$
More elegant way: take any curve segment $alpha$ as in your first line. Define $bar{alpha}(t) = alpha(t_1+t_0-t)$. Then $bar{alpha}$ is also a curve segment on $M$, and further, $bar{alpha}(t_0) = q$, and $bar{alpha}(t_1) = p$. Then, clearly
$$int_{t_0}^{t_1}|bar{alpha}'(t)|dt = int_{t_0}^{t_1}|frac{d}{dt}alpha(t_1+t_0-t)|dt = int_{t_1}^{t_0}-|alpha'(t)|dt = int_{t_0}^{t_1}|alpha'(t)|dt leq rho(p,q).$$
But this holds for any $alpha$, so we have $rho(q,p)leqrho(p,q)$. But this is symmetric in $p$ and $q$, so the exact same argument gives that $rho(p,q)leqrho(q,p)$, so indeed, $rho(p,q) = rho(q,p)$.
$endgroup$
add a comment |
$begingroup$
More elegant way: take any curve segment $alpha$ as in your first line. Define $bar{alpha}(t) = alpha(t_1+t_0-t)$. Then $bar{alpha}$ is also a curve segment on $M$, and further, $bar{alpha}(t_0) = q$, and $bar{alpha}(t_1) = p$. Then, clearly
$$int_{t_0}^{t_1}|bar{alpha}'(t)|dt = int_{t_0}^{t_1}|frac{d}{dt}alpha(t_1+t_0-t)|dt = int_{t_1}^{t_0}-|alpha'(t)|dt = int_{t_0}^{t_1}|alpha'(t)|dt leq rho(p,q).$$
But this holds for any $alpha$, so we have $rho(q,p)leqrho(p,q)$. But this is symmetric in $p$ and $q$, so the exact same argument gives that $rho(p,q)leqrho(q,p)$, so indeed, $rho(p,q) = rho(q,p)$.
$endgroup$
add a comment |
$begingroup$
More elegant way: take any curve segment $alpha$ as in your first line. Define $bar{alpha}(t) = alpha(t_1+t_0-t)$. Then $bar{alpha}$ is also a curve segment on $M$, and further, $bar{alpha}(t_0) = q$, and $bar{alpha}(t_1) = p$. Then, clearly
$$int_{t_0}^{t_1}|bar{alpha}'(t)|dt = int_{t_0}^{t_1}|frac{d}{dt}alpha(t_1+t_0-t)|dt = int_{t_1}^{t_0}-|alpha'(t)|dt = int_{t_0}^{t_1}|alpha'(t)|dt leq rho(p,q).$$
But this holds for any $alpha$, so we have $rho(q,p)leqrho(p,q)$. But this is symmetric in $p$ and $q$, so the exact same argument gives that $rho(p,q)leqrho(q,p)$, so indeed, $rho(p,q) = rho(q,p)$.
$endgroup$
More elegant way: take any curve segment $alpha$ as in your first line. Define $bar{alpha}(t) = alpha(t_1+t_0-t)$. Then $bar{alpha}$ is also a curve segment on $M$, and further, $bar{alpha}(t_0) = q$, and $bar{alpha}(t_1) = p$. Then, clearly
$$int_{t_0}^{t_1}|bar{alpha}'(t)|dt = int_{t_0}^{t_1}|frac{d}{dt}alpha(t_1+t_0-t)|dt = int_{t_1}^{t_0}-|alpha'(t)|dt = int_{t_0}^{t_1}|alpha'(t)|dt leq rho(p,q).$$
But this holds for any $alpha$, so we have $rho(q,p)leqrho(p,q)$. But this is symmetric in $p$ and $q$, so the exact same argument gives that $rho(p,q)leqrho(q,p)$, so indeed, $rho(p,q) = rho(q,p)$.
answered Dec 2 '18 at 11:05
user3482749user3482749
4,266919
4,266919
add a comment |
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%2f3022488%2fintrinsic-distance-is-symmetric%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