1 Definition and basic properties

A fixed-point set collects all elements that a map leaves unchanged. In many settings, it serves as a natural way to describe equilibrium, symmetry, or self-consistency. The idea is simple, but its consequences are broad: fixed-point sets can be finite, infinite, geometric, algebraic, or even empty, depending on the mapping and the underlying space.

1.1 Set-theoretic definition

Let \(f\) be a map from a set \(X\) to itself. The fixed-point set of \(f\) is \[ \mathrm{Fix}(f)=\{x\in X : f(x)=x\}. \] Each element of this set is called a fixed point of \(f\). If no element satisfies the equation, then the fixed-point set is empty. Because the definition depends only on equality under the map, it applies in very general contexts, from simple functions on numbers to transformations of geometric objects.

1.2 Fixed points versus fixed-point sets

A fixed point is a single element \(x\) with \(f(x)=x\). A fixed-point set is the collection of all such elements. In some problems, attention centers on whether at least one fixed point exists; in others, the full set is studied to understand structure. For example, a map may have exactly one fixed point, while another may fix an entire line, plane, or subspace.

1.3 Notation and terminology

Common notation includes \(\mathrm{Fix}(f)\), \(\mathrm{FP}(f)\), or simply \( \{x : f(x)=x\}\). The term “fixed-point set” is standard in analysis, topology, and dynamical systems. In some contexts, especially algebra and geometry, related language such as “fixed locus” or “fixed subspace” is used when the map has additional structure.

1.4 Examples of fixed-point sets

A constant map \(f(x)=c\) has fixed points only when \(x=c\), and thus its fixed-point set is \(\{c\}\) if \(c\) lies in the domain and satisfies \(f(c)=c\). The identity map fixes every point, so its fixed-point set is the entire space. A reflection across a line in the plane fixes exactly the points on that line. A rotation of a circle by a nonzero angle has no fixed points, while the zero-angle rotation fixes all points.

2 Types of maps and transformations

The form of the fixed-point set depends strongly on the type of map involved. Algebraic maps, linear operators, continuous functions, and iterative dynamical systems each impose different kinds of constraints. As a result, the same definition can lead to very different behavior across fields.

2.1 Functions on sets

For an arbitrary self-map of a set, the fixed-point set is determined purely by the equation \(f(x)=x\). No continuity or algebraic compatibility is required. This setting is useful for abstract discussions, combinatorial constructions, and discrete systems, where fixed points may be found by direct inspection or enumeration.

2.2 Linear operators

If \(T\) is a linear operator on a vector space, then \(\mathrm{Fix}(T)\) is a linear subspace. Indeed, if \(T(x)=x\) and \(T(y)=y\), then \(T(ax+by)=ax+by\). This set is the eigenspace associated with eigenvalue \(1\). In finite-dimensional settings, its dimension equals the multiplicity of that eigenvalue as a geometric eigenspace.

2.3 Continuous mappings

For continuous maps on topological spaces, the fixed-point set may inherit useful topological properties, especially when the ambient space has compactness or convexity assumptions. Continuity alone does not guarantee fixed points, but it often enables the use of powerful existence theorems. In geometry and analysis, continuity is a common baseline for studying the shape and stability of fixed-point sets.

2.4 Dynamical systems and iterated maps

In dynamical systems, a fixed point is a state that remains unchanged under one step of evolution. The fixed-point set may represent equilibria or steady states. When a map is iterated, points in the fixed-point set stay constant under every iterate, making them central to the long-term behavior of the system. Nearby trajectories may converge to, diverge from, or cycle around such sets.

3 Existence and uniqueness

Questions of existence and uniqueness are central to fixed-point theory. A map may have no fixed points, one fixed point, or many. The answer often depends on properties of the domain, the codomain, and the map itself. In analysis, existence is frequently established by compactness, completeness, or contractive behavior.

3.1 Conditions for existence

A fixed point can often be obtained by combining structural assumptions on the space with regularity assumptions on the map. Many classical results show that fixed points appear when the map cannot “move” every point away from itself indefinitely. These theorems are among the most useful tools in nonlinear analysis.

3.1.1 Compactness assumptions

Compactness is a common hypothesis in fixed-point arguments. On compact convex sets, continuous maps often admit fixed points. Compactness helps prevent escape to infinity and supports limit arguments, while convexity supplies geometric stability. Such assumptions appear in several major results, especially in finite-dimensional and functional-analytic contexts.

3.1.2 Completeness assumptions

Completeness is especially important for contraction mappings. In a complete metric space, a self-map that strictly reduces distances by a uniform factor has a unique fixed point. The completeness condition ensures that the iterative sequence used to find the fixed point converges to an element of the space rather than “leaving” it through a limit process.

3.2 Uniqueness of fixed points

