- Fixed point (mathematics)
- Not to be confused with a stationary point where f'(x) = 0.
In mathematics, a fixed point (sometimes shortened to fixpoint, also known as an invariant point) of a function is a point that is mapped to itself by the function. A set of fixed points is sometimes called a fixed set. That is to say, c is a fixed point of the function f(x) if and only if f(c) = c. For example, if f is defined on the real numbers by
then 2 is a fixed point of f, because f(2) = 2.
Not all functions have fixed points: for example, if f is a function defined on the real numbers as f(x) = x + 1, then it has no fixed points, since x is never equal to x + 1 for any real number. In graphical terms, a fixed point means the point (x, f(x)) is on the line y = x, or in other words the graph of f has a point in common with that line. The example f(x) = x + 1 is a case where the graph and the line are a pair of parallel lines.
Attractive fixed points
An attractive fixed point of a function f is a fixed point x0 of f such that for any value of x in the domain that is close enough to x0, the iterated function sequence
The natural cosine function ("natural" means in radians, not degrees or other units) has exactly one fixed point, which is attractive. In this case, "close enough" is not a stringent criterion at all—to demonstrate this, start with any real number and repeatedly press the cos key on a calculator (checking first that the calculator is in "radians" mode). It eventually converges to about 0.739085133, which is a fixed point. That is where the graph of the cosine function intersects the line y = x.
Not all fixed points are attractive: for example, x = 0 is a fixed point of the function f(x) = 2x, but iteration of this function for any value other than zero rapidly diverges. However, if the function f is continuously differentiable in an open neighbourhood of a fixed point x0, and , attraction is guaranteed.
Attractive fixed points are a special case of a wider mathematical concept of attractors.
An attractive fixed point is said to be a stable fixed point if it is also Lyapunov stable.
A fixed point is said to be a neutrally stable fixed point if it is Lyapunov stable but not attracting. The center of a linear homogeneous differential equation of the second order is an example of a neutrally stable fixed point.
Theorems guaranteeing fixed points
There are numerous theorems in different parts of mathematics that guarantee that functions, if they satisfy certain conditions, have at least one fixed point. These are amongst the most basic qualitative results available: such fixed-point theorems that apply in generality provide valuable insights.
In many fields, equilibria or stability are fundamental concepts that can be described in terms of fixed points. For example, in economics, a Nash equilibrium of a game is a fixed point of the game's best response correspondence. However, in physics, more precisely in the theory of Phase Transitions, linearisation near an unstable fixed point has led to Wilson's Nobel prize-winning work inventing the renormalization group, and to the mathematical explanation of the term "critical phenomenon".
In compilers, fixed point computations are used for whole program analysis, which are often required to do code optimization.
Logician Saul Kripke makes use of fixed points in his influential theory of truth. He shows how one can generate a partially defined truth predicate (one which remains undefined for problematic sentences like "This sentence is not true"), by recursively defining "truth" starting from the segment of a language which contains no occurrences of the word, and continuing until the process ceases to yield any newly well-defined sentences. (This will take a denumerable infinity of steps.) That is, for a language L, let L-prime be the language generated by adding to L, for each sentence S in L, the sentence "S is true." A fixed point is reached when L-prime is L; at this point sentences like "This sentence is not true" remain undefined, so, according to Kripke, the theory is suitable for a natural language which contains its own truth predicate.
The concept of fixed point can be used to define the convergence of a function.
Topological fixed point property
there exists such that f(x) = x.
The FPP is a topological invariant, i.e. is preserved by any homeomorphism. The FPP is also preserved by any retraction.
According to the Brouwer fixed point theorem, every compact and convex subset of a euclidean space has the FPP. Compactness alone does not imply the FPP and convexity is not even a topological property so it makes sense to ask how to topologically characterize the FPP. In 1932 Borsuk asked whether compactness together with contractibility could be a necessary and sufficient condition for the FPP to hold. The problem was open for 20 years until the conjecture was disproved by Kinoshita who found an example of a compact contractible space without the FPP.
Wikimedia Foundation. 2010.
Look at other dictionaries:
Fixed point — has many meanings in science, most of them mathematical. *Fixed point (mathematics) *Fixed point combinator *Fixed point arithmetic, a manner of doing arithmetic on computers *For “fixed points” in physics, see Renormalization group *Fixed points … Wikipedia
Fixed point combinator — A fixed point combinator (or fixed point operator) is a higher order function that computes a fixed point of other functions. This operation is relevant in programming language theory because it allows the implementation of recursion in the form… … Wikipedia
fixed-point theorem — ▪ mathematics any of various theorems in mathematics dealing with a transformation of the points of a set into points of the same set where it can be proved that at least one point remains fixed. For example, if each real number is squared … Universalium
Fixed point theorem — In mathematics, a fixed point theorem is a result saying that a function F will have at least one fixed point (a point x for which F ( x ) = x ), under some conditions on F that can be stated in general terms. Results of this kind are amongst the … Wikipedia
Fixed-point theorems in infinite-dimensional spaces — In mathematics, a number of fixed point theorems in infinite dimensional spaces generalise the Brouwer fixed point theorem. They have applications, for example, to the proof of existence theorems for partial differential equations. The first… … Wikipedia
Fixed point theorems in infinite-dimensional spaces — In mathematics, a number of fixed point theorems in infinite dimensional spaces generalise the Brouwer fixed point theorem. They have applications, for example, to the proof of existence theorems for partial differential equations. The first… … Wikipedia
Fixed-point combinator — Y combinator redirects here. For the technology venture capital firm, see Y Combinator (company). In computer science, a fixed point combinator (or fixpoint combinator ) is a higher order function that computes a fixed point of other functions … Wikipedia
Fixed point index — In mathematics, the fixed point index is a concept in topological fixed point theory, and in particular Nielsen theory. The fixed point index can be thought of as a multiplicity measurement for fixed points.The index can be easily defined in the… … Wikipedia
Fixed point space — In mathematics, a Hausdorff space X is called a fixed point space if every continuous function f:X ightarrow X has a fixed point.For example, any closed interval [a,b] in mathbb R is a fixed point space, and it can be proved from the intermediate … Wikipedia
Atiyah–Bott fixed-point theorem — In mathematics, the Atiyah–Bott fixed point theorem, proven by Michael Atiyah and Raoul Bott in the 1960s, is a general form of the Lefschetz fixed point theorem for smooth manifolds M , which uses an elliptic complex on M . This is a system of… … Wikipedia