Source: Oxford Part A paper A1, A15294W1, Differential Equations, 22 June 2021; bundle pages 268–271, paper pages 1–4. All three questions, both proof options in Question 2(a), and every subpart are solved below.
The method of characteristics replaces the first-order partial differential equation by the ordinary differential equations
An integrating factor for the second equation gives , so their general solution of a differential equation is
Here are real constants. For , eliminating gives the characteristic projections
each restricted to either or . These are arcs of parabolas, with the straight-line exception . Along an oriented characteristic curve, increases with .
For , the characteristic projections lie on : describes either vertical half-line when . For the projection is the single point , although still changes. This last lifted characteristic curve cannot be contained in the function graph of a classical solution: at the original partial differential equation would require .
Parametrize the initial curve by , . Its tangent is , whereas the projected characteristic vector field there is . The determinant
proves that these are Noncharacteristic Cauchy data: the initial curve is everywhere transverse to the characteristic curves.
There is a regularity qualification. The prescribed function is continuous and Lipschitz continuous, but is not differentiable at . Thus the data are Cauchy in this geometric sense, with data given by a smooth function on each of and ; the usual theorem giving a global classical solution from continuously differentiable data does not apply across .
Use the initial conditions , , in the characteristic equations for a transport equation. The resulting parametrized solution surface is
The Jacobian determinant of is . In fact the inverse is explicit:
Consequently the explicit solution of a differential equation on the region reached from the data is
To verify it away from , set . Direct differentiation gives and . At we have , giving precisely the prescribed boundary condition.
Across the formula remains continuous and locally Lipschitz, is a smooth function on each side, and solves the partial differential equation along every characteristic curve. It is also a weak solution, since its first distributional derivatives agree almost everywhere with its ordinary derivatives. It is not a classical solution throughout the region because of the inherited corner.
Every point with has exactly one backward characteristic curve meeting , at the point . It meets the specified data precisely when . Thus the whole region determined by these data, including the two bounding characteristic curves, is
Its interior is the corresponding open domain for the partial differential equation. Uniqueness here means uniqueness in the class of continuous functions satisfying the characteristic equations for a transport equation, including the piecewise smooth function defining the solution of a differential equation above. The endpoints of the initial segment determine the two boundary values by continuity.
This region is maximal for determination by the given data: on , arbitrary extensions of outside give different values on the characteristic curves with . No characteristic curve from reaches .
For ,
The lower boundary is a straight line, the upper boundary is a parabola, and the characteristic carrying the corner is . All three approach the excluded origin as .
Figure 1.
The characteristic region for beta equal to one, with the curve carrying the corner
. Details.
For , . On the two sides of the corner-carrying characteristic curve, the partial derivative is
At every point with , the two one-sided partial derivatives are and . Therefore does not exist on this curve; its piecewise values have a jump discontinuity of magnitude . There are no other interior discontinuities. The values on the outer boundaries are interpreted from within .
This is exactly propagation of a derivative jump along a characteristic. Already on , the data have slopes and on the two sides of . The transport equation transports this corner along the characteristic curve from , which is ; it provides no smoothing. This is consistent with Noncharacteristic Cauchy data and does not contradict the smooth-data theorem, whose differentiability hypothesis fails here.
In the convention , the coefficients of the principal symbol are
Thus the second-order partial differential equation is
There is no region of elliptic partial differential equation type. The terms hyperbolic, parabolic and elliptic refer to the pointwise classification of a second-order partial differential equation. At every second-order coefficient vanishes, so the principal symbol has rank zero and the equation is degenerate rather than genuinely parabolic there. Moreover the right side is , so no twice continuously differentiable classical solution can satisfy the equation at the origin.
For , the equation for the characteristic curves is
The two families are therefore and the characteristic projections from part (a), , together with the vertical characteristic . On either region or , the hyperbolic partial differential equation admits the characteristic coordinates
Indeed is constant along the first family, while . Their Jacobian determinant is
The coefficients of the two pure second partial derivatives in these coordinates vanish, and the coefficient of the mixed partial derivative is . Hence they give the hyperbolic characteristic normal form. They also remain regular at , provided .
The alternative , is valid on patches with . On , it is a parabolic partial differential equation away from the fully degenerate origin, so two independent hyperbolic characteristic coordinates are unavailable.
The second-order differential operator factors as
Therefore setting turns the second-order partial differential equation into exactly the first-order partial differential equation in part (a). Conversely, given a sufficiently smooth solution of a differential equation of that equation on a coordinate rectangle, define
The fundamental theorem of calculus gives , so this solves the second-order equation, with an arbitrary twice continuously differentiable function . This classical correspondence is local on smooth patches; for the cornered solution of part (b), it can instead be interpreted using distributional derivatives.
For the Weierstrass M-test proof of the Picard-Lindelöf theorem, the required bound is
To see this, use Picard iteration starting with and
If takes its values in , then . Thus every Picard iterate remains in the rectangle where the hypotheses hold. Successive applications of the Lipschitz condition and integration give the factorial estimate for Picard iteration
For example, the estimate is , and integrating the th estimate multiplied by proves the next one. The sum of the uniform bounds is
for every finite , by the exponential series. Hence the telescoping series of Picard iterates converges uniformly by the Weierstrass M-test. The uniform limit stays in the closed rectangle, and the Lipschitz condition permits passage to the limit in the integral equation. The fundamental theorem of calculus then gives the desired solution of a differential equation on .
For the direct contraction mapping theorem proof with the usual supremum norm, take the complete metric space
and the Picard iteration map . The estimates are
Thus this proof requires
The first inequality makes preserve ; the strict second inequality makes it a contraction mapping. Its unique fixed point is the desired solution of a differential equation.
This is more restrictive than the preceding Weierstrass M-test argument: a single application of must shrink every difference in the supremum norm, whereas repeated integration in the other proof produces the factorial and convergence even when . If , the additional condition is automatic. These are conditions for the two stated direct proofs; they are not necessary bounds on the actual existence interval.
With the standard constant starting Picard iterate, , the next two Picard iterates are
and, for ,
Thus
The restriction for is essential for the integral from to : the preceding iterate vanishes at , where the new integrand is undefined.
The rectangle avoids the singular line exactly when . There , and the largest on is . Since decreases with , the smallest feasible uniform bound is
It is attained at , . For the Lipschitz constant, the mean value theorem gives
The quotients approach this upper bound as and , so the smallest feasible constant is
Substitution into part (a) gives
The contraction mapping restriction is automatic for every M-test-admissible precisely when . Because ,
Therefore
is exactly the range where the two proofs guarantee all the same closed symmetric intervals, including the largest M-test interval.
For completeness, set and . The M-test allows ; the contraction mapping theorem allows with . At , these have the same supremum , but contraction excludes the endpoint . For , it gives the strictly shorter range . For a particular , both proofs work exactly when both displayed inequalities hold, even for these larger .
Near the solution of a differential equation has , so the separable differential equation gives
Equivalently its trajectory lies on the level set
On , the function is strictly increasing because , and its range is . Thus the positive branch exists exactly where
The connected component containing is
The implicit function theorem gives a smooth solution of a differential equation at every such . It remains finite at every finite , because increases without bound. As , we have , and the original right side becomes singular. Hence this is the maximal interval through the prescribed initial condition.
In particular, the solution is not defined for all . It cannot pass through as a classical solution, since its required value there is .
Treat both sides of at once: for set , . Nonnegativity gives
Define . By the fundamental theorem of calculus, and . The integrating factor gives
Since , this proves the affine Gronwall estimate
Continuous dependence of an ODE solution on parameters here means continuity of the map into with its supremum norm: for every and , all sufficiently close satisfy
Subtract the two integral equations and use the uniform Lipschitz constant on the rectangle. With we obtain
Part (i), with and , therefore proves, for ,
The case follows from uniqueness or the same estimate with zero forcing. If , the direct integral estimate gives . In either case the map is even Lipschitz continuous, and hence continuous, throughout in the stated supremum norm.
The equilibrium points satisfy and , so they are
The Jacobian matrix and its eigenvalue equation are
At the eigenvalues are , so both points are saddle equilibria. Their stable and unstable tangent directions have slopes and , respectively.
At the eigenvalues are , giving a centre for the linearized equation. Purely imaginary eigenvalues alone do not classify the nonlinear system. The first integral established in part (ii) proves that is in fact a centre equilibrium. It is clockwise: immediately to its right, with and , the vector field points downwards. Thus the final nonlinear classification is
Where , taking the quotient of the two ordinary differential equations gives
Choose the first integral
The chain rule checks conservation even at points excluded in taking that quotient:
Thus each trajectory is contained in a connected component of a level set of . At the gradient vanishes and the Hessian matrix is the identity, so has a strict local minimum there. To make the closed-trajectory argument explicit, put and . The bounded component of is
The two arcs join at to form a simple closed curve that is a regular level set. The gradient cannot vanish on it: the only critical point of a dynamical system in is the centre, whose level is .
The vector field is tangent and nowhere zero on this compact set, so its speed has a positive minimum. It therefore traverses the curve in finite time and returns to its initial point, giving a periodic orbit. These ovals shrink to the centre as . This is the planar first integral criterion for a centre and proves the required nonlinear assertion; it also gives Lyapunov stability without asymptotic stability.
The nullclines are
On , away from the equilibrium points, the vector field is vertical. Its crossing direction is downwards for , upwards for , downwards for , and upwards for , because . On each of , the vector field is horizontal: it points right when and left when .
Throughout each complementary region, has the sign of , and has the four signs just listed. These signs orient the level sets from part (ii). In particular, the inner periodic orbits are clockwise. The saddle level is , whose separatrices satisfy
For , the upper arc goes from to ; the lower arc goes back from to . These two heteroclinic orbits form a closed boundary around the family of periodic orbits. The remaining branches of the same saddle level extend outwards. The sketch shows the surrounding nonclosed trajectories as well as the nullclines and equilibrium points.
Figure 1.
The phase plane in coordinates x and y minus beta, showing clockwise periodic orbits and saddle connections
. Details.
Set . Then the autonomous planar system becomes
which has no dependence. Therefore
More precisely, replacing by sends every trajectory to , with the same time parametrization. The equilibrium points, nullclines, periodic orbits and separatrices all undergo this same translation. Their types and orientations are independent of , so varying produces no bifurcation.
Using , in the original autonomous planar system gives
The map is a rotation by , preserving time and the clockwise or counterclockwise orientation of trajectories. Hence the given centre equilibrium at becomes a clockwise centre at , and the given saddle equilibrium at becomes a saddle at . These are the only equilibrium points, because rotation is invertible.
Applying time reversal of an autonomous differential equation to the system from part (i), and renaming its coordinates , gives
The equilibrium points remain and . Time reversal of an autonomous differential equation preserves a saddle equilibrium, interchanging its stable and unstable directions; it also reverses the direction around a centre equilibrium. Therefore this system has precisely the required counterclockwise centre at and saddle at .
One suitable autonomous planar system is
Its equilibrium points are exactly the four combinations . Its Jacobian matrix is
Thus and have eigenvalues and are saddle equilibria. At the other two points the eigenvalues are . To establish the nonlinear centre equilibrium classifications, use the first integral
Its Hessian matrix is , a negative-definite matrix at and a positive-definite matrix at . Thus each is a strict local extremum, and nearby regular level sets are closed curves supporting periodic orbits, by the planar first integral criterion for a centre.
Immediately to the right of , the vector field points down because , so that centre is clockwise. Immediately to the right of it points up because , so that centre is counterclockwise. This verifies both the nonlinear classifications and the prescribed orientations, with exactly four equilibrium points.

Articles by others on the same topic (0)

There are currently no matching articles.