Hint or help on this metric spaces problem? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)continuous map of metric spaces and compactnessIs this product countably compact?Demonstrate that the following metric space is not compactA metric space is complete if for some $epsilon gt 0$, every $epsilon$-ball in $X$ has compact closure.Prove that a metric space is sequentially compact iff every infinite subset has a cluster pointWhat is a cluster point of this sequence?Equivalence between properties of compactness for metric spacesIn a metric space $X$, a subset $S subset X$ is relatively sequentially compact if and only if its closure $overlineS$ is sequentially compact.A subset of a metric space is closed iff it contains all of its cluster points.Show that a metric space $(X,d)$ is totally bounded if and only if the completion of $(X,d)$ is compact.

When a candle burns, why does the top of wick glow if bottom of flame is hottest?

Can a USB port passively 'listen only'?

Using audio cues to encourage good posture

English words in a non-english sci-fi novel

What does the "x" in "x86" represent?

What is the logic behind the Maharil's explanation of why we don't say שעשה ניסים on Pesach?

How to find out what spells would be useless to a blind NPC spellcaster?

Identifying polygons that intersect with another layer using QGIS?

Why do we bend a book to keep it straight?

Why aren't air breathing engines used as small first stages

What is a non-alternating simple group with big order, but relatively few conjugacy classes?

How come Sam didn't become Lord of Horn Hill?

What are the pros and cons of Aerospike nosecones?

Apollo command module space walk?

Error "illegal generic type for instanceof" when using local classes

How do I stop a creek from eroding my steep embankment?

What causes the vertical darker bands in my photo?

3 doors, three guards, one stone

How to deal with a team lead who never gives me credit?

ListPlot join points by nearest neighbor rather than order

Echoing a tail command produces unexpected output?

Why did the rest of the Eastern Bloc not invade Yugoslavia?

How discoverable are IPv6 addresses and AAAA names by potential attackers?

Output the ŋarâþ crîþ alphabet song without using (m)any letters



Hint or help on this metric spaces problem?



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)continuous map of metric spaces and compactnessIs this product countably compact?Demonstrate that the following metric space is not compactA metric space is complete if for some $epsilon gt 0$, every $epsilon$-ball in $X$ has compact closure.Prove that a metric space is sequentially compact iff every infinite subset has a cluster pointWhat is a cluster point of this sequence?Equivalence between properties of compactness for metric spacesIn a metric space $X$, a subset $S subset X$ is relatively sequentially compact if and only if its closure $overlineS$ is sequentially compact.A subset of a metric space is closed iff it contains all of its cluster points.Show that a metric space $(X,d)$ is totally bounded if and only if the completion of $(X,d)$ is compact.










0












$begingroup$


Let $(X,d)$ be a sequentially compact metric space. Let $F$ map $X$ into $X$, with the property $d(F(x),F(y)) geq d(x,y)$ for all $x$ and $y$ in $X$.



Show that every point $z$ in $X$ is a cluster point (i.e, in the closure) of the set $F^n (z) : n = 1,2,...$



I'm just not entirely sure how to use the fact that the distance of the images is at least the distance of the preimage.



What I have so far:



Let $epsilon > 0$. Consider an open ball around $zin X$, with radius epsilon; call it $B(z;epsilon)$. Then since $X$ is sequentially compact we may form a converging subsequence from any sequence in $X$. Hence, $(forall epsilon >0) (exists K in mathbbN)$ so that $z_n_k in B(z;epsilon) forall k>K$



The idea here is to try to show that the intersection of this ball and the above set is nonempty, hence showing that $z$ is in its closure.



Is this the wrong way to start? Am I missing something? Again, it isn't too clear to me how I'm to bring in the other assumption.










share|cite|improve this question