Uniqueness usually follows from strong contraction or monotonicity conditions. If two points were both fixed, the structure of the map would force them to coincide under suitable hypotheses. Uniqueness is valuable in applications because it often implies that an equilibrium or solution is well defined and stable under perturbation of the initial guess.

3.3 Counterexamples and nonexistence

Fixed points do not always exist. A translation of the real line has no fixed points, since every point is shifted by the same amount. A rotation of a circle by a nontrivial angle also has none. These examples show that topology and geometry matter: even simple continuous transformations can fail to have fixed points if the space permits movement without self-intersection.

4 Structural properties

The structure of a fixed-point set can reveal deep information about the underlying map. Depending on the situation, it may be convex, a subspace, a submanifold, a discrete collection, or a set with more complicated singular behavior. Structural analysis is often as important as existence.

4.1 Geometry of fixed-point sets

Geometric features of fixed-point sets depend on the symmetry and regularity of the transformation. In Euclidean spaces, fixed-point sets of linear isometries or affine maps are often flat objects such as points, lines, planes, or affine subspaces. For nonlinear maps, the geometry may be curved or locally complicated, reflecting the local behavior of the transformation.

4.1.1 Convex fixed-point sets

For certain maps, especially affine or nonexpansive maps on convex domains, the fixed-point set is itself convex. This means that if two points are fixed, then every point on the segment joining them is also fixed. Convexity is useful in optimization and analysis because it simplifies both theoretical arguments and computational methods.

4.1.2 Manifold structure

Under suitable smoothness and regularity assumptions, a fixed-point set may form a manifold. For example, the set of points fixed by a smooth symmetry can locally resemble a smooth subspace. However, singularities may occur when the derivative of the map has special eigenvalue behavior or when fixed points merge. In such cases, the local geometry can be more intricate.

4.2 Topological properties

Topological properties of fixed-point sets are often studied through connectedness, closedness, compactness, and homotopy type. For continuous maps on Hausdorff spaces, fixed-point sets are typically closed, since they can be described as the preimage of the diagonal under a continuous map. Topological invariants may also help classify the set or relate it to the surrounding space.

4.3 Algebraic properties

In algebraic settings, fixed-point sets can carry additional structure. For linear maps they are subspaces; for group actions they may form subgroups or subgroup-like subsets; and for maps respecting algebraic operations, the fixed points often inherit those operations. This makes them useful in representation theory, algebraic geometry, and operator theory.

4.4 Dimension and measure

The dimension of a fixed-point set may range from zero to the full dimension of the ambient space. In some cases it is lower-dimensional and negligible in the sense of measure; in others it fills a large portion of the space. Measure-theoretic size is often important in applications, where fixed points may represent isolated equilibria or extended invariant regions.

5 Fixed-point theorems

Fixed-point theorems provide conditions under which fixed points must exist. They are among the most influential results in mathematics because they convert geometric or analytic hypotheses into existence statements. Different theorems apply in different settings, from finite-dimensional convex bodies to abstract metric spaces.

5.1 Brouwer fixed-point theorem

The Brouwer fixed-point theorem states that every continuous self-map of a closed disk in Euclidean space has at least one fixed point. More generally, every continuous map from a compact convex subset of \(\mathbb{R}^n\) to itself has a fixed point. This theorem has far-reaching consequences in topology, analysis, and economics, and it is often viewed as a foundational existence result.

5.2 Banach fixed-point theorem

The Banach fixed-point theorem applies to contraction mappings on complete metric spaces. It guarantees the existence of a unique fixed point and shows that repeated iteration converges to it. Because the theorem is constructive, it is widely used in numerical analysis and differential equations. It also provides a practical method for approximating solutions.

5.3 Schauder fixed-point theorem

The Schauder fixed-point theorem extends the spirit of Brouwer’s result to infinite-dimensional settings. It asserts that a continuous compact map from a nonempty convex closed subset of a Banach space into itself has a fixed point. The theorem is especially useful for integral equations and nonlinear boundary value problems, where compactness replaces finite-dimensional geometry.

5.4 Lefschetz fixed-point theorem

The Lefschetz fixed-point theorem links fixed points with algebraic topology. It gives a criterion, expressed through a Lefschetz number, that forces the existence of a fixed point under appropriate hypotheses. The theorem is powerful because it translates a geometric question into one about induced maps on homology or cohomology, connecting dynamics with topological invariants.

6 Methods for computing fixed-point sets

Computing fixed-point sets may require exact formulas, iterative schemes, or numerical approximation. The choice of method depends on the map’s regularity, the dimension of the space, and whether one seeks all fixed points or only one. In many practical problems, a combination of symbolic and numerical techniques is used.

6.1 Analytical methods

Analytical approaches start by solving the equation \(f(x)=x\) directly. In linear problems, this may reduce to solving a system of equations. In nonlinear problems, one may use calculus, algebraic manipulation, or structural decompositions. Analytical methods are most effective when the map has a simple form or strong symmetry.

