The polar form is . Interpreting the fractional complex exponentiation as all its values, a candidate satisfies . The three roots of a complex number are
They have arguments , and , respectively. Since all have modulus one, their squared distances from in the complex plane are , giving
The last is strictly largest, so the required root of a complex number is
Restricting complex exponentiation to its principal value would give only ; the request to choose among roots requires all three values.
Figure 1.
The three values of the fractional complex power and their distances from z
. Details.
Apply the vector triple product identity with . This gives
For column vectors , the scalar triple product is ; replacing by gives the other coefficient. Therefore
The signs follow the stated column convention and the cyclic invariance of the scalar triple product. No independence assumptions on the four vectors are needed.
Write the given matrix as . Expanding its characteristic polynomial along the middle column gives
Thus the eigenvalues are , counted with algebraic multiplicity.
For , solving gives and . For , solving gives , with free. A convenient eigenbasis is therefore
The last two eigenvectors span the two-dimensional eigenspace for . The three columns have determinant , so they are linearly independent and form a basis of . In particular the repeated eigenvalue causes no failure of diagonalizability here.
Let with , using the standard complex Hermitian inner product. Then
Taking the complex conjugate and using yields . Since ,
Thus every eigenvalue of an anti-Hermitian matrix lies on the imaginary axis, including the possible zero eigenvalue; each nonzero eigenvalue is purely imaginary.
Now take and . On one hand . On the other hand
Consequently . Distinct eigenvalues therefore imply
which is the required orthogonality of the eigenvectors.
A normal vector to the plane is , with Euclidean norm . For , , so the distance from a point to a plane is
To verify that this is the minimum, the displacement to the closest point on a plane is parallel to . Put and require . This gives and
For every other point on the plane, the displacement is orthogonal to . The Pythagorean theorem gives , proving minimality.
On the interval containing the initial point, divide the linear ordinary differential equation by to obtain . Its integrating factor is , giving
The initial condition gives . Hence
Direct differentiation gives , so and . The coefficient of vanishes at zero; the boxed expression is the solution on the regular initial-value interval, rather than an assertion of unique continuation through zero.
The right-hand side depends on , suggesting the substitution . Then , so the ordinary differential equation becomes
The original equation is undefined at . If , this is a separable differential equation:
Substituting back gives the implicit family
Differentiating the implicit equation gives , or , verifying it on its permitted intervals.
Division by excluded the constant solution , which must be restored separately:
It satisfies . Together these give all local real solutions on intervals where .
The determinant is . Thus , and its four polynomial roots are
In Cartesian form these are , , and . Their moduli are one and their complex arguments are equally spaced by . The Argand diagram is therefore a square centered at the origin, with sides parallel to the coordinate axes.
Figure 1.
The four roots of z to the fourth equals minus one, plotted on the unit circle in the complex plane.
Details.

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