The differential operator is , with . Because already occurs in the complementary function with a repeated root of a polynomial, an unmodified trial gives zero. Put . The product rule yields
Thus , and we may choose , giving
The other terms arising on twice integrating give , exactly the complementary function, so they need not be included in the particular integral.
Use the method of undetermined coefficients with the polynomial . Substitution into gives
Matching successive coefficients with the forcing gives , , and . Hence a particular integral is
Indeed and give . The complementary function, if wanted, is .
For a genuinely second-order linear ordinary differential equation, assume . Substituting the exponential function into the homogeneous linear differential equation gives . Oscillations arise precisely when its two roots of a polynomial have nonzero imaginary parts, namely
In that case, writing , the real complementary function is
Every nonzero such solution has an oscillatory factor; the oscillation may decay, grow, or keep constant amplitude according to the sign of . This is the oscillatory-root criterion for a real second-order equation; decay is not a prerequisite for oscillation.
For completeness, if and , only real exponential functions occur. If and , only is allowed. If all three coefficients vanish, every twice-differentiable function is allowed, including oscillatory ones; the second-order criterion does not apply to this degenerate identity.
To invert the complex cosine, let and put . Since the exponential function is nonzero, , and Euler's formula gives . Multiplying by yields the quadratic equation . Thus
Choosing either square root of merely exchanges the two signs. The two values have product one, so neither vanishes; taking a complex logarithm is legitimate.
For each choice of sign, all solutions of satisfy . Therefore the full inverse relation is
Conversely, exponentiating any displayed value recovers one root of the quadratic equation, and hence , proving completeness. With a multivalued complex logarithm, the term is already included and this is the source's compact formula for inverse cosine.
The principal inverse cosine requires compatible choices of logarithm branch, square root and sign. Both signs cannot represent that same principal function indiscriminately: at , the two principal-log values are and , whereas the principal is . Thus the printed is correct for the inverse relation, not a pair of interchangeable principal-value formulas.
Put . By Euler's formula, . The binomial theorem gives
Group opposite powers and use :
Since , division by yields
This derivation is an application of the same exponential representation underlying De Moivre's theorem.
In a real orthonormal basis, a matrix is a proper rotation matrix exactly when and . The first condition preserves dot products, and the second preserves orientation of a vector space.
Put , , and , so the rows of the given matrix are . Their squared Euclidean norms and pairwise dot products are
Thus . For the sign of its determinant, use the circulant form:
This proves that it is a rotation matrix. Its fixed axis is , because each row sums to one. The rotation trace formula gives ; the skew part selects a positive angle about the unit axis .
The original triangle has edge vectors and . Its area is half the Euclidean norm of their cross product:
The rotated vertices are twice the three columns of :
A rotation matrix preserves lengths and the angle between the two edge vectors, so it preserves their parallelogram area. More explicitly, for a proper rotation matrix, and , so the rotated edge cross product is again . Therefore
The characteristic polynomial of is
The corresponding eigenvectors may be chosen as and . They are linearly independent, so write . Substitution in the system of ordinary differential equations gives
Independence of the eigenvectors yields two decoupled harmonic oscillator equations. Their four integration constants give the general real solution
Both components can be differentiated directly to verify . Orthogonality of the eigenvectors is unnecessary: diagonalizing this nonsymmetric matrix requires an invertible eigenbasis, not an orthonormal one.
The linear system has the matrix form
The first equation gives . Substitute it into the second to obtain . Substitution into the third gives . Consequently
It follows that
Substitution verifies all three equations. Also , so this solution of a linear system is unique.
Write . The two off-diagonal entries of give
or . If both vanish, is diagonal; if either is nonzero, the trace must be one. Thus the trace criterion for a two-by-two idempotent is
For the diagonal case, idempotence further forces . The stated alternative is only necessary: has trace one but its square is , so it is not idempotent. Among two-by-two matrices of trace one, the additional condition is sufficient by the Cayley-Hamilton theorem, which gives .
The upper-triangular matrix has distinct eigenvalues , with respective eigenvectors and . Thus
The defining power series shows that the matrix exponential respects similarity. Applying solution to the diagonal factor gives
As a direct series check, for ; summing this entry divided by gives the same off-diagonal expression.
For a finite matrix, the series defining the matrix exponential converges absolutely in any matrix norm, because . Thus the Hermitian adjoint may be taken term by term. Since ,
Therefore the matrix exponential of a Hermitian matrix is Hermitian.
If is a diagonal matrix, then . Summing each entry separately gives
For the Hermitian matrix case each is real. The diagonal entry formula itself remains valid for complex diagonal entries.

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