At zero the indicial equation is , with repeated indicial root zero. To exhibit the analytic solution rather than only its candidate exponent, clear the denominator in the normal form:
Substitute and equate coefficients. With for negative indices, the linear recurrence relation is
Every leading coefficient on the left is nonzero. Hence is free and all later coefficients are determined; the Frobenius method guarantees local convergence up to the next singularity. In particular,
For a second solution, use reduction of order. Writing gives , so part (c) yields
The additive constant in the integral only adds a multiple of . As within , its integrand is
Therefore
The nonzero Wronskian proves linear independence, and the logarithm is unavoidable for this second local solution.
Define the Wronskian by . Differentiating and using the normal-form differential equation gives
Integrating this first-order linear differential equation proves Abel's identity:
Thus, on any interval avoiding zero and ,
Absolute-value signs from real logarithms can be absorbed into the constant on each such interval. For linearly independent solutions, .
Set and use the Frobenius solution with . From part (a), the leading coefficients are and . The coefficient of the lowest power is therefore
The indicial equation reduces to , giving
Since , the two indicial roots differ by a nonzero imaginary number, not an integer. Thus the two local Frobenius solutions exist independently on a chosen branch of .
First simplify the coefficient of using
After dividing by , the second-order linear differential equation is
At zero, and , and both products are analytic there. At , and , again with analytic extensions. Thus , and there are no other finite singular points.
Infinity must also be considered because the question asks for all singular points. Put and . The coefficient of in its normal-form equation is . Multiplication by does not make it analytic at zero. Hence .
The orthogonal change of coordinates preserves distance to the origin. On the required quadric surface,
Thus the squared distance is at least . Equality holds precisely when , and the constraint then gives . Using from part (b), the nearest points in the original coordinates are
Substitution checks the constraint directly: . The inequality proves these are global nearest points, rather than merely stationary candidates.
In the orthonormal basis of part (b), the three quadric surfaces have the following forms. For ,
a two-sheeted hyperboloid with axis , vertices , and one sheet on each side of the plane . For ,
an elliptic cone with vertex at the origin and the same axis. For ,
a one-sheet hyperboloid with axis and a waist ellipse at , whose semiaxes are along and along . The sections at fixed enlarge away from the waist.
Figure 1.
The two-sheeted hyperboloid, elliptic cone and one-sheet hyperboloid in separate orthonormal coordinate frames
. Details.
The quadratic form is for the real symmetric matrix
The axis has eigenvalue . On the plane, the characteristic polynomial is
Thus the orthogonal diagonalization from part (a) yields
For later use, one possible orthonormal basis is
Then , , . This explicit choice also confirms that the Euclidean norm is preserved: .
Choose a real unit eigenvector of the real symmetric matrix , with eigenvalue . Its orthogonal complement is an invariant subspace: for any with ,
The restriction of to this -dimensional space is again real and symmetric. Applying the same argument inductively produces an orthonormal basis of real eigenvectors. The base case is immediate. This proves the spectral theorem for real symmetric matrices without assuming that distinct eigenvalues are available.
One can also check that eigenvectors with different eigenvalues are automatically orthogonal: . Within a repeated eigenspace, the Gram-Schmidt process preserves the eigenvector property. Thus repeated eigenvalues cause no obstruction, and .
Here . Splitting the matrix exponential into even and odd powers therefore gives
For the second matrix, , so . Hence
Both are real orthogonal matrices, and hence also unitary matrices.
If , then , and the matrix exponential series gives . Also , since . Thus
The assumed diagonalization ensures that these account for all eigenvalues, including multiplicities. In particular, for ,
both of modulus one, in agreement with the unitary matrix property.
Taking the conjugate transpose term by term in the convergent matrix exponential gives
The matrices and commute, so the matrix exponential product law gives and likewise . Hence .
For , use the inverse and product rules for the conjugate transpose:
The factors commute, as do their inverses, since they are expressions in the same matrix. Consequently
and similarly . Therefore . This rational construction is the skew-Hermitian form of the Cayley transform of a Hermitian matrix, obtained by writing with a Hermitian matrix.
If were a singular matrix, a nonzero vector would satisfy , so . This would make an eigenvalue of the anti-Hermitian matrix, contrary to part (a). Thus . The same argument shows is an invertible matrix, which will also be used below.
Let with . Taking the Hermitian inner product with gives . For an anti-Hermitian matrix,
Consequently . As , the eigenvalue satisfies , or . Zero is included as a purely imaginary eigenvalue.
The squared norm of the original function is
Applying the Parseval identity to part (c), using the evenness of the squared transform, gives
Thus the last integral equals . Now set . Since
we obtain
The apparent singularity at is removable: the continuous value of the integrand there is . No principal-value interpretation is needed.
The real odd function has a purely imaginary odd Fourier transform. Setting and using a product-to-sum identity,
The apparent singularities are removable. Direct evaluation or limits give
In particular, the transform stays finite where its numerator and denominator both vanish.

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