Using the signs chosen above, explicit multiplication gives
Thus the nonzero cases obey . This relates the right singular vectors and left singular vectors in a singular value decomposition. For example, if and , then with .
In , every row sums to one, so is an eigenvector with eigenvalue . The antisymmetric direction gives eigenvalue . A direction orthogonal to both is , and direct multiplication shows that it lies in the kernel of a linear map. Normalizing all three gives the complete system
They form an orthonormal basis of . The extra zero eigenvalue reflects the one-dimensional kernel of a linear map for this rank-two rectangular matrix. The question's symbols denote the eigenvalues of ; the nonzero singular values of are their square roots, namely and .
For a matrix with equal diagonal entries, the symmetric and antisymmetric directions and are eigenvectors. Direct multiplication of gives eigenvalues and . Dividing each direction by its Euclidean norm gives
The two normalized eigenvectors are orthogonal; either may independently be replaced by its negative.
A row's squared Euclidean norm is , and the dot product of the two rows is . Thus the row Gram matrix is
For the column Gram matrix, the first and third squared column norms are , the middle one is , and the respective cross-products are . Hence
The two products are square matrices of different sizes; their unequal dimensions are consistent with being rectangular.
Use integration by parts in , writing the integrand as . Since an antiderivative of is ,
The boundary term vanishes because the Gaussian exponential function decays faster than any fixed power. These improper integrals are absolutely convergent, justifying the limiting integration by parts.
Starting from the permitted Gaussian integral , the Gaussian moment recurrence gives and then
More generally, iteration gives , using the double factorial with .
Assume that wrong-note events are independent events and that each note has the same error probability , with . Then their count has a binomial distribution. Choose the mistaken positions in ways and multiply the probabilities of the errors and correct notes:
The endpoint cases or are understood by continuity, giving deterministic counts. More than half means at least mistakes, so
The single-note error probability alone would not determine this count distribution if mistakes were correlated; independence is the additional standard modeling assumption.
A uniformly shuffled deck makes all unordered five-card hands equally likely, giving possible hands. Choose the rank appearing four times in ways; all four suits of that rank are then fixed. The remaining card can be any of the other cards. No hand is counted twice, because five cards cannot contain two different complete four-card ranks. This use of combinatorics gives the probability
Here is a binomial coefficient; the probability also simplifies to .
For , the required derivatives are
At these give , , and . Setting , the three-term Taylor polynomial yields
By the Taylor theorem with Lagrange remainder, the signed error is
It is positive, and . Consequently
The last comparison is exact because . Thus the estimate is an underestimate with the required rigorous absolute error bound.
With the first terms counted from the constant term, Taylor's theorem gives
where lies between and . Continuous derivatives through order on the joining interval are a sufficient hypothesis for this Taylor theorem with Lagrange remainder. The Taylor remainder measures the error of the finite Taylor polynomial; convergence of the corresponding infinite Taylor series is a separate question.

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