Source paper: released examination archive, member 2016/T/a15294w1.pdf. The printed cover dates the examination to 16 June 2017. All three questions and all eighteen terminal subparts, including the two displayed cases in part 3(d), are answered below.
The autonomous planar system has two real state variables, so its phase space is a subset of . It is autonomous because its vector field has no explicit time dependence. The nullclines are and , on which the respective coordinate's instantaneous rate of change vanishes. A critical point of a dynamical system is an intersection where ; the constant trajectory at that point is an equilibrium of an autonomous differential equation. A nullcline alone need not consist of equilibria.
Assume are continuously differentiable near the equilibrium. Put , and expand the vector field:
This Jacobian matrix defines the linearized system. For distinct real eigenvalues, two negative values give a stable node, two positive values an unstable node, and opposite signs a saddle point of a dynamical system. A complex-conjugate pair with negative real part gives a stable focus, and one with positive real part an unstable focus. Thus a hyperbolic saddle has two real eigenvalues of opposite signs, equivalently .
The linearization stability theorem transfers these stability conclusions to the nonlinear system when no eigenvalue has zero real part. Distinctness alone is insufficient: a zero eigenvalue or a purely imaginary conjugate pair leaves a nonhyperbolic equilibrium, for which the nonlinear terms must be examined. In the purely imaginary case the linearized trajectories form a centre, but that does not establish a nonlinear centre.
One useful form of the Bendixson-Dulac theorem is this: let be open and simply connected, and let be continuously differentiable on . If
has one strict sign throughout , then there is no nonconstant periodic orbit lying entirely in . More generally the divergence may have a weak sign provided it is not identically zero on any nonempty open subset. The multiplier is a Dulac function. Green's theorem proves the criterion: the vector field is tangent to a hypothetical closed orbit, so its scaled flux across that boundary is zero, whereas the signed area integral of its divergence would be nonzero.
Intersect the nullclines and . Their intersection equation is , giving the origin and . The Jacobian matrix is
At the origin, , and
For , only the origin is in the nonnegative quadrant, and it is a saddle because its determinant is negative. For , the origin is an unstable node, with two distinct positive eigenvalues, and there is a second equilibrium in the open quadrant. At that second equilibrium, , so it is a saddle. These signs give hyperbolic equilibria, so the nonlinear classifications follow from the linearization stability theorem. The boundary value is excluded from the two stated cases.
Draw the downward-opening nullcline , meeting the axes at , and the line . Their positive intersection is . Use the sign rules
Above both curves the arrows point northwest; below both they point southeast. For , the parabola lies above the line, so arrows between them point northeast. For , their order reverses, so arrows between them point southwest. For , throughout the nonnegative quadrant, with the vertical direction still determined by the line. Mark the origin as an unstable node and as a saddle, and trace sample trajectories consistent with those directions.
Figure 1.
Nullclines and sample trajectories for the representative value
. The displayed vector field is restricted to the nonnegative quadrant. The origin is an unstable node and the interior equilibrium is a saddle. Details.
The quadrant is not positively invariant: on , ; on , . Trajectories reaching either axis there leave the plotted region. The phase portrait describes the portions inside the quadrant, not a claim that all forward trajectories remain inside it.
Let and choose the positive Dulac function
More generally, for , direct differentiation gives
Taking cancels the linear term and makes the quadratic term nonnegative:
The open positive quadrant is simply connected, so the Bendixson-Dulac theorem excludes every nonconstant periodic orbit entirely inside it. Such an orbit cannot touch while staying in the closed quadrant, since its differentiable coordinate would have a local minimum there but . The same argument applies on . It cannot pass through the origin either, by local uniqueness of this smooth autonomous system. Therefore there is no nonconstant closed trajectory in the entire nonnegative quadrant. The calculation illustrates an exponential Dulac multiplier for a quadratic planar system.
The contraction mapping theorem states that a contraction mapping on a nonempty complete metric space has a unique fixed point. Explicitly, if for all and one fixed , then the iterates converge to that fixed point from every . Both self-mapping and completeness are needed; the set need not be a vector space.
For , work on the closed subset
It is a nonempty complete metric space because it is closed in the Banach space of continuous functions with the supremum norm. Define the Picard iteration operator
Choose so that and , omitting a bound whose constant is zero. Such a positive exists. The first inequality makes a self-map, since . The Lipschitz condition gives
so the contraction mapping theorem yields a unique fixed point. The fundamental theorem of calculus makes it a differentiable solution of with ; conversely every solution staying in the rectangle satisfies the integral equation and is a fixed point. This is the local Picard-Lindelöf theorem construction. The interval-restricted space avoids treating functions defined on a shorter interval as elements of .
Under , the same Picard iteration operator maps all of into itself. It need not be a contraction mapping in one step, since can exceed one. Instead repeated integration gives the factorial estimate for Picard iteration
proved inductively by integrating the preceding bound between and . Thus
For some the coefficient is less than one, so is a contraction. Its unique fixed point is also fixed by : and uniqueness forces . Conversely any fixed point of is one of . This iterated contraction argument gives a unique solution on the full interval , without the unjustified extra assumption .
The uniqueness statement is for solutions in the specified rectangle, where is given and controlled. The bound keeps the constructed solution inside that rectangle throughout the interval.
Where , . By the mean value theorem, the solution is strictly decreasing on every interval where it avoids . At , the derivative is zero, so a constant segment there is possible. Thus all solutions are nonincreasing, while strict decrease need not persist through an interval spent at that equilibrium.
For example, choose and around . On the rectangle, , so is continuous, and . The mean value theorem therefore supplies a Lipschitz constant . These choices even satisfy and .
While , separation of variables gives . Therefore the uniquely determined branch up to its first arrival at is
It reaches at , with derivative zero. The restriction is essential: extending the same quadratic beyond two would make its derivative positive and violate the original differential equation. Beyond that time the waiting-time continuation at a non-Lipschitz equilibrium is nonunique.
Two solutions for are
For the second, because ; both have value and derivative zero at two. They are distinct for every . Local Lipschitz continuity fails at the equilibrium, so the existence of these two continuations is compatible with the Picard-Lindelöf theorem.
For each departure time , define
Each branch satisfies the ordinary differential equation, and both joins have matching value and matching derivative zero. Thus is continuously differentiable and satisfies the same initial value problem. If , the solutions differ on , proving infinitely many solutions on every with .
The uniqueness hypotheses fail when the solution reaches . Indeed
No finite Lipschitz constant works on a rectangle containing that level in its interior. The local theorem still controls the earlier branch near zero; it cannot be extended through a point where its hypotheses fail. These are waiting-time continuations at a non-Lipschitz equilibrium.
Figure 1.
The same initial solution admits different departure times from a non-Lipschitz equilibrium
. Each curve arrives at at time two, may remain there, and then decreases again. All displayed joins are continuously differentiable. Details.
The principal coefficients are , , , in the convention . Their discriminant is . Thus it is a hyperbolic partial differential equation where and an elliptic partial differential equation where . Its principal part has parabolic type where ; however the full equation contains and is undefined on . On its actual domain , the parabolic locus is .
The characteristic equation of a partial differential equation is
In a hyperbolic region this gives two distinct real characteristic directions. The singular lower-order coefficient should not be mistaken for an ordinary parabolic point of the full equation on .
In , the characteristic equation of a partial differential equation gives . Integration yields the characteristic coordinates
Their Jacobian determinant is , so they are valid independent coordinates. To see cancellation of the lower-order terms explicitly, first put , and . The chain rule gives
Substitution cancels the first-derivative terms, leaving . With , and , the characteristic normal form is . Integrating once in each variable gives
where are arbitrary twice continuously differentiable functions on the relevant coordinate intervals. This is a curvilinear reduction to the one-dimensional wave equation.
On , the transformed variables satisfy and . Differentiating the displacement data tangentially and using gives
Hence on , on , and the additive constants have sum . The uniquely determined solution is therefore
It is fixed by the data exactly where both needed characteristic arguments belong to their known intervals:
Equivalently, in the plane this is the diamond . In the original coordinates it is bounded by four curved characteristic curves. It lies wholly in . The displayed formula supplies one smooth extension beyond the diamond too, but the specified finite data segment does not determine that extension: one may change or outside its known argument interval. This is the characteristic-coordinate domain of dependence.
Figure 1.
The finite Cauchy-data segment determines a characteristic diamond in transformed coordinates
. The left panel shows its curved image in the original quadrant; the right panel shows the straight-sided diamond after the change of variables. Shading includes both forward and backward determination from the data segment. Details.
The initial curve is , with , so it is characteristic. The displacement data force and therefore on that interval. Along the curve,
The derivative data in case (i) are compatible precisely when . They place no restriction on the rest of . For example, for every real constant ,
solves the equation and has both prescribed data on the curve. Choosing and exhibits more than one solution directly. The initial curve follows one characteristic family, so its data do not determine the other wave family. This is the compatible case of compatibility of Cauchy data on a characteristic curve.
As in case (i), the initial curve is characteristic and its displacement data force . The new derivative data would therefore require
The right-hand side varies along the initial segment. A single number cannot satisfy those conditions, so no classical solution exists.
Characteristic Cauchy data impose a compatibility condition on transverse derivatives without determining the missing independent wave family. Compatible data can leave nonuniqueness, as in case (i); incompatible data have no solution, as here. The distinction follows from compatibility of Cauchy data on a characteristic curve, rather than a noncharacteristic existence-and-uniqueness theorem.

Articles by others on the same topic (0)

There are currently no matching articles.