{
  "id": "contraction-mapping",
  "title": "Contraction Mapping",
  "lang": "en",
  "source_lang": "en",
  "summary": "A contraction mapping uniformly reduces distances by a factor less than one, guaranteeing a unique fixed point when it maps a nonempty complete metric space into itself.",
  "category": "mathematics",
  "subcategory": "analysis",
  "type": "concept",
  "aliases": [
    "Contraction",
    "Contractive mapping",
    "Contractive map"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/contraction-mapping/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/contraction-mapping/",
      "json": "https://aiwiki.page/zh/contraction-mapping.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A contraction mapping is a function between metric spaces that reduces every distance by a common factor strictly less than one. Its importance lies in the connection between this quantitative condition and the existence of a fixed point: when a contraction maps a nonempty complete metric space into itself, repeated application converges to exactly one point that the mapping leaves unchanged. This principle provides both an existence theorem and a method for constructing solutions. (jirka.org)"
    },
    {
      "heading": "Definition and basic properties",
      "text": "Let \\((X,d_X)\\) and \\((Y,d_Y)\\) be metric spaces. A mapping \\(T:X\\to Y\\) is a contraction if there is a constant \\(q\\), with \\(0\\le q<1\\), such that\n\n\\[d_Y(Tx,Ty)\\le q\\,d_X(x,y) \\qquad\\text{for every }x,y\\in X.\\]\n\nThe number \\(q\\) is called a contraction constant; it need not be the smallest possible one. Thus a contraction has Lipschitz continuity with a constant below one, and consequently has uniform continuity. The fixed-point results concern self-maps \\(T:X\\to X\\), although the distance inequality also makes sense between different spaces. (jirka.org)\n\nThe uniform bound is crucial: merely decreasing each nonzero distance does not necessarily provide a single factor below one. A nonexpansive mapping, by comparison, satisfies the inequality with \\(q=1\\). Contractions need not be injective: a constant mapping is a contraction with \\(q=0\\). Contraction is also relative to the chosen metric, rather than a property of the underlying set alone. (kconrad.math.uconn.edu)"
    },
    {
      "heading": "Banach fixed-point theorem",
      "text": "The Banach fixed-point theorem, also called the contraction mapping principle, states that a contraction \\(T:X\\to X\\) on a nonempty complete metric space has a unique fixed point \\(p\\), satisfying \\(Tp=p\\). For every starting point \\(x_0\\in X\\), the fixed-point iteration\n\n\\[x_{n+1}=Tx_n\\]\n\nconverges to \\(p\\). Completeness means that every Cauchy sequence has a limit inside the space. The theorem applies to general metric spaces, not only to real numbers or finite-dimensional vectors. (jirka.org)\n\nThe proof combines geometric decay with completeness. Successive iterates satisfy\n\n\\[d(x_{n+1},x_n)\\le q^n d(x_1,x_0).\\]\n\nUsing the triangle inequality and summing a geometric series gives, for \\(m>n\\),\n\n\\[d(x_m,x_n)\\le \\frac{q^n}{1-q}d(x_1,x_0).\\]\n\nHence the iterates are Cauchy and converge to a point \\(p\\). Continuity yields \\(Tp=p\\). If \\(p\\) and \\(r\\) were both fixed points, then\n\n\\[d(p,r)=d(Tp,Tr)\\le q\\,d(p,r),\\]\n\nwhich forces \\(p=r\\). (kconrad.math.uconn.edu)"
    },
    {
      "heading": "Convergence and error estimates",
      "text": "Contraction iteration has a geometric error bound:\n\n\\[d(x_n,p)\\le q^n d(x_0,p).\\]\n\nA useful a priori estimate, expressed through the initial step, is\n\n\\[d(x_n,p)\\le \\frac{q^n}{1-q}d(x_1,x_0).\\]\n\nAn a posteriori estimate, using the latest computed step, is\n\n\\[d(x_n,p)\\le \\frac{q}{1-q}d(x_n,x_{n-1}), \\qquad n\\ge1.\\]\n\nThese bounds turn successive differences into certified error bounds, provided the contraction hypotheses hold. They also supply stopping criteria for a numerical algorithm without requiring knowledge of the exact fixed point. A smaller contraction constant generally gives a stronger guaranteed convergence rate; an upper bound close to one may be conservative. (people.math.ethz.ch)"
    },
    {
      "heading": "Examples and verification",
      "text": "For an affine mapping on the real line,\n\n\\[T(x)=ax+b,\\qquad |a|<1,\\]\n\nthe contraction constant is \\(|a|\\), and its fixed point is\n\n\\[p=\\frac{b}{1-a}.\\]\n\nIndeed, \\(x_n-p=a^n(x_0-p)\\), directly illustrating geometric convergence. (kconrad.math.uconn.edu)\n\nFor a differentiable real function on an interval, a uniform bound on its derivative,\n\n\\[|T'(x)|\\le q<1,\\]\n\nimplies the contraction inequality through the mean value theorem. Applying the fixed-point theorem additionally requires that the function map the chosen complete domain into itself. For example, \\(T(x)=\\cos x\\) maps \\([0,1]\\) into itself and has contraction constant \\(\\sin 1<1\\). Iterating cosine therefore converges to the unique solution of \\(x=\\cos x\\) in that interval. (math.tecnico.ulisboa.pt)"
    },
    {
      "heading": "Applications and limitations",
      "text": "In functional analysis, the points being iterated can themselves be functions. An important example is the Picard–Lindelöf theorem for a differential equation\n\n\\[y'(t)=f(t,y(t)),\\qquad y(t_0)=y_0.\\]\n\nOne replaces it with an integral equation and defines\n\n\\[(Ty)(t)=y_0+\\int_{t_0}^{t}f(s,y(s))\\,ds.\\]\n\nOn a suitable closed subset of the Banach space of continuous functions, a Lipschitz bound \\(L\\) in the dependent variable gives contraction constant at most \\(Lh\\), where \\(|t-t_0|\\le h\\). Choosing \\(h\\) sufficiently small and ensuring invariance establishes local existence and uniqueness. (jirka.org)\n\nThe assumptions cannot simply be omitted. As direct examples, \\(T(x)=x/2\\) is a contraction on the incomplete space \\((0,1)\\), but its only possible fixed point, zero, lies outside that space. On the complete space \\(\\mathbb R\\), \\(T(x)=x+1\\) is nonexpansive but has no fixed point. The identity mapping has every point fixed. These examples distinguish the necessity of completeness, invariance, and a uniform factor strictly below one in the theorem’s guarantee. (jirka.org)"
    }
  ],
  "links": [
    "mathematical-function",
    "metric-space",
    "fixed-point",
    "lipschitz-continuity",
    "uniform-continuity",
    "injective-function",
    "banach-fixed-point-theorem",
    "complete-metric-space",
    "fixed-point-iteration",
    "cauchy-sequence",
    "limit",
    "real-number",
    "mathematical-proof",
    "triangle-inequality",
    "geometric-series",
    "algorithm",
    "affine-map",
    "derivative",
    "mean-value-theorem",
    "functional-analysis",
    "differential-equation",
    "integral",
    "banach-space"
  ],
  "sources": [
    {
      "title": "jirka.org/ra/html/sec_metpicard.html",
      "url": "https://www.jirka.org/ra/html/sec_metpicard.html"
    },
    {
      "title": "kconrad.math.uconn.edu/blurbs/analysis/contraction.pdf",
      "url": "https://kconrad.math.uconn.edu/blurbs/analysis/contraction.pdf"
    },
    {
      "title": "people.math.ethz.ch/~grsam/NCSE20/NumCSE_Lecture_Document.pdf",
      "url": "https://people.math.ethz.ch/~grsam/NCSE20/NumCSE_Lecture_Document.pdf"
    },
    {
      "title": "math.tecnico.ulisboa.pt/~calves/MC/cap1uk.html",
      "url": "https://www.math.tecnico.ulisboa.pt/~calves/MC/cap1uk.html"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}