This week, I recorded 4 new #VisualAlgebra YouTube videos on group actions. I heavily use the following concepts:
1. G-sets 2. Action graphs 3. Group switchboards 4. Fixed point tables.
Interested? I'll give you a preview here. Please share!
🧵👇1/16
If G acts on S, via ϕ:G→Perm(S), imagine that G has a "group switchboard", w/ a button for each element. Pressing it permutes elements of S, with the rule:
"Pressing the a-button followed by the b-button is the same as pressing the ab-button." This means:
ϕ(a)ϕ(b)=ϕ(ab)
2/16
A G-set is a set w/ an action. This endows it w/ an algebraic structure.
Many books don't define this, which is a mistake.
Note the difference b/w the G-set vs. action graph, which depends on the generating set.
Lecture 5.1: G-sets & action graphs
3/16
The fixed point table of an action ϕ:G→Perm(S) has a checkmark in the (g,s) entry if g fixes s.
We can read the stabilizers off the columns, and the fixators off the rows. These are "dual" concepts.
We should also interpret these using switchboards & action graphs.
4/16
The kernel of an action is the intersection of the stabilizers. The fixed point set is the intersection of the fixators.
These are dual in the fixed point table. The group switchboard analogy is useful.
Lecture 5.2: Five features of group actions
5/16
An important observation is that elements in the same orbit have conjugate stabilizers. Here's a picture for why, the "action graph" interpretation on the right is the most helpful:
If x is a loop from s, and g:s↦s' a path, then g⁻¹xg is a loop from s'
6/16
Intuitively, elements in larger orbits tend to have smaller stabilizers, and vice-versa.
Also, more checkmarks in the fixed table lead to more orbits.
These observations can be quantified with the orbit-stabilizer and orbit-counting theorems.
7/16
The orbit-stabilizer theorem says that there is a bijection b/w elements in the orbit of s, and cosets of the stabilizer of s.
Here's a visual for why this is true. To prove it, just show that the map below is a bijection.
8/16
The orbit-counting theorem says the avg # of checkmarks per row (i.e., the avg size of a fixator) is the number of orbits.
It's worth comparing this to our running example of D₄ acting on binary squares.
Lecture 5.3: Two theorems on orbits
9/16
Next, we'll see 4 examples: a group G acting on...
1. Its elements by multiplication 2. Its elements by conjugation 3. Its subgroups by conjugation 4. Its cosets by multiplication
Here's the first one, and a 1-line proof of Cayley's theorem.
10/16
Here's the action of G on its elements by conjugation.
It's worth characterizing our "five fundamental features":
1. orbits 2. stabilizers 3. fixators 4. kernel 5. fixed point set
11/16
Here's the action of G on its subgroups by conjugation.
Once again, we'll characterize our "five fundamental features", and revisit our two theorems on orbits.
It's helpful to superimpose the action graph on the subgroup lattice.
12/16
One of my favorite examples is A₄, and it's something we've seen since Chapter 3.
These last 2 pictures are from an old lecture, way back when we introduced normal subgroups:
Lecture 3.4: Normalizers and normal subgroups
13/16
Our last action is new, but arguably the most important: G acting on cosets of some subgroup H≤G.
Also, *every* transitive G-set is isomorphic to such a G-set!
This is constructed by collapsing the *right* cosets in a Cayley graph.
14/16
**Don't let someone tell you that you can only take the quotient by a subgroup if it's normal!**
You can ALWAYS quotient by the right cosets and get a G-set. If it's normal, that G-set happens to be a group.
[In Ch 3, we constructed G/H by collapsing by *left* cosets.]
15/16
Here's a summary of our 4 examples actions and the fundamental features.
Please share, I think this will be helpful to algebra students and instructors alike!
Lecture 5.4: Examples of actions
16/16
One more thing! You can find the entire playlist (currently have 45 lectures, am planning about 100) at the following webpage. I have the slides posted as well.
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*.