Fixed point (mathematics)

hatnote|1=Fixed points in mathematics are not to be confused with other uses of "fixed point", or stationary points where math|1=f(x) = 0. In mathematics, a fixed point (sometimes shortened to fixpoint), also known as an invariant point, is a value that does not change under a given transformation. Specifically for functions, a fixed point is an element that is mapped to itself by the function. Formally, c is a fixed point of a function f if c belongs to both the domain and the codomain of f, and 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, f(x) = x + 1, has no fixed points, since x is never equal to x + 1 for any real number. In graphical terms, a fixed point x 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. Fixed-point iteration In numerical analysis, fixed-point iteration is a method of computing fixed points of a function. Specifically, given a function with the same domain and codomain, a point in the domain of , the fixed-point iteration is which gives rise to the sequence of iterated function applications which is hoped to converge to a point . If is continuous, then one can prove that the obtained is a fixed point of . Points that come back to the same value after a finite number of iterations of the function are called periodic points. A fixed point is a periodic point with period equal to one. In algebra, for a group G acting on a set X with a group action , x in X is said to be a fixed point of g if . The fixed-point subgroup of an automorphism f of a group G is the subgroup of G: Similarly the fixed-point subring of an automorphism f of a ring R is the subring of the fixed points of f, that is, In Galois theory, the set of the fixed points of a set of field automorphisms is a field called the fixed field of the set of automorphisms. Fixed-point property A topological space is said to have the fixed point property (FPP) if for any continuous function there exists such that .

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (3)

Related concepts (60)

Related courses (45)

Related lectures (501)

Related MOOCs (8)

PHYS-512: Statistical physics of computation

This course covers the statistical physics approach to computer science problems ranging from graph theory and constraint satisfaction to inference and machine learning. In particular the replica and

PHYS-739: Conformal Field theory and Gravity

This course is an introduction to the non-perturbative bootstrap approach to Conformal Field Theory and to the Gauge/Gravity duality, emphasizing the fruitful interplay between these two ideas.

MATH-416: Abstract analysis on groups

We study analytic phenomena on groups, notably paradoxical decompositions, fixed point properties and harmonic functions.

Fixed point (mathematics)

Eigenvalues and eigenvectors

In linear algebra, an eigenvector (ˈaɪgənˌvɛktər) or characteristic vector of a linear transformation is a nonzero vector that changes at most by a constant factor when that linear transformation is applied to it. The corresponding eigenvalue, often represented by , is the multiplying factor. Geometrically, a transformation matrix rotates, stretches, or shears the vectors it acts upon. The eigenvectors for a linear transformation matrix are the set of vectors that are only stretched, with no rotation or shear.

Brouwer fixed-point theorem

Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. (Bertus) Brouwer. It states that for any continuous function mapping a nonempty compact convex set to itself there is a point such that . The simplest forms of Brouwer's theorem are for continuous functions from a closed interval in the real numbers to itself or from a closed disk to itself. A more general form than the latter is for continuous functions from a nonempty convex compact subset of Euclidean space to itself.

Ergodicity & Mixing: Understanding Chaos

Explores ergodicity and mixing in dynamical systems to understand chaos and system behavior.

Smith Theory in Floer Persistence and Dynamics

Covers Smith theory in Floer persistence and dynamics, exploring classical mechanics invariants, Poincaré-Birkhoff theorem, and the Hofer-Zehnder conjecture.

Continuous Functions: Integrability and Examples

Explores continuous functions and integrability through practical examples.

Physique générale

Neuronal Dynamics - Computational Neuroscience of Single Neurons

The activity of neurons in the brain and the code used by these neurons is described by mathematical neuron models at different levels of detail.

Neuronal Dynamics - Computational Neuroscience of Single Neurons

The activity of neurons in the brain and the code used by these neurons is described by mathematical neuron models at different levels of detail.

Invariant integrals on topological groups

Vasco Schiavo

We generalize the fixed-point property for discrete groups acting on convex cones given by Monod in [23] to topological groups. At first, we focus on describing this fixed-point property from a functional point of view, and then we look at the class of groups that have it. Finally, we go through some applications of this fixed-point property. To accomplish these tasks, we introduce a new class of normed Riesz spaces that depend on group representation. (c) 2022 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Local Vulnerabilities and Global Robustness of Coupled Dynamical Systems on Complex Networks

Melvyn Sandy Tyloo

Coupled dynamical systems are omnipresent in everyday life. In general, interactions between individual elements composing the system are captured by complex networks. The latter greatly impact the way coupled systems are functioning and evolving in time. An important task in such a context, is to identify the most fragile components of a system in a fast and efficient manner. It is also highly desirable to have bounds on the amplitude and duration of perturbations that could potentially drive the system through a transition from one equi- librium to another. A paradigmatic model of coupled dynamical system is that of oscillatory networks. In these systems, a phenomenon known as synchronization where the individual elements start to behave coherently may occur if couplings are strong enough. We propose frameworks to assess vulnerabilities of such synchronous states to external perturbations. We consider transient excursions for both small-signal response and larger perturbations that can potentially drive the system out of its initial basin of attraction. In the first part of this thesis, we investigate the robustness of complex network-coupled oscillators. We consider transient excursions following external perturbations. For ensemble averaged perturbations, quite remarkably we find that robustness of a network is given by a family of network descriptors that we called generalized Kirchhoff indices and which are defined from extensions of the resistance distance to arbitrary powers of the Laplacian matrix of the system. These indices allow an efficient and accurate assessment of the overall vulnera- bility of an oscillatory network and can be used to compare robustness of different networks. Moreover, a network can be made more robust by minimizing its Kirchhoff indices. Then for specific local perturbations, we show that local vulnerabilities are captured by generalized resistance centralities also defined from extensions of the resistance distance. Most fragile nodes are therefore identified as the least central according to resistance centralities. Based on the latter, rankings of the nodes from most to least vulnerable can be established. In summary, we find that both local vulnerabilities and global robustness are accurately evaluated with resistance centralities and Kirchhoff indices. Moreover, the framework that we define is rather general and may be useful to analyze other coupled dynamical systems. In the second part, we focus on the effect of larger perturbations that eventually lead the sys- tem to an escape from its initial basin of attraction. We consider coupled oscillators subjected to noise with various amplitudes and correlation in time. To predict desynchronization and transitions between synchronous states, we propose a simple heuristic criterion based on the distance between the initial stable fixed point and the closest saddle point. Surprisingly, we find numerically that our criterion leads to rather accurate estimates for the survival probability and first escape time. Our criterion is general and may be applied to other dynamical systems.

EPFL2020

We investigate how probability tools can be useful to study representations of non-amenable groups. A suitable notion of "probabilistic subgroup" is proposed for locally compact groups, and is valuable to induction of representations. Nonamenable groups admit nonabelian free subgroups in that measure-theoretical sense. Consequences for affine actions and for unitarizability are then drawn. In particular, we obtain a new characterization of amenability via some affine actions on Hilbert spaces. Along the way, various fixed-point properties for groups are studied. We also give a survey of several useful facts about group representations on Banach spaces, continuity of group actions, compactness of convex hulls in locally convex spaces, and measurability pathologies in Banach spaces.

EPFL2017