Fixed point theorem knowing that ##T^n## is a contraction

Click For Summary
In a complete metric space where T^n is a contraction, it is proven that there exists a unique fixed point x such that T(x) = x. The discussion emphasizes the importance of showing that the sequence generated by iterating T^n from any initial point is Cauchy, leading to convergence. Once the fixed point of T^n is established, it is shown that applying T to this point yields the same point, confirming its uniqueness. The conversation also clarifies that T being a contraction is not necessary for T^n to be a contraction, with examples provided to illustrate this distinction. The final consensus reinforces the uniqueness of the fixed point derived from the contraction property of T^n.
mahler1
Messages
217
Reaction score
0
Homework Statement .
Let ##X## be a complete metric space and let ##T:X \to X## such that there exists ##n \in \mathbb N##: ##T^n## is a contraction. Prove that there is a unique ##x \in X## such that ##T(x)=x##.

The attempt at a solution.
Sorry but I am completely lost with this exercise and I am a little bit confused about the following: if ##T^n## is a contraction, would this mean that for any ##x,y \in X## ##d(T^n(x), T^n(y))<αd(x,y)## or ##d(T^n(x), T^n(y))<αd(T^{n-1}(x),T^{n-1}(y))##, for ##0<α<1##?. How could I begin the exercise to find the ##x## such that ##T(x)=x##?.
 
Physics news on Phys.org
mahler1 said:
Homework Statement .
Let ##X## be a complete metric space and let ##T:X \to X## such that there exists ##n \in \mathbb N##: ##T^n## is a contraction. Prove that there is a unique ##x \in X## such that ##T(x)=x##.

The attempt at a solution.
Sorry but I am completely lost with this exercise and I am a little bit confused about the following: if ##T^n## is a contraction, would this mean that for any ##x,y \in X## ##d(T^n(x), T^n(y))<αd(x,y)## or ##d(T^n(x), T^n(y))<αd(T^{n-1}(x),T^{n-1}(y))##, for ##0<α<1##?. How could I begin the exercise to find the ##x## such that ##T(x)=x##?.

Let's just write ##C## instead of ##T^n## so we can skip some exponents. Here's a hint. Pick ##x_0## to be any point. Now define ##x_1=C(x_0), x_2=C(x_1)##, etc. Now you've got things like ##d(x_1,x_2)=d(C(x_0),C(x_1)) \le αd(x_0,x_1)##. The first step is going to be trying to prove that sequence is Cauchy.
 
  • Like
Likes 1 person
mahler1 said:
Homework Statement .
Let ##X## be a complete metric space and let ##T:X \to X## such that there exists ##n \in \mathbb N##: ##T^n## is a contraction. Prove that there is a unique ##x \in X## such that ##T(x)=x##.

The attempt at a solution.
Sorry but I am completely lost with this exercise and I am a little bit confused about the following: if ##T^n## is a contraction, would this mean that for any ##x,y \in X## ##d(T^n(x), T^n(y))<αd(x,y)## or ##d(T^n(x), T^n(y))<αd(T^{n-1}(x),T^{n-1}(y))##, for ##0<α<1##?.
BOTH. The definition of "contraction map" is that for any x, y, d(T(x), T(y))\le \alpha d(x, y) (with \alpha&lt; 0). For any positive integer, d(T^n(x), T^n(y))&lt;\alpha d(T^{n-1}(x), T^{n-1}(y)) is just that same statement with T^{n-1}(x) in place of x and T^{n-1}(y) in place of y.

How could I begin the exercise to find the ##x## such that ##T(x)=x##?.
Take x_0 to be any point in X. Look at the sequence \{T^n(x_0)\}. Show that it is a Cauchy sequence so converges. See what happens when you apply T to the limit of that sequence.
 
  • Like
Likes 1 person
HallsofIvy said:
BOTH. The definition of "contraction map" is that for any x, y, d(T(x), T(y))\le \alpha d(x, y) (with \alpha&lt; 0). For any positive integer, d(T^n(x), T^n(y))&lt;\alpha d(T^{n-1}(x), T^{n-1}(y)) is just that same statement with T^{n-1}(x) in place of x and T^{n-1}(y) in place of y.

Not quite, I don't think. The problem (for some reason) didn't say T is a contraction, it says ##T^n## is a contraction.
 
