Math 2.0

statement theorem

Picard–Lindelöf theorem

Statement

Let J=[tmin⁡,tmax⁡]J = [t_{\min}, t_{\max}] and t0∈Jt_0 \in J, let x0∈Rnx_0 \in \mathbb{R}^n, and let f:J×Rn→Rnf : J \times \mathbb{R}^n \to \mathbb{R}^n satisfy the Picard–Lindelöf hypotheses at (t0,x0)(t_0, x_0) with constants a,L,Ka, L, K. Let BB be the closed ball of radius aa around x0x_0. Then there is exactly one continuous curve α:J→B\alpha : J \to B with α(t0)=x0\alpha(t_0) = x_0 and with this property. For each t∈Jt \in J, α\alpha has the derivative f(t,α(t))f(t, \alpha(t)) at tt within JJ.

Remarks

The proof uses the integral equation form and the fact that an iterate of the Picard operator is a contraction. The limit of Picard iteration is the solution. A common form: let ff be continuous on a neighbourhood of (t0,x0)(t_0, x_0) and locally Lipschitz in xx. Then the initial value problem has a unique solution on [t0−ε,t0+ε][t_0 - \varepsilon, t_0 + \varepsilon] for some ε>0\varepsilon > 0. The theorem is local. For x′=1+x2x' = 1 + x^2, x(0)=0x(0) = 0, the solution tan⁡t\tan t exists only for ∣t∣<π/2|t| < \pi/2. Without the Lipschitz condition, solutions exist by the Peano existence theorem, but they need not be unique. See the non-uniqueness example.

History

The theorem is named after Émile Picard and Ernst Lindelöf. It is also called the Cauchy–Lipschitz theorem, after Augustin-Louis Cauchy and Rudolf Lipschitz.

Explanations

L1 human

If the vector field is regular enough, the present state determines the whole motion near the start time. Regular enough means continuous in time and Lipschitz in the state. Then there is one and only one solution through the initial point, at least for a short time.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (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 12 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. Integral equation form of an initial value problem statement
  11. An iterate of the Picard operator is a contraction statement
  12. Picard–Lindelöf theorem statement

What depends on this

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

Sources

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