$endgroup$











  • $begingroup$
    What is $z_n$?...
    $endgroup$
    – amsmath
    Mar 26 at 17:54










  • $begingroup$
    It is an arbitrary sequence in $X$. Since $X$ is sequentially compact, every sequence has a converging subsequence.
    $endgroup$
    – Ryan Goulden
    Mar 26 at 17:55










  • $begingroup$
    Why should it help to consider an arbitrary sequence? You will have to look at the sequence $(F^n(z))$ and then $d(z,F^n(z))$.
    $endgroup$
    – amsmath
    Mar 26 at 17:57















0












$begingroup$


Let $(X,d)$ be a sequentially compact metric space. Let $F$ map $X$ into $X$, with the property $d(F(x),F(y)) geq d(x,y)$ for all $x$ and $y$ in $X$.



Show that every point $z$ in $X$ is a cluster point (i.e, in the closure) of the set $F^n (z) : n = 1,2,...$



I'm just not entirely sure how to use the fact that the distance of the images is at least the distance of the preimage.



What I have so far:



Let $epsilon > 0$. Consider an open ball around $zin X$, with radius epsilon; call it $B(z;epsilon)$. Then since $X$ is sequentially compact we may form a converging subsequence from any sequence in $X$. Hence, $(forall epsilon >0) (exists K in mathbbN)$ so that $z_n_k in B(z;epsilon) forall k>K$



The idea here is to try to show that the intersection of this ball and the above set is nonempty, hence showing that $z$ is in its closure.



Is this the wrong way to start? Am I missing something? Again, it isn't too clear to me how I'm to bring in the other assumption.










share|cite|improve this question











$endgroup$











  • $begingroup$
    What is $z_n$?...
    $endgroup$
    – amsmath
    Mar 26 at 17:54










  • $begingroup$
    It is an arbitrary sequence in $X$. Since $X$ is sequentially compact, every sequence has a converging subsequence.
    $endgroup$
    – Ryan Goulden
    Mar 26 at 17:55










  • $begingroup$
    Why should it help to consider an arbitrary sequence? You will have to look at the sequence $(F^n(z))$ and then $d(z,F^n(z))$.
    $endgroup$
    – amsmath
    Mar 26 at 17:57













0












0








0





$begingroup$


Let $(X,d)$ be a sequentially compact metric space. Let $F$ map $X$ into $X$, with the property $d(F(x),F(y)) geq d(x,y)$ for all $x$ and $y$ in $X$.



Show that every point $z$ in $X$ is a cluster point (i.e, in the closure) of the set $F^n (z) : n = 1,2,...$



I'm just not entirely sure how to use the fact that the distance of the images is at least the distance of the preimage.



What I have so far:



Let $epsilon > 0$. Consider an open ball around $zin X$, with radius epsilon; call it $B(z;epsilon)$. Then since $X$ is sequentially compact we may form a converging subsequence from any sequence in $X$. Hence, $(forall epsilon >0) (exists K in mathbbN)$ so that $z_n_k in B(z;epsilon) forall k>K$



The idea here is to try to show that the intersection of this ball and the above set is nonempty, hence showing that $z$ is in its closure.



Is this the wrong way to start? Am I missing something? Again, it isn't too clear to me how I'm to bring in the other assumption.










share|cite|improve this question











$endgroup$




Let $(X,d)$ be a sequentially compact metric space. Let $F$ map $X$ into $X$, with the property $d(F(x),F(y)) geq d(x,y)$ for all $x$ and $y$ in $X$.



Show that every point $z$ in $X$ is a cluster point (i.e, in the closure) of the set $F^n (z) : n = 1,2,...$



I'm just not entirely sure how to use the fact that the distance of the images is at least the distance of the preimage.



What I have so far:



Let $epsilon > 0$. Consider an open ball around $zin X$, with radius epsilon; call it $B(z;epsilon)$. Then since $X$ is sequentially compact we may form a converging subsequence from any sequence in $X$. Hence, $(forall epsilon >0) (exists K in mathbbN)$ so that $z_n_k in B(z;epsilon) forall k>K$



The idea here is to try to show that the intersection of this ball and the above set is nonempty, hence showing that $z$ is in its closure.



