The infimum of is its greatest lower bound: means that for every , and that every lower bound of satisfies . The supremum is its least upper bound: means that for every , and every upper bound satisfies . The completeness of the real numbers ensures that both exist for a nonempty bounded set of real numbers.
A left group action is a map satisfying
Define by . The action axioms give
Hence each is a bijection, with inverse , and belongs to the symmetric group . Finally,
so is a group homomorphism.
Lagrange's theorem states that for a subgroup of a finite group ,
in particular, divides . Here is the subgroup index, the number of left cosets of .
The order of a group element is the least positive integer such that . It exists because is finite. The cyclic subgroup consists of exactly , so has order . Applying Lagrange's theorem to this subgroup gives
Acting separately on disjoint sets of four and eight symbols embeds the direct product of groups into . The action is injective since fixing all twelve symbols forces both factors to be identities.
For the lower bound, contains a cycle of order four and contains disjoint cycles of lengths five and three, whose product has order fifteen. The corresponding element of has order of a group element . Every isomorphic subgroup of must therefore contain a permutation of order sixty. We can bound the minimum number of symbols for a permutation of prescribed order directly here.
In the disjoint cycle decomposition of such a permutation, all cycle lengths divide , and their least common multiple must contain the factors , , and . If these factors occur in three distinct cycles, those cycles use at least symbols. If two occur in the same cycle, that cycle has length at least their product: combining costs at least , combining costs at least , and combining costs at least . Each possibility already requires at least twelve symbols. Thus , and
If a permutation has disjoint cycle lengths , then its th power is the identity exactly when every divides . Thus its order of a permutation is .
Suppose is a prime power and has order . Each divides , so is a power of . Their least common multiple is therefore their maximum, forcing some . This cycle already uses all symbols, so is an -cycle.
Conversely, if is not a prime power, choose a prime-power factor containing the full power of one prime divisor of , and put . Then , they are coprime, and . Moreover
so . We can therefore take disjoint cycles of lengths and in , fixing all remaining symbols. Their product has order of a permutation , but it is not an -cycle. This proves the prime-power characterization by full permutation cycles:
A transposition in the symmetric group exchanges two distinct symbols and fixes all others. A permutation cycle sends to , sends to , and fixes the other symbols. Its entries are distinct. For this is the identity permutation.
A group element has order of a group element if is the least positive integer for which its th power is the identity element. For the displayed permutation cycle, its th power sends forward places, with subscripts read modulo . Hence the th power fixes every symbol, whereas for the image of is different from . Thus its order of a group element is exactly , including .

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