Consider the following system of ODE:
$$\begin{array}{ll}\ddot y + y + \ddot x + x = 0 \\ y+\dot x - x = 0 \end{array}$$
Question: How many initial conditions are required to determine a unique solution?
A naive reasoning leads to four: $y(0),\dot y(0), x(0)$ and $\dot x(0)$. However, if we write the system in a first-order form:
$$\begin{bmatrix} 1 & 0 & 0 & 0 \\ 1 & 0 & 1 & 0 \\ 0 & 0 & 1 & 0 \\ 1 & 0 & 0 & 0 \end{bmatrix} \begin{bmatrix} \dot x \\ \ddot x \\ \dot y \\ \ddot y\end{bmatrix} = \begin{bmatrix} 0 & 1 & 0 & 0 \\ -1 & 0 & -1 & 0 \\ 0 & 0 & 0 & 1\\ 1 & 0 & -1 & 0 \end{bmatrix}\begin{bmatrix} x \\ \dot x \\ y \\ \dot y\end{bmatrix}$$
the left matrix is not of full rank, which means the equations are not all independent. Indeed, by differentiating the second equation: $\dot y + \ddot x -\dot x=0$ which leads to $\ddot y + y + \dot x - \dot y + x =0$, or, in the first-order form: $$ \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 1 & 0 & 1 \end{bmatrix} \begin{bmatrix} \dot x \\ \dot y \\ \ddot y \end{bmatrix} = \begin{bmatrix} 1 & -1 & 0 \\ 0 & 0 & 1 \\ -1 & -1 & 1 \end{bmatrix} \begin{bmatrix} x \\ y \\ \dot y \end{bmatrix}$$
With the above form, it shows only three initial conditions are required: $x(0),y(0),\dot y(0)$.
And, what if I had:
$$\begin{array}{ll}\ddot y + y + x^{(n)} + x = 0 \\ \dot x - x = 0 \end{array}$$
for some $n$. Then, I could solve the second equation for some $x(0)$, then differentiate $x$ $n$ times and inject in the first equation, so only $x(0), y(0), \dot y(0)$ are needed. Can this be seen directly, in a robust manner?