Math 2.0

definition

Picard operator

Definition

Let J=[tmin⁡,tmax⁡]J = [t_{\min}, t_{\max}], let t0∈Jt_0 \in J and let x0∈Rnx_0 \in \mathbb{R}^n. Let f:J×Rn→Rnf : J \times \mathbb{R}^n \to \mathbb{R}^n be a function such that s↦f(s,γ(s))s \mapsto f(s, \gamma(s)) is integrable on JJ for each continuous γ:J→Rn\gamma : J \to \mathbb{R}^n. The Picard operator of ff at (t0,x0)(t_0, x_0) maps a continuous curve γ:J→Rn\gamma : J \to \mathbb{R}^n to the curve Pγ:J→RnP\gamma : J \to \mathbb{R}^n given by (Pγ)(t)=x0+∫t0tf(s,γ(s))ds.(P \gamma)(t) = x_0 + \int_{t_0}^{t} f\left(s, \gamma(s)\right) ds.

Remarks

Assume the Picard–Lindelöf hypotheses with constants a,L,Ka, L, K. Then PP maps the continuous curves with values in the closed ball ∥x−x0∥≤a\|x - x_0\| \le a to curves in this ball. A fixed point of PP is a solution of the initial value problem. See the integral equation form. Picard iteration applies PP again and again, starting from the constant curve x0x_0.

Explanations

L1 human

The operator takes a guess for the solution and makes a new guess. It integrates the field along the old guess, starting from x0x_0. A curve that the operator does not change is a solution.

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 9 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

What depends on this

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

Sources

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