The eigenvector equations give . Multiplying on the left by therefore gives
This is an orthogonal diagonalization: the linear map acts independently by multiplication by its eigenvalues in the new orthonormal basis. The repeated eigenvalue explains the freedom to rotate the last two basis directions.
The entry of is . Hence is an orthogonal matrix, whose matrix inverse equals its transpose:
This obtains the inverse without unnecessary cofactor calculations.
Using the ordered orthonormal basis chosen in (c), the column matrix is
Other signs or another orthonormal choice within the repeated eigenspace are equally valid, provided the same choice is retained in the remaining parts.
The trace is the sum of the eigenvalues, counting multiplicity, while the determinant is their product:
A direct expansion along the middle row checks the latter: .
Choose two perpendicular unit directions in the eigenspace:
Their pairwise dot products vanish and their Euclidean norms are one. They form an orthonormal basis of eigenvectors, with eigenvalues , as guaranteed for a real symmetric matrix by the spectral theorem for real symmetric matrices.
A vector perpendicular to has the form . Direct matrix multiplication gives
Thus every nonzero such vector is an eigenvector with . The zero vector must be excluded from the literal claim about “any” perpendicular vector, since an eigenvector is nonzero. The eigenspace is two-dimensional. Equivalently, exhibits the spectrum of a scalar matrix plus a rank-one projector.
Solving gives and . A convenient normalized eigenvector is
The displayed nonzero vector proves that four is an eigenvalue. Every nonzero multiple represents the same eigendirection.
The absolute value in the original PDF reflects every negative sine arch upward. The graph is nonnegative, with zeros at for , and it lies below the decaying envelope . On the th arch, differentiation gives a factor proportional to . Thus its unique local maximum is
Successive maximum heights have ratio . At each interior zero the one-sided slopes have opposite signs, producing a corner. The smaller panels below magnify the later arches so that all four remain visible.
Figure 1.
Four positive exponentially damped sine arches, with separate linear-scale enlargements of the later arches
. Details.
The domain of a function is , because the denominator vanishes at zero. Near zero, , so is a vertical asymptote, approached with value from the left and from the right. The horizontal asymptotes are as and as .
Moreover,
Both branches define a strictly decreasing monotone function: the left branch lies below , and the right branch is positive. There are no zeros or vertical-axis intercept.
Figure 1.
The decreasing reciprocal-exponential branches with their three asymptotes
. Details.
Take positive dimensions measured in metres. The volume is and the external surface area constraint is . There is one base and four walls, with no lid. The Lagrange multiplier equations for are
The first equation implies . Multiply the first by and the second by and subtract; this gives , hence . The last equation gives . Substituting into the first yields and therefore .
The constraint now reads . Thus
For a global check, apply the arithmetic-geometric mean inequality to , and , whose sum is . Their product is , so no feasible box has . Equality holds exactly at the dimensions found above. This is the maximum-volume open rectangular box at fixed surface area.

There are unlisted articles, also show them or only show them.