Let
Since and , separating the even and odd terms of the matrix exponential gives
and
Over , triangularize and denote its eigenvalues, with algebraic multiplicity, by . Then
The numbers are all the root of unity solutions of , so
Consequently
If is an eigenvalue of , choose with . The displayed identity makes at least one factor zero. Thus is an eigenvalue of and
Eigenvectors belonging to distinct eigenvalues are linearly independent. Under the hypothesis they therefore form a basis . For every ,
because . A linear map that vanishes on a basis is zero, hence
This proves the Cayley-Hamilton theorem in the distinct-eigenvalue case.
Choose
The Leibniz formula for determinants shows that its leading term is , as required. A scalar is an eigenvalue exactly when has a nonzero kernel, equivalently when it is singular, so
The fundamental theorem of algebra gives a complex root of the degree- polynomial , so every nonempty complex square matrix has at least one complex eigenvalue.
Let the vertex position vectors be . Suppose
Subtracting the second scalar product from the first gives
so the remaining pair of opposite edges of a tetrahedron is also perpendicular.
Put
Direct expansion gives, cyclically,
with the other two differences equal to minus twice the scalar products of the other opposite-edge pairs. All three scalar products vanish, hence
Write
The first equation is then automatic, while the second becomes
Thus the general solution is
As varies, and are antipodal points of the sphere with center and radius , so they are opposite ends of a diameter.
The inequality gives, for ,
For , the terms have magnitude at least and therefore do not tend to zero, so the series diverges by the term test for divergence. Hence
Let
The set contains zero. If and , then by comparison. Moreover, if the original power series diverges at , no can lie in , because absolute convergence at would imply absolute convergence at . Thus is finite and nonnegative.
If , choose with ; comparison gives absolute convergence at . If and the series converged at , then its terms would be bounded. For any with ,
so the geometric series comparison would put in , contradicting the definition of . This proves the radius of convergence property.
For , the ratio is , so the geometric series criterion gives
Condition (iii) is also sufficient. If did not tend to infinity, some would contain infinitely many terms with . Those terms form a bounded subsequence, and the Bolzano-Weierstrass theorem would give it a convergent subsequence, contrary to the hypothesis. Hence and
Condition (ii) is sufficient. If , then eventually . Therefore
so
Condition (i) is insufficient because the allowed limit may be zero. For example, is nonzero and converges to zero, whereas does not converge in .
Let the columns be , and replace by , where . By multilinearity of the determinant,
The second determinant vanishes because it has two equal columns. Hence
Interchanging two rows reverses the sign of an alternating multilinear map, so
In the Leibniz formula for determinants, the same result follows by composing every permutation with the corresponding transposition, which reverses its sign.
The scalar multiplication multiplies every one of the rows by . Applying multilinearity of the determinant once to each row gives
The Leibniz formula for determinants is
Equivalently, the determinant is the unique alternating function of the rows that is multilinear and takes value one on the identity matrix. Multiplying one row by therefore gives
Write with . On a fixed branch of the complex logarithm on which and , the equation becomes
Its real and imaginary parts give the same condition , or
This is a logarithmic spiral. For the principal complex logarithm, it is the portion parametrized by that avoids the branch cut.
Use the principal complex logarithm, for which , and set
Then the definition of complex exponentiation gives
and therefore
Other choices of branch of the complex logarithm produce further valid answers.
Since and ,

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