For , ,
Additivity and complex linearity follow from those of and multiplication in , so is an module homomorphism. In particular the action stays inside . Associativity gives
Both distributive laws hold pointwise. These are exactly the axioms for a right module, proving is a right -module.
The Jordan–Hölder theorem applies to a module of finite length: if
is a composition series of a module, its successive quotients are simple modules. Any two such composition series of a module have the same length , and their composition factors are pairwise isomorphic after a permutation, with multiplicities preserved. Every finite-dimensional module over has finite length, since strict inclusions increase vector-space dimension. A finite-dimensional algebra over a field does not by itself make every possible module finite-dimensional, so the finite-length hypothesis should be retained in the statement.
No. Take and its diagonal subalgebra . The algebra over a field is commutative, so . But does not commute with :
Hence , although . Commutation inside a subalgebra places no condition on elements outside it.
Use the usual unital convention for an algebra over a field. For and ,
Passing to matrices in one fixed basis preserves these identities: , and . Thus is an algebra homomorphism. If , evaluating at gives . Its kernel is zero, so the left regular representation is faithful.
Use the column order in . The two restrictions of degree four coincide and equal ; those of degree five coincide and equal . The centralizer orders give
Thus both are irreducible characters. The remaining given restriction is , and
It splits as two distinct irreducible characters. Neither is , or , since their character inner products with are zero. A finite group has as many complex irreducible characters as conjugacy classes, so these five exhaust them. The sum of squares of irreducible degrees is . The first three degrees contribute , leaving for the two constituents, whose degrees sum to six. Hence both have degree three.
Write one constituent as . All five conjugacy classes are closed under inversion, so all its values are real: . Orthogonality with , and gives
Solving gives , and . The squared norm one gives , so and . Thus are the roots of , namely and . Here the bar labels the other real root, rather than complex conjugation. The other constituent is , so the two last values are interchanged.
The Character table of the alternating group A5 is therefore
The conjugacy class sizes are . A normal subgroup is a union of entire conjugacy classes containing the identity, and its order divides by Lagrange's theorem. A nontrivial such union has size at least ; the only proper divisors of at least are . Subtracting the identity would require a sum of some of equal to , respectively, none of which is possible. Thus is simple.
By the Maschke theorem, the restricted representation is a direct sum of irreducible -modules. The row orthogonality relations for a character table identify the multiplicity of as . Therefore
Using the preceding character inner product identity and the irreducibility of ,
This is the character restriction norm bound. When , the nonzero sum of squares of integer multiplicities is either one or two. Hence the restriction is irreducible, or is the sum of two distinct irreducible characters, each with multiplicity one. This proves the requested index-two character restriction dichotomy directly; normality of an index-two subgroup is a general group theory fact.
The row orthogonality relations for a character table assert that distinct complex irreducible characters are orthogonal and each has squared norm one:
Using the linearity and conjugate-linearity of the character inner product,
Since the multiplicities are nonnegative integers, this is
In a finite group, choose a maximal chain of normal subgroups from to . Finiteness ensures such a chain exists, and maximality leaves no normal subgroup of strictly between successive terms. This is a chief series.
The infinite cyclic group has no chief series. In any finite chain starting at zero, the first nonzero subgroup is . But is a nonzero proper subgroup of it and is normal in . Thus zero is not maximal among the normal subgroups in that first term, contradicting the definition.
For any chief series, is a maximal proper normal subgroup of . The subgroup correspondence theorem identifies normal subgroups of with normal subgroups of containing . Consequently the top chief factor is simple.
Other chief factors need only have no proper nonzero subgroup invariant under the action of the whole group. In ,
is a chief series, where . Conjugation in permutes the three involutions transitively, so none of its three order-two subgroups is normal in . Thus is a minimal nontrivial normal subgroup; the top quotient is . But the bottom chief factor is not simple, since it has proper order-two normal subgroups as an abstract group.
If with , a Sylow p-subgroup has order . The Sylow theorems say that such subgroups exist; every p-subgroup is contained in one; they are all conjugate; and their number divides and satisfies .
Suppose with distinct primes and were simple. A Sylow subgroup of order has order , and divides , so or . If , conjugation gives a nontrivial homomorphism . Its kernel is normal and, by simplicity, trivial. Hence would divide by Lagrange's theorem, impossible because has only one factor of .
If , distinct Sylow subgroups of order meet only in the identity and together contain nonidentity elements. Only elements of remain, including the identity. Every Sylow p-subgroup lies entirely in that remaining set and itself has elements. They must therefore all be the same subgroup, making it normal, again a contradiction. Thus no group of order is simple. If , the preceding p-group argument applies.
For distinct , a finite Abelian group is the direct product of groups of its primary subgroups. A group of order is either cyclic or has every nonidentity element of order , in which case choosing two independent elements gives . Consequently the possibilities are
If the primes coincide, the Fundamental theorem of finitely generated abelian groups gives instead , , and . This classification is used only for the requested list, not for the proof above.
For the Abelian case of Cauchy theorem for groups, use induction on . Choose . If divides , then has order . Otherwise is a nontrivial normal subgroup of order prime to , and has smaller order still divisible by . Induction gives a coset of order ; any lift has order divisible by , because the order of its image divides its own order. A suitable power of then has order . This uses no classification of finite Abelian groups.
For a finite p-group, the class equation is
where the sum is over noncentral conjugacy classes. Each index is a positive power of , hence divisible by . Therefore divides , and the center of a group is nontrivial.
If with and , this is already a proper nontrivial normal subgroup. If , the group is Abelian; the established case of Cauchy theorem for groups gives a subgroup of order , which is normal and proper. Thus

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