Fixed Point Theorem: Necessary & Sufficient Conditions for Convergence

Click For Summary
The discussion focuses on identifying necessary and sufficient conditions for the convergence of sequences defined by the function f, where f is continuously differentiable and has a fixed point at a. It is suggested that the spectral radius of the Jacobian of f at the fixed point a plays a crucial role in determining convergence. The analysis indicates that if all sequences converge to a, then the spectral radius must be less than or equal to one. The conversation also touches on the implications of the Jacobian being non-invertible and the potential need for further exploration of sufficient conditions for convergence. Overall, the thread seeks clarity on the mathematical conditions that ensure convergence in this context.
Calabi
Messages
140
Reaction score
2

Homework Statement


Let be ##f \in C^{1}(\mathbb{R}^{n}, \mathbb{R}^{n})## and ##a \in \mathbb{R}^{n}## with ##f(a) = a##. I'm looking for a suffisent and necessar condition on f that for all ##(x_{n})## define by ##f(x_{n}) = x_{n+1}##, then ##(x_{n})## converge.

Homework Equations


##f(a) = a##

The Attempt at a Solution



If all sequences define like this converge it's necessarly on a.
We've got the following result : if A is a complex matrix, then the seuqences define by ##X_{n+1} = AX_{n}## converge if and only if the spectral radius ##\rho{A} < 1##.

So I think we should care about the spectral radius of the jacobian of f.

By whrogting ##f(a + x_{n}) = a + df(a)x_{n} + ||x_{n}||\epsilon(x_{n})## but I get nothing.

Have you got an idea please?

Thank you in advance and have a nice afternoon:oldbiggrin:.
 
Physics news on Phys.org
It is necessar because if all sequences define by f converge it's in ##a## then We can choose ##(x_{n})## no stationnar if ##df(a)## is invertible : by the local reverse theorem we can find a neighbourhood ##V## of a with ##f_{|V} : V \rightarrow V## is injective then it is enough to choose ##x_{0} \in V - \{a\}##(then if for a certain n ##x_{n} = a## we easily show that necessarly ##x_{0} = a##.). so ##x_{n + 1} = f(a + x_{n} - a) = a + df(a).(x_{n} - a) + ||x_{n} - a||\epsilon(x_{n} - a)##(whith ##\epsilon(x) \rightarrow_{x \rightarrow 0} 0##.). ##\forall \epsilon > 0## we can choose n enough high as ##||x_{n} - a|| < \epsilon## and ##||x_{n+1} - a|| \leq ||x_{n} - a|| ##(indeed, by convergence hypothesis, ##\exists N \in \mathbb{N} | n > N \Rightarrow ||x_{n} - a|| < \epsilon##, then if forall n integer > N we have ##||x_{n+1} - a|| > ||x_{n} - a||## then it doesn't converge in 0 which is absurd.). so ##||\rho(df(a))|| ||x_{n} - a|| \leq |||df(a)||| ||x_{n} - a|| \leq ||x_{n + 1} - a|| + ||x_{n} - a|| ||\epsilon(x_{n} - a)|| \leq ||x_{n} - a|| + ||x_{n} - a|| ||\epsilon(x_{n} - a)||## so as ##(x_{n})## is not stationnar ##||\rho(df(a))|| \leq 1 + \epsilon## so ##||\rho(df(a))|| \leq 1##.
If the jacobian is non invertible I don't know.
 
Last edited:
But what about the suffisient condition please? Maybe it's wrong.
 
We can choose ##(x_{n})## no stationnar if ##df(a)## is invertible : by the local reverse theorem we can find a neighbourhood ##V## of a with ##f_{|V} : V \rightarrow V## is injective then it is enough to choose ##x_{0} \in V - \{a\}##(then if ##x_{n} = a## we easily show that necessarly ##x_{0} = a##.).
 
Could you help me?
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 12 ·
Replies
12
Views
2K
Replies
2
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 16 ·
Replies
16
Views
1K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K