Is this the wrong way to start? Am I missing something? Again, it isn't too clear to me how I'm to bring in the other assumption.







real-analysis general-topology metric-spaces






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 26 at 17:55







Ryan Goulden

















asked Mar 26 at 17:40









Ryan GouldenRyan Goulden

489310




489310











  • $begingroup$
    What is $z_n$?...
    $endgroup$
    – amsmath
    Mar 26 at 17:54










  • $begingroup$
    It is an arbitrary sequence in $X$. Since $X$ is sequentially compact, every sequence has a converging subsequence.
    $endgroup$
    – Ryan Goulden
    Mar 26 at 17:55










  • $begingroup$
    Why should it help to consider an arbitrary sequence? You will have to look at the sequence $(F^n(z))$ and then $d(z,F^n(z))$.
    $endgroup$
    – amsmath
    Mar 26 at 17:57
















  • $begingroup$
    What is $z_n$?...
    $endgroup$
    – amsmath
    Mar 26 at 17:54










  • $begingroup$
    It is an arbitrary sequence in $X$. Since $X$ is sequentially compact, every sequence has a converging subsequence.
    $endgroup$
    – Ryan Goulden
    Mar 26 at 17:55










  • $begingroup$
    Why should it help to consider an arbitrary sequence? You will have to look at the sequence $(F^n(z))$ and then $d(z,F^n(z))$.
    $endgroup$
    – amsmath
    Mar 26 at 17:57















$begingroup$
What is $z_n$?...
$endgroup$
– amsmath
Mar 26 at 17:54




$begingroup$
What is $z_n$?...
$endgroup$
– amsmath
Mar 26 at 17:54












$begingroup$
It is an arbitrary sequence in $X$. Since $X$ is sequentially compact, every sequence has a converging subsequence.
$endgroup$
– Ryan Goulden
Mar 26 at 17:55




$begingroup$
It is an arbitrary sequence in $X$. Since $X$ is sequentially compact, every sequence has a converging subsequence.
$endgroup$
– Ryan Goulden
Mar 26 at 17:55












$begingroup$
Why should it help to consider an arbitrary sequence? You will have to look at the sequence $(F^n(z))$ and then $d(z,F^n(z))$.
$endgroup$
– amsmath
Mar 26 at 17:57




$begingroup$
Why should it help to consider an arbitrary sequence? You will have to look at the sequence $(F^n(z))$ and then $d(z,F^n(z))$.
$endgroup$
– amsmath
Mar 26 at 17:57










2 Answers
2






active

oldest

votes


















0












$begingroup$

I will take the 'in the closure' as your definition of 'cluster point' since, for example, for $X$ the closed unit disc with $F$ a rotation, say of angle $pi$, satisfies $d(F(x),F(y))=d(x,y)$, but then $F^n(0)=0$ doesn't accumulate at $0$ in the sense of every neighborhood having elements of $F^n(0)$ different from $0$.



If there is $n>0$ such that $F^n(z)=z$ we are done since the its orbit is finite and therefore closed, and it contains $z$.



Let's assume for the rest that $f^n(z)neq z$ for $n>0$.



It can't happen that the orbit is eventually periodic. If it were so, assume that $m>ngeq 1$ are smallest such that $f^m(z)=f^n(z)$, then $0=d(f^m(z),f^n(z))geq d(f^m-n(z),z)>0$ is a contradiction.



So, we can assume that $F^n(z)$ is infinite. Since $X$ is compact this sequence has a convergent subsequence $F^n_k(z)to ain X$.



