Isomorphism by Ciro Santilli 37 Updated 2025-07-16
Something analogous to a group isomorphism, but that preserves whatever properties the given algebraic object has. E.g. for a field, we also have to preserve multiplication in addition to addition.
Other common examples include isomorphisms of vector spaces and field. But since both of those two are much simpler than groups in classification, as they are both determined by number of elements/dimension alone, see:we tend to not talk about isomorphisms so much in those contexts.
Group homomorphism by Ciro Santilli 37 Updated 2025-07-16
Like isomorphism, but does not have to be one-to-one: multiple different inputs can have the same output.
The image is as for any function smaller or equal in size as the domain of course.
This brings us to the key intuition about group homomorphisms: they are a way to split out a larger group into smaller groups that retains a subset of the original structure.
As shown by the fundamental theorem on homomorphisms, each group homomorphism is fully characterized by a normal subgroup of the domain.
Cayley graph by Ciro Santilli 37 Updated 2025-07-16
You select a generating set of a group, and then you name every node with them, and you specify:
  • each node by a product of generators
  • each edge by what happens when you apply a generator to each element
Not unique: different generating sets lead to different graphs, see e.g. two possible en.wikipedia.org/w/index.php?title=Cayley_graph&oldid=1028775401#Examples for the
Cycle graph (algebra) by Ciro Santilli 37 Updated 2025-07-16
How to build it: math.stackexchange.com/questions/3137319/how-in-general-does-one-construct-a-cycle-graph-for-a-group/3162746#3162746 good answer with ASCII art. You basically just pick each element, and repeatedly apply it, and remove any path that has a longer version.
Immediately gives the generating set of a group by looking at elements adjacent to the origin, and more generally the order of each element.
TODO uniqueness: can two different groups have the same cycle graph? It does not seem to tell us how every element interact with every other element, only with itself. This is in contrast with the Cayley graph, which more accurately describes group structure (but does not give the order of elements as directly), so feels like it won't be unique.
Although quotients look a bit real number division, there are some important differences with the "group analog of multiplication" of direct product of groups.
If a group is isomorphic to the direct product of groups, we can take a quotient of the product to retrieve one of the groups, which is somewhat analogous to division: math.stackexchange.com/questions/723707/how-is-the-quotient-group-related-to-the-direct-product-group
The "converse" is not always true however: a group does not need to be isomorphic to the product of one of its normal subgroups and the associated quotient group. The wiki page provides an example:
Given G and a normal subgroup N, then G is a group extension of G/N by N. One could ask whether this extension is trivial or split; in other words, one could ask whether G is a direct product or semidirect product of N and G/N. This is a special case of the extension problem. An example where the extension is not split is as follows: Let , and which is isomorphic to Z2. Then G/N is also isomorphic to Z2. But Z2 has only the trivial automorphism, so the only semi-direct product of N and G/N is the direct product. Since Z4 is different from Z2 × Z2, we conclude that G is not a semi-direct product of N and G/N.
TODO find a less minimal but possibly more important example.
I think this might be equivalent to why the group extension problem is hard. If this relation were true, then taking the direct product would be the only way to make larger groups from normal subgroups/quotients. But it's not.
The only thing that matters is that students aim towards the goals described at explain how to make money with the lesson.
Any "homework for which the student cannot use existing resources available online" is a waste of time.
The ideal way to go about it is to reach some intermediate milestone, and then document it. You don't have to do the hole thing! Just go until your patience with it runs out. But while you are doing it, go as deep and wide as you possibly can, without mercy.
The Moonshots in Education project also has a fantastic related quote:
Real World Work. Students must produce learning projects with real world applications and an authentic audience.
Commutative ring by Ciro Santilli 37 Updated 2025-07-16
Two ways to see it:
Division ring by Ciro Santilli 37 Updated 2025-07-16
Two ways to see it:
Finite field by Ciro Santilli 37 Updated 2025-07-16
A convenient notation for the elements of of prime order is to use integers, e.g. for we could write:
which makes it clear what is the additive inverse of each element, although sometimes a notation starting from 0 is also used:
For fields of prime order, regular modular arithmetic works as the field operation.
For non-prime order, we see that modular arithmetic does not work because the divisors have no inverse. E.g. at order 6, 2 and 3 have no inverse, e.g. for 2:
we see that things wrap around perfecly, and 1 is never reached.
For non-prime prime power orders however, we can find a way, see finite field of non-prime order.
Video 1.
Finite fields made easy by Randell Heyman (2015)
Source. Good introduction with examples

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