Visual Group Theory, Lecture 3.6: Normalizers

preview_player
Показать описание
Visual Group Theory, Lecture 3.6: Normalizers

A subgroup H of G is normal if xH=Hx for all x in G. If H is not normal, then the normalizer is the set of elements for which xH=Hx. Obviously, the normalizer has to be at least H and at most G, and so in some sense, this is measuring "how close H is to being normal". We interpret this in terms of Cayley diagrams, and then prove some basic properties of normalizers: they are always subgroups, and they are unions of cosets -- precisely, those left cosets that are also right cosets.

Рекомендации по теме
Комментарии
Автор

Motivating the normalizer by quantifying the notion of normality through voting is a great pedagogical start.

shaisimonson
Автор

this lecture series is SAVING me!!! thank you so much for uploading these!

katyohsiek
Автор

Greetings from Brazil. This series is my favorite soap opera! :)

puepx
Автор

You are awesome Professor! Even though my semester is over I am binge watching your videos instead of Netflix! Thanks a lot and looking forward to more amazing math! Is it possible for you to do a lecture series on representation theory, I am gonna take that course next sem and I am a final year undergrad student from India! Thanks a lot!

manassrivastava
Автор

Voting idea for explaining is perfect, thank you professor 🙏😊😃

nainamat
Автор

In every math course there's a point in which my neuron snap.
no wait...
yeah it's gone.

atzuras
Автор

I have a problem with the proof of observation 1. Why is the last equality (i. e. Hg=Hb) true? We only assumed that gH=bH, in other words b \in gH. For this equality we would need b \in Hg.

pawebielinski
Автор

1:30 Should be "at minimum ONE element (e) votes "yes""

ijindela
Автор

I guess the color of x at 8:59 should be blue..

smackronme