Take $epsilon >0$, then there is $K$ such that for $k>K$ we have $epsilon>d(F^n_k+1(z),F^n_k(z))geq d(F^n_k+1-n_k(z),z)$. Therefore $F^n_k+1-n_k(z)$ is inside the ball with center $z$ and radius $epsilon$.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Thanks for the response! I considered looking at sequences of $F^n$ but I guess my confusion was that any subsequence doesn't seem to be meaningfully different from the first. Since $n$ is just a sequence of increasing naturals, then how can $n_k$ be any different?
    $endgroup$
    – Ryan Goulden
    Mar 26 at 18:13










  • $begingroup$
    Well, $(F^n_k(z))_k$ converges while $(F^n(z))_n$ does not in general.
    $endgroup$
    – amsmath
    Mar 26 at 18:17










  • $begingroup$
    @RyanGoulden Double check the statement, because for what is usually called 'cluster point' the statement is false.
    $endgroup$
    – user647486
    Mar 26 at 18:20










  • $begingroup$
    @amsmath right, that would follow from what it means to be sequentially compact. I guess what I'm saying is that I don't really see how that's possible. How can it be that $F^n$ doesn't converge while $F^n_k$ does?
    $endgroup$
    – Ryan Goulden
    Mar 26 at 18:20










  • $begingroup$
    @user647486 I'm using "cluster point" to refer to points in the closure of a set, where the closure of a set $A$ is the union of $A$ with its accumulation points.
    $endgroup$
    – Ryan Goulden
    Mar 26 at 18:21


















0












$begingroup$

There exists a subsequence $(F^n_k(z))_k$ which is a Cauchy sequence. Thus, for $varepsilon > 0$ there exists $K$ such that for $kgeellge K$ we have $d(F^n_k(z),F^n_ell(z)) < varepsilon$. Hence, by induction, $d(F^n_k-n_ell(z),z) < varepsilon$. Since this holds for any $varepsilon > 0$, that's it.






share|cite|improve this answer