Dick said:
Let's just write ##C## instead of ##T^n## so we can skip some exponents. Here's a hint. Pick ##x_0## to be any point. Now define ##x_1=C(x_0), x_2=C(x_1)##, etc. Now you've got things like ##d(x_1,x_2)=d(C(x_0),C(x_1)) \le αd(x_0,x_1)##. The first step is going to be trying to prove that sequence is Cauchy.

Ok, but with that sequence, what I am goint to prove is that ##T^n## has a fixed point. If I call that point ##x##, would ##x## help me to find the fixed point of ##T## that I am looking for?
 
In my first response I said "(with \alpha&lt; 0)" when, of course, I meant "(with \alpha&lt; 1)".

Now, in your first post you said "there exist n\in N such that T^n is contraction". The first thing I would do is define S= T^n for that n so that S is a contraction. You can then show that the sequence T^m x_0 is a Cauchy sequence and so converges to some point x.

The point is that applying T to that x, Tx, is the same as applying T to each term in the sequence. But that just shifts the sequence by one place. It is still the same sequence and still converges to x. That is, Tx=x.
 
  • Like
Likes 1 person
mahler1 said:
Ok, but with that sequence, what I am goint to prove is that ##T^n## has a fixed point. If I call that point ##x##, would ##x## help me to find the fixed point of ##T## that I am looking for?

First you want to show that the fixed point is unique. If T^n(x)=x and T^n(y)=y, then x=y. Now can you show that if x is a fixed point then T(x) is also a fixed point?
 
Dick said:
First you want to show that the fixed point is unique. If T^n(x)=x and T^n(y)=y, then x=y. Now can you show that if x is a fixed point then T(x) is also a fixed point?

Suppose there are ##x,y \in X## such that ##T^n(x)=x## and ##T^n(y)=y##, ##d(x,y)=d(T^n(x),T^n(y))\leq \alpha d(x,y)## and this inequality holds if and only if ##x=y##.

Now let ##x## be the fixed point of ##T^n##, ##T^n(T(x))=T(T^n(x))=T(x)##. It follows that ##T(x)## is a fixed point but by unicity we have that ##T(x)=x##, which means ##x## is a fixed point of ##T##. One can prove unicity using the fact that ##T^n## is a contraction.

Thank you very much!
 
BTW it might be tempting to think that if T^n is a contraction, then T must be a contraction. That's not true. Take X=R^2 and T to be the linear mapping represented by the matrix [[0,1],[1/2,0]]. T is not a contraction. T^2 is a contraction. Show that if you are interested.
 
  • Like
Likes 1 person
  • #10
mahler1 said:
Suppose there are ##x,y \in X## such that ##T^n(x)=x## and ##T^n(y)=y##, ##d(x,y)=d(T^n(x),T^n(y))\leq \alpha d(x,y)## and this inequality holds if and only if ##x=y##.

Now let ##x## be the fixed point of ##T^n##, ##T^n(T(x))=T(T^n(x))=T(x)##. It follows that ##T(x)## is a fixed point but by unicity we have that ##T(x)=x##, which means ##x## is a fixed point of ##T##. One can prove unicity using the fact that ##T^n## is a contraction.

Thank you very much!

Very welcome. Nicely done!
 
  • Like
Likes 1 person
  • #11
Dick said:
BTW it might be tempting to think that if T^n is a contraction, then T must be a contraction. That's not true. Take X=R^2 and T to be the linear mapping represented by the matrix [[0,1],[1/2,0]]. T is not a contraction. T^2 is a contraction. Show that if you are interested.

Thanks for the remark, I appreciate it. Another example could be ##f:[\frac{1}{4},\frac{1}{2}] \to [\frac{1}{4},\frac{1}{2}]## defined as ##f(x)=x##. ##f## is clearly not a contraction but ##f^2## is a contraction.
 
  • #12
mahler1 said:
Thanks for the remark, I appreciate it. Another example could be ##f:[\frac{1}{4},\frac{1}{2}] \to [\frac{1}{4},\frac{1}{2}]## defined as ##f(x)=x##. ##f## is clearly not a contraction but ##f^2## is a contraction.

f^2(x) means f(f(x)). f(f(x))=f(x)=x. I'm not sure that's a good example. You really have to go to more than one dimension to get a linear example.
 
  • #13
Dick said:
f^2(x) means f(f(x)). f(f(x))=f(x)=x. I'm not sure that's a good example. You really have to go to more than one dimension to get a linear example.

Oops.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
979
  • · Replies 1 ·
Replies
1
Views
2K
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
2
Views
1K
  • · Replies 12 ·
Replies
12
Views
2K
Replies
26
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
3
Views
2K