Brouwer fixed point theorem

related topics
{math, number, function}
{math, energy, light}
{@card@, make, design}
{game, team, player}

Brouwer's fixed point theorem is a fixed point theorem in topology, named after Luitzen Brouwer. It states that for any continuous function f with certain properties there is a point x0 such that f(x0) = x0. The simplest form of Brouwer's theorem is for continuous functions f from a disk D to itself. A more general form is for continuous functions from a convex compact subset K of Euclidean space to itself.

Among hundreds of fixed point theorems,[1] Brouwer's is particularly well known, due in part to its use across numerous fields of mathematics. In its original field, this result is one of the key theorems characterizing the topology of Euclidean spaces, along with the Jordan curve theorem, the hairy ball theorem or the Borsuk–Ulam theorem.[2] This gives it a place among the fundamental theorems of topology.[3] The theorem is also used for proving deep results about differential equations and is covered in most introductory courses on differential geometry. It appears in unlikely fields such as game theory. In economics, Brouwer's fixed point theorem and its extension, the Kakutani fixed point theorem, play a central role in the proof of existence of general equilibrium in market economies as developed in the 1950s by economics Nobel prize winners Gerard Debreu and Kenneth Arrow.

The theorem was first studied in view of work on differential equations by the French mathematicians around Poincaré and Picard. Proving results such as the Poincaré–Bendixson theorem requires the use of topological methods. This work at the end of the 19th century opened into several successive versions of the theorem. The general case was first proved in 1910 by Hadamard, and then in 1912 by Luitzen Egbertus Jan Brouwer.


Full article ▸

related documents
Naive Bayes classifier
Pell's equation
Shell sort
Tree automaton
Root-finding algorithm
Delaunay triangulation
Scientific notation
Symmetric matrix
Fundamental theorem of arithmetic
Analytic function
Selection sort
Tangent space
Uniform convergence
Binomial theorem
Burnside's problem
Affine transformation
Finite state machine
Sufficiency (statistics)
Polish notation
Greatest common divisor
Knapsack problem
Brute force attack
Grover's algorithm