What does it really mean for a group to be "nilpotent"?
This year, I've asked many people to describe it in simple, memorable terms, and have yet to get a good answer.
Usually: something something about an ascending series. But what exactly, and WHY? Let's dig in! 🧵👇
1/17
First, I'm wasn't at all picking on anyone, but rather, at how this concept (and so many others) are taught in nearly every algebra class and book.
By the end of this thread, you'll learn what nilpotent really means in a memorable visual way you'll never forget!
2/17
First, a quick refresher. In the subgroup lattice of G:
--subgroups H≤G appear as down-sets, like stalagmites
--quotients G/N appear as up-sets, like stalactites.
Here are two groups of order 20. The dihedral group D_5 is a subgroup of one and a quotient of the other.
3/17
Next, recall the commutator subgroup G'. It's the smallest subgroup such that G/G' is abelian.
In other words: "how far can you jump down the lattice so the resulting stalactite is abelian"?
In these examples, the quotients G/G' are:
C3 C4
V4 C4 x C2
4/17
I describe the operation of taking a commutator as a "maximum abelian step" down the lattice.
We can iterate this. The commutator of G' is G'', and so on.
A group is "solvable" if we eventually get to the bottom!
Let's do an example and a non-example.
5/17
Example: the order-24 group SL(2,3) of 2x2 matrices over Z_3 is the smallest group that requires 3 "maximal abelian steps" to reach the bottom.
6/17
Non-example: The alternating group A5 is the smallest nonabelian simple group.
Since G' is normal, there are only two choices for it: {1} and A5. But the former is impossible because A5/{1}≅A5 is nonabelian.
Therefore, we get stuck:
A5 = G = G' = G'' = G''' = ....
7/17
What does this have to do with nilpotent groups?
Solvability is defined algebraically. But that's not how you should think of it.
Solvable means: "if we climb DOWN the lattice, we reach the bottom."
Nilpotent means: "if we climb UP the lattice, we reach the top."
8/17
But just how DO we climb UP a subgroup lattice?
Start at the bottom, Z0:={1}. How do we find a canonical normal subgroup?
Every group has a center! Let's jump up to Z1:=Z(G) in the subgroup lattice!
Now, "chop off" the lattice below Z1, i.e., take the quotient, G/Z1.
9/17
The quotient group has a center. By the isomorphism theorems (see previous images), it has the form G/Z2, for some subgroup Z2 of H.
Now, we have Z0 ⊴ Z1 ⊴ Z2.
Repeat this process: chop off the lattice below Z2 via a quotient G/Z2, and find the center of that: G/Z3.
10/17
In summary, to climb UP a subgroup lattice:
--start at the bottom, and jump up to the center.
--chop off everything BELOW to get a new lattice (a quotient!). Find the center of that group.
--repeat this process.
If we reach the top, then G is nilpotent!
11/17
Theorem: nilpotent => solvable. In plain English, I remember this as:
"it's easier to fall DOWN than to climb UP"
Since p-groups have non-trivial centers, we immediately conclude that they're nilpotent, and hence solvable (which isn't a priori clear).
12/17
There are many equivalent characterizations of what it means to be nilpotent, e.g.: "G is the direct product of its Sylow p-subgroups".
My favorite involves normalizers. If H isn't normal, then it's either "fully" or "moderately unnormal". Here's a picture:
13/17
The index of the normalizer measures "how close to being normal" a subgroup is. This also counts the number of conjugate subgroups.
"Fully unnormal" means that the "fan" of conjugate subgroups is as big as possible. The only left coset that's a right cosets is H itself.
13/17
Theorem: A finite group G is nilpotent iff it has no fully unnormal subgroups.
In particular, p-groups cannot have fully unnormal subgroups. Their subgroup lattices group UP, rather than OUT.
14/17
In summary, a finite group G is:
SOLVABLE if we can climb DOWN its lattice via "maximal abelian steps"
NILPOTENT if we can climb UP its lattice via "jumping up to the center, chopping off below, repeat".
Theorem: "Falling down is easier than climbing up."
15/17
When I showed this to a PhD student last month, I got one of the most audible "AH HA!"s I can ever remember.
Moral: concepts in algebra, and so many other areas of math, NEED to be motivated visually. Unfortunately, this is the exception rather than the norm.
16/17
So why is this? People teach subjects the way they learned them. There's a huge void in the literature that approaches materials in such a memorable way.
Let's change things, and make math more inclusive and accessible! For more materials, see:
Now that my #VisualAlgebra class is in the books, I want to post a long "meta thread" of all 16 weekly threads, with daily summaries. Here's my entire class, including lectures, HW, & exams, in one convenient place.
And stayed tuned for some surprise announcements below!👇🧵
We started #Week1 of #VisualAlgebra with a few quotes from "A Mathematician's Apology" on the beauty of mathematics, and then saw Cayley diagrams for the symmetries of the rectangle and triangle.
In #Week2 of #VisualAlgebra, we explored the Rubik's cube, more Cayley diagrams, group presentations, the impossibility of the word & halting problems, and we classified all frieze groups.
I woke up a few days ago with the sobering realization: actually, I do NOT really understand groups actions.
Spoiler: I do now, but it took some work. And now I realize how incomplete my understanding was. 😳
Let me explain, I think some of you might enjoy this!
1/12 🧵👇
See those "orbit diagrams" above? I got to thinking: "how can we characterize all possible diagrams?" Equivalently, all transitive actions of D_4 (or a group G in general).
Playing around with things, I came up with a few more. But I still didn't know the answer. Do you?
2/12
For example, how many of the following are possible?
Before reading on, see if you can answer this, and generalize to arbitrary groups.
There's a simple elegant answer, that I was never aware of. And I suspect that the majority of people who teach algebra aren't either.
Finishing up our🧵👇 #VisualAlgebra class in #Week15 with divisibility and factorization. I'm a little short on visuals, but here are two really nice ones on what we'll be covering, made by @linguanumerate.
Henceforth, we'll assume that R is an integral domain.
1/8 Mon
The integers have nice properties that we usually take for granted:
--multiplication commutes
--there aren't zero divisors
--every nonzero number can be factored into primes
--any 2 nonzero numbers have a unique gcd and lcm
--the Euclidean algorithm can compute these
2/8 M
Some, but not all of these hold in general integral domains. This is what we'd like understand!
If b=ac, we say "a divides b", or "b is a multiple of a".
If a | b and b | a, they're "associates", written a~b.
We started #Week11 of #VisualAlgebra with a new diagram of one of the isomorphism theorems. I made this over spring break. The concept is due to Douglas Hofstadter (author of "Gödel, Escher, Bach"), who calls this a "pizza diagram".
1/14 Mon 🧵👇
Though we constructed semidirect products visually last week, we haven't yet seen the algebraic definition. On Friday, we saw inner automorphisms, which was the last step we needed.
Recall the analogy for A⋊B:
A = automorphism, B = "balloon".
2/14 M
Next, we asked when a group G is isomorphic to a direct product or semidirect product of its subgroups, N & H.
Here are two examples of groups that we are very familiar with.
Here are two ways to think about it. One involves cosets as "boxes" in a grid, and the other is in terms of the subgroup lattice: to find the index [H:K], just take the product of the edges b/w them.
1/8 Mon
Pause for a quick comment about cosets in additive groups. Don't forget to write a+H, rather than aH. Here's a nice way to see the equality of a left coset and a right coset.
2/8 M
Next, we proved that if [G:H]=2, then H is normal. Here's a "picture proof": one left (resp., right) coset is H, and the other is G-H.
WEEK 2 of #VisualAlgebra! This is only Lecture #2 of the class.
Monday was MLK Day, but on Wed, we learned about the Rubik's cube! I got to show up my rare signed cube with Ernő Rubik himself from 2010! Did a shout out to @cubes_art's amazing talents.
1/8 W
We learned some neat facts about the Rubik's cube, like how the group has just 6 generators, but 4.3 x 10^{19} elements, and a Cayley diagram with diameter of 20 or 26, depending on whether you count a 180 degree twists as 1 or 2 moves.
2/8 W
I showed 3 different groups of order 8, and asked if any are isomorphic. At this point, all they know about what that means is that two groups must have identical Cayley diagrams *for some generating set*.