{
  "id": "brouwer-fixed-point-theorem",
  "title": "Brouwer Fixed-Point Theorem",
  "lang": "en",
  "source_lang": "en",
  "summary": "The Brouwer fixed-point theorem guarantees that every continuous self-map of a nonempty compact convex subset of finite-dimensional Euclidean space has a fixed point.",
  "category": "mathematics",
  "subcategory": "geometry",
  "type": "concept",
  "aliases": [
    "Brouwer's fixed-point theorem",
    "Brouwer fixed point theorem"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/brouwer-fixed-point-theorem/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/brouwer-fixed-point-theorem/",
      "json": "https://aiwiki.page/zh/brouwer-fixed-point-theorem.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The Brouwer fixed-point theorem is a fundamental result in topology stating that every continuous map from a nonempty compact convex subset of finite-dimensional Euclidean space to itself has a fixed point: a point that the map leaves unchanged. It is an existence theorem, requiring neither differentiability nor a contraction condition. It underlies many arguments about the existence of solutions to equations and equilibria, but does not by itself establish uniqueness or provide a convergent method for finding a fixed point."
    },
    {
      "heading": "Statement",
      "text": "Let \\(K\\subseteq\\mathbb{R}^n\\) be nonempty, compact, and convex. If\n\n\\[f:K\\longrightarrow K\\]\n\nis a continuous function, then there exists \\(x^*\\in K\\) such that\n\n\\[f(x^*)=x^*.\\]\n\nHere, \\(\\mathbb{R}^n\\) is finite-dimensional Euclidean space. Compactness is equivalent to being closed and bounded in this setting, by the Heine–Borel theorem. Convexity means that the line segment joining any two points of \\(K\\) lies entirely in \\(K\\).\n\nA standard formulation uses the closed unit ball\n\n\\[B^n=\\{x\\in\\mathbb{R}^n:\\|x\\|\\leq 1\\}.\\]\n\nEvery continuous map \\(B^n\\to B^n\\) has a fixed point. Equivalent formulations use the cube \\([0,1]^n\\) or an \\(n\\)-dimensional simplex.\n\nThe general compact-convex formulation follows from the ball formulation. Choose a closed ball \\(B\\) containing \\(K\\), and let \\(P_K:B\\to K\\) be the nearest-point projection, which is continuous for a nonempty closed convex set in Euclidean space. Apply the ball theorem to\n\n\\[x\\longmapsto f(P_K(x)).\\]\n\nAny resulting fixed point belongs to \\(K\\), where \\(P_K(x)=x\\), and is therefore a fixed point of \\(f\\)."
    },
    {
      "heading": "Low-dimensional interpretation",
      "text": "For an interval \\(K=[a,b]\\), the theorem follows from the intermediate value theorem. Set\n\n\\[g(x)=f(x)-x.\\]\n\nBecause \\(f\\) maps the interval into itself,\n\n\\[g(a)\\geq 0,\\qquad g(b)\\leq 0.\\]\n\nContinuity gives a point \\(c\\in[a,b]\\) with \\(g(c)=0\\), hence \\(f(c)=c\\).\n\nIn two dimensions, the theorem states that every continuous self-map of a closed disk has a fixed point. The map may stretch, fold, or collapse the disk; it need not preserve distances, area, or distinctness of points.\n\nThe conclusion is not limited to geometrically convex domains. If a space is homeomorphic to a closed ball, it also has the fixed-point property. Indeed, a homeomorphism transports any continuous self-map to a continuous self-map of the ball, and transports a fixed point back again."
    },
    {
      "heading": "Why the hypotheses matter",
      "text": "The theorem's assumptions cannot simply be discarded.\n\n- Without continuity: On \\([0,1]\\), define \\(f(0)=1\\) and \\(f(x)=0\\) for \\(x>0\\). This self-map has no fixed point.\n- Without closedness: The continuous map \\(f(x)=(x+1)/2\\) sends \\((0,1)\\) into itself, but its only possible fixed point is \\(1\\), outside the domain.\n- Without boundedness: The continuous map \\(f(x)=x+1\\) on \\(\\mathbb{R}\\) has no fixed point.\n- Without a suitable restriction on the domain's shape: A nontrivial rotation of a circle is a continuous self-map of a compact set with no fixed point.\n\nThese examples show that the stated assumptions are sufficient and cannot be removed indiscriminately. They do not mean that every set with the fixed-point property must itself be compact and convex.\n\nFinite dimensionality is also essential to this formulation. In the infinite-dimensional Hilbert space \\(\\ell^2\\), the closed unit ball admits the continuous self-map\n\n\\[F(x_1,x_2,\\ldots) = \\left(\\sqrt{1-\\|x\\|^2},x_1,x_2,\\ldots\\right).\\]\n\nIts image lies on the unit sphere. A fixed point would have all coordinates equal; square summability would force them all to be zero, contradicting the first-coordinate equation. Closed bounded sets in infinite-dimensional spaces need not be compact."
    },
    {
      "heading": "Proof through Sperner's lemma",
      "text": "One important proof uses Sperner's lemma, a combinatorial result about labeled subdivisions of a simplex.\n\nWrite the standard \\(n\\)-simplex as\n\n\\[\\Delta^n= \\left\\{x\\in\\mathbb{R}^{n+1}: x_i\\geq 0,\\ \\sum_{i=0}^{n}x_i=1\\right\\},\\]\n\nand let \\(f:\\Delta^n\\to\\Delta^n\\) be continuous.\n\nSubdivide the simplex into smaller simplices. If a subdivision vertex \\(v\\) is already fixed, the theorem is proved. Otherwise, assign \\(v\\) a label \\(i\\) for which\n\n\\[v_i>f_i(v).\\]\n\nSuch an index exists because the coordinates of \\(v\\) and \\(f(v)\\) both sum to \\(1\\): if the vectors differ, at least one coordinate of \\(v\\) must be larger.\n\nA vertex with \\(v_i=0\\) cannot receive label \\(i\\), since \\(f_i(v)\\geq 0\\). Thus the labeling satisfies Sperner's boundary condition: each vertex receives a label belonging to the face on which it lies. Sperner's lemma guarantees a small simplex whose vertices collectively have all labels \\(0,\\ldots,n\\).\n\nNow take subdivisions whose maximum simplex diameter tends to zero. For each subdivision, choose a fully labeled simplex and denote its vertex labeled \\(i\\) by \\(v_i^{(m)}\\). Compactness supplies a subsequence along which all these vertices converge to the same point \\(x^*\\). From\n\n\\[\\bigl(v_i^{(m)}\\bigr)_i> f_i\\bigl(v_i^{(m)}\\bigr)\\]\n\nand continuity, it follows that\n\n\\[x_i^*\\geq f_i(x^*)\\]\n\nfor every \\(i\\). Since both coordinate sums equal \\(1\\), all these inequalities must be equalities. Therefore \\(f(x^*)=x^*\\).\n\nThis proof illustrates how a finite combinatorial statement, combined with compactness and continuity, yields an exact existence result."
    },
    {
      "heading": "The no-retraction formulation",
      "text": "Another standard proof uses the no-retraction theorem: there is no continuous map\n\n\\[r:B^n\\to S^{n-1}\\]\n\nthat fixes every point of the boundary sphere \\(S^{n-1}\\).\n\nSuppose a continuous map \\(f:B^n\\to B^n\\) had no fixed point. For each \\(x\\), draw the ray starting at \\(f(x)\\), passing through \\(x\\), and continuing until it meets the boundary sphere. Let \\(r(x)\\) be that boundary intersection.\n\nBecause \\(f(x)\\neq x\\), this construction is well defined and continuous. When \\(x\\) already lies on the boundary, \\(r(x)=x\\). It would therefore define a forbidden retraction.\n\nConversely, a retraction \\(r:B^n\\to S^{n-1}\\) would produce the fixed-point-free map \\(x\\mapsto-r(x)\\). The Brouwer and no-retraction theorems are consequently equivalent. The impossibility of retraction can be established using algebraic topology, including homology."
    },
    {
      "heading": "Applications",
      "text": "Existence of solutions\n\nAn equation\n\n\\[F(x)=0\\]\n\ncan sometimes be rewritten as\n\n\\[x=T(x).\\]\n\nIf \\(T\\) continuously maps an appropriate nonempty compact convex set into itself, Brouwer's theorem establishes a solution.\n\nThe main work in such applications is usually finding an invariant set and proving that the proposed map stays inside it. Continuity alone, without this self-mapping condition, is insufficient.\n\nGame theory and equilibrium\n\nThe theorem is a central tool in game theory, especially in proofs of the existence of Nash equilibria in finite games.\n\nEach player's mixed strategies form a simplex, and the joint strategy space is a product of simplices, hence a compact convex set. A suitable continuous adjustment map can be constructed so that its fixed points are exactly equilibrium profiles.\n\nThe ordinary best-response rule is not generally a single-valued continuous function, so Brouwer's theorem cannot simply be applied to it directly. An alternative proof uses the Kakutani fixed-point theorem, which accommodates suitable set-valued maps.\n\nNonlinear analysis\n\nFinite-dimensional approximations of nonlinear equations often lead to maps on compact convex sets. Brouwer's theorem can establish solutions to these approximating problems. Additional estimates and convergence arguments are then required to pass to an infinite-dimensional limit."
    },
    {
      "heading": "Comparison with other fixed-point theorems",
      "text": "The Banach fixed-point theorem concerns a contraction mapping on a nonempty complete metric space. It guarantees a unique fixed point and convergence of successive iteration to that point.\n\nBrouwer's theorem requires no contraction estimate, but its conclusion is weaker:\n\n- A fixed point need not be unique; the identity map fixes every point.\n- Iteration need not converge. For \\(f(x)=1-x\\) on \\([0,1]\\), the unique fixed point is \\(1/2\\), but every other starting point alternates between two values.\n- The theorem supplies no general error bound or convergence rate.\n\nThe Schauder fixed-point theorem extends the compact-convex principle to infinite-dimensional settings. One standard version states that every continuous self-map of a nonempty compact convex subset of a Banach space has a fixed point. Other formulations use a closed bounded convex domain together with a compactness condition on the map."
    },
    {
      "heading": "Historical development",
      "text": "The theorem is named after the Dutch mathematician L. E. J. Brouwer, whose 1911 work established the general finite-dimensional result. Earlier contributions by Henri Poincaré and Piers Bohl addressed related fixed-point questions and special cases.\n\nBrouwer's theorem became a foundational result in topology and nonlinear analysis. Sperner's lemma, published in 1928, later supplied an influential combinatorial proof and connected the theorem with subdivision-based approximation methods."
    }
  ],
  "links": [
    "topology",
    "fixed-point",
    "compact-space",
    "convex-set",
    "continuous-function",
    "euclidean-space",
    "heine-borel-theorem",
    "simplex",
    "intermediate-value-theorem",
    "homeomorphism",
    "circle",
    "hilbert-space",
    "algebraic-topology",
    "game-theory",
    "nash-equilibrium",
    "mixed-strategy",
    "banach-fixed-point-theorem",
    "contraction-mapping",
    "banach-space"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}