If for a nonzero eigenvector, idempotence gives . Hence
These are the only possible eigenvalues; either may be absent. In fact decomposes every vector into the image and kernel of , so every idempotent matrix is diagonalizable even when it is not an orthogonal projection.
For an idempotent matrix, for every integer . Thus any scalar polynomial reduces to
or equivalently . This expression describes all polynomials in , although its two coefficients need not be unique if or .
Scaling the whole matrix scales all rows. The multilinearity of the determinant therefore gives
This includes for .
The determinant is unchanged by transposition: . In the Leibniz formula for determinants, replacing each permutation by its inverse interchanges the row and column roles without changing its sign of a permutation.
The determinant is an alternating multilinear map of its rows, so exchanging two rows gives the negative of the original determinant: . This also holds when the determinant is zero.
When all three exponents equal , write . The exponential shift rule for differential operators gives and . Thus . Two integrations give
The repeated characteristic root supplies and as homogeneous solutions; forcing at that same exponent needs the further factor.
With and , the first equation is . Multiplication by its integrating factor gives , hence
This holds whether or not . If , solving by a second integrating factor gives
The extra factor is the response to the resonance condition at the forcing exponent; the coincident-root case requires the next part.
For the linear differential operator , the exponential function is an eigenfunction: . Distinct give the two homogeneous solutions, while the method of undetermined coefficients supplies a particular solution at the distinct forcing exponent :
Set . Wherever , the chain rule and the given implicit differential equation give
Thus and . Squaring without losing the square-root sign restriction gives
with either sign of on its interval of definition. These parabolas satisfy . Their vertex is a regular point as a parametrized curve but cannot belong to a differentiable graph satisfying the equation: there while . The degenerate case gives the separate solution in the differential-form interpretation printed in the paper. It would be lost by dividing the equation by .
Figure 1.
Singular initial-point branches and the parabolic integral curves, with their graph-domain restrictions
. Details.
For a nonzero real solution use the Bernoulli power substitution . Dividing the differential equation by gives . The integrating factor yields
Direct substitution shows this formula also solves the equation at its zeros. Division temporarily discarded the additional solution . Since the real power is not locally Lipschitz at zero, the complete real solution family also permits waiting-time solutions of a sublinear Bernoulli equation: join a zero interval to a displayed branch at a root of . At a joining point the branch and its derivative are both zero, so the joined function satisfies the original equation. On each open nonzero interval every solution has the displayed form.
Let be the square matrix whose th column is . The Leibniz formula for determinants is precisely the stated contraction:
A square matrix has zero determinant exactly when its columns are linearly dependent, proving the required equivalence. One direction also follows directly from multilinearity and antisymmetry of a multilinear map: replacing one column by a linear combination of the others leaves only terms with repeated columns, each zero. Conversely, nonzero determinant gives an inverse matrix and hence independent columns.
Every nonzero component of the n-dimensional Levi-Civita symbol is , so its square is one. There are exactly permutations of the distinct indices; all remaining index lists have a repeat and contribute zero. Hence
Reversal has one inversion of a permutation for every pair of indices, hence inversions of a permutation. The sign of a permutation gives
It is for and for .
If all indices are distinct and each lies in , their list is a permutation of . Sorting it takes some number of transpositions. The n-dimensional Levi-Civita symbol equals because its sorted component is . Therefore
The parity of a permutation is independent of the chosen sequence of transpositions.

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