Math 2.0

statement proposition

Time translation of solutions of an autonomous system

Statement

Let UU be an open subset of Rn\mathbb{R}^n, let f:U→Rnf : U \to \mathbb{R}^n be a function. Let γ:I→U\gamma : I \to U be a solution of the autonomous system x′=f(x)x' = f(x) on an interval II. Let c∈Rc \in \mathbb{R} and let I−c={t−c:t∈I}I - c = \{t - c : t \in I\}. Then the function δ:I−c→U\delta : I - c \to U given by δ(t)=γ(t+c)\delta(t) = \gamma(t + c) is also a solution of x′=f(x)x' = f(x).

Remarks

Proof: by the chain rule, δ′(t)=γ′(t+c)=f(γ(t+c))=f(δ(t))\delta'(t) = \gamma'(t + c) = f(\gamma(t + c)) = f(\delta(t)). So it is enough to solve an initial value problem with initial time 00. The solution with x(t0)=x0x(t_0) = x_0 is t↦φ(t−t0)t \mapsto \varphi(t - t_0), where φ\varphi solves x(0)=x0x(0) = x_0. The result fails for non-autonomous equations. For x′=tx' = t, the solution t2/2t^2/2 is a solution, but (t+1)2/2(t+1)^2/2 is not.

Explanations

L1 human

If the law of motion does not change with time, a motion that starts later is the same motion, only delayed. So shifting a solution in time gives another 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 7 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. Solution of an ordinary differential equation definition
  6. Autonomous system definition
  7. Time translation of solutions of an autonomous system statement

Sources

  1. Web https://en.wikipedia.org/wiki/Autonomous_system_(mathematics), Properties