Label the vertices of a regular tetrahedron , and include all its Euclidean isometries, both rotations and reflections. The following list describes every subgroup of cardinality at most six, allowing arbitrary relabelling of the vertices. The numbers count actual subgroups, rather than just their group isomorphism types.
Here is why this is exhaustive. Part b leaves only the trivial group, . The disjoint cycle decomposition gives exactly the two listed kinds of involutions, the three-cycles, and the four-cycles, accounting for all the cyclic subgroups. In a Klein four-group, the nonidentity elements commute. If it contains , any other nonidentity element must be a commuting involution, hence or ; either choice yields the displayed opposite-edge subgroup. If it has no transposition, its three nonidentity elements must be all three double transpositions, yielding the rotational subgroup.
Finally, an subgroup has a unique cyclic subgroup of cardinality three. Its two three-cycles fix the same unique vertex. Every element of the subgroup preserves this vertex, since conjugation preserves that unique cyclic subgroup. Thus it is the full stabilizer subgroup of that vertex. The counts in the list are consequently exhaustive, giving
The two kinds of and the two kinds of Klein four-groups have different geometric behavior despite having the same abstract group isomorphism type within each pair. This is the distinction recorded by the small subgroups of tetrahedral symmetry.
The complete classification up to group isomorphism is
Here is the trivial group. The prime number cases follow from i. For four elements, an element of order of a group element four generates . If there is none, Lagrange's theorem makes every nonidentity element have order of a group element two. Then iv produces a four-element subgroup, which must be all of , giving the Klein four-group.
For six elements, an element of order of a group element six gives . Suppose there is none. If there were no element of order of a group element three either, all nonidentity elements would have order of a group element two. Part iv would then produce a subgroup of cardinality four, contradicting Lagrange's theorem. Thus choose of order of a group element three. There is also an involution : otherwise the five nonidentity elements could be paired into distinct pairs , impossible for an odd number of elements.
The subgroup has index of a subgroup two, so it is a normal subgroup. Indeed, for , both and are the complement of , and for both equal . Consequently is either or . The first possibility makes commute, and then has order of a group element six: forces , so both and divide . This contradicts our assumption. Therefore
Every element is uniquely or , with , and the relation determines all their products. Sending to and to gives a group isomorphism with the symmetric group . This completes the classification of groups of order at most six.
Of these groups, exactly embed in . Concrete subgroups are
There is no subgroup, since does not divide . There is no subgroup either: the order of a group element in a symmetric group is the least common multiple of the lengths in its disjoint cycle decomposition, and on four letters the only possibilities are .

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