6.2 Iterative methods

Iteration is one of the most common ways to approximate fixed points. Beginning from an initial estimate, one repeatedly applies the map or a related update rule. If the process converges, the limit is often a fixed point. Iterative methods are particularly valuable when exact solutions are unavailable.

6.2.1 Successive approximation

Successive approximation, also called fixed-point iteration, uses the sequence \[ x_{n+1}=f(x_n). \] Under suitable contraction conditions, the sequence converges to the unique fixed point. Even when convergence is not guaranteed, this method often gives useful qualitative information about the map’s behavior and the basin of attraction of a fixed point.

6.2.2 Newton-type methods

Newton-type methods solve \(f(x)=x\) by rewriting it as \(g(x)=0\), where \(g(x)=f(x)-x\), and then applying a root-finding scheme. These methods can converge rapidly near a solution, especially when derivatives are available. They are widely used in nonlinear equations, optimization, and computational physics.

6.3 Numerical approximation

Numerical methods approximate fixed-point sets when exact descriptions are impractical. Grid-based sampling, continuation methods, and homotopy techniques may be used to locate fixed points and estimate their stability. In higher-dimensional problems, one may compute selected points on a fixed set rather than the entire set, especially when the set is continuous or complicated.

6.4 Software and symbolic computation

Computer algebra systems and numerical software assist in solving fixed-point equations, simplifying expressions, and analyzing stability. Symbolic computation can identify exact fixed-point formulas in algebraic cases, while numerical packages handle large-scale nonlinear systems. Visualization tools are also important, especially for low-dimensional maps where the fixed-point set can be graphed directly.

7 Applications in applied mathematics

Fixed-point sets arise whenever a system seeks balance, self-consistency, or steady behavior. This makes the concept central to many applied fields. The same mathematical object may represent an equilibrium, a stable configuration, or an invariant solution depending on the context.

7.1 Equilibria in dynamical systems

In dynamical systems, fixed points represent equilibria that do not change under the system’s update rule. Their stability indicates whether nearby states return to equilibrium or move away from it. Fixed-point sets can also describe families of equilibria, including continua of steady states in models with symmetry or conservation laws.

7.2 Optimization and variational problems

Optimization algorithms often seek points that satisfy self-consistency conditions, which can be written as fixed-point equations. Proximal methods, projection methods, and gradient-based schemes frequently rely on fixed-point formulations. In variational problems, the solution may be characterized as a fixed point of an operator derived from an energy functional or a constraint system.

7.3 Control theory

In control theory, fixed points can describe steady operating regimes of a controlled system. Feedback laws are often designed so that desired states become fixed points of the closed-loop dynamics. The analysis of such sets helps assess stability, convergence, and robustness under disturbances or parameter changes.

7.4 Game theory and equilibrium analysis

Many equilibrium concepts in game theory can be formulated as fixed points of best-response maps or related correspondence operators. In this setting, a fixed point represents a state in which no participant has an incentive to unilaterally change strategy. Fixed-point methods therefore play a major role in proving the existence of equilibrium profiles.

7.5 Invariant sets in geometry and mechanics

In geometry and mechanics, fixed-point sets often correspond to symmetry loci or preserved configurations. A transformation may leave a curve, surface, or subspace unchanged, and that set can encode essential geometric information. In mechanics, fixed-point analysis helps identify stationary configurations and conserved structures under motion or symmetry operations.

Fixed-point sets are closely connected to several broader notions. These include invariant subsets, periodicity, spectral theory, and equations defined by self-maps. Understanding these related ideas helps place fixed-point theory within a larger mathematical framework.

8.1 Invariant sets

An invariant set is one that is mapped into itself, though not necessarily pointwise fixed. Every fixed-point set is invariant, but not every invariant set consists of fixed points. This distinction is important in dynamics, where trajectories may remain inside a region while individual points continue to move.

8.2 Periodic points

A periodic point returns to itself after a finite number of iterations, not necessarily after one. Fixed points are the special case of period one. Periodic point sets are therefore a natural generalization, and they often reveal cyclic behavior that complements the steady-state picture given by fixed points.

8.3 Eigenvectors and eigenspaces

For linear maps, fixed points are exactly the vectors in the eigenspace for eigenvalue \(1\). More generally, eigenvectors describe directions preserved up to scaling, while fixed points require complete preservation. This relation makes fixed-point sets a bridge between linear algebra and geometry.

8.4 Solving equation \(f(x)=x\)

The equation \(f(x)=x\) is the defining equation for fixed points. Rewriting a problem in this form often clarifies its structure and opens the door to general theorems or iterative methods. Many problems in analysis, computation, and applied modeling are ultimately expressed as solutions to this self-consistency condition.