For the Frobenius solution, differentiate term by term:
The unshifted terms in the equation have coefficient . The extra factors of give the shifted contribution . Equating the coefficient of for gives the linear recurrence relation
Factoring both coefficients is especially useful:
The separate lowest-power equation is . Do not cancel when it vanishes: that is the possible undetermined coefficient at Frobenius resonance.
After division by the leading coefficient, write , where
The only finite singular points of a differential equation are . At zero, and are analytic. At , and are analytic. The regular singular point criterion for a second-order equation therefore makes both points regular.
If infinity is included, it is a regular singular point at infinity as well: and . Equivalently, with the transformed coefficients are and , which satisfy the same regular-singular criterion at .
Using the exponential form of the complex cosine, is equivalent to . Thus the zeros are exactly
At each point , so the cosine has a simple zero. Cubing it gives
The order of a zero of a holomorphic function is therefore three at every zero. There are no finite singularities because this is an entire function.
To classify infinity, examine at . The identity shows that its Laurent series contains the nonzero negative-power coefficients
There are infinitely many terms in the principal part, the criterion for an essential singularity. Therefore This is also the general characterization of a nonpolynomial entire function at infinity.
Insert the specified real part into the polar Cauchy-Riemann equations. The first gives , and integration with respect to gives
The second equation then requires , so . The remaining imaginary additive constant is fixed by . Thus
The resulting polynomial is holomorphic at the origin too, consistently extending the calculation made in polar coordinates with .
For a holomorphic function with , the chain rule gives
Writing and equating real parts and imaginary parts,
For , division by gives the Cauchy-Riemann equations in polar coordinates:
The restriction reflects the coordinate singularity at the origin; the Cartesian equations have no such restriction.
Use and take the Hermitian conjugate in the reverse product order:
The factorization gives , while . Consequently
The last equality uses the fact that commutes with and its inverse. Thus is a Hermitian matrix. The exclusion of the eigenvalue one is essential to define the inverse. Spectrally, an eigenvalue is sent to , a real number. This is the inverse Cayley transform of a unitary matrix without eigenvalue one.
Part (a) makes each real. In the eigenvector basis,
and . Hence .
All factors that are rational functions of commute. Taking the Hermitian conjugate reverses product order and gives
Therefore
so . This is a Cayley transform of a Hermitian matrix, with scale and the convention that an infinite real eigenvalue maps to one.
Applying it to each eigenvector yields
The eigenvectors are unchanged, and because numerator and denominator are complex conjugates. No equals one when . The scalar map is injective on real , so the eigenspaces, including any degeneracies, are preserved exactly.
A complex square matrix is a unitary matrix if . Equivalently, it preserves the complex inner product and hence the norm. If with , then
Division by the positive squared norm gives . Thus every eigenvalue lies on the unit circle.
Let be a Hermitian matrix and with . The scalar equals its own complex conjugate, because
Since and the squared norm is positive, .
Now take and . The inner product satisfies
Subtracting gives . Thus distinct eigenvalues imply , proving orthogonality of the corresponding eigenvectors. Within a degenerate eigenspace, an orthonormal basis may be chosen, but arbitrary distinct vectors in that same eigenspace need not be orthogonal.
At the angles in part (f),
Let the two diagonal matrices be and . Multiplication gives
The vector condition is exactly . For , the general form is therefore
Every pair is attainable, for example with and . The transformation need not be orthogonal or invertible; the question asks only for diagonal rescalings with this one vector image. If and , no linear map can satisfy the condition. If , the entry is arbitrary as well.
Applying the rightmost rotation matrix first gives
Equality with requires , so in the specified range. Then and give
In the reverse order, first fixes , so . Therefore . This explicitly demonstrates that rotations about different axes do not generally commute.
The Hermitian conjugate of a real matrix is its transpose, so
Therefore It is also a real skew-symmetric matrix. It is Hermitian as well only in the exceptional case , precisely when is symmetric. This includes the identity and half-turn cases from part (d), so the zero-matrix overlap should not be excluded.
With the same right-handed active rotation convention as , the direction is fixed, rotates towards , and towards . Therefore
Its columns give the images of the three Cartesian unit vectors, which also makes the signs of this rotation matrix explicit.
The direction is fixed, giving the eigenvalue one. The planar block has characteristic polynomial
Thus the full list of eigenvalues is
The last two are real precisely when , so all three are real exactly for . At even multiples of the matrix is the identity and every vector is fixed. At odd multiples it is a half-turn: the axial eigenvalue remains , while the whole perpendicular plane has eigenvalue .
For other angles, the only real eigenvector direction is the rotation axis; the perpendicular plane is rotated rather than preserving an individual real direction. Its complex eigenvectors can be taken as and for and , respectively. These represent the two complex conjugate planar eigenvalues.
The columns of are an orthonormal basis, since and the first two columns have zero dot product. Thus : it is an orthogonal matrix. Consequently
and hence . This is the preservation of the Euclidean norm by a rotation matrix.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact