Alternative proof. There is $f_0 in C([0,1], K)$ such that $ell(f_0) leq ell(f)quad forall f$

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite
2













Let $a,b in K$ where $K subset mathbbR^n$ is compact. Let $C$ the set of continuous paths $f: [0,1] to K$, rectifiable, with $f(0)=a$ and $f(1)=b$. If $C neq emptyset$ then there is $f_0 in C$ such that $ell(f_0) leq ell(f)$ for all $f in C$.




Notation. $ell(f)$ denotes the length of the path $f$.



I know a proof of this result using the Ascoli-Arzelá Theorem, but I'm trying to get a proof without using this theorem. Does anyone know (if any)?







share|cite|improve this question



















  • I suspect it might be difficult to avoid a compactness argument?
    – copper.hat
    Jul 31 at 4:59














up vote
1
down vote

favorite
2













Let $a,b in K$ where $K subset mathbbR^n$ is compact. Let $C$ the set of continuous paths $f: [0,1] to K$, rectifiable, with $f(0)=a$ and $f(1)=b$. If $C neq emptyset$ then there is $f_0 in C$ such that $ell(f_0) leq ell(f)$ for all $f in C$.




Notation. $ell(f)$ denotes the length of the path $f$.



I know a proof of this result using the Ascoli-Arzelá Theorem, but I'm trying to get a proof without using this theorem. Does anyone know (if any)?







share|cite|improve this question



















  • I suspect it might be difficult to avoid a compactness argument?
    – copper.hat
    Jul 31 at 4:59












up vote
1
down vote

favorite
2









up vote
1
down vote

favorite
2






2






Let $a,b in K$ where $K subset mathbbR^n$ is compact. Let $C$ the set of continuous paths $f: [0,1] to K$, rectifiable, with $f(0)=a$ and $f(1)=b$. If $C neq emptyset$ then there is $f_0 in C$ such that $ell(f_0) leq ell(f)$ for all $f in C$.




Notation. $ell(f)$ denotes the length of the path $f$.



I know a proof of this result using the Ascoli-Arzelá Theorem, but I'm trying to get a proof without using this theorem. Does anyone know (if any)?







share|cite|improve this question












Let $a,b in K$ where $K subset mathbbR^n$ is compact. Let $C$ the set of continuous paths $f: [0,1] to K$, rectifiable, with $f(0)=a$ and $f(1)=b$. If $C neq emptyset$ then there is $f_0 in C$ such that $ell(f_0) leq ell(f)$ for all $f in C$.




Notation. $ell(f)$ denotes the length of the path $f$.



I know a proof of this result using the Ascoli-Arzelá Theorem, but I'm trying to get a proof without using this theorem. Does anyone know (if any)?









share|cite|improve this question










share|cite|improve this question




share|cite|improve this question









asked Jul 31 at 3:34









Lucas Corrêa

1,075319




1,075319











  • I suspect it might be difficult to avoid a compactness argument?
    – copper.hat
    Jul 31 at 4:59
















  • I suspect it might be difficult to avoid a compactness argument?
    – copper.hat
    Jul 31 at 4:59















I suspect it might be difficult to avoid a compactness argument?
– copper.hat
Jul 31 at 4:59




I suspect it might be difficult to avoid a compactness argument?
– copper.hat
Jul 31 at 4:59















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',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
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%2f2867625%2falternative-proof-there-is-f-0-in-c0-1-k-such-that-ellf-0-leq%23new-answer', 'question_page');

);

Post as a guest



































active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes










 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2867625%2falternative-proof-there-is-f-0-in-c0-1-k-such-that-ellf-0-leq%23new-answer', 'question_page');

);

Post as a guest













































































Comments

Popular posts from this blog

What is the equation of a 3D cone with generalised tilt?

Color the edges and diagonals of a regular polygon

Relationship between determinant of matrix and determinant of adjoint?