The dimension formula for a sum of subspaces and the zero intersection imply
But is a vector subspace of the -dimensional space , so its dimension is at most . Equality follows, and the sum is all of . Since the intersection is zero, it is a direct sum:
The argument remains valid for a degenerate ambient symmetric bilinear form; it uses the stated intersection hypothesis rather than assuming nondegeneracy everywhere.
Under the bidual evaluation map, a vector lies in exactly when
That is precisely membership of the orthogonal complement for a bilinear form. Therefore
The dimension formula in part (ii) gives
so . More precisely, the rank-nullity theorem gives
This is the orthogonal complement dimension for a degenerate bilinear form. The possible excess comes from vectors annihilated by the form against all of .
The annihilator of a vector subspace is
If , extend a basis of to one of . In the resulting dual basis of , the last coordinate functionals span . Hence .
The bidual evaluation map is . It is a linear isomorphism in finite dimension. Its inverse image of the annihilator is
This identification uses evaluation only; no choice of inner product is involved.
The rank-nullity theorem states that for a linear map with finite-dimensional domain,
Equivalently, nullity plus rank equals the dimension of the domain. One proof extends a basis of to a basis of ; the images of the added vectors form a basis of .
The fixed points of reciprocal root pairing are and , so part (iii) alone does not establish their parity. Use the polynomial identity itself.
Write , where and allow if one is not a root. After substituting in and canceling away from , obtain
Letting yields , so is even.
Similarly write with . This time cancellation gives . Letting yields , so is even. Thus
The conclusion includes multiplicity zero. It is a consequence of the reciprocal identity in even degree, which is stronger at these fixed points than just pairing the roots.
Let , and suppose with . The reciprocal identity gives, for ,
Near the factor is nonzero. Also has a simple zero there. Hence
This proves equality of the algebraic multiplicities, not merely that the inverse is another eigenvalue. Invertibility excludes zero eigenvalues throughout.
For , factor the matrix inside the determinant:
The second line uses ; the third uses the even matrix size; the last uses part (i). Consequently
In other words, the characteristic polynomial equals its reciprocal polynomial.
Rearrange as
Thus is similar to . Similar matrices have the same characteristic polynomial by part (a), and transposition also preserves it:
Therefore . This is the underlying algebraic source of the reciprocal spectrum of a symplectic matrix.
The identity is symplectic because . For two symplectic matrices ,
Thus the set is closed under matrix multiplication. Every member is invertible by part (i). Multiplying on the left by and on the right by gives
so it is also closed under inverses. Associativity is inherited from the general linear group. These facts prove that the symplectic group is a subgroup of .
The given satisfies and is invertible. Taking determinants in the defining identity of a symplectic matrix gives
Since and , cancellation yields . Hence
In particular every symplectic matrix is invertible. This argument establishes the requested alternatives; the later parts explicitly supply the determinant-one hypothesis that they use.
Let and . By part (ii), these are complementary projection operators with images and . Thus acts as on and on .
The linear operator preserves both summands because it commutes with its own polynomials. Therefore preserves them too, and its restrictions satisfy
Put . Both restrictions of vanish, so the direct sum gives
Hence is a nilpotent linear map. The operator is diagonalizable, since its two summands are its eigenspaces, and it commutes with . This illustrates the Jordan–Chevalley decomposition in the case of two distinct eigenvalues.
Write , . The linear operator vanishes on . On , the identity gives .
By the direct sum in part (i), every vector has a unique expression , and
Consequently
The complementary projection operator is , onto along . These are polynomial projections for a coprime decomposition. In particular the projection does not depend on which Bézout coefficients are chosen: its action on the two summands uniquely determines it.
Evaluate Bézout's identity for polynomials at :
All these linear operators commute because they are polynomials in the same operator. Thus every can be written
The first summand belongs to and the second to , since applying the corresponding operator introduces the product .
If lies in both kernels, the same identity gives . Therefore the sum is direct:
This is the kernel decomposition for coprime polynomials. It uses both annihilation by and the coprimality expressed by the Bézout identity.
Suppose . Every vector has the decomposition
If also belongs to , then . Hence
On its image of a linear map, acts as the identity; on its kernel of a linear map, it acts as zero. Concatenate a basis of the image with a basis of the kernel. The resulting matrix is , where .
Conversely, this block matrix squares to itself, so any linear map having that matrix in a basis satisfies . Thus projection operators are precisely the linear maps with this block form. This is an algebraic projection; no inner product or orthogonality is required.
The minimal polynomial is the monic polynomial of least polynomial degree such that . Here a polynomial is evaluated at the linear operator by , with the constant term acting as .
An annihilating polynomial exists because lie in the finite-dimensional vector space and are therefore eventually linearly dependent. Uniqueness follows by subtracting two monic annihilators of the same least degree: their difference has smaller degree and still annihilates .
Equivalently,
For the forward implication evaluate the factorization at . For the reverse implication divide by using polynomial division; the remainder annihilates , so minimality makes it zero. This also identifies the annihilating polynomials as the principal ideal generated by .
The two-torsion square-class homomorphism image on is all of , realized by the identity, , and multiplication of classes. Its two-isogeny formula companion is . Positivity and prime support allow only . Class five is realized by , whereas class three would require . Reduction modulo three forces one of coprime to be divisible by three; either choice gives odd valuation one on the right, contradicting a square. Multiplication by class five also excludes fifteen. The two-isogeny rank formula gives .
For , , the two-isogeny formula companion is . With the positive-sign standard isogenies, the two preimages of under the dual are and . The two-torsion square-class homomorphism on detects membership in the image of the forward isogeny of elliptic curves by the class of . Thus either preimage lifts precisely when its first coordinate is a rational square. Their being integers turns rational squareness into integer squareness.
For , the abscissa square class map has image contained in . It contains from the identity and . Class three would require a primitive quartic solution . Modulo three this forces divisible by three; modulo nine the right side is then three and the left side zero, a contradiction. Class minus one would multiply by the known class minus three to give three, so is also excluded. This image has size two.
The dual curve is . Its nonzero real abscissas are positive because , so its square class image is contained in . The point gives 21 and gives three, and their product gives seven. Thus this image has size four. The two-isogeny rank formula gives , proving rank one. This combines a local obstruction on one covering with explicit rational witnesses on the other.
For , the two-isogenous curve is . The first-coordinate square-class image on is . The prime-support bound permits only ; square class two would require a primitive integer solution to , whose right side is two modulo three whenever are not both divisible by three. Thus that class is excluded, as is minus one by the subgroup property. The identity and the point supply the remaining two classes.
The image on is : the quadratic factor is positive, so only positive square classes dividing nine occur, and supplies class three. The square-class index formula for two-isogeny descent consequently gives , so the rank of an elliptic curve is zero. Alternatively, the dual-isogeny kernel lies in the image of the forward isogeny because nine is a square, giving . The four rational two-torsion points already account for that index, again forcing rank zero.
In characteristic zero, inducing a Specht module from to gives one copy of each Specht module obtained by adding one box in a valid Young-diagram position. By Frobenius reciprocity, its multiplicity in the induced module equals the multiplicity of in the restriction of that larger Specht module. The restriction branching rule for a symmetric group says this multiplicity is one exactly when removing one corner gives , and zero otherwise. Semisimplicity in characteristic zero turns these multiplicities into the displayed direct-sum decomposition.

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