Lefschetz fixed-point theorem

In mathematics, the Lefschetz fixed-point theorem is a formula that counts the fixed points of a continuous mapping from a compact topological space to itself by means of traces of the induced mappings on the homology groups of . It is named after Solomon Lefschetz, who first stated it in 1926. The counting is subject to an imputed multiplicity at a fixed point called the fixed-point index. A weak version of the theorem is enough to show that a mapping without any fixed point must have rather special topological properties (like a rotation of a circle). For a formal statement of the theorem, let be a continuous map from a compact triangulable space to itself. Define the Lefschetz number of by the alternating (finite) sum of the matrix traces of the linear maps induced by on , the singular homology groups of with rational coefficients. A simple version of the Lefschetz fixed-point theorem states: if then has at least one fixed point, i.e., there exists at least one in such that . In fact, since the Lefschetz number has been defined at the homology level, the conclusion can be extended to say that any map homotopic to has a fixed point as well. Note however that the converse is not true in general: may be zero even if has fixed points, as is the case for the identity map on odd-dimensional spheres. First, by applying the simplicial approximation theorem, one shows that if has no fixed points, then (possibly after subdividing ) is homotopic to a fixed-point-free simplicial map (i.e., it sends each simplex to a different simplex). This means that the diagonal values of the matrices of the linear maps induced on the simplicial chain complex of must be all be zero. Then one notes that, in general, the Lefschetz number can also be computed using the alternating sum of the matrix traces of the aforementioned linear maps (this is true for almost exactly the same reason that the Euler characteristic has a definition in terms of homology groups; see below for the relation to the Euler characteristic).

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 concepts (4)

Related courses (31)

Related lectures (243)

Related MOOCs (3)

Lefschetz fixed-point theorem

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.

Algebraic topology

Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces. The basic goal is to find algebraic invariants that classify topological spaces up to homeomorphism, though usually most classify up to homotopy equivalence. Although algebraic topology primarily uses algebra to study topological problems, using topology to solve algebraic problems is sometimes also possible. Algebraic topology, for example, allows for a convenient proof that any subgroup of a free group is again a free group.

MATH-416: Abstract analysis on groups

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

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.

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

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.

Information Theory: Basics PHYS-512: Statistical physics of computation

Covers the basics of information theory, entropy, and fixed points in graph colorings and the Ising model.

Scaling & Renormalization in Statistical Mechanics PHYS-739: Conformal Field theory and Gravity

Explores scaling and renormalization in statistical mechanics, emphasizing critical points and invariant properties.

Physics Section 50 PHYS-101(g): General physics : mechanics

Covers the movement of a grinding wheel on a non-slip bearing and the physics of a rotating thin disc.