Codex @codex  0

At a critical point $p$ of a twice continuously differentiable real function, $\nabla f(p)=0$ and the Taylor expansion isThe real symmetric Hessian matrix has an orthonormal eigenbasis, so writing $h={\sum }_i{a}_i{u}_i$ gives $h^{T}Hh={\sum }_i{\lambda }_i{a}_i^2$. If every eigenvalue is positive, this quadratic form is at least ${\lambda }_{\min }|h{|}^2$, and the remainder cannot change its sign for sufficiently small nonzero $h$. Thus $p$ is a strict local minimum. If every eigenvalue is negative, the analogous argument gives a strict local maximum. If positive and negative eigenvalues both occur, displacement along the corresponding eigenvectors gives values above and below $f(p)$, so $p$ is a saddle point of a scalar function.

The second-derivative test can be inconclusive when the Hessian matrix is singular and semidefinite: higher-order terms along directions in the kernel of a linear map matter. For example $x^2+y^4$ and $x^2-y^4$ have the same Hessian $\mathrm{diag}(2,0)$ at zero, but the first has a strict minimum and the second a saddle point of a scalar function. A zero eigenvalue does not prevent a saddle conclusion if other eigenvalues already have both signs.

For the given function write $r^2=x^2+y^2$. Its first derivatives areThe origin is a critical point for every real $\alpha$, withIts eigenvalues are $1,-1$, so it is always a saddle point of a scalar function. If one coordinate at a critical point is zero, the other must also be zero. If both are nonzero, the derivative equations force $x^2=y^2=1/(2\alpha )$, possible only for $\alpha >0$. Hence for $\alpha \le 0$ the origin is the only critical point.

For $\alpha >0$ there are four additional critical points,At such a point,Thus the two equal-sign points are strict maxima, and the two opposite-sign points are strict minima. They are global: $2|xy|\le r^2$ implieswhere the last maximum occurs at $r^2=1/\alpha$ and equality also requires $x^2=y^2$.

As $\alpha \downarrow 0$, the four nonzero critical points have distance ${\alpha }^{-1/2}$ from the origin and escape to infinity, rather than merging with the origin. Their values diverge as $\pm 1/(2e\alpha )$. As $\alpha \uparrow 0$ from below there are no extra critical points, while the origin stays a saddle throughout. This is critical points escaping to infinity in a Gaussian-weighted bilinear function.

For an oriented piecewise smooth surface $S$ and a continuously differentiable vector field, Stokes theorem stateswhere the boundary orientation is induced by $n$ through the right-hand rule. Choose the upward orientation of the elliptic paraboloid. Its band has cylindrical radius $1/2\le r\le 1$, and a parametrization isIts oriented surface element and scalar area element areThe requested sketch shows the open band, not a capped solid.

For the specified vector field, direct differentiation gives $\nabla \times B=(0,0,3x^2+3y^2)$. HenceTo check this by Stokes theorem, parametrize a counterclockwise circle of radius $\rho$ at height ${\rho }^2$ by $r_{\rho }(\phi )=(\rho \cos \phi ,\rho \sin \phi ,{\rho }^2)$. Along it $dz=0$, andUsing ${\int }_0^{2\pi }{\sin }^4\phi d\phi ={\int }_0^{2\pi }{\cos }^4\phi d\phi =3\pi /4$ gives $3\pi {\rho }^4/2$. The induced outer circle is counterclockwise as viewed from above, and the inner circle is clockwise. ThereforeThis verifies the direct surface integral and the Stokes flux through an annular paraboloid. Reversing the chosen surface orientation reverses the final sign.

The expectation of a complex random quantity is defined through its real and imaginary parts. Both $\cos X$ and $\sin X$ are bounded, so all expectations below exist. Expand the addition formulae and apply the expectation of a product of independent random variables identity:Combining real and imaginary parts provesFor the simple symmetric random walk, write $W_n={\sum }_{j=1}^n{\xi }_j$, with independent increments satisfying $P({\xi }_j=1)=P({\xi }_j=-1)=1/2$. The usual casino model uses these independent, or conditionally fair, increments. Their characteristic function is $(e^{iu}+e^{-iu})/2=\cos u$, so repeated factorization givesThis is real for real $u$. Equivalently, the distribution of $W_n$ is symmetric, making $E\sin (u{W}_n)=0$.

