# Brouwer fixed-point theorem

The **Brouwer fixed-point theorem** states that every continuous function from a nonempty compact convex subset of [Euclidean space](https://www.edgepedia.org/euclidean-space) into itself has at least one fixed point, a point that the function maps to itself<sup>[1](https://epubs.siam.org/doi/10.1137/1.9781611978247.ch12)</sup>. In its common special form, every continuous function \( f : [0,1]^{n} \to [0,1]^{n} \) has a point \( p \) with \( f(p) = p \)<sup>[2](https://link.springer.com/article/10.1365/s13291-021-00230-8)</sup>. L. E. J. Brouwer proved the result in 1911 as part of his work on the topology of Euclidean spaces, and it became one of the basic theorems of nonlinear functional analysis and a standard tool in analysis, economics, and game theory<sup>[1](https://epubs.siam.org/doi/10.1137/1.9781611978247.ch12)</sup><sup> • </sup><sup>[3](https://arxiv.org/abs/2607.05987)</sup>.

| Key fact | Detail |
|---|---|
| Statement | Every continuous mapping from a compact convex subset of \( \mathbb{R}^{n} \) into itself has at least one fixed point<sup>[1](https://epubs.siam.org/doi/10.1137/1.9781611978247.ch12)</sup> |
| Origin | Proved by L. E. J. Brouwer in 1911; Hadamard published a proof in 1910, informed by a letter from Brouwer, based on the Kronecker index<sup>[2](https://link.springer.com/article/10.1365/s13291-021-00230-8)</sup><sup> • </sup><sup>[4](https://www.mdpi.com/2227-7390/8/4/501)</sup> |
| Equivalent form | The no-retraction theorem: there is no continuous map from the \( n \)-ball onto its boundary that fixes the boundary pointwise; Borsuk observed in 1931 that each result implies the other<sup>[5](https://www.sciencedirect.com/topics/mathematics/brouwer-fixed-point-theorem)</sup> |
| Combinatorial route | Sperner's lemma yields a proof of the theorem via a compactness argument, but the two statements are not logically equivalent: Sperner's lemma holds over the rational numbers, while Brouwer's theorem requires completeness<sup>[6](https://arxiv.org/abs/2507.02366)</sup> |
| Constructive status | Brouwer himself rejected the theorem as constructively incorrect, since the fixed point cannot in general be found or approximated; he proved an approximate fixed-point theorem instead<sup>[7](https://www.sciencedirect.com/science/article/pii/S0304397511002787)</sup><sup> • </sup><sup>[2](https://link.springer.com/article/10.1365/s13291-021-00230-8)</sup> |
| Computational complexity | Computing an approximate Brouwer fixed point is PPAD-complete in two and in three or more dimensions; the query complexity on the \( n \)-cube is \( (1/\varepsilon)^{\Theta(n)} \)<sup>[8](https://eccc.weizmann.ac.il/report/2016/055/download/)</sup> |
| Main applications | Existence of Nash equilibria in game theory and of competitive equilibria in economics, via Brouwer's theorem and its Kakutani generalization<sup>[9](https://epubs.siam.org/doi/10.1137/1.9780898719239.ch3)</sup><sup> • </sup><sup>[10](https://doi.org/10.1073/pnas.36.1.48)</sup> |

## Statement and elementary cases

The theorem asserts that a continuous self-map of a compact [convex set](https://www.edgepedia.org/convex-set), such as the unit ball \( B^{n} \) or the cube \( [0,1]^{n} \), cannot move every point: some point satisfies \( f(x) = x \)<sup>[1](https://epubs.siam.org/doi/10.1137/1.9781611978247.ch12)</sup><sup> • </sup><sup>[2](https://link.springer.com/article/10.1365/s13291-021-00230-8)</sup>. In higher dimensions the result is considerably less trivial, and its proof requires topological input<sup>[11](https://math.uchicago.edu/~amathew/HMMT.pdf)</sup>.

The hypotheses matter.

## History

Brouwer proved the fixed-point theorem in 1911, in the same period as his proofs of the invariance of dimension and the invariance of domains<sup>[2](https://link.springer.com/article/10.1365/s13291-021-00230-8)</sup><sup> • </sup><sup>[13](https://mate.dm.uba.ar/~gminian/materias/topalg2023/sperner_ivanov.pdf)</sup>. A year earlier, [Jacques Hadamard](https://www.edgepedia.org/jacques-hadamard), informed by a letter from Brouwer of the statement, had published a proof based on the Kronecker index, a forerunner of the Brouwer topological degree, as an appendix to an analysis book of Tannery<sup>[4](https://www.mdpi.com/2227-7390/8/4/501)</sup>. The theorem seeded a branch of mathematics, fixed-point theory, and a family of related results: the Knaster–Kuratowski–Mazurkiewicz theorem of 1929 follows easily from the Brouwer degree, and the Lefschetz fixed-point theorem of 1926 has Brouwer's result as a special case<sup>[14](https://encyclopediaofmath.org/wiki/Brouwer_degree)</sup><sup> • </sup><sup>[15](https://encyclopediaofmath.org/wiki/Lefschetz_theorem)</sup>.

## Proofs and equivalent statements

**No-retraction route.** In 1931 [Karol Borsuk](https://www.edgepedia.org/karol-borsuk) observed that the fixed-point theorem is a consequence of, and in turn implies, the no-retraction theorem: there is no continuous map \( r : B^{n} \to \partial B^{n} \) with \( r(x) = x \) for all \( x \) on the boundary<sup>[5](https://www.sciencedirect.com/topics/mathematics/brouwer-fixed-point-theorem)</sup>. Intuitively, a disc cannot be continuously squashed onto its rim without tearing. If a continuous self-map of the ball had no fixed point, one could project each point along the segment from \( f(x) \) toward the boundary and obtain such a retraction, an impossible object<sup>[16](https://www.matpic.com/essays/something-always-stays-put/)</sup>. Brouwer's own proof ran through his degree theory for continuous maps<sup>[5](https://www.sciencedirect.com/topics/mathematics/brouwer-fixed-point-theorem)</sup>.

**Sperner's lemma.** [Sperner's lemma](https://www.edgepedia.org/sperners-lemma) is a combinatorial statement about coloring the vertices of a triangulated triangle or grid. In the two-dimensional grid version, each point of an \( N \times N \) grid is colored red, blue, or yellow subject to boundary conditions on each side, and the lemma guarantees at least one trichromatic small triangle; in fact an odd number of them<sup>[12](https://www.mit.edu/~6.7980/brouwer.html)</sup>. The lemma acts as a discretized version of the fixed-point theorem: coloring grid vertices according to the direction of \( f(z) - z \) for a continuous \( f : [0,1]^{2} \to [0,1]^{2} \), and refining the grid, produces approximate fixed points, and a compactness argument delivers the exact fixed point<sup>[12](https://www.mit.edu/~6.7980/brouwer.html)</sup>. This proof can be run as an algorithm and locates a point moved by less than any specified tolerance<sup>[16](https://www.matpic.com/essays/something-always-stays-put/)</sup>.

The two statements are often presented as equivalent, but the relationship is subtler. Each can be derived from the other, yet they are not logically equivalent: Junichi Minagawa showed in 2025 that Sperner's lemma holds in the ordered field of rational numbers, whereas proving Brouwer's theorem requires completeness of the reals<sup>[6](https://arxiv.org/abs/2507.02366)</sup>. On a [MathOverflow](https://www.edgepedia.org/mathoverflow) discussion of the question, the practical view is that only one further step, compactness, is needed to pass from Sperner to Brouwer<sup>[17](https://mathoverflow.net/questions/131413/in-what-rigorous-sense-are-sperners-lemma-and-the-brouwer-fixed-point-theorem-e)</sup>.

**Topology behind the combinatorics.** Nikolai V. Ivanov, a mathematician at [Rice University](https://www.edgepedia.org/rice-university), showed that the combinatorial proof of Sperner's lemma can be read as a cochain-level version, written in combinatorial language, of a standard cohomological argument, and that the deduction of Brouwer's theorem from Sperner's lemma parallels the usual deduction from the no-retraction theorem and relates to simplicial approximation<sup>[18](https://arxiv.org/abs/0906.5193)</sup>.

## Constructive content

The theorem is an existence statement: it guarantees a solution but does not provide one, and it is not constructive<sup>[9](https://epubs.siam.org/doi/10.1137/1.9780898719239.ch3)</sup>. Brouwer, who developed intuitionistic mathematics after his topological work, knew his own theorem to be constructively false and answered the question "is the fixed point theorem correct?" with a point-blank "no"; from the intuitionistic viewpoint the promised fixed point cannot in general be found or approximated<sup>[7](https://www.sciencedirect.com/science/article/pii/S0304397511002787)</sup>. He had used the principle of the excluded middle in his topology papers, and he formulated and proved an approximate fixed-point theorem instead<sup>[2](https://link.springer.com/article/10.1365/s13291-021-00230-8)</sup>.

The non-constructivity has precise computational form. The counter-examples of Orevkov and Baigger show that there is no general procedure for finding the fixed point: there exists a computable continuous function on the unit ball that fixes no computable point<sup>[19](https://arxiv.org/abs/0804.3199)</sup>. Constructive mathematics recovers usable versions: an approximate fixed-point theorem for simplices via Sperner's lemma is part of the folklore of the field, and constructive proofs restrict attention to uniformly continuous functions<sup>[20](https://math.hawaii.edu/home/jla/157-495-1-PB.pdf)</sup><sup> • </sup><sup>[21](https://arxiv.org/abs/1611.02531)</sup>.

## Computational complexity

Finding an approximate Brouwer fixed point is genuinely hard in the complexity-theoretic sense. [Christos Papadimitriou](https://www.edgepedia.org/christos-papadimitriou), a professor of computer science at Columbia University, proved in 1994 that the problem is complete for the class PPAD in three or more dimensions, and the two-dimensional version is also PPAD-complete<sup>[8](https://eccc.weizmann.ac.il/report/2016/055/download/)</sup>. In the black-box query model, Hirsch, Papadimitriou, and Vavasis proved in 1989 that every deterministic algorithm computing an \( \varepsilon \)-approximate fixed point of a function on the \( n \)-dimensional cube has worst-case query complexity \( (1/\varepsilon)^{\Theta(n)} \), even when the function has a Lipschitz constant arbitrarily close to 1<sup>[8](https://eccc.weizmann.ac.il/report/2016/055/download/)</sup>.

Algorithmic work on the problem goes back to [Herbert Scarf](https://www.edgepedia.org/herbert-scarf), who in 1967 adapted ideas of Lemke and Howson to obtain an exponential-time algorithm for computing approximate fixed points<sup>[8](https://eccc.weizmann.ac.il/report/2016/055/download/)</sup>. The combinatorial structure underlying these reductions is the parity argument behind Sperner's lemma: in a standard lecture treatment, Brouwer reduces to Sperner, which reduces to finding odd-degree vertices in directed graphs, and reductions also run in reverse, which explains the computational difficulty of [Nash equilibrium](https://www.edgepedia.org/nash-equilibrium) computation<sup>[12](https://www.mit.edu/~6.7980/brouwer.html)</sup>. Recent proof-assistant work has formalized a complete combinatorial route from Scarf's theorem through Brouwer's theorem to the existence of mixed Nash equilibria in the Lean 4 system<sup>[3](https://arxiv.org/abs/2607.05987)</sup>.

## Applications

**Game theory.** [John von Neumann](https://www.edgepedia.org/john-von-neumann) used the Brouwer fixed-point theorem to prove the basic theorem of zero-sum two-person games, and [John F. Nash Jr.](https://www.edgepedia.org/john-f-nash-jr) used fixed-point theorems to prove the existence of equilibria in many-person games<sup>[9](https://epubs.siam.org/doi/10.1137/1.9780898719239.ch3)</sup>. Nash's 1950 PNAS note modeled mixed strategy profiles as points in a product of simplices and applied Kakutani's theorem, a generalization of Brouwer's theorem to set-valued maps, crediting [David Gale](https://www.edgepedia.org/david-gale) for suggesting that simplification<sup>[10](https://doi.org/10.1073/pnas.36.1.48)</sup>. His 1951 Annals paper gave a direct proof via Brouwer's theorem: since the space of strategy n-tuples is a cell, a suitable continuous map must have a fixed point, which is an equilibrium point<sup>[22](https://metaphor.ethz.ch/x/2025/hs/401-3005-00L/texts/classic/nash_1951_noncooperative_games.pdf)</sup>. Kakutani's theorem is classically equivalent to Brouwer's<sup>[21](https://arxiv.org/abs/1611.02531)</sup>.

**Economics.** [Gerard Debreu](https://www.edgepedia.org/gerard-debreu)'s 1952 social equilibrium existence theorem, proved with fixed-point methods, was used by [Kenneth Arrow](https://www.edgepedia.org/kenneth-arrow) and Debreu to prove the existence of equilibrium for a classical competitive economic system, and contains as special cases the existence of equilibrium points for N-person games and solutions for zero-sum two-person games<sup>[23](https://doi.org/10.1073%2Fpnas.38.10.886)</sup>. In functional analysis, Schauder's theorem extends Brouwer's result to compact convex subsets of arbitrary Banach spaces, where the fixed "point" may be a function solving a nonlinear integral or partial differential equation<sup>[24](https://encyclopediaofmath.org/wiki/Schauder_theorem)</sup><sup> • </sup><sup>[9](https://epubs.siam.org/doi/10.1137/1.9780898719239.ch3)</sup>.

## References

1. [Chapter 12, "Great Theorems" of Nonlinear Functional Analysis, in P. G. Ciarlet, Linear and Nonlinear Functional Analysis with Applications, 2nd ed., SIAM, 2025](https://epubs.siam.org/doi/10.1137/1.9781611978247.ch12)
2. [Intuitionism: An Inspiration? Jahresbericht der DMV (2021)](https://link.springer.com/article/10.1365/s13291-021-00230-8)
3. [Y. Lyu and K. Li, Formalizing Scarf, Brouwer, and Nash in Lean, arXiv:2607.05987](https://arxiv.org/abs/2607.05987)
4. [Variations on the Brouwer Fixed Point Theorem: A Survey, Mathematics 8(4):501 (2020)](https://www.mdpi.com/2227-7390/8/4/501)
5. [Brouwer Fixed Point Theorem, ScienceDirect Topics overview](https://www.sciencedirect.com/topics/mathematics/brouwer-fixed-point-theorem)
6. [J. Minagawa, On the (in)equivalence of Brouwer's fixed point theorem and Sperner's lemma, arXiv:2507.02366 (2025)](https://arxiv.org/abs/2507.02366)
7. [Brouwer's ε-fixed point and Sperner's lemma, Theoretical Computer Science 412:3140–3144 (2011)](https://www.sciencedirect.com/science/article/pii/S0304397511002787)
8. [Communication and query complexity of approximate Brouwer fixed points, ECCC Report No. 55 (2016)](https://eccc.weizmann.ac.il/report/2016/055/download/)
9. [J. N. Franklin, Methods of Mathematical Economics, Chapter 3: Fixed-Point Theorems, SIAM](https://epubs.siam.org/doi/10.1137/1.9780898719239.ch3)
10. [J. F. Nash, Jr., Equilibrium points in n-person games, PNAS 36(1):48–49 (1950)](https://doi.org/10.1073/pnas.36.1.48)
11. [Sperner's Lemma, Brouwer's fixed-point theorem, HMMT lecture notes, University of Chicago](https://math.uchicago.edu/~amathew/HMMT.pdf)
12. [MIT 6.7980, Lecture 2: Brouwer and Sperner](https://www.mit.edu/~6.7980/brouwer.html)
13. [Sperner's lemma, Brouwer's fixed-point theorem, and cohomology (Ivanov), course copy, Universidad de Buenos Aires](https://mate.dm.uba.ar/~gminian/materias/topalg2023/sperner_ivanov.pdf)
14. [Brouwer degree, Encyclopedia of Mathematics](https://encyclopediaofmath.org/wiki/Brouwer_degree)
15. [Lefschetz theorem, Encyclopedia of Mathematics](https://encyclopediaofmath.org/wiki/Lefschetz_theorem)
16. [Something always stays put, Matpic essay](https://www.matpic.com/essays/something-always-stays-put/)
17. [In what rigorous sense are Sperner's Lemma and the Brouwer Fixed Point Theorem equivalent?, MathOverflow](https://mathoverflow.net/questions/131413/in-what-rigorous-sense-are-sperners-lemma-and-the-brouwer-fixed-point-theorem-e)
18. [N. V. Ivanov, Sperner's Lemma, Brouwer's fixed-point theorem, and cohomology, arXiv:0906.5193 (2009)](https://arxiv.org/abs/0906.5193)
19. [Computable counter-examples to the Brouwer fixed-point theorem, arXiv:0804.3199](https://arxiv.org/abs/0804.3199)
20. [M. Hendtlass, Fixed point theorems in constructive mathematics, Journal of Logic & Analysis 4:10 (2012)](https://math.hawaii.edu/home/jla/157-495-1-PB.pdf)
21. [M. Hendtlass, Kakutani's fixed point theorem in constructive mathematics, arXiv:1611.02531 (2016)](https://arxiv.org/abs/1611.02531)
22. [J. F. Nash, Jr., Non-Cooperative Games, Annals of Mathematics 54:286–295 (1951)](https://metaphor.ethz.ch/x/2025/hs/401-3005-00L/texts/classic/nash_1951_noncooperative_games.pdf)
23. [G. Debreu, A Social Equilibrium Existence Theorem, PNAS 38(10):886–893 (1952)](https://doi.org/10.1073%2Fpnas.38.10.886)
24. [Schauder theorem, Encyclopedia of Mathematics](https://encyclopediaofmath.org/wiki/Schauder_theorem)

---
*Topic: Encyclopedia › Physical world and mathematics › Mathematics and statistics › Geometry and topology › General and set-theoretic topology*

*Initially written Sep 17, 2026 · Reviewed: Sep 30, 2026; Oct 15, 2026 · Edited: Sep 30, 2026; Oct 15, 2026 · Last review: Oct 15, 2026*

*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*

License: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license