Math 2.0

definition

Contraction mapping

Definition

Let (X,d)(X, d) be a metric space. A map f ⁣:X→Xf \colon X \to X is a contraction when there is a real number kk with 0≤k<10 \le k < 1 such that d(f(x),f(y))≤k d(x,y)for all x,y∈X.d\bigl(f(x), f(y)\bigr) \le k \, d(x, y) \quad \text{for all } x, y \in X.

Remarks

A contraction is a Lipschitz map with a constant less than 11. Thus it is uniformly continuous. The map x↦x/2x \mapsto x/2 on R\mathbb{R} is a contraction with k=1/2k = 1/2. The condition d(f(x),f(y))<d(x,y)d(f(x), f(y)) < d(x, y) for all x≠yx \neq y is weaker. The map x↦x+1/xx \mapsto x + 1/x on [1,∞)[1, \infty) satisfies it, but it is not a contraction and has no fixed point.

Explanations

L1 human

A contraction pulls the points of the space closer together, each time by at least the same factor. If you apply it again and again, all points are pulled toward one point.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Contraction_mapping, lead section