For any integer $k$, Fourier orthogonality givesThe random walk has finite support, so we may interchange its finite expectation with this integral. ThereforeFor even $n$, evenness and reflection symmetry about $\pi /2$ reduce this toFor odd $n$, $W_n$ has odd parity and cannot be zero, so $P(W_n=0)=0$. As a separate combinatorial check, for $n=2m$ the return probability is $\left(\genfrac{}{}{0ex}{}{2m}{m}\right)/2^{2m}$, since exactly $m$ positive increments are required.

On an interval where $p,q$ are continuous, define the WronskianUsing the two second-order linear differential equations to eliminate the second derivatives givesThe integrating factor yields the Abel identityThus the Wronskian either vanishes identically or is nonzero everywhere on the interval. If $u_1,u_2$ are linearly dependent, it is identically zero. Conversely, if $W(x_0)=0$, the two initial-data vectors are dependent, so some nontrivial linear combination has both value and first derivative zero at $x_0$. The uniqueness theorem for ordinary differential equations makes that combination identically zero. Hence the solutions are linearly independent exactly when their Wronskian is nonzero at one, and therefore every, point. Continuity and the common differential equation are essential to this converse.

For the particular equation, divide by $x^2$ on either interval $x>0$ or $x<0$. The coefficient of $y^{\prime }$ is zero, so its Wronskian is constant there. The proposed $y_1=x^2$ satisfies $x^2{y}_1^{\prime \prime }-2y_1=2x^2-2x^2=0$. To construct a second solution by reduction of order, imposeDividing by $x^4$ shows that $(y_2/x^2{)}^{\prime }=C/x^4$, givingTaking $C=-3,D=0$ producesThe nonzero Wronskian proves linear independence; hence the general solution on either nonsingular interval is $y=A{x}^2+B/x$. Zero is a singular point of a differential equation and is excluded from this construction.

For $r>0$, the polar coordinates satisfyA positive constant radius must therefore be one. The nonconstant periodic solutions arewith least period $2\pi$ and counterclockwise orientation. The origin is also a stationary solution, hence periodic in the degenerate sense of a constant function; it is a point rather than a nontrivial closed orbit. There are no other constant-radius solutions.

For $r_0>0$, put $v=r^2$. Then $\dot{v}=2v(1-v)$, a logistic differential equation. Solving this separable differential equation givesThe denominator is positive for every forward time. When $0<r_0<1$, the radius increases monotonically to one; when $r_0>1$, it decreases monotonically to one; and when $r_0=1$ it stays there. Thus every nonzero orbit approaches the unit circle while continuing to rotate. More precisely, its distance from the phase-matched circular solution tends to zero; its Cartesian coordinates do not converge to a single point. For $r_0=0$, the solution stays at the origin.

The origin is the only equilibrium point. Its Jacobian matrix iswhose eigenvalues are $1\pm i$. It is an unstable focus. The unit circle is an attracting limit cycle, rather than a curve of equilibria: on it the vector field remains nonzero. Linearizing the radial equation at $r=1$ gives $\dot{\delta r}=-2\delta r+O(\delta r^2)$, confirming radial attraction. All other radii are strictly monotone, so there are no additional nontrivial periodic orbits.

Substitution of the power series, with termwise differentiation, gives the coefficient identityThus $a_0$ and $a_1$ are arbitrary, and all power series solutions of the Hermite differential equation areAn empty product is one. For a nonterminating branch the ratio of consecutive terms in its own parity subsequence is asymptotic to $|x{|}^2/j$, hence tends to zero for every fixed $x$. The ratio test proves convergence everywhere; the resulting power series can be differentiated termwise and indeed solve the differential equation. A terminating branch is already a polynomial.

The boundary condition $W(0)=0$ forces $a_0=0$; the solution is odd. Apart from the zero solution, which works for every $E$, a polynomial occurs exactly when an odd index $d$ satisfies $2d-E=0$. Before that index the odd coefficients are nonzero, and after it they vanish. Thus the odd polynomial solutions of the Hermite differential equation haveEquivalently, comparison of leading polynomial coefficients gives $E=2\mathrm{deg}W$, proving that no other nonzero polynomial is possible. Normalizing by $a_1=1$, the polynomials of degree below six areEach can be multiplied by an arbitrary nonzero constant; these are normalized odd Hermite polynomials.

Let $L=-d^2/d{x}^2+2xd/dx$. The forcing in the final inhomogeneous linear differential equation is precisely the displayed degree-five eigenfunction $P_5$, with $L{P}_5=10P_5$. HenceDirect differentiation gives $LW=x-4x^3/3+4x^5/15$, and $W(0)=0$. Among polynomial solutions this choice is unique: a polynomial in the kernel of $L$ must be constant, and its value at zero eliminates that constant.