$endgroup$













    Your Answer








    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%2f3163515%2fhint-or-help-on-this-metric-spaces-problem%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









    0












    $begingroup$

    I will take the 'in the closure' as your definition of 'cluster point' since, for example, for $X$ the closed unit disc with $F$ a rotation, say of angle $pi$, satisfies $d(F(x),F(y))=d(x,y)$, but then $F^n(0)=0$ doesn't accumulate at $0$ in the sense of every neighborhood having elements of $F^n(0)$ different from $0$.



    If there is $n>0$ such that $F^n(z)=z$ we are done since the its orbit is finite and therefore closed, and it contains $z$.



    Let's assume for the rest that $f^n(z)neq z$ for $n>0$.



    It can't happen that the orbit is eventually periodic. If it were so, assume that $m>ngeq 1$ are smallest such that $f^m(z)=f^n(z)$, then $0=d(f^m(z),f^n(z))geq d(f^m-n(z),z)>0$ is a contradiction.



    So, we can assume that $F^n(z)$ is infinite. Since $X$ is compact this sequence has a convergent subsequence $F^n_k(z)to ain X$.



    Take $epsilon >0$, then there is $K$ such that for $k>K$ we have $epsilon>d(F^n_k+1(z),F^n_k(z))geq d(F^n_k+1-n_k(z),z)$. Therefore $F^n_k+1-n_k(z)$ is inside the ball with center $z$ and radius $epsilon$.






    share|cite|improve this answer









    $endgroup$












    • $begingroup$
      Thanks for the response! I considered looking at sequences of $F^n$ but I guess my confusion was that any subsequence doesn't seem to be meaningfully different from the first. Since $n$ is just a sequence of increasing naturals, then how can $n_k$ be any different?
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:13










    • $begingroup$
      Well, $(F^n_k(z))_k$ converges while $(F^n(z))_n$ does not in general.
      $endgroup$
      – amsmath
      Mar 26 at 18:17










    • $begingroup$
      @RyanGoulden Double check the statement, because for what is usually called 'cluster point' the statement is false.
      $endgroup$
      – user647486
      Mar 26 at 18:20










    • $begingroup$
      @amsmath right, that would follow from what it means to be sequentially compact. I guess what I'm saying is that I don't really see how that's possible. How can it be that $F^n$ doesn't converge while $F^n_k$ does?
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:20










    • $begingroup$
      @user647486 I'm using "cluster point" to refer to points in the closure of a set, where the closure of a set $A$ is the union of $A$ with its accumulation points.
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:21















    0












    $begingroup$

    I will take the 'in the closure' as your definition of 'cluster point' since, for example, for $X$ the closed unit disc with $F$ a rotation, say of angle $pi$, satisfies $d(F(x),F(y))=d(x,y)$, but then $F^n(0)=0$ doesn't accumulate at $0$ in the sense of every neighborhood having elements of $F^n(0)$ different from $0$.



    If there is $n>0$ such that $F^n(z)=z$ we are done since the its orbit is finite and therefore closed, and it contains $z$.



    Let's assume for the rest that $f^n(z)neq z$ for $n>0$.



    It can't happen that the orbit is eventually periodic. If it were so, assume that $m>ngeq 1$ are smallest such that $f^m(z)=f^n(z)$, then $0=d(f^m(z),f^n(z))geq d(f^m-n(z),z)>0$ is a contradiction.



    So, we can assume that $F^n(z)$ is infinite. Since $X$ is compact this sequence has a convergent subsequence $F^n_k(z)to ain X$.



    Take $epsilon >0$, then there is $K$ such that for $k>K$ we have $epsilon>d(F^n_k+1(z),F^n_k(z))geq d(F^n_k+1-n_k(z),z)$. Therefore $F^n_k+1-n_k(z)$ is inside the ball with center $z$ and radius $epsilon$.






    share|cite|improve this answer









    $endgroup$












    • $begingroup$
      Thanks for the response! I considered looking at sequences of $F^n$ but I guess my confusion was that any subsequence doesn't seem to be meaningfully different from the first. Since $n$ is just a sequence of increasing naturals, then how can $n_k$ be any different?
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:13










    • $begingroup$
      Well, $(F^n_k(z))_k$ converges while $(F^n(z))_n$ does not in general.
      $endgroup$
      – amsmath
      Mar 26 at 18:17










    • $begingroup$
      @RyanGoulden Double check the statement, because for what is usually called 'cluster point' the statement is false.
      $endgroup$
      – user647486
      Mar 26 at 18:20










    • $begingroup$
      @amsmath right, that would follow from what it means to be sequentially compact. I guess what I'm saying is that I don't really see how that's possible. How can it be that $F^n$ doesn't converge while $F^n_k$ does?
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:20










    • $begingroup$
      @user647486 I'm using "cluster point" to refer to points in the closure of a set, where the closure of a set $A$ is the union of $A$ with its accumulation points.
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:21













    0












    0








    0





    $begingroup$

    I will take the 'in the closure' as your definition of 'cluster point' since, for example, for $X$ the closed unit disc with $F$ a rotation, say of angle $pi$, satisfies $d(F(x),F(y))=d(x,y)$, but then $F^n(0)=0$ doesn't accumulate at $0$ in the sense of every neighborhood having elements of $F^n(0)$ different from $0$.



    If there is $n>0$ such that $F^n(z)=z$ we are done since the its orbit is finite and therefore closed, and it contains $z$.



    Let's assume for the rest that $f^n(z)neq z$ for $n>0$.



    It can't happen that the orbit is eventually periodic. If it were so, assume that $m>ngeq 1$ are smallest such that $f^m(z)=f^n(z)$, then $0=d(f^m(z),f^n(z))geq d(f^m-n(z),z)>0$ is a contradiction.



    So, we can assume that $F^n(z)$ is infinite. Since $X$ is compact this sequence has a convergent subsequence $F^n_k(z)to ain X$.



    Take $epsilon >0$, then there is $K$ such that for $k>K$ we have $epsilon>d(F^n_k+1(z),F^n_k(z))geq d(F^n_k+1-n_k(z),z)$. Therefore $F^n_k+1-n_k(z)$ is inside the ball with center $z$ and radius $epsilon$.






    share|cite|improve this answer









    $endgroup$



    I will take the 'in the closure' as your definition of 'cluster point' since, for example, for $X$ the closed unit disc with $F$ a rotation, say of angle $pi$, satisfies $d(F(x),F(y))=d(x,y)$, but then $F^n(0)=0$ doesn't accumulate at $0$ in the sense of every neighborhood having elements of $F^n(0)$ different from $0$.



    If there is $n>0$ such that $F^n(z)=z$ we are done since the its orbit is finite and therefore closed, and it contains $z$.



    Let's assume for the rest that $f^n(z)neq z$ for $n>0$.



    It can't happen that the orbit is eventually periodic. If it were so, assume that $m>ngeq 1$ are smallest such that $f^m(z)=f^n(z)$, then $0=d(f^m(z),f^n(z))geq d(f^m-n(z),z)>0$ is a contradiction.



    So, we can assume that $F^n(z)$ is infinite. Since $X$ is compact this sequence has a convergent subsequence $F^n_k(z)to ain X$.



    Take $epsilon >0$, then there is $K$ such that for $k>K$ we have $epsilon>d(F^n_k+1(z),F^n_k(z))geq d(F^n_k+1-n_k(z),z)$. Therefore $F^n_k+1-n_k(z)$ is inside the ball with center $z$ and radius $epsilon$.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Mar 26 at 18:07









    user647486user647486

    917111




    917111











    • $begingroup$
      Thanks for the response! I considered looking at sequences of $F^n$ but I guess my confusion was that any subsequence doesn't seem to be meaningfully different from the first. Since $n$ is just a sequence of increasing naturals, then how can $n_k$ be any different?
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:13










    • $begingroup$
      Well, $(F^n_k(z))_k$ converges while $(F^n(z))_n$ does not in general.
      $endgroup$
      – amsmath
      Mar 26 at 18:17










    • $begingroup$
      @RyanGoulden Double check the statement, because for what is usually called 'cluster point' the statement is false.
      $endgroup$
      – user647486
      Mar 26 at 18:20










    • $begingroup$
      @amsmath right, that would follow from what it means to be sequentially compact. I guess what I'm saying is that I don't really see how that's possible. How can it be that $F^n$ doesn't converge while $F^n_k$ does?
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:20










    • $begingroup$
      @user647486 I'm using "cluster point" to refer to points in the closure of a set, where the closure of a set $A$ is the union of $A$ with its accumulation points.
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:21
















    • $begingroup$
      Thanks for the response! I considered looking at sequences of $F^n$ but I guess my confusion was that any subsequence doesn't seem to be meaningfully different from the first. Since $n$ is just a sequence of increasing naturals, then how can $n_k$ be any different?
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:13










    • $begingroup$
      Well, $(F^n_k(z))_k$ converges while $(F^n(z))_n$ does not in general.
      $endgroup$
      – amsmath
      Mar 26 at 18:17










    • $begingroup$
      @RyanGoulden Double check the statement, because for what is usually called 'cluster point' the statement is false.
      $endgroup$
      – user647486
      Mar 26 at 18:20










    • $begingroup$
      @amsmath right, that would follow from what it means to be sequentially compact. I guess what I'm saying is that I don't really see how that's possible. How can it be that $F^n$ doesn't converge while $F^n_k$ does?
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:20










    • $begingroup$
      @user647486 I'm using "cluster point" to refer to points in the closure of a set, where the closure of a set $A$ is the union of $A$ with its accumulation points.
      $endgroup$
      – Ryan Goulden
      Mar 26 at 18:21















    $begingroup$
    Thanks for the response! I considered looking at sequences of $F^n$ but I guess my confusion was that any subsequence doesn't seem to be meaningfully different from the first. Since $n$ is just a sequence of increasing naturals, then how can $n_k$ be any different?
    $endgroup$
    – Ryan Goulden
    Mar 26 at 18:13




    $begingroup$
    Thanks for the response! I considered looking at sequences of $F^n$ but I guess my confusion was that any subsequence doesn't seem to be meaningfully different from the first. Since $n$ is just a sequence of increasing naturals, then how can $n_k$ be any different?
    $endgroup$
    – Ryan Goulden
    Mar 26 at 18:13












    $begingroup$
    Well, $(F^n_k(z))_k$ converges while $(F^n(z))_n$ does not in general.
    $endgroup$
    – amsmath
    Mar 26 at 18:17




    $begingroup$
    Well, $(F^n_k(z))_k$ converges while $(F^n(z))_n$ does not in general.
    $endgroup$
    – amsmath
    Mar 26 at 18:17












    $begingroup$
    @RyanGoulden Double check the statement, because for what is usually called 'cluster point' the statement is false.
    $endgroup$
    – user647486
    Mar 26 at 18:20




    $begingroup$
    @RyanGoulden Double check the statement, because for what is usually called 'cluster point' the statement is false.
    $endgroup$
    – user647486
    Mar 26 at 18:20












    $begingroup$
    @amsmath right, that would follow from what it means to be sequentially compact. I guess what I'm saying is that I don't really see how that's possible. How can it be that $F^n$ doesn't converge while $F^n_k$ does?
    $endgroup$
    – Ryan Goulden
    Mar 26 at 18:20




    $begingroup$
    @amsmath right, that would follow from what it means to be sequentially compact. I guess what I'm saying is that I don't really see how that's possible. How can it be that $F^n$ doesn't converge while $F^n_k$ does?
    $endgroup$
    – Ryan Goulden
    Mar 26 at 18:20












    $begingroup$
    @user647486 I'm using "cluster point" to refer to points in the closure of a set, where the closure of a set $A$ is the union of $A$ with its accumulation points.
    $endgroup$
    – Ryan Goulden
    Mar 26 at 18:21




    $begingroup$
    @user647486 I'm using "cluster point" to refer to points in the closure of a set, where the closure of a set $A$ is the union of $A$ with its accumulation points.
    $endgroup$
    – Ryan Goulden
    Mar 26 at 18:21











    0












    $begingroup$

    There exists a subsequence $(F^n_k(z))_k$ which is a Cauchy sequence. Thus, for $varepsilon > 0$ there exists $K$ such that for $kgeellge K$ we have $d(F^n_k(z),F^n_ell(z)) < varepsilon$. Hence, by induction, $d(F^n_k-n_ell(z),z) < varepsilon$. Since this holds for any $varepsilon > 0$, that's it.






    share|cite|improve this answer









    $endgroup$

















      0












      $begingroup$

      There exists a subsequence $(F^n_k(z))_k$ which is a Cauchy sequence. Thus, for $varepsilon > 0$ there exists $K$ such that for $kgeellge K$ we have $d(F^n_k(z),F^n_ell(z)) < varepsilon$. Hence, by induction, $d(F^n_k-n_ell(z),z) < varepsilon$. Since this holds for any $varepsilon > 0$, that's it.






      share|cite|improve this answer









      $endgroup$















        0












        0








        0





        $begingroup$

        There exists a subsequence $(F^n_k(z))_k$ which is a Cauchy sequence. Thus, for $varepsilon > 0$ there exists $K$ such that for $kgeellge K$ we have $d(F^n_k(z),F^n_ell(z)) < varepsilon$. Hence, by induction, $d(F^n_k-n_ell(z),z) < varepsilon$. Since this holds for any $varepsilon > 0$, that's it.






        share|cite|improve this answer









        $endgroup$



        There exists a subsequence $(F^n_k(z))_k$ which is a Cauchy sequence. Thus, for $varepsilon > 0$ there exists $K$ such that for $kgeellge K$ we have $d(F^n_k(z),F^n_ell(z)) < varepsilon$. Hence, by induction, $d(F^n_k-n_ell(z),z) < varepsilon$. Since this holds for any $varepsilon > 0$, that's it.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Mar 26 at 18:13









        amsmathamsmath

        3,305421




        3,305421



























            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.




            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3163515%2fhint-or-help-on-this-metric-spaces-problem%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

            Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye

            random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

            How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer