Math 2.0

statement lemma

An iterate of the Picard operator is a contraction

Statement

Let ff satisfy the Picard–Lindelöf hypotheses at (t0,x0)(t_0, x_0) on J=[tmin⁡,tmax⁡]J = [t_{\min}, t_{\max}] with constants a,L,Ka, L, K. Let XX be the set of continuous curves γ:J→Rn\gamma : J \to \mathbb{R}^n with ∥γ(t)−x0∥≤a\|\gamma(t) - x_0\| \le a for each t∈Jt \in J, with the distance d(γ,δ)=sup⁡t∈J∥γ(t)−δ(t)∥d(\gamma, \delta) = \sup_{t \in J} \|\gamma(t) - \delta(t)\|. Let P:X→XP : X \to X be the Picard operator and let T=max⁡(tmax⁡−t0, t0−tmin⁡)T = \max(t_{\max} - t_0,\ t_0 - t_{\min}). Then for each integer m≥0m \ge 0 and all γ,δ∈X\gamma, \delta \in X, d(Pmγ,Pmδ)≤(KT)mm! d(γ,δ).d\left(P^m \gamma, P^m \delta\right) \le \frac{(K T)^m}{m!}\, d(\gamma, \delta). In particular, there is an m≥1m \ge 1 such that PmP^m is a contraction of XX: (KT)m/m!<1(KT)^m / m! < 1.

Remarks

Proof idea: by induction on mm, ∥(Pmγ)(t)−(Pmδ)(t)∥≤(K∣t−t0∣)mm! d(γ,δ)\|(P^m \gamma)(t) - (P^m \delta)(t)\| \le \frac{(K |t - t_0|)^m}{m!}\, d(\gamma, \delta) for each t∈Jt \in J. The induction step integrates the bound of the previous step. The space XX is a complete metric space. So the Banach fixed point theorem applies to PmP^m, and it gives a unique fixed point of PP. If KT<1K T < 1, then PP itself is a contraction. The power PmP^m avoids the need for a short time interval.

Explanations

L1 human

A contraction brings any two points closer by a fixed factor smaller than one. The Picard operator may not do this in one step, but after enough steps it does, because m!m! grows faster than (KT)m(KT)^m. That is enough to get a unique fixed 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 this needs

To read this node, read these 10 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Differential equation concept
  2. Function concept
  3. Interval concept
  4. Ordinary differential equation definition
  5. Lipschitz condition definition
  6. Solution of an ordinary differential equation definition
  7. Initial value problem definition
  8. Picard–Lindelöf hypotheses definition
  9. Picard operator definition
  10. An iterate of the Picard operator is a contraction statement

What depends on this

5 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Picard%E2%80%93Lindel%C3%B6f_theorem, Detailed proof