Combine the real variables into . The linear system of ordinary differential equations becomes , hence for arbitrary real . Taking real and imaginary parts gives
The two independent constants cover every real initial condition. In the phase plane, the distance from the origin grows as and the polar angle changes at rate . For the trajectories are outward logarithmic spirals; for they are outward straight rays.
At a fixed point, the first equation gives . Substitution into the second gives , so the equilibrium points are . The Jacobian matrix is
At the origin its eigenvalues are , so the origin is an unstable spiral. The local rotation is clockwise: on the positive -axis the velocity points downward. At either nonzero equilibrium point,
Thus both nonzero equilibria are saddles, with eigenvalues . The stable manifold is tangent to , and the unstable manifold to , at each saddle equilibrium. Since all these equilibrium points are hyperbolic, linear stability of a planar equilibrium gives their actual local types.
For the phase portrait, the nullclines are and , the latter defined away from . The horizontal direction has the sign of ; the vertical direction has the sign of . The system is invariant under , so trajectories occur in centrally symmetric pairs. The arrows below show these directions; the highlighted stable manifolds enter the saddle equilibria, whereas the highlighted unstable manifolds leave them.
Figure 1.
Clockwise unstable spiral and two saddles with stable and unstable separatrices
. Details.
Work locally where the needed derivatives of the level set can be represented by the implicit function theorem. Differentiating while holding the indicated coordinate fixed gives
Multiplying the three implicit differentiation formulas proves
This cyclic partial derivative identity is asserted where all three finite coordinate derivatives exist, in particular when . It is not a globally defined product at points where one of the necessary coordinate parametrizations is singular.
The partial derivatives of are , and . Therefore the three implicit differentiation formulas are
Their product is wherever . The excluded factors identify exactly where these quotient formulas cannot all represent finite partial derivatives.
At the gradient is . The outward radial unit vector is when . Taking its scalar product with the gradient gives the radial directional derivative
Equivalently, on this plane . At the origin the radial unit vector is undefined, but every unit directional derivative is zero. Differentiating along the unnormalized scaling path instead gives at ; that is a rate per scaling parameter, not per unit radial distance.
A stationary point requires and . The Hessian matrix is diagonal:
For , the origin has positive definite Hessian matrix, hence is a strict local minimum, with value zero. The two additional stationary points have value and Hessian matrix ; both are saddle points.
For , the origin is the only stationary point and has an indefinite Hessian matrix, so it is a saddle point. For , the Hessian matrix test is inconclusive, but takes positive values along the -axis and negative values along the -axis arbitrarily near zero. Thus the origin is a degenerate saddle point. There are no local maxima in any case: varying or away from a stationary point increases .
In the -plane take ; holding another fixed merely shifts all contour labels by . The level sets satisfy
For , the origin is a local minimum and are saddle points of a scalar function at contour value . For , a closed contour around the origin is accompanied by unbounded outer components. At the contour satisfies and crosses at the two saddle points of a scalar function. For , two unbounded components remain; negative contours have only outer components.
For , the origin is a saddle point of a scalar function, and the zero contour is , with tangent lines . Positive contours form two components extending on opposite sides of the -axis; negative contours form upper and lower components. These level sets are illustrated below.
Figure 1.
Contours of the quartic surface at z equal to zero for a equal to one and minus one
. Details.
The Wronskian is
On an interval where are continuous, the solutions are linearly independent exactly when at one point, equivalently when the Wronskian is nonzero throughout the interval. Differentiation and the homogeneous linear differential equation give
Hence Abel identity reads . If , the two initial-data vectors are dependent; the uniqueness theorem for ordinary differential equations then makes the corresponding linear combination identically zero. This proves the converse as well as the necessity.
Direct calculation gives
Where , Abel identity gives , and substitution of either solution gives . Thus
These coefficients have singularities at odd multiples of . This does not contradict the Wronskian criterion: its continuous-coefficient interval hypothesis fails at those points.
On , the initial conditions uniquely select . The normalized differential equation is not defined on the whole interval , so the usual global uniqueness theorem for ordinary differential equations cannot give the global initial-value assertion as posed. No choice of finite coefficients at can repair the normalized equation while retaining both displayed solutions: at that point and its first derivative vanish, but its second derivative equals one.
The continuation through a zero of the leading ODE coefficient is a different problem: consider the multiplied, degenerate equation
For this different equation, a globally solution with the given initial data is uniquely . On each regular interval every solution is ; continuity of and at an odd multiple of forces both constants to agree across it. If only piecewise solutions away from the singular points are required, the may change and uniqueness fails. Thus the coefficient singularity and the intended solution regularity must be distinguished.
Both functions satisfy the constant-coefficient homogeneous linear differential equation
Its characteristic polynomial is , so the general real solution is . The three initial conditions give , , and , hence
Here the equation has continuous coefficients and nonzero highest-derivative coefficient everywhere. The uniqueness theorem for ordinary differential equations, applied to its three-component first-order system, gives a unique solution on the entire half-line.
Rewrite the integrand as . The binomial series, uniformly valid in for bounded below one, gives
The integrals of over a full period are respectively . Termwise integration therefore yields the ellipse perimeter expansion near a circle
With the chain rule gives and . Substitution, initially for , gives
The transformed coefficients are and . At , both and are analytic; at , both and are analytic. Each point is singular because a normalized coefficient has a pole, but satisfies the regular singular point criterion for a second-order equation. Thus both points are regular singular points.
For a Frobenius method substitution , the lowest power gives the indicial equation
The repeated indicial root is zero. Setting and equating the coefficient of gives
Consequently the analytic power-series solution of a differential equation is
Taking reproduces the ellipse perimeter expansion.
For a second independent solution, normalize . Reduction of order and give
Since , this has the Logarithmic Frobenius solution form
The logarithm is on the real negative side, or a chosen complex logarithm on a slit complex neighborhood. Its nonzero logarithmic coefficient establishes independence. The physical perimeter is finite at , so it selects the analytic branch rather than this logarithmic one.
By the definition of conditional probability,
Since the form a disjoint partition of the sample space, the law of total probability gives . Substitution proves Bayes' theorem in the required form:
The hypotheses make the denominator positive and each conditioning probability well defined.
Let denote the mattress count and the event of undisturbed sleep. Use the intended model in which the presence of the pea is independent of , with probability , and without a pea sleep is undisturbed. Conditioning on gives
The law of total probability and the equal prior probabilities give
By Bayes' theorem, the posterior probabilities of given are respectively . Therefore the conditional expectation is
Undisturbed sleep shifts the posterior toward larger mattress counts because those counts make the observation more likely.
For any nonnegative random variable with finite expectation and any , Markov's inequality states
Indeed , and taking expectations proves the bound. Nonnegativity is essential.
Each waiting time has the geometric distribution on with success probability : a wait of length consists of failures followed by the prescribed success, so its probability is . Hence
Disjoint successive blocks of independent tosses give independent waiting times. More explicitly, any specified list of block lengths determines exactly one allowed sequence of heads and tails and has probability , the product of the individual block probabilities.
There are waiting times. Multiplication of their probability generating functions and addition of their expectations give
To recover its probability mass function, expand by the negative binomial series:
The coefficient of is therefore
and it is zero below . Equivalently there are compositions of into positive block lengths, each with probability . This is the negative binomial distribution for a sum of geometric waiting times, even though the desired outcome alternates between blocks.
For ,
Since , Markov's inequality gives , and indeed .
Let be the hitting probability of the right endpoint before the left endpoint, starting at . A surviving vase corresponds to that right-endpoint event. Conditioning on the first step of the simple symmetric random walk gives
The Markov property makes the remaining probability depend only on the position after that step. These absorbing endpoint values distinguish the event of interest from its complement.
Let be the expected remaining hitting time of either endpoint, measured in minutes. The first step consumes one minute, after which first-step analysis gives
The expectation is finite: from any interior state, a block of twenty leftward steps guarantees absorption and has probability . Thus the survival probability over successive twenty-step blocks has a geometric upper bound. This justifies using finite expectations in the recurrence.
The homogeneous linear recurrence relation has characteristic polynomial , hence general solution . For the expected-time recurrence, rearrangement gives , for which is a particular solution. Thus
Imposing the absorbing boundary conditions from the preceding parts gives the gambler's ruin formulas
The initial position is . Applying the gambler's ruin hitting probability and mean hitting time gives
For comparison, the original central starting position would give probability and mean time minutes.
Now the event is to hit before , starting at . Up to the first of those two hitting times, translate the interval by one unit; its endpoints become and the starting point becomes . The gambler's ruin hitting probability is therefore
Stopping at is essential: using the original absorbing endpoint would answer a different event.
Normalization of the probability density function gives
The first two moments are
Consequently
The cumulative distribution function is on . For with the uniform distribution on , inverse transform sampling therefore uses
The inverse lies in the required interval and satisfies .
Conditional on , the uniform distribution of the sector's centre angle gives a range of possible centre bearings of length that hit a specified house. Independence of the two angles therefore gives the conditional probability . By the law of total expectation,
For coverage of antipodal points by a randomly oriented sector, the house bearings differ by . For , no single sector can cover both. For , the two allowable arcs of centre bearings overlap in two components, each of length . Thus the conditional probability of a double hit is , not . Averaging against the probability density function gives
Put to obtain . Therefore
The event that is hit but is not has probability . Dividing by the probability that is covered, using the definition of conditional probability, gives
This conditioning concerns angular coverage of a sector; the two house-hit events are not independent.

Articles by others on the same topic (0)

There are currently no matching articles.