Integrate around the real segment from to and the counterclockwise upper semicircle, with . The only enclosed pole is , whose residue is . On the semicircle, and , so its integral has magnitude at most .
The residue theorem thus gives . The line integral converges absolutely, so taking its real part is justified:
The inverse image is an ideal, by preservation of differences and multiplication. It is proper since . If , then ; primality of gives or , hence or . Therefore the inverse image is prime.
For maximality, take the inclusion and . This is a maximal ideal of the field , but its inverse image is in , strictly contained in the proper ideal , so it is not maximal. Preservation of identity matters for proper inverse images: without it the zero homomorphism could pull a proper ideal back to the whole ring.
Use the standard definition that a prime ideal is proper, in addition to the product condition. The quotient operations are
Its zero and identity are and , which differ because is proper. If , then , so primality gives or . Thus one factor is zero. The commutative quotient ring has no nonzero zero divisors and is therefore an integral domain.
The printed definition omits properness. If that omission were read literally, would satisfy its product condition, but would be the zero ring, which is not an integral domain under the standard convention . Properness is the necessary qualification, retained explicitly in this proof.
An ideal is an additive subgroup with for all . A ring homomorphism preserves addition and multiplication; for the rings with identity here use the standard unital convention . If , then , and if then . Thus the kernel is an ideal.
A maximal ideal is a proper ideal such that an ideal satisfying is either or .
Assume condition (iii), and factor . If some , the primary decomposition theorem gives the nonzero summand on which the minimal polynomial is exactly . The operator cannot vanish on this whole summand, or its restriction would have minimal polynomial dividing . Choose with . Then
contradicting (iii) with and . Hence every , proving (iii) implies (ii).
Suppose has no repeated irreducible factor. For every polynomial and integer , its monic greatest common divisors satisfy , since raising to a power changes no membership of an irreducible factor of the square-free . This is the square-free minimal polynomial criterion for polynomial kernel stabilization. The kernel identity proved above gives
Thus (ii) implies (iii) over every field.
Over , the distinct irreducible factors of are linear. The primary decomposition theorem therefore reads , a direct sum of eigenspaces. Taking a basis in each summand gives an eigenbasis, proving (ii) implies (i) over the complex numbers.
Over , take . Its minimal polynomial is , which is an irreducible polynomial over and has no repeated factor. But it has no real eigenvalues, so no real eigenbasis. This is the required counterexample. Over a general field, the phrase “no repeated factors” here refers to irreducible factors in , rather than a prior assumption that those factors split.
If a basis consists of eigenvectors, let be the distinct eigenvalues. A polynomial annihilates the diagonal action exactly when it vanishes at each . Consequently the minimal polynomial is , a product of distinct linear factors. It therefore has no repeated irreducible factor, proving (i) implies (ii).

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