Math 2.0

Ordinary differential equations Proof

Proof of the reduction of a higher-order equation to a first-order system

Builds on Solution of an ordinary differential equationOrdinary differential equation

Proof

  1. By the definition of a solution of the equation, y:I→ℝy : I \to \R solves y(n)=f(x,y,…,y(n−1))y^{(n)} = f\left(x, y, \dots, y^{(n-1)}\right) on II when three things hold. The function yy is nn times differentiable on II. For each x∈Ix \in I, the point (x,y(x),…,y(n−1)(x))\left(x, y(x), \dots, y^{(n-1)}(x)\right) lies in UU. For each x∈Ix \in I, y(n)(x)=f(x,y(x),…,y(n−1)(x))y^{(n)}(x) = f\left(x, y(x), \dots, y^{(n-1)}(x)\right).
  2. In the same way, z=(z1,…,zn):I→ℝnz = (z_1, \dots, z_n) : I \to \R^n solves the system on II when three things hold. The function zz is differentiable on II. For each x∈Ix \in I, (x,z(x))∈U(x, z(x)) \in U, and the nn equations of the system hold at xx.
  3. Let yy solve the equation on II, and set zk=y(k−1)z_k = y^{(k-1)} for k=1,…,nk = 1, \dots, n. Since k−1≤n−1k - 1 \le n - 1, each zkz_k is differentiable on II, with zk′=y(k)z_k' = y^{(k)}.
  4. For k=1,…,n−1k = 1, \dots, n - 1, this gives zk′=y(k)=zk+1z_k' = y^{(k)} = z_{k+1}.
  5. For k=nk = n, step 1 gives zn′=y(n)=f(x,y,…,y(n−1))=f(x,z1,…,zn)z_n' = y^{(n)} = f\left(x, y, \dots, y^{(n-1)}\right) = f(x, z_1, \dots, z_n) on II.
  6. Also (x,z(x))=(x,y(x),…,y(n−1)(x))∈U(x, z(x)) = \left(x, y(x), \dots, y^{(n-1)}(x)\right) \in U for each x∈Ix \in I. By step 2, zz solves the system on II.
  7. Conversely, let zz solve the system on II, and set y=z1y = z_1. We show by induction on kk that yy is k−1k - 1 times differentiable with y(k−1)=zky^{(k-1)} = z_k, for k=1,…,nk = 1, \dots, n.
  8. For k=1k = 1 this is the definition y=z1y = z_1.
  9. Let 1≤k<n1 \le k < n and assume y(k−1)=zky^{(k-1)} = z_k. The function zkz_k is differentiable with zk′=zk+1z_k' = z_{k+1}. So y(k−1)y^{(k-1)} is differentiable and y(k)=zk+1y^{(k)} = z_{k+1}. This completes the induction.
  10. In particular y(n−1)=zny^{(n-1)} = z_n, and znz_n is differentiable. So yy is nn times differentiable on II, and y(n)=zn′y^{(n)} = z_n'.
  11. By the last equation of the system, y(n)=zn′=f(x,z1,…,zn)=f(x,y,…,y(n−1))y^{(n)} = z_n' = f(x, z_1, \dots, z_n) = f\left(x, y, \dots, y^{(n-1)}\right) on II.
  12. By steps 7 to 9, (x,y(x),…,y(n−1)(x))=(x,z(x))∈U\left(x, y(x), \dots, y^{(n-1)}(x)\right) = (x, z(x)) \in U for each x∈Ix \in I. So yy solves the equation on II, and zk=y(k−1)z_k = y^{(k-1)} for k=1,…,nk = 1, \dots, n.

Idea

The new unknowns zkz_k are names for the derivatives y(k−1)y^{(k-1)}. The first n−1n - 1 equations of the system say exactly that each name is the derivative of the previous one. The last equation is the original equation, written in the new names.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • 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. Proof of the reduction of a higher-order equation to a first-order system proof

Where this leads

56 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Ordinary_differential_equation, Reduction to a first-order system
About this page
TagPGAEBXP9WZ
URIm2://PGAEBXP9WZ
Kindproof
WritingW0 stub
MSC34A99
ProvesReduction of a higher-order equation to a first-order system
UsesSolution of an ordinary differential equation, Ordinary differential equation
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

No page links to this page yet.