Math 2.0

definition

Picard–Lindelöf hypotheses

Definition

Let tmin⁡≤t0≤tmax⁡t_{\min} \le t_0 \le t_{\max} be real numbers, let J=[tmin⁡,tmax⁡]J = [t_{\min}, t_{\max}], let x0∈Rnx_0 \in \mathbb{R}^n, and let a,L,K≥0a, L, K \ge 0. Let B={x∈Rn:∥x−x0∥≤a}B = \{x \in \mathbb{R}^n : \|x - x_0\| \le a\}, and let f:J×Rn→Rnf : J \times \mathbb{R}^n \to \mathbb{R}^n be a function. The function ff satisfies the Picard–Lindelöf hypotheses at (t0,x0)(t_0, x_0) with constants a,L,Ka, L, K if these four conditions hold. (1) For each t∈Jt \in J, the map x↦f(t,x)x \mapsto f(t, x) is KK-Lipschitz on BB (Lipschitz condition). (2) For each x∈Bx \in B, the map t↦f(t,x)t \mapsto f(t, x) is continuous on JJ. (3) For each t∈Jt \in J and x∈Bx \in B, ∥f(t,x)∥≤L\|f(t, x)\| \le L. (4) L⋅max⁡(tmax⁡−t0, t0−tmin⁡)≤aL \cdot \max(t_{\max} - t_0,\ t_0 - t_{\min}) \le a.

Remarks

Conditions (1) and (2) together imply that ff is continuous on J×BJ \times B. Condition (4) makes the time interval short enough. A curve that starts at x0x_0 with speed at most LL cannot leave BB during the time interval JJ. Under these hypotheses, the Picard–Lindelöf theorem gives a unique solution of x′=f(t,x)x' = f(t, x), x(t0)=x0x(t_0) = x_0 on JJ. A C1C^1 vector field satisfies these hypotheses on a small time interval.

Explanations

L1 human

These are the conditions that make the proof of existence and uniqueness work. The field must be continuous in time, Lipschitz in space and bounded near the start point. The time interval must be so short that the solution stays in the region where we control the field.

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

What depends on this

9 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
  2. Web https://en.wikipedia.org/wiki/Picard%E2%80%93Lindel%C3%B6f_theorem, Optimization of the solution's interval