1.1 Existence and Uniqueness of Solutions
When does $y'=f(x,y)$, $y(x_0)=y_0$ have a solution, when is it the only one, and how long does it live? Lipschitz conditions, Picard iterates, Peano's theorem, blow-up and Gronwall's inequality.
A differential equation $y'=f(x,y)$ together with a starting value $y(x_0)=y_0$ is the mathematical form of a deterministic law: the present state and the rule of change should fix the whole future. Whether they really do is not obvious. The equation $y'=3y^{2/3}$ with $y(0)=0$ is satisfied by $y\equiv0$ and by $y=x^3$, and by infinitely many other functions; the perfectly smooth equation $y'=y^2$ with $y(0)=1$ has a solution that runs off to infinity at $x=1$; and a discontinuous right-hand side can leave an initial value problem with no solution at all. Before solving equations we must know which questions have answers.
This section answers them. The Lipschitz condition gives existence and uniqueness (the Picard–Lindelöf theorem), proved constructively by Picard's successive approximations — the same iteration that reappears in Chapter 5 as a numerical method and in Chapter 7 for Volterra integral equations. Continuity alone gives existence without uniqueness (Peano). Solutions extend until they blow up or leave the domain, and Gronwall's inequality shows that they depend continuously on the data. CSIR NET examines exactly these points: the interval $h=\min(a,b/M)$, whether a given $f$ is Lipschitz, how many solutions an IVP has, and the maximal interval of existence. At the end we collect the classical solution methods — exact equations, integrating factors, linear and Bernoulli equations — as tools for computing the solutions the theory promises.
Initial Value Problems and the Integral Equation
Let $D\subseteq\mathbb{R}^2$ and let $f:D\to\mathbb{R}$ be continuous. The initial value problem (IVP) with data $(x_0,y_0)\in D$ is
$$y'=f(x,y),\qquad y(x_0)=y_0.$$A solution on an interval $I\ni x_0$ is a differentiable function $\varphi:I\to\mathbb{R}$ whose graph lies in $D$, i.e. $(x,\varphi(x))\in D$ for all $x\in I$, with $\varphi'(x)=f(x,\varphi(x))$ for every $x\in I$ and $\varphi(x_0)=y_0$. Geometrically, the graph of $\varphi$ is an integral curve: at each of its points its slope is the value of $f$ there.
Since $\varphi'(x)=f(x,\varphi(x))$ is a composite of continuous functions, every solution is automatically $C^1$. The first step of the whole theory is to trade the derivative for an integral, because integrals behave far better under limits.
Proof. If $\varphi$ solves the IVP, then $\varphi'$ is continuous, and the fundamental theorem of calculus gives $\varphi(x)-\varphi(x_0)=\int_{x_0}^x\varphi'(t)\,dt=\int_{x_0}^x f(t,\varphi(t))\,dt$, with $\varphi(x_0)=y_0$. Conversely, if $\varphi$ is continuous and satisfies the integral equation, the integrand $t\mapsto f(t,\varphi(t))$ is continuous, so the right-hand side is differentiable with derivative $f(x,\varphi(x))$ (fundamental theorem of calculus); hence $\varphi$ is differentiable, $\varphi'(x)=f(x,\varphi(x))$, and putting $x=x_0$ gives $\varphi(x_0)=y_0$. ∎
Notice the gain: the integral equation asks only for continuity of $\varphi$, and differentiability comes for free. A limit of a uniformly convergent sequence of continuous functions is continuous, but need not be differentiable — so it is the integral form that lets us build solutions as limits.
The Lipschitz Condition
Continuity of $f$ will turn out to be enough for existence. For uniqueness we need control on how fast $f$ changes in the $y$-direction: two solutions that start together separate at a rate governed by $f(x,y_1)-f(x,y_2)$, and the Lipschitz condition bounds this by a multiple of $|y_1-y_2|$.
A function $f:D\to\mathbb{R}$ satisfies a Lipschitz condition (with respect to $y$) on $D$, with Lipschitz constant $L\ge0$, if
$$|f(x,y_1)-f(x,y_2)|\le L\,|y_1-y_2|\qquad\text{whenever }(x,y_1),(x,y_2)\in D.$$Only the second variable is involved: the two points have the same $x$. We say $f$ is locally Lipschitz in $y$ on an open set $D$ if every point of $D$ has a neighbourhood (a rectangle) on which $f$ is Lipschitz in $y$, with a constant that may depend on the neighbourhood.
Let $D$ be convex in $y$ (whenever $(x,y_1),(x,y_2)\in D$, the vertical segment joining them lies in $D$ — e.g. a rectangle or a vertical strip).
- If $\partial f/\partial y$ exists on $D$ and $\left|\partial f/\partial y\right|\le L$ there, then $f$ is Lipschitz in $y$ on $D$ with constant $L$.
- Conversely, if $f$ is Lipschitz in $y$ with constant $L$ and $\partial f/\partial y$ exists at an interior point, then $|\partial f/\partial y|\le L$ there.
- If $D$ is open and $\partial f/\partial y$ is continuous on $D$, then $f$ is locally Lipschitz in $y$ on $D$.
Proof. (1) Fix $x$ and $y_1\lt y_2$ with $(x,y_1),(x,y_2)\in D$. The function $g(s)=f(x,s)$ is differentiable on $[y_1,y_2]$ (the segment lies in $D$), so by the mean value theorem $f(x,y_2)-f(x,y_1)=\tfrac{\partial f}{\partial y}(x,\eta)(y_2-y_1)$ for some $\eta$ between $y_1$ and $y_2$; taking absolute values gives the bound with constant $L$. (2) $\left|\tfrac{f(x,y+k)-f(x,y)}{k}\right|\le L$ for all small $k\ne0$; let $k\to0$. (3) Around each point of $D$ choose a closed rectangle $R\subset D$. The continuous function $|\partial f/\partial y|$ attains a maximum $L_R$ on the compact set $R$, and $R$ is convex, so (1) applies on $R$. ∎
The theorem is only a sufficient test. The function $f(x,y)=|y|$ is Lipschitz with $L=1$ on all of $\mathbb{R}^2$ (by the reverse triangle inequality $\big||y_1|-|y_2|\big|\le|y_1-y_2|$) although $\partial f/\partial y$ does not exist on the line $y=0$. And a Lipschitz constant must work for all pairs of points: $f=y^2$ is Lipschitz on every bounded rectangle but not on a strip $[0,1]\times\mathbb{R}$, since $|y_1^2-y_2^2|/|y_1-y_2|=|y_1+y_2|$ is unbounded there.
Picard Iterates and the Picard–Lindelöf Theorem
Theorem 1.1 turns the IVP into a fixed-point problem: $\varphi=T\varphi$ for the operator $(T\varphi)(x)=y_0+\int_{x_0}^x f(t,\varphi(t))\,dt$. The most natural way to look for a fixed point is to iterate.
Let $R=\{(x,y):|x-x_0|\le a,\ |y-y_0|\le b\}$ with $a,b\gt0$, and let $f:R\to\mathbb{R}$ be
- continuous on $R$, with $M=\max_R|f|$, and
- Lipschitz in $y$ on $R$ with constant $L$.
Put $h=\min\left(a,\dfrac bM\right)$ (and $h=a$ if $M=0$), $I=[x_0-h,x_0+h]$. Then the IVP $y'=f(x,y)$, $y(x_0)=y_0$ has exactly one solution $\varphi$ on $I$. The Picard iterates are defined on $I$, have graphs in $R$, and converge to $\varphi$ uniformly on $I$, with
$$|\varphi(x)-\varphi_n(x)|\le\frac{M}{L}\,\frac{(Lh)^{n+1}}{(n+1)!}\,e^{Lh}\qquad(x\in I,\ L\gt0).$$Moreover, any solution of the IVP on any interval $J\subseteq I$ containing $x_0$ coincides with $\varphi$ on $J$.
Proof. Step 1: the iterates stay in $R$. We show by induction that each $\varphi_n$ is continuous on $I$ with $|\varphi_n(x)-y_0|\le b$. This is true for $\varphi_0$. If it holds for $\varphi_n$, then $t\mapsto f(t,\varphi_n(t))$ is continuous on $I$ and bounded by $M$, so $\varphi_{n+1}$ is defined, continuous (indeed $C^1$), and $|\varphi_{n+1}(x)-y_0|\le M|x-x_0|\le Mh\le b$. This is exactly where $h\le b/M$ is needed: the graph of $\varphi_{n+1}$ cannot escape through the top or bottom of $R$ before $|x-x_0|$ reaches $h$.
Step 2: the successive differences shrink factorially. We claim $$|\varphi_{k+1}(x)-\varphi_k(x)|\le\frac{ML^k|x-x_0|^{k+1}}{(k+1)!}\qquad(x\in I,\ k\ge0).$$ For $k=0$ this is $|\varphi_1-y_0|\le M|x-x_0|$ from Step 1. If it holds for $k-1$, then for $x\ge x_0$ (the other side is symmetric), by the Lipschitz condition, $$|\varphi_{k+1}(x)-\varphi_k(x)|\le\int_{x_0}^x\big|f(t,\varphi_k)-f(t,\varphi_{k-1})\big|dt\le L\int_{x_0}^x\frac{ML^{k-1}(t-x_0)^k}{k!}dt=\frac{ML^k(x-x_0)^{k+1}}{(k+1)!}.$$
Step 3: uniform convergence. On $I$ the $k$-th difference is at most $\dfrac{M}{L}\dfrac{(Lh)^{k+1}}{(k+1)!}$, and $\sum_k\tfrac{(Lh)^{k+1}}{(k+1)!}=e^{Lh}-1\lt\infty$. By the Weierstrass M-test, $\varphi_n=\varphi_0+\sum_{k=0}^{n-1}(\varphi_{k+1}-\varphi_k)$ converges uniformly on $I$ to a continuous function $\varphi$, and $|\varphi(x)-y_0|\le b$ because each $\varphi_n$ satisfies this. The tail estimate is $$|\varphi-\varphi_n|\le\frac ML\sum_{j\ge n+1}\frac{(Lh)^j}{j!}\le\frac ML\frac{(Lh)^{n+1}}{(n+1)!}\sum_{i\ge0}\frac{(Lh)^i}{i!},$$ using $(n+1+i)!\ge(n+1)!\,i!$; this is the stated error bound.
Step 4: the limit is a solution. $|f(t,\varphi_n(t))-f(t,\varphi(t))|$ is at most $L|\varphi_n(t)-\varphi(t)|\le L\sup_I|\varphi_n-\varphi|$, which tends to $0$, uniformly in $t$, so $\int_{x_0}^xf(t,\varphi_n)\,dt\to\int_{x_0}^xf(t,\varphi)\,dt$. Letting $n\to\infty$ in the definition of $\varphi_{n+1}$ gives $\varphi=y_0+\int_{x_0}^xf(t,\varphi)\,dt$, and Theorem 1.1 shows that $\varphi$ solves the IVP.
Step 5: uniqueness. Let $\psi$ be a solution on $J\subseteq I$. First, the graph of $\psi$ stays in $R$. If not, by continuity there is a first point $x_1\gt x_0$ (say) of $J$ at which $|\psi(x_1)-y_0|=b$, followed by points where the graph is outside $R$; on $[x_0,x_1]$ the graph is in $R$, so $|\psi'|\le M$ there and $b=|\psi(x_1)-y_0|\le M(x_1-x_0)$. Hence $x_1-x_0\ge b/M\ge h$, so $x_1=x_0+h$ is the right end of $I$ and there are no later points of $J$ — a contradiction. Now $u=|\varphi-\psi|$ is continuous, bounded by $2b$ on $J$, and $u(x)\le L\int_{x_0}^xu(t)\,dt$. Inserting the bound $u\le2b$ into the right-hand side repeatedly gives $u(x)\le2b\,\dfrac{L^n|x-x_0|^n}{n!}$ for every $n$, and the right-hand side tends to $0$. So $\psi=\varphi$ on $J$. ∎
Three features of the proof are worth remembering. The Lipschitz condition is used twice — for convergence (Step 2) and for uniqueness (Step 5). The bound $M$ only controls where the iterates can go, so it limits the interval through $h=\min(a,b/M)$, not the convergence. And the iterates converge factorially fast, like the partial sums of $e^{Lh}$: Picard iteration is a contraction-mapping argument in disguise (with the norm $\sup_I e^{-2L|x-x_0|}|\varphi(x)|$ the operator $T$ is a contraction on the whole of $I$; the Banach fixed-point theorem is proved in the CSIR NET Unit 1 course, in its chapter on metric spaces).
Proof (sketch). (1) Euler polygons. For each $n$ divide $[x_0,x_0+h]$ into $n$ equal steps and join the points $(x_k,y_k)$ with $y_{k+1}=y_k+\tfrac hn f(x_k,y_k)$ by segments. Each polygon $\psi_n$ has slopes bounded by $M$, so it stays in $R$ (as in Step 1 above) and $|\psi_n(x)-\psi_n(x')|\le M|x-x'|$. (2) Compactness. The family $\{\psi_n\}$ is uniformly bounded and equicontinuous, so by the Arzelà–Ascoli theorem a subsequence converges uniformly to a continuous $\varphi$. (3) The limit solves the integral equation. Each polygon satisfies $\psi_n(x)=y_0+\int_{x_0}^xf(t,\psi_n(t))\,dt+\varepsilon_n(x)$ with $\sup|\varepsilon_n|\to0$, by uniform continuity of $f$ on $R$; passing to the limit along the subsequence gives the integral equation for $\varphi$, and Theorem 1.1 finishes. Without the Lipschitz condition different subsequences can converge to different solutions. ∎
Non-Uniqueness, Maximal Solutions and Blow-Up
The same gluing works for $y'=y^{1/3}$ (blocks $y=\pm\left(\tfrac{2(x-c)}{3}\right)^{3/2}$ for $x\ge c$) and for $y'=\sqrt{|y|}$ (blocks $y=\tfrac{(x-c)^2}4$ for $x\ge c$). More generally $y'=|y|^\alpha$, $y(0)=0$ has infinitely many solutions for $0\lt\alpha\lt1$ and only $y\equiv0$ for $\alpha\ge1$.
Let $D\subseteq\mathbb{R}^2$ be open and $f:D\to\mathbb{R}$ continuous and locally Lipschitz in $y$. Then for every $(x_0,y_0)\in D$:
- the IVP has a unique maximal solution $\varphi$, and its maximal interval $(\omega_-,\omega_+)$ is open; every other solution is a restriction of $\varphi$;
- as $x\to\omega_+$ the point $(x,\varphi(x))$ leaves every compact subset $K$ of $D$: there is $x_K\lt\omega_+$ with $(x,\varphi(x))\notin K$ for $x_K\lt x\lt\omega_+$ (and similarly at $\omega_-$).
In particular, if $D=(\alpha,\beta)\times\mathbb{R}$, then either $\omega_+=\beta$ or $|\varphi(x)|\to\infty$ as $x\to\omega_+^-$: a solution on a strip can only end by blowing up.
Proof (sketch). (1) If two solutions $\varphi_1$ on $I_1$ and $\varphi_2$ on $I_2$ agree at one point $x_1\in I_1\cap I_2$, the set $\{x\in I_1\cap I_2:\varphi_1(x)=\varphi_2(x)\}$ is closed (continuity) and open (apply Theorem 1.3 on a small rectangle around each point where they agree), hence it is the whole interval $I_1\cap I_2$. So all solutions of the IVP agree where they overlap, and their union defines one solution on the union of their intervals — the maximal solution. The interval is open, because a solution on $[x_0,\omega_+]$ could be extended past $\omega_+$ by Theorem 1.3 at $(\omega_+,\varphi(\omega_+))\in D$.
(2) Let $K\subset D$ be compact. Choose $\delta\gt0$ so that the compact set $K_\delta$ of points within distance $\delta$ (in the max-norm) of $K$ lies in $D$, and let $M$ bound $|f|$ on $K_\delta$; $f$ is Lipschitz in $y$ on $K_\delta$ (cover it by finitely many rectangles). For every $(\xi,\eta)\in K$, Theorem 1.3 on the square of half-side $\delta$ centred there gives a solution through $(\xi,\eta)$ on $[\xi,\xi+h]$ with the same $h=\min(\delta,\delta/M)$. If there were points $x_k\to\omega_+$ with $(x_k,\varphi(x_k))\in K$, pick one with $\omega_+-x_k\lt h$: the solution through $(x_k,\varphi(x_k))$ would extend $\varphi$ beyond $\omega_+$. Contradiction. For the strip, if $\omega_+\lt\beta$ apply this with $K=[x_0,\omega_+]\times[-N,N]$ for every $N$. ∎
Proof. Now the iterates need not stay in any rectangle — $f$ is defined for every $y$ — so they are defined and continuous on all of $[\alpha,\beta]$. Let $M_0=\max_{[\alpha,\beta]}|f(t,y_0)|$. Then $|\varphi_1(x)-\varphi_0(x)|\le M_0|x-x_0|$, and the induction of Step 2 of Theorem 1.3 (which used only the Lipschitz condition) gives $|\varphi_{k+1}-\varphi_k|\le$ $M_0L^k|x-x_0|^{k+1}/(k+1)!$ on $[\alpha,\beta]$. Steps 3–5 go through verbatim with $h$ replaced by $\beta-\alpha$ (uniqueness now needs no argument about staying in $R$). For the linear equation, the difference of the right-hand sides at $y_1$ and at $y_2$ is $p(x)(y_1-y_2)$, of absolute value at most $\left(\max_{[\alpha,\beta]}|p|\right)|y_1-y_2|$ on every compact $[\alpha,\beta]\subseteq J$; the solutions on an increasing sequence of compact intervals exhausting $J$ agree on overlaps by uniqueness. ∎
This is the reason linear equations never blow up: a linear equation can be singular only where its coefficients are, and the solution lives on the whole interval on which $p$ and $q$ are continuous. Chapter 2 rests on this fact.
Gronwall's Inequality and Continuous Dependence
A physical law is useful only if small errors in the data produce small errors in the prediction. The tool for proving this is an inequality that turns an integral inequality into an explicit exponential bound.
Proof. Put $U(x)=C+\int_{x_0}^xk(t)u(t)\,dt$, so $u\le U$ and $U$ is $C^1$ with $U'=ku\le kU$ (here $k\ge0$ is essential). With $K(x)=\int_{x_0}^xk$, $$\left(U e^{-K}\right)'=(U'-kU)e^{-K}\le0,$$ so $U(x)e^{-K(x)}\le U(x_0)=C$. Hence $u(x)\le U(x)\le Ce^{K(x)}$. The last statement is the case $C=0$, $k=L$. ∎
Proof. Subtract the integral equations: $$y(x)-z(x)=y_0-z_0+\int_{x_0}^x\Big(\big[f(t,y)-f(t,z)\big]+\big[f(t,z)-g(t,z)\big]\Big)dt.$$ Hence $w=|y-z|$ satisfies $w(x)\le\delta+\int_{x_0}^x(Lw+\varepsilon)\,dt$, with $\delta=|y_0-z_0|$. Put $u=w+\varepsilon/L$: then $u(x)\le\left(\delta+\tfrac\varepsilon L\right)+\int_{x_0}^xLu\,dt$, and Gronwall gives $u\le\left(\delta+\tfrac\varepsilon L\right)e^{L(x-x_0)}$, which is the claim. ∎
With $\varepsilon=0$ and $\delta=0$ this is once more the uniqueness theorem. The factor $e^{L(x-x_0)}$ is honest: for $y'=y$ two solutions starting $\delta$ apart are $\delta e^{x}$ apart at time $x$. Continuous dependence on a finite interval is not the same as stability for all time — that question returns in §1.3.
Tools for Solving: Exact Equations, Integrating Factors, Linear and Bernoulli Equations
The existence theory tells us a solution exists; for many equations met in practice the classical methods find it. We collect them briefly — CSIR questions often combine a solution method with an existence question (find the solution, then its maximal interval).
Proof. If $\Phi_x=M$, $\Phi_y=N$ with $M,N\in C^1$, then $\Phi$ is $C^2$ and by Schwarz's theorem $M_y=\Phi_{xy}=\Phi_{yx}=N_x$. Conversely, with $\Phi$ as displayed (the segments used stay in the rectangle), $\Phi_y=N(x,y)$ by the fundamental theorem of calculus, and differentiating under the integral sign, $$\Phi_x=M(x,y_0)+\int_{y_0}^yN_x(x,s)\,ds=M(x,y_0)+\int_{y_0}^yM_y(x,s)\,ds=M(x,y).$$ If $y(x)$ solves $M+Ny'=0$ then $\tfrac{d}{dx}\Phi(x,y(x))=\Phi_x+\Phi_yy'=0$, so $\Phi$ is constant along solutions. ∎
- If $\dfrac{M_y-N_x}{N}=g(x)$ depends on $x$ alone, then $\mu=e^{\int g\,dx}$ is an integrating factor; if $\dfrac{N_x-M_y}{M}=h(y)$ depends on $y$ alone, then $\mu=e^{\int h\,dy}$ is one.
- The linear equation $y'+P(x)y=Q(x)$ ($P,Q$ continuous on $J$) has the general solution $$y=e^{-\int P}\left(\int Qe^{\int P}dx+C\right)\quad\text{on }J.$$
- The Bernoulli equation $y'+P(x)y=Q(x)y^n$ ($n\ne0,1$) becomes linear for $v=y^{1-n}$: $\ v'+(1-n)Pv=(1-n)Q$. For $n\gt0$, $y\equiv0$ is an extra solution, and for $0\lt n\lt1$ the IVP with $y(x_0)=0$ is in general not unique.
Proof. (1) For $\mu=\mu(x)$, exactness of $\mu M\,dx+\mu N\,dy$ means $\mu M_y=\mu'N+\mu N_x$, i.e. $\mu'/\mu=(M_y-N_x)/N$, which is solvable by $\mu=e^{\int g}$ exactly when the right side depends only on $x$; the $y$-case is symmetric. (2) Multiply by $\mu=e^{\int P}$: $(\mu y)'=\mu y'+\mu Py=\mu Q$; integrate. (3) For $y\ne0$, $v'=(1-n)y^{-n}y'$, and $y^{-n}y'=y^{-n}(Qy^n-Py)=Q-Pv$, so $v'=(1-n)(Q-Pv)$. For $0\lt n\lt1$ the right side $Qy^n-Py$ is not Lipschitz at $y=0$, which is how the gluing of Example 5 becomes possible. ∎
- Locate the bad set. Find where $f$ is discontinuous or where $\partial f/\partial y$ fails to exist or is unbounded (typically $y^\alpha$ with $0\lt\alpha\lt1$ at $y=0$, or a denominator vanishing).
- Away from it, $f$ is locally Lipschitz: through every point there is exactly one solution (Theorems 1.2, 1.3, 1.5).
- On it, test uniqueness directly: try to glue a constant solution to a nonconstant one (Example 5). If $f(y_0)\ne0$ for an autonomous equation, separation of variables usually restores uniqueness even without a Lipschitz condition.
- Interval questions. For "guaranteed by Picard" compute $M$ on the given rectangle and $h=\min(a,b/M)$. For "maximal interval" solve explicitly and use Theorem 1.5 (blow-up or reaching $\partial D$); for linear or globally Lipschitz $f$ use Theorem 1.6.
- Dependence questions. Use Theorem 1.8 with the Lipschitz constant on the relevant strip.
- Continuity does not give uniqueness. $y'=3y^{2/3}$, $y(0)=0$: $y\equiv0$, $y=x^3$ and uncountably many glued solutions (Example 5). Likewise $y'=\sqrt{|y|}$ and $y'=y^{1/3}$.
- Without continuity there may be no solution. $f(x,y)=-1$ for $y\ge0$, $f=1$ for $y\lt0$, $y(0)=0$: a solution would have $y'(0)=-1$, so $y\lt0$ just after $0$, where $y'=1$ forces $y$ to increase from $0$ — a contradiction. No solution on any $[0,\delta)$.
- Lipschitz is sufficient, not necessary, for uniqueness. $y'=1+y^{2/3}$, $y(0)=0$ has a unique solution (separate: $\int_0^y\frac{ds}{1+s^{2/3}}=x$ with a strictly increasing left side), although $f$ is not Lipschitz at $y=0$.
- Lipschitz does not need differentiability. $|y|$, $x|y|$, $|\sin y|$ are Lipschitz but not differentiable in $y$ everywhere.
- A bounded $\partial f/\partial y$ needs a domain convex in $y$. On a set made of two separated horizontal bands, the mean value theorem cannot be applied across the gap.
- Smooth $f$ can blow up. $y'=y^2$ and $y'=1+y^2$: $f$ is a polynomial, yet the solutions live on finite intervals. "Locally Lipschitz" gives local existence only.
- $h=\min(a,b/M)$ is a guarantee, not the answer. For $y'=1+y^2$, $y(0)=0$ the best guarantee is $\tfrac12$, the truth $\tfrac\pi2$; for $y'=y$ every rectangle gives $h\le1$, the truth is $\mathbb{R}$.
- Picard iterates may converge to one of several solutions. For $y'=3y^{2/3}$, $y(0)=0$ all iterates are $0$: they converge — to just one of infinitely many solutions. Convergence of iterates does not prove uniqueness.
- Uniqueness is local. $y'=3y^{2/3}$, $y(0)=1$ is unique near $0$ but has infinitely many global solutions (Example 5(b)).
- Gronwall needs $k\ge0$. With $C=1$, $k=-1$ on $[0,1]$: $u\equiv\tfrac12$ satisfies $u\le1-\int_0^xu\,dt=1-\tfrac x2$, yet the "conclusion" $u\le e^{-x}$ fails at $x=1$ ($e^{-1}\approx0.37\lt\tfrac12$). The step $ku\le kU$ of the proof reverses when $k\lt0$.
Exercises
- 1 Write $y'=x^2+y^2$, $y(0)=1$ as an integral equation and compute the Picard iterates $\varphi_1$ and $\varphi_2$.
- 2 Find all continuous $y$ on $(-\infty,1)$ with $y(x)=1+\int_0^xy(t)^2\,dt$.
- 3 Is $f$ Lipschitz in $y$ on the given set? Give the best constant if so. (a) $xy^2$ on $[0,1]\times[-3,3]$; (b) $e^{-x}\sin y$ on $[0,\infty)\times\mathbb{R}$; (c) $y^{2/3}$ on $[0,1]\times[-1,1]$; (d) $x|y|$ on $[-2,2]\times\mathbb{R}$.
- 4 Show that $f(x,y)=\sqrt{|y|}$ is Lipschitz in $y$ on $\{(x,y):|y|\ge\delta\}$ for every $\delta\gt0$, with constant $\tfrac1{2\sqrt\delta}$, but on no rectangle that contains a point of the $x$-axis.
- 5 Give a function, continuous on $\mathbb{R}^2$ and Lipschitz in $y$, for which $\partial f/\partial y$ fails to exist at infinitely many values of $y$.
- 6 Find the smallest Lipschitz constant of $f(x,y)=xe^{-y^2}$ on $[0,1]\times\mathbb{R}$.
- 7 Show that $f(x,y)=\sqrt{|x|}+y$ is Lipschitz in $y$ on $\mathbb{R}^2$ although it is not Lipschitz in $x$ near $x=0$. What does this give for the IVP $y'=\sqrt{|x|}+y$, $y(x_0)=y_0$?
- 8 Show that the integral equation $y(x)=\int_0^x\sqrt{|y(t)|}\,dt$ has infinitely many continuous solutions on $[0,\infty)$.
- 1 Compute the Picard iterates for $y'=-y$, $y(0)=2$, find $\varphi_n$ and its limit.
- 2 For $y'=x+y$, $y(0)=1$, compute $\varphi_1$, $\varphi_2$ and compare with the exact solution.
- 3 For $y'=y^2$, $y(0)=1$, compute $\varphi_1,\varphi_2$ and compare them with the Taylor series of the exact solution.
- 4 For $y'=y^2$, $y(0)=1$ on $|x|\le1$, $|y-1|\le b$, find $h(b)$ and its largest value.
- 5 For $y'=x^2+y^2$, $y(0)=0$ on the square $|x|\le a$, $|y|\le a$, find $h$ as a function of $a$ and the best choice of $a$.
- 6 For $y'=1+\tfrac12\sin y$, $y(0)=0$ on $[0,1]$, use the bound of Theorem 1.6 (with $M_0=\max|f(t,y_0)|$) to find $n$ such that $|\varphi-\varphi_n|\lt10^{-6}$ on $[0,1]$.
- 7 Show that the Picard iterates of $y'=3y^{2/3}$, $y(0)=0$ converge, and explain why this does not contradict Example 5.
- 8 Prove that $y'=\sin(xy)$, $y(0)=y_0$ has a unique solution on all of $\mathbb{R}$.
- 1 Find the maximal interval of the solution of $y'=1+y^2$, $y(0)=1$.
- 2 Solve $y'=xy^2$, $y(0)=2$, and find the maximal interval.
- 3 Solve $y'=-y^3$, $y(0)=1$. In which direction does the solution blow up?
- 4 Find all solutions of $y'=\sqrt{|y|}$, $y(0)=0$ on $\mathbb{R}$.
- 5 Prove that $y'=1+y^{2/3}$, $y(0)=0$ has exactly one solution near $x=0$.
- 6 For the logistic equation $y'=y(1-y)$ show that if $0\lt y_0\lt1$ the solution exists on $\mathbb{R}$ and stays in $(0,1)$, and that if $y_0\gt1$ the maximal interval is $\left(\log(1-1/y_0),\infty\right)$.
- 7 Give a continuous $f$ on $\mathbb{R}^2$ such that the IVP through every point of the $x$-axis has more than one solution.
- 8 Let $f$ be continuous and locally Lipschitz in $y$ on $\mathbb{R}^2$ and bounded, $|f|\le M$. Prove that every maximal solution of $y'=f(x,y)$ is defined on $\mathbb{R}$.
- 1 Let $u\ge0$ be continuous on $[x_0,x_1]$ with $u(x)\le L\int_{x_0}^xu(t)\,dt$. Prove from Theorem 1.7 that $u\equiv0$, and deduce uniqueness for Lipschitz $f$ in two lines.
- 2 Let $y'=\cos y$, $y(0)=0$ and $z'=\cos z+0.01$, $z(0)=0$. Bound $|y(x)-z(x)|$ on $[0,1]$.
- 3 Solve $(2xy+3x^2)\,dx+(x^2+2y)\,dy=0$ with $y(0)=1$.
- 4 Find an integrating factor for $(x^2+y^2+x)\,dx+xy\,dy=0$ and solve.
- 5 Solve $y'-\dfrac{2y}{x}=-x^2y^2$, $y(1)=1$, and find the maximal interval.
- 6 Solve $y'+y\tan x=\sec x$, $y(0)=1$. The formula you obtain is defined on $\mathbb{R}$; what is the maximal interval of the solution of this IVP, and why?
- 7 Prove: if $f$ is continuous on $D$ and non-increasing in $y$ for each fixed $x$, then the IVP has at most one solution on $[x_0,x_0+\delta)$. Apply this to $y'=-y^{1/3}$, $y(0)=0$, and show that uniqueness fails backwards.
- 8 Let $y$ be the maximal solution of $y'=x^2+y^2$, $y(0)=0$, on $[0,\omega_+)$. Show that $y(x)\ge\tfrac{x^3}{3}$, and that $\omega_+\le1+\tfrac\pi2-\arctan\tfrac13\approx2.249$.
E1. CSIR Part B GATE MA For the IVP $y'=1+y^2$, $y(0)=0$, considered on the rectangle $R=\{|x|\le2,\ |y|\le3\}$, the Picard–Lindelöf theorem guarantees a unique solution on $|x|\le h$ with $h=$ (A) $2$; (B) $\tfrac{3}{10}$; (C) $\tfrac12$; (D) $\tfrac\pi2$.
E2. CSIR Part B The maximal interval of existence of the solution of $y'=e^{y}$, $y(0)=0$ is (A) $\mathbb{R}$; (B) $(-\infty,1)$; (C) $(-1,1)$; (D) $(-\infty,e)$.
E3. CSIR Part B Which of the following functions satisfies a Lipschitz condition in $y$ on the whole plane $\mathbb{R}^2$? (A) $f(x,y)=xy$; (B) $f(x,y)=y^{1/3}$; (C) $f(x,y)=e^{-|y|}\cos x$; (D) $f(x,y)=y^2$.
E4. CSIR Part C For $\alpha\gt0$ consider $y'=|y|^{\alpha}$, $y(0)=0$. Which of the following statements are true? (One or more options may be correct.) (A) For every $\alpha\ge1$ the IVP has exactly one solution on $\mathbb{R}$. (B) For every $0\lt\alpha\lt1$ the IVP has infinitely many solutions on $\mathbb{R}$. (C) For $\alpha=2$, the solution with $y(0)=1$ instead of $y(0)=0$ is not defined on all of $[0,\infty)$. (D) For $\alpha=\tfrac12$ every solution vanishes on $(-\infty,0]$.
E5. CSIR Part C GATE MA Let $f:\mathbb{R}^2\to\mathbb{R}$ be continuous with $|f(x,y_1)-f(x,y_2)|\le|y_1-y_2|$ for all $x,y_1,y_2$. Which of the following are true? (A) Every IVP $y'=f(x,y)$, $y(x_0)=y_0$ has a unique solution defined on $\mathbb{R}$. (B) The graphs of two different solutions may intersect. (C) If $y,z$ are solutions with $y(0)=0$ and $z(0)=10^{-3}$, then $|y(1)-z(1)|\le e\cdot10^{-3}$. (D) Every solution is bounded on $\mathbb{R}$.
E6. CSIR Part C Let $\varphi_n$ be the Picard iterates of $y'=y^2$, $y(0)=1$ (with $\varphi_0=1$). Which of the following are true? (A) $\varphi_2(x)=1+x+x^2+\tfrac{x^3}{3}$. (B) $\varphi_n\to\tfrac{1}{1-x}$ uniformly on $\left[-\tfrac14,\tfrac14\right]$. (C) The solution of the IVP can be extended to all of $\mathbb{R}$. (D) The $\varphi_n$ converge uniformly on $[0,2]$.
Suggested plan — 3 lectures × 60 min.
- The question and the tools. Open with the three pathologies ($y'=3y^{2/3}$, $y'=y^2$, the discontinuous $f$ of pitfall 2) before any theorem. Theorem 1.1 with Example 1; Definition 1.2 and Theorem 1.2 with Example 2 worked on the board. Project Interactive 2 in its first mode while students try to "decide" the solution through $(0,0)$.
- Picard–Lindelöf. Example 3 first (students compute iterates and recognise $e^{x^2}-1$), then the full proof of Theorem 1.3, emphasising where $h\le b/M$ and where $L$ are used. Interactive 1: modes 1–3, then mode 4 beyond $x=1$. Example 4, Theorem 1.4 (sketch only).
- Maximal solutions, Gronwall, tools. Example 5 (gluing), Theorem 1.5 with the picture of a solution leaving a compact set, Example 6 with Interactive 2 in its second mode, Theorem 1.6 (linear equations never blow up). Gronwall and Theorem 1.8; Example 7; finish with Exam-corner E1 and E4 live.
Discussion questions. (1) Picard iterates for $y'=3y^{2/3}$, $y(0)=0$ converge — so why is the solution not unique? What exactly does the Lipschitz condition add? (2) Is there an equation $y'=f(y)$ with $f$ continuous whose solutions are unique although $f$ is nowhere Lipschitz near some point? (3) A computer integrates $y'=y^2$, $y(0)=1$ to $x=2$ without complaint and prints a finite number. What has gone wrong, and how would Theorem 1.5 warn you?
Misconceptions to watch for. "Continuous $f$ ⇒ unique solution"; "$f$ differentiable everywhere ⇒ solution exists for all $x$"; confusing Lipschitz in $y$ with Lipschitz in $(x,y)$; reading $h=\min(a,b/M)$ as the maximal interval; thinking that the explicit formula's domain is the maximal interval (Example 7, Exercise IV.6); forgetting $k\ge0$ in Gronwall.
Suggested homework. I(1, 3, 4, 7), II(2, 4, 6, 7), III(1, 4, 6, 8), IV(2, 5, 7, 8); Exam corner E2, E5, E6.
Research question. When does a model "explode" in finite time — and can we trap the explosion time between two numbers we can prove, before any computer is switched on?
Why it matters. Finite-time blow-up is not only a mathematical curiosity. Thermal runaway in batteries and chemical reactors, the ignition of a fuel mixture, and the collapse of a self-gravitating cloud are all modelled by equations whose solutions blow up; engineers in battery safety and combustion research need the blow-up time (the "ignition delay") and its sensitivity to the data. The Riccati equation $y'=x^2+y^2$ is the simplest model with a source that grows in time and a superlinear feedback.
What to do.
- Prove a lower bound for $\omega_+$ for $y'=x^2+y^2$, $y(0)=0$: on $[0,1]$ compare with $y'\le1+y^2$ (show $\arctan y(x)\le x$, so the solution survives past $x=1$); then improve it on $[1,\omega_+)$ using $y'\le x_1^2+y^2$ on $[1,x_1]$.
- Prove an upper bound as in Exercise IV.8, and sharpen it by using a better lower estimate for $y(1)$ (for example $y\ge\varphi_2$, a Picard iterate — justify why!).
- Integrate numerically with a stepsize-controlled method until $y$ exceeds $10^8$, for several tolerances, and estimate $\omega_+$ to five digits.
- Repeat for $y'=x^2+y^2$, $y(0)=y_0$ with $y_0\in\{-1,0,1,2\}$ and plot $\omega_+(y_0)$. Compare with Theorem 1.8: is $\omega_+$ a continuous function of $y_0$?
Tools: Pen and paper for the bounds; Python with scipy.integrate.solve_ivp (with an event that stops the integration at a large value) or a spreadsheet RK4 with a halving step.
Hand in: A one-page note with your proved bracket for $\omega_+$, the numerical estimate, and the graph of $\omega_+(y_0)$.
Going further. The substitution $y=-u'/u$ turns this Riccati equation into the linear equation $u''+x^2u=0$; blow-up of $y$ corresponds to the first positive zero of $u$. Read about this link and explain why Sturm's comparison theorem (§2.3) gives bounds on $\omega_+$.
🧪 Self-check quiz
Q1. Which hypotheses on $f$ in a rectangle around $(x_0,y_0)$ guarantee that $y'=f(x,y)$, $y(x_0)=y_0$ has exactly one local solution?
Q2. How many solutions does $y'=y^{1/3}$, $y(0)=0$ have on $[0,\infty)$?
Q3. The maximal interval of the solution of $y'=y^2$, $y(0)=-1$ is
Q4. For $y'=y$, $y(0)=1$ on the rectangle $|x|\le1$, $|y-1|\le1$, Theorem 1.3 guarantees a solution on $|x|\le h$ with $h=$
Q5. If $u$ is continuous on $[0,1]$ and $u(x)\le2+\int_0^x3u(t)\,dt$, Gronwall's inequality gives