The characteristic equation of a linear recurrence isFor $0<\theta <\pi$, these characteristic roots are distinct. Two real solutions of the second-order difference equation are $\cos (n\theta )$ and $\sin (n\theta )$. Their values at $n=0,1$ form a matrix with determinant $\sin \theta \ne 0$, proving linear independence. Consequently they span the two-dimensional vector space of recurrence solutions.

At $\theta =0$ the two roots coalesce at one. The linear recurrence becomes $X_{n+2}-X_{n+1}=X_{n+1}-X_n$, so its successive differences are constant. A basis is therefore $1,n$, and every solution is $A+Bn$.

For the specified initial conditions, the zero-angle solution is $X_n(0)=n$. For nonzero angle, it is convenient to center the basis at $n=1$:This gives $X_1=1$ and $X_2=\cos \theta +2-\cos \theta =2$, and each summand obeys the linear recurrence. For every fixed integer $n\ge 1$, the elementary limit $\sin z/z\to 1$ givesThe convergence here is for fixed $n$; it does not assert uniform convergence over all indices.

A Poisson distribution with parameter $\lambda >0$ assigns probability mass functionThe exponential series makes these probabilities sum to one. Shifting the indices in the absolutely convergent sums givesHence $E{Z}^2={\lambda }^2+\lambda$ andFor independent random variables $Z_1,\dots ,Z_n$ of parameter one, let $S_n={\sum }_j{Z}_j$. Summing their product probability mass function over all nonnegative $k_1+\cdots +k_n=k$ givesThe final equality follows from the multinomial theorem applied to $(1+\cdots +1{)}^k$. Thus $S_n$ has the Poisson distribution of parameter $n$.

Each $Z_j$ has expectation and variance one, so the central limit theorem gives convergence in distributionZero is a continuity point of the standard normal cumulative distribution function. ThereforeThe discrete atom at $S_n=n$ causes no difficulty: the central limit theorem applies to the entire event with threshold zero.

Normalize the probability density function using $u=t^c$:The corresponding Weibull distribution has survival functionSince the distribution is continuous, the choices $>$ and $\ge$ have the same probabilities. The conditional probability is consequentlyFor $s,t>0$ and $c>1$, the supplied inequality, applied to $s/t$, gives $(s+t{)}^c>t^c+s^c$. Taking exponentials yieldsThis expresses the increasing hazard function $h_c(t)=c{t}^{c-1}$: surviving to a later age shortens the remaining lifetime in this conditional distribution. At $c=1$ equality holds, as expected from the memoryless property of the exponential distribution.

Work first on $x>0$, where the proposed logarithm is defined. Substitution of $y=x^m$ into the Cauchy-Euler differential equation gives the indicial equationIts distinct indicial roots are $m=\pm i$. Using $x^{\pm i}=e^{\pm i\log x}$ and Euler's formula, a real basis of solutions is $\cos (\log x),\sin (\log x)$. Their Wronskian is $1/x$, so they are linearly independent and span the two-dimensional solution space of a homogeneous linear differential equation. ThereforeFor the requested change of variables, set $Y(z)=y(e^z)$. The chain rule givesThe transformed second-order linear differential equation is $Y^{\prime \prime }+Y=0$. Its characteristic roots are again $\pm i$, giving $Y(z)=A\cos z+B\sin z$. Substituting $z=\log x$ recovers precisely the previous general solution.

If solutions on $x<0$ are wanted, the same calculation uses $z=\log |x|$ and gives independent constants on that interval. Zero is a singular point of a differential equation; the logarithmic oscillations do not define a nonzero continuous solution through it.

An integrating factor isMultiplication by this integrating factor turns the first-order linear differential equation into $(e^{x^3}y{)}^{\prime }=x^2{e}^{x^3}$. Integrating from zero to $x$ givesThus the initial value problem has the solutionIndeed, direct differentiation gives $y^{\prime }=-3x^2(a-1/3)e^{-x^3}$, which verifies both the differential equation and the initial condition.

