A differential equation is an equation relating an unknown function to its derivatives.

Let EE be a differential equation. The equation EE is an ordinary differential equation if and only if the unknown function has one independent variable. The equation EE is a partial differential equation if and only if the unknown function has several independent variables, so that partial derivatives appear.

Let EE be a differential equation. The order of EE is the order of the highest derivative in it.

Let I⊆RI\subseteq\mathbb{R} be an interval and FF be a function of n+1n+1 real variables. An ordinary differential equation of order nn in normal form is an equation that expresses the highest derivative of the unknown yy in terms of xx and the lower derivatives.

y(n)=F(x,y,y′,…,y(n−1))y^{(n)}=F\left(x,y,y',\ldots,y^{(n-1)}\right)

Let y(n)=F(x,y,y′,…,y(n−1))y^{(n)}=F\left(x,y,y',\ldots,y^{(n-1)}\right) be an ordinary differential equation of order nn on an interval I.I. A solution of the equation on II is a function y:I→Ry:I\rightarrow\mathbb{R} that is nn times differentiable on II and satisfies the equation at every x∈I.x\in I. The graph of a solution is an integral curve.

Let EE be an ordinary differential equation of order n.n. A general solution of EE is a family of solutions depending on nn arbitrary constants that contains every solution, or every solution but finitely many. A particular solution of EE is one member of the family. A singular solution of EE is a solution that is not a member of the family. For example, y′=yy'=y has general solution y=C exy=C\,e^x for C∈R,C\in\mathbb{R}, since (y e−x)′=0\left(y\,e^{-x}\right)'=0 for every solution.

Let y(n)=F(x,y,y′,…,y(n−1))y^{(n)}=F\left(x,y,y',\ldots,y^{(n-1)}\right) be an ordinary differential equation on an interval I.I. The equation is linear if and only if FF is a linear function of y,y′,…,y(n−1),y,y',\ldots,y^{(n-1)}, so that it can be written with coefficient functions a0,…,an−1a_0,\ldots,a_{n-1} and a forcing function gg defined on I.I.

y(n)+an−1(x) y(n−1)+⋯+a1(x) y′+a0(x) y=g(x)y^{(n)}+a_{n-1}(x)\,y^{(n-1)}+\cdots+a_1(x)\,y'+a_0(x)\,y=g(x)

The equation is non-linear if and only if it is not linear.

Let EE be a linear ordinary differential equation with forcing function gg and coefficient functions a0,…,an−1.a_0,\ldots,a_{n-1}. The equation EE is homogeneous if and only if g=0,g=0, and inhomogeneous otherwise. The equation EE has constant coefficients if and only if every aia_i is constant.

Let y(n)=F(x,y,y′,…,y(n−1))y^{(n)}=F\left(x,y,y',\ldots,y^{(n-1)}\right) be an ordinary differential equation. The equation is autonomous if and only if FF does not depend on x.x. If yy is a solution of an autonomous equation then every translate x↦y(x−c)x\mapsto y\left(x-c\right) is a solution.

Let y(n)=F(x,y,y′,…,y(n−1))y^{(n)}=F\left(x,y,y',\ldots,y^{(n-1)}\right) be an ordinary differential equation of order nn in normal form and y‾=(y,y′,…,y(n−1)).\underline{y}=\left(y,y',\ldots,y^{(n-1)}\right). The first-order system equivalent to the equation is the system of nn first-order equations

y‾′=F‾(x,y‾),F‾(x,y‾)=(y2,…,yn,F(x,y1,…,yn)).\underline{y}'=\underline{F}\left(x,\underline{y}\right),\qquad\underline{F}\left(x,\underline{y}\right)=\left(y_2,\ldots,y_n,F\left(x,y_1,\ldots,y_n\right)\right).

Results about first-order systems with y‾∈Rn\underline{y}\in\mathbb{R}^n therefore apply to equations of every order.

Let y‾′=F‾(x,y‾)\underline{y}'=\underline{F}\left(x,\underline{y}\right) be a first-order system, x0∈Ix_0\in I and y‾0∈Rn.\underline{y}_0\in\mathbb{R}^n. An initial condition is a condition y‾(x0)=y‾0\underline{y}\left(x_0\right)=\underline{y}_0 that fixes the value of the unknown at one point. An initial value problem is a first-order system together with an initial condition.

y‾′=F‾(x,y‾),y‾(x0)=y‾0\underline{y}'=\underline{F}\left(x,\underline{y}\right),\qquad\underline{y}\left(x_0\right)=\underline{y}_0

For an equation of order nn the initial condition prescribes y(x0),y′(x0),…,y(n−1)(x0).y\left(x_0\right),y'\left(x_0\right),\ldots,y^{(n-1)}\left(x_0\right).

Let EE be an ordinary differential equation on an interval I.I. A boundary value problem is the equation EE together with conditions on the unknown at two or more points, typically the endpoints of I.I. A boundary value problem need not have a unique solution, or any solution: y′′+y=0y''+y=0 with y(0)=y(π)=0y(0)=y(\pi)=0 is solved by every y=Csin⁡x,y=C\sin x, whereas with y(0)=0y(0)=0 and y(π)=1y(\pi)=1 it has no solution.

Let y‾′=F‾(x,y‾),\underline{y}'=\underline{F}\left(x,\underline{y}\right), y‾(x0)=y‾0\underline{y}\left(x_0\right)=\underline{y}_0 be an initial value problem with F‾\underline{F} continuous. The integral equation of the initial value problem is the equation obtained by integrating both sides from x0,x_0, where a vector-valued function is integrated componentwise.

y‾(x)=y‾0+∫x0xF‾(s,y‾(s))ds  ∀ x∈I\underline{y}(x)=\underline{y}_0+\int_{x_0}^{x}\underline{F}\left(s,\underline{y}(s)\right)ds\,\,\forall\,x\in I

By the fundamental theorems of calculus, a continuous y‾\underline{y} solves the initial value problem on an interval II containing x0x_0 if and only if it satisfies the integral equation.

Let y‾′=F‾(x,y‾),\underline{y}'=\underline{F}\left(x,\underline{y}\right), y‾(x0)=y‾0\underline{y}\left(x_0\right)=\underline{y}_0 be an initial value problem with F‾\underline{F} continuous. Picard iteration is the sequence of functions obtained by applying the right-hand side of the integral equation repeatedly, starting from the constant function y‾0.\underline{y}_0.

y‾k+1(x):=y‾0+∫x0xF‾(s,y‾k(s))ds\underline{y}_{k+1}(x):=\underline{y}_0+\int_{x_0}^{x}\underline{F}\left(s,\underline{y}_k(s)\right)ds

Let R⊆R×RnR\subseteq\mathbb{R}\times\mathbb{R}^n and F‾:R→Rn\underline{F}:R\rightarrow\mathbb{R}^n be a function. The function F‾\underline{F} is Lipschitz continuous in y‾\underline{y} on RR if and only if there exists L≥0L\geq 0 such that

∥F‾(x,y‾)−F‾(x,z‾)∥≤L∥y‾−z‾∥  ∀ (x,y‾),(x,z‾)∈R.\left\lVert\underline{F}\left(x,\underline{y}\right)-\underline{F}\left(x,\underline{z}\right)\right\rVert\leq L\left\lVert\underline{y}-\underline{z}\right\rVert\,\,\forall\,\left(x,\underline{y}\right),\left(x,\underline{z}\right)\in R.

If F‾\underline{F} is C1C^1 on an open set then by the mean value theorem it is Lipschitz continuous in y‾\underline{y} on every closed bounded rectangle inside that set.

Let R=[x0−a,x0+a]×B‾(y‾0,b)R=\left[x_0-a,x_0+a\right]\times\overline{B}\left(\underline{y}_0,b\right) and F‾:R→Rn\underline{F}:R\rightarrow\mathbb{R}^n be continuous with ∥F‾∥≤M\lVert\underline{F}\rVert\leq M on RR and Lipschitz continuous in y‾\underline{y} on R.R. The Picard–Lindelöf theorem states that the initial value problem y‾′=F‾(x,y‾),\underline{y}'=\underline{F}\left(x,\underline{y}\right), y‾(x0)=y‾0\underline{y}\left(x_0\right)=\underline{y}_0 has exactly one solution on [x0−h,x0+h]\left[x_0-h,x_0+h\right] with h=min⁡{a,bM},h=\min\left\{a,\frac{b}{M}\right\}, and that the Picard iterates converge uniformly to it. The right-hand side of the integral equation is a map on the complete metric space of continuous functions from [x0−h,x0+h]\left[x_0-h,x_0+h\right] into B‾(y‾0,b)\overline{B}\left(\underline{y}_0,b\right) with the supremum norm, some iterate of which is a contraction, so the contraction mapping theorem gives the unique fixed point.

Let R=[x0−a,x0+a]×B‾(y‾0,b)R=\left[x_0-a,x_0+a\right]\times\overline{B}\left(\underline{y}_0,b\right) and F‾:R→Rn\underline{F}:R\rightarrow\mathbb{R}^n be continuous with ∥F‾∥≤M\lVert\underline{F}\rVert\leq M on R.R. The Peano existence theorem states that the initial value problem has a solution on [x0−h,x0+h]\left[x_0-h,x_0+h\right] with h=min⁡{a,bM}.h=\min\left\{a,\frac{b}{M}\right\}. The Lipschitz condition cannot be dropped for uniqueness: y′=2∣y∣y'=2\sqrt{\lvert y\rvert} with y(0)=0y(0)=0 is solved by y=0y=0 and by y=x∣x∣,y=x\lvert x\rvert, since ∣y∣\sqrt{\lvert y\rvert} is not Lipschitz continuous near 0.0.

Let y‾1\underline{y}_1 and y‾2\underline{y}_2 be solutions of an initial value problem on intervals I1⊆I2.I_1\subseteq I_2. The solution y‾2\underline{y}_2 extends y‾1\underline{y}_1 if and only if y‾2\underline{y}_2 agrees with y‾1\underline{y}_1 on I1.I_1.

Let U⊆R×RnU\subseteq\mathbb{R}\times\mathbb{R}^n be open and F‾:U→Rn\underline{F}:U\rightarrow\mathbb{R}^n be continuous and Lipschitz continuous in y‾\underline{y} on every closed bounded rectangle inside U.U. A maximal solution of an initial value problem is a solution that is not extended by any other solution, and its interval of definition (α,ω)\left(\alpha,\omega\right) is the maximal interval of existence. Maximal solutions have the following properties:

  • every solution extends to a unique maximal solution;
  • as x→ωx\rightarrow\omega or x→αx\rightarrow\alpha the point (x,y‾(x))\left(x,\underline{y}(x)\right) leaves every compact subset of U;U;
  • the maximal interval can be smaller than the interval on which F‾\underline{F} is defined, since a solution can blow up in finite time: y′=y2y'=y^2 with y(0)=1y(0)=1 has maximal solution y=11−xy=\frac{1}{1-x} on (−∞,1);\left(-\infty,1\right);
  • if F‾\underline{F} is continuous on I×RnI\times\mathbb{R}^n and Lipschitz continuous in y‾\underline{y} on all of it, as it is for a linear system with continuous coefficients, then every maximal solution exists on the whole of I.I.

Let u:[x0,x1]→Ru:\left[x_0,x_1\right]\rightarrow\mathbb{R} be continuous and C,L≥0C,L\geq 0 be constants. Grönwall’s inequality states that if u(x)≤C+L∫x0xu(s) dsu(x)\leq C+L\int_{x_0}^{x}u(s)\,ds for all xx then u(x)≤C eL(x−x0)u(x)\leq C\,e^{L\left(x-x_0\right)} for all x.x.

Let F‾\underline{F} be Lipschitz continuous in y‾\underline{y} with constant L,L, and y‾\underline{y} and z‾\underline{z} be solutions of y‾′=F‾(x,y‾)\underline{y}'=\underline{F}\left(x,\underline{y}\right) with initial values y‾0\underline{y}_0 and z‾0\underline{z}_0 at x0.x_0. Continuous dependence on initial conditions is the property that the distance between the solutions is bounded by the distance between their initial values, which follows from Grönwall’s inequality applied to the difference of the two integral equations.

∥y‾(x)−z‾(x)∥≤∥y‾0−z‾0∥eL∣x−x0∣\left\lVert\underline{y}(x)-\underline{z}(x)\right\rVert\leq\left\lVert\underline{y}_0-\underline{z}_0\right\rVert e^{L\lvert x-x_0\rvert}

Taking y‾0=z‾0\underline{y}_0=\underline{z}_0 gives uniqueness.

An initial value problem is well-posed if and only if it has a unique solution that depends continuously on the initial condition. The bound above grows exponentially in x,x, so well-posedness does not prevent nearby solutions from diverging over long intervals.