Write and let its constant modulus be . If , then . For , differentiating with respect to and , then applying the Cauchy-Riemann equations, gives
Thus
The coefficient matrix has determinant , forcing . The Cauchy-Riemann equations then also give . Therefore are constant on a connected domain and
This proves the constant-modulus holomorphic function result. If a domain is disconnected, the conclusion applies separately to each connected component.
The Cauchy-Riemann equations are . They give the gradient identity
At a regular intersection, where , the two nonzero gradients are normal vectors to the two level sets, so their tangent directions are perpendicular. This is the orthogonality of regular real and imaginary level curves.
The regularity qualification is necessary: , so at a critical point both normals vanish and the curves need not have unique tangents. For example gives diagonal lines for and coordinate axes for , all meeting at the origin. Thus the conclusion is , rather than an unrestricted claim at critical points.
Since both real matrices are antisymmetric, and . Thus . Expand the two unitary identities:
Subtracting and adding give . Because has simple eigenvalues, each of its complex eigenspaces is one-dimensional. Commutation makes each one invariant under : if , then . Hence for some scalar . The complete eigenbasis of is therefore a common eigenbasis, which also diagonalizes .
The skew-Hermitian decomposition of a unitary matrix is explicit:
If , unitarity gives . Consequently
Equivalently, for the paired eigenvalues are . The hypotheses can only occur in even dimension: and is invertible, whereas an odd-dimensional skew-symmetric matrix has zero determinant.
To avoid confusing the diagonalizing matrix with the exponential, write from part (b). The convergent matrix exponential series gives
Each is purely imaginary, so . The diagonal exponential is therefore a unitary matrix, and
Hence the matrix called in this part is unitary. The series identity gives the same conclusion directly and also covers repeated eigenvalues.
Let and . The skew-Hermitian matrix property gives
where the last equality uses part (a). Distinct eigenvalues therefore imply . Normalize each eigenvector to length one. Since there are distinct eigenvalues, these vectors form an orthonormal basis.
Put them in the columns of . Then is a unitary matrix and , so
A skew-Hermitian matrix satisfies , where denotes the conjugate transpose. If with , then
Since , this gives .
A unitary matrix satisfies . It preserves the Hermitian inner product and norm. Thus if ,
and therefore . Zero is allowed among the purely imaginary eigenvalues in the first statement, but not among the unitary eigenvalues.
Expand the quadratic form of this Gram matrix:
For , linear independence of the real vectors implies , so its squared Euclidean norm is strictly positive. Thus
proving the positive definiteness of a Gram matrix in the independent-vector case.
The diagonalization in part (b) gives . Hence
Sufficiency follows from the scalar powers tending to zero; necessity also follows immediately from the diagonal entries of . Under these conditions the matrix geometric series converges, and its sum is
Writing , and , all entries are explicitly
For example, and . These expressions remain valid when parameter values coincide.
A single eigenbasis works for every choice of the parameters. The columns , , satisfy
They are linearly independent because their column matrix has determinant one. Thus the diagonalization is
This formula includes all coincidences among , so no special repeated-eigenvalue cases need separate bases.
A square matrix is a diagonalizable matrix over the chosen field when there are an invertible matrix and a diagonal matrix such that . If is column of and , the identity gives . Invertibility makes these columns linearly independent eigenvectors.
Conversely, put linearly independent eigenvectors in the columns of and their eigenvalues in . Then is invertible and , giving
Repeated eigenvalues are allowed; the requirement is a complete eigenbasis, not distinctness of the eigenvalues.
The Parseval identity for this Fourier transform convention is
Apply it to . Its squared norm is , so
Under , the last integrand times becomes . Consequently
The integrand has continuous value at zero and decays integrably at infinity, so this is an ordinary convergent improper integral.
Direct evaluation gives the first Fourier transform:
For the even triangular function, the odd sine part integrates to zero. Two elementary integrations by parts or one evaluation of the cosine integral give
The values at zero are the respective areas, agreeing with the removable limits. Therefore . By the convolution theorem and uniqueness of the Fourier transform,
There is also a direct interpretation: the convolution is the length of overlap of the intervals and , giving exactly that triangular profile.
For integrable functions , Fubini's theorem justifies exchanging the two integrals in the Fourier transform of the convolution. Set to obtain
This proves the convolution theorem with the stated normalization:
Using the causal Green's function,
Put . Since is equivalent to , the improper integral converges and gives
The elementary identity follows by differentiating for . Direct substitution checks , and the displayed solution and its first derivative vanish at zero.
To give all solutions allowed by the printed boundary conditions, retain the singular-endpoint qualification from part (b):
Thus the causal integral gives a particular member of a two-parameter family in the first range and the unique solution in the second.
Choose the causal Green function convention for each source point , with when . This automatically gives the two zero-origin limits. The kernel is continuous at , and integrating its equation across the source requires the unit derivative jump .
For , the homogeneous basis from part (a) gives a continuous kernel proportional to . Its derivative at is , so the normalization is . Hence the causal Green function for a repeated-root Euler operator is
The same formula follows from on the right of the source, with .
The singular endpoint matters for uniqueness. If , then , and both and , together with their first derivatives, vanish at zero. Adding any source-dependent linear combination of these homogeneous solutions to preserves the two stated origin conditions. Thus those conditions alone do not determine a unique Green's function in that parameter range. The causal requirement used here selects the displayed kernel. For no nonzero homogeneous solution satisfies both zero-origin limits, so this ambiguity is absent.
The homogeneous equation is a Cauchy-Euler equation. With the power-law ansatz on , its indicial equation is
Thus is a repeated indicial root. The two independent solutions are and , giving
Their Wronskian, with , is , verifying linear independence.
For separation of variables matching the boundary Fourier mode, take with . Because , the reduced ordinary differential equation is
Therefore
The decay of a Fourier mode in a third-order spatial evolution equation requires a sign check: this satisfies the requested limit at positive infinity precisely when . For it remains identically one, while for its amplitude grows exponentially. Hence for those nonpositive values there is no separated solution meeting both prescribed boundary conditions; the printed assumption that is merely real needs this additional restriction for decay.
The first-order condition , combined with , gives
Differentiate this expression with respect to and insert it into . The terms cancel, leaving
Thus the compatibility partial differential equation is
It is exactly . Integrating with respect to therefore gives
where the integration constant may be any function of . Conversely, differentiating this last equation with respect to recovers the compatibility equation.
Insert the proposed leading relation into the two zeroth-order residuals. It gives
and, since ,
Hence . The same relation is forced by when ; its derivative then automatically gives .

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