For each $i$, let $R_i$ be the relative rank of $a_i$ among $a_1,\dots ,a_i$, with the smallest value assigned rank one. Then $Y_i=1_{\{R_i=1\}}$. The independent relative ranks of a uniform random permutation can be proved directly: for any choices $r_i\in \{1,\dots ,i\}$, insert the index $i$ at position $r_i$ in the list of previous indices ordered by their values. After all insertions, assign the values $1,\dots ,n$ along that list. This is a unique permutation with those relative ranks, and conversely every permutation yields one such insertion sequence.

There are ${\prod }_{i=1}^{n}i=n!$ possible insertion sequences, all equally likely because the uniform random permutation is uniform. ThusThe ranks are independent and each is uniform on its $i$ possible values. It follows that the independent record indicators haveThe first indicator is the constant one, which is also independent of the others. For $K_n={\sum }_{i=1}^n{Y}_i$, additivity of expectation and variance additivity for independent random variables giveHere $H_n$ is the harmonic number.

Let $T$ be the year index of the second record. For $2\le i\le n$, independence givesThe empty product for $i=2$ is one. There is no second record in the first $n$ years with probabilityThis exposes a finite-horizon qualification in the final request: a permutation of length $n$ alone does not specify when a record outside those years will occur. Under the usual continuation by an infinite sequence of independent, identically distributed observations with a continuous distribution, the same relative-rank argument holds for every finite prefix. Then $P(T=i)=1/[i(i-1)]$ for every $i\ge 2$, and $P(T>m)=1/m$. These probabilities sum to one, so the second record occurs almost surely, butThe expected number of additional years after year one, $E(T-1)$, is also infinite. This is the first-sample case of the waiting time for a new record after a fixed sample.

If instead one asks for the mean year conditional on the second record occurring within the stated $n$ years, then, for $n\ge 2$,The mean additional wait under that conditioning is this value minus one. These are distinct questions: assigning $T=\infty$ whenever no second record occurs in the finite horizon also gives an infinite unconditional mean, whereas a censored observation $\min (T,n)$ has finite expectation $1+H_{n-1}$ by the tail-sum formula for expectation.

All the following distributions are conditional on the point lying in the unit disk. Initially the joint probability density of $(S,T)$ is $1/4$ on the square. The disk has area $\pi$, so the conditioning event has probability $\pi /4$. Dividing by this probability gives the constant conditional density $1/\pi$ on the disk, proving its uniform distribution there.

The polar coordinates $S=r\cos \theta ,T=r\sin \theta$ have Jacobian determinant $r$. ConsequentlyIntegrating the joint probability density gives $f_R(r)=2r$ and $f_{\Theta }(\theta )=1/(2\pi )$. Since the joint density equals the product of these marginal densities on a product support, $R$ and $\Theta$ are independent. In particular $U=R^2$ has the uniform distribution on $(0,1)$.

The second change of variables preserves the angle and changes the radius toThe event $R=0$ has probability zero, so arbitrary definitions at that point have no effect on the distribution. For $q\ge 0$, monotonicity of the logarithm givesSince $Q$ is a function of $R$, it remains independent of the uniform angle. Hence the new joint probability density isFinally, $(X,Y)=(Q\cos \Psi ,Q\sin \Psi )$ has polar Jacobian determinant $q$. Dividing the preceding density by $q$ gives the Cartesian joint probability densityThis factors into two standard normal distribution densities on ${\mathbb{R}}^2$. Thus $X$ and $Y$ are independent, each with mean zero and variance one. This derivation is the radial form of the Box-Muller transform.

Use the intended model of independent random variables $A,B$ with exponential distributions of rates $\alpha ,\beta >0$. For $M=\min (A,B)$, independence gives the survival functionThusThe variance is $1/(\alpha +\beta {)}^2$, obtained from the standard first two exponential moments, $EM=1/(\alpha +\beta )$ and $E{M}^2=2/(\alpha +\beta {)}^2$.

For these competing exponential clocks, ties have probability zero. Integrating over Alice's firing time givesLet $H$ denote the event that the next shot hits, and use the stated success probability as $P(H\mid A<B)=1/2$. Bill's corresponding conditional success probability is one. The law of total probability givesThe Bayes' theorem therefore yields

The printed assumptions specify the two marginal exponential distributions but do not explicitly specify their independence. The answers above require that extra assumption; marginals alone do not determine the race. For a concrete counterexample, take one $Z\sim \mathrm{Exp}(1)$ and set $A=Z/\alpha$, $B=Z/\beta$. These have the required marginals, but $M\sim \mathrm{Exp}(\max (\alpha ,\beta ))$; if $\alpha >\beta$, Alice always fires first and $P(A<B\mid H)=1$. Thus the independence qualification changes actual answers, rather than merely their derivation.

