TOPICS
Search

Fixed Point


A fixed point is a point that does not change upon application of a map, system of differential equations, etc. In particular, a fixed point of a function f(x) is a point x_0 such that

 f(x_0)=x_0.
(1)

The Wolfram Language commands FixedPoint[f, x] and FixedPointList[f, x] repeatedly apply a function f starting from x, stopping when successive results agree according to SameQ by default. The first returns the last result, and the second returns the list of iterates. Such an iteration need not converge or terminate. The form FixedPoint[f, x, n] limits the number of iterations to n.

The following table lists selected nonnegative real fixed points for several simple functions. For tangent, the smallest positive fixed point is shown.

FixedPointCos
FixedPointSin

Fixed points of functions in the complex plane commonly lead to beautiful fractal structures. For example, the plots above color the value of the fixed point (left figures) and the number of iterations to reach a fixed point (right figures) for cosine (top) and sine (bottom). Newton's method, which essentially involves a fixed point computation in order to find roots, leads to similar fractals in an analogous way.

Points of an autonomous system of ordinary differential equations at which

 {(dx_1)/(dt)=f_1(x_1,...,x_n)=0; |; (dx_n)/(dt)=f_n(x_1,...,x_n)=0
(2)

are known as fixed points.

If a variable is slightly displaced from a fixed point, it may (1) move back to the fixed point ("asymptotically stable"), (2) move away ("unstable"), or (3) move in a neighborhood of the fixed point but not approach it ("stable" but not "asymptotically stable"). Fixed points are also called critical points or equilibrium points. For an autonomous system with a locally Lipschitz vector field, a trajectory starting away from a fixed point cannot reach it in finite time. Under the same uniqueness hypothesis, a trajectory cannot cross itself unless it is a closed curve, in which case it is a periodic solution.

A fixed point can be classified into one of several classes using linear stability analysis and the resulting stability matrix.

The following table summarizes fixed points of a two-dimensional linear system (Tabor 1989, pp. 22-24). Here lambda_1 and lambda_2 are the eigenvalues of the stability matrix, and alpha, beta, and omega are positive. For a nonlinear system, purely imaginary eigenvalues of the linearization alone do not determine stability.


See also

Dottie Number, Elliptic Fixed Point, Fixed Point Iteration, Fixed Point Node, Fixed Point Theorem, Group Fixed Point, Hyperbolic Fixed Point, Mann Iteration, Map Fixed Point, Newton's Method, Stable Improper Node, Stable Node, Stable Spiral Point, Stable Star, Unstable Improper Node, Unstable Node, Unstable Spiral Point, Unstable Star

Explore with Wolfram|Alpha

References

Shashkin, Yu. A. Fixed Points. Providence, RI: Amer. Math. Soc., 1991.Sloane, N. J. A. Sequences A003957, A069814, A069855, A085984, A115365, A133866, A133867, and A133868 in "The On-Line Encyclopedia of Integer Sequences."Tabor, M. "Linear Stability Analysis." §1.4 in Chaos and Integrability in Nonlinear Dynamics: An Introduction. New York: Wiley, pp. 20-31, 1989.

Referenced on Wolfram|Alpha

Fixed Point

Cite this as:

Weisstein, Eric W. "Fixed Point." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/FixedPoint.html

Subject classifications