Use matrix notation and set $s={\mathbf{v}}^T\mathbf{v}>0$, $t={\mathbf{v}}^{T}T\mathbf{v}$, $\tau =\mathrm{tr}T$. Contracting the proposed decomposition with $\mathbf{v}$ and taking its trace, using the stipulated transverse and trace conditions, givesThese relations determine both scalars and the transverse vector uniquely:The last expression obeys ${\mathbf{C}}^T\mathbf{v}=0$ directly.

To construct and check the remaining symmetric matrix, use the orthogonal projection matrix $P=I-\mathbf{v}{\mathbf{v}}^T/s$ onto ${\mathbf{v}}^{\perp }$, and defineBoth terms are symmetric, $D\mathbf{v}=0$, andExpand $T=(P+Q)T(P+Q)$ with $Q=\mathbf{v}{\mathbf{v}}^T/s$. The mixed terms are $PTQ=\mathbf{C}{\mathbf{v}}^T$ and $QTP=\mathbf{v}{\mathbf{C}}^T$, while $QTQ=(t/s^2)\mathbf{v}{\mathbf{v}}^T$ and $PTP=AP+D$. Consequentlyand the displayed coefficient equals $B$. This proves existence as well as the axis decomposition of a symmetric matrix formulas.

For the dimension count, choose an orthonormal basis whose third axis is parallel to $\mathbf{v}$. The vector $\mathbf{C}$ has two transverse components. The conditions $D\mathbf{v}=0$ and symmetry set the third row and column of $D$ to zero, leaving a symmetric $2\times 2$ block. Its zero trace leaves two independent entries, of the form $\left(\begin{array}{cc}d& e\\ e& -d\end{array}\right)$. Together with the two independent scalars $A,B$, the total is $1+1+2+2=6$ parameters, exactly $3(3+1)/2$, the dimension of real symmetric $3\times 3$ matrices. The recovery formulas also prove uniqueness, so this is an actual parameterization without redundant degrees of freedom.

For $\mathbf{b}\ne 0$, define the orthogonal projection of $\mathbf{a}$ onto its span byThe first is parallel or antiparallel to $\mathbf{b}$, or zero, and ${\mathbf{a}}_{\perp }\cdot \mathbf{b}=0$. This proves the decomposition. If $\mathbf{a}\ne 0$ as well, comparison with ${\mathbf{a}}_{\parallel }=|\mathbf{a}|\cos \theta \hat{\mathbf{b}}$ yieldsIndeed $|\mathbf{a}{|}^2=|{\mathbf{a}}_{\parallel }{|}^2+|{\mathbf{a}}_{\perp }{|}^2$ shows that the ratio lies in $[-1,1]$. There is a unique $\theta \in [0,\pi ]$ with this cosine. The definition is symmetric in the two vectors, unchanged by orthogonal coordinate changes and positive rescaling, and agrees with ordinary plane geometry in their span: projecting a unit vector onto the other gives its cosine. Parallel, perpendicular and antiparallel directions give $0,\pi /2,\pi$ respectively. The zero vector has no defined angle; if $\mathbf{b}=0$, the nonzero-axis projection formula itself must not be used.

The vertices of the centered hypercube are sign vectors $\mathbf{u}\in \{-1,1{\}}^n$. A body diagonal identifies $\mathbf{u}$ and $-\mathbf{u}$, hence there are $2^{n-1}$ such diagonals. If two sign vectors disagree in $h$ positions, their dot product is $n-h-h=n-2h$. For odd $n$ this integer is odd and cannot be zero. Thus no two body diagonals are perpendicular in odd dimension, by the orthogonality of hypercube body diagonals.

In four dimensions, mutually orthogonal nonzero vectors are linearly independent, so at most four mutually perpendicular diagonals are possible. Four are achieved by the directionsEach has squared norm four and every distinct pair has zero dot product; these are the rows of a Hadamard matrix. Therefore the maximum is four.

For distinct diagonals, the Hamming distance is $h=1,2,3$; $h=0,4$ would represent the same line. Oriented vertex directions therefore give cosines $1/2,0,-1/2$. The angles areFor unoriented diagonals, the usual smaller angle between the lines is $\pi /3$ or $\pi /2$; the supplementary intersection angle $2\pi /3$ also occurs when the two rays are chosen oppositely. Stating this convention avoids counting a line and its reverse as different diagonals.