<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Group-Theory on Chen Kai Blog</title><link>https://www.chenk.top/en/tags/group-theory/</link><description>Recent content in Group-Theory on Chen Kai Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Sun, 19 Sep 2021 09:00:00 +0000</lastBuildDate><atom:link href="https://www.chenk.top/en/tags/group-theory/index.xml" rel="self" type="application/rss+xml"/><item><title>Abstract Algebra (10): Representation Theory — Groups Acting on Vector Spaces</title><link>https://www.chenk.top/en/abstract-algebra/10-representation-theory/</link><pubDate>Sun, 19 Sep 2021 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/abstract-algebra/10-representation-theory/</guid><description>&lt;p>&lt;figure class="article-figure">
 &lt;img src="https://blog-pic-ck.oss-cn-beijing.aliyuncs.com/posts/en/abstract-algebra/figures/10_maschke.png" alt="Maschke&amp;rsquo;s theorem: complete reducibility" loading="lazy" decoding="async" class="content-image">
 
&lt;/figure>
&lt;/p>
&lt;p>An abstract group is a set with a binary operation satisfying certain axioms. This is elegant but sometimes hard to work with — how do you compute with elements of a group defined by generators and relations, or extract numerical invariants from a multiplication table? The solution, going back to Frobenius and Burnside over a century ago, is to represent group elements as matrices. Matrices are concrete: you can multiply them, take traces, compute determinants, decompose them into eigenspaces. Representation theory is the systematic study of this idea, and it has become one of the most powerful tools in modern algebra, number theory, and mathematical physics.&lt;/p></description></item><item><title>Abstract Algebra (4): Sylow Theorems — Dissecting Finite Groups</title><link>https://www.chenk.top/en/abstract-algebra/04-sylow-theorems/</link><pubDate>Tue, 07 Sep 2021 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/abstract-algebra/04-sylow-theorems/</guid><description>&lt;p>&lt;figure class="article-figure">
 &lt;img src="https://blog-pic-ck.oss-cn-beijing.aliyuncs.com/posts/en/abstract-algebra/figures/04_group_classification.png" alt="Classification of groups of small order" loading="lazy" decoding="async" class="content-image">
 
&lt;/figure>
&lt;/p>
&lt;p>Lagrange&amp;rsquo;s theorem tells you the order of any subgroup must divide &lt;span class="math-inline">$|G|$&lt;/span>
. That is a necessary condition, and it is famously &lt;em>not&lt;/em> sufficient — the alternating group &lt;span class="math-inline">$A_4$&lt;/span>
 has order &lt;span class="math-inline">$12$&lt;/span>
, but no subgroup of order &lt;span class="math-inline">$6$&lt;/span>
. So the moment you start asking &amp;ldquo;given &lt;span class="math-inline">$|G| = n$&lt;/span>
, what does &lt;span class="math-inline">$G$&lt;/span>
 actually look like?&amp;rdquo;, Lagrange leaves you holding an empty bag.&lt;/p>
&lt;p>The Sylow theorems are what go inside that bag. They say: for every maximal prime power &lt;span class="math-inline">$p^a$&lt;/span>
 dividing &lt;span class="math-inline">$|G|$&lt;/span>
, a subgroup of order &lt;span class="math-inline">$p^a$&lt;/span>
 exists, all such subgroups are conjugate, and their count &lt;span class="math-inline">$n_p$&lt;/span>
 is sharply constrained (&lt;span class="math-inline">$n_p \equiv 1 \pmod p$&lt;/span>
, &lt;span class="math-inline">$n_p \mid [G:P]$&lt;/span>
). Ludwig Sylow proved this in 1872, and 150 years later it is still the first thing you reach for when somebody hands you a finite group of unknown order and asks what it is.&lt;/p></description></item><item><title>Abstract Algebra (3): Quotient Groups and Homomorphisms: The Art of Collapsing Structure</title><link>https://www.chenk.top/en/abstract-algebra/03-quotient-groups-and-homomorphisms/</link><pubDate>Sun, 05 Sep 2021 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/abstract-algebra/03-quotient-groups-and-homomorphisms/</guid><description>&lt;p>A group can be enormous &amp;mdash; millions of elements, intricate multiplication tables, symmetries that take pages to describe. Yet hidden inside every group are natural compression points where you can collapse entire chunks of the group into single elements, producing a smaller group that still remembers something essential about the original. This article develops the machinery for doing that: normal subgroups, quotient groups, homomorphisms, and the isomorphism theorems that tie everything together.&lt;/p></description></item><item><title>Abstract Algebra (2): Group Actions — How Groups Move Things Around</title><link>https://www.chenk.top/en/abstract-algebra/02-group-actions-and-symmetry/</link><pubDate>Fri, 03 Sep 2021 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/abstract-algebra/02-group-actions-and-symmetry/</guid><description>&lt;p>&lt;figure class="article-figure">
 &lt;img src="https://blog-pic-ck.oss-cn-beijing.aliyuncs.com/posts/en/abstract-algebra/figures/02_orbit_counting.png" alt="Counting orbits with Burnside" loading="lazy" decoding="async" class="content-image">
 
&lt;/figure>
&lt;/p>
&lt;h2 id="from-abstract-groups-to-concrete-actions" class="heading-anchor">From Abstract Groups to Concrete Actions&lt;a href="#from-abstract-groups-to-concrete-actions" class="heading-link" aria-label="Permalink to this section" title="Copy link to this section">#&lt;/a>
&lt;/h2>&lt;p>Mental picture before any definitions: a group acting on a set is a collection of moves, and the set is the playground those moves permute. Pick up an object, do a move from the group, set it down. The orbit of an object is everywhere you can take it. The stabilizer is every move that puts it back exactly where it started.&lt;/p></description></item><item><title>Abstract Algebra (1): Groups — Your First Encounter with Algebraic Structure</title><link>https://www.chenk.top/en/abstract-algebra/01-groups-first-encounter/</link><pubDate>Wed, 01 Sep 2021 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/abstract-algebra/01-groups-first-encounter/</guid><description>&lt;h2 id="why-algebraic-structure-matters" class="heading-anchor">Why Algebraic Structure Matters&lt;a href="#why-algebraic-structure-matters" class="heading-link" aria-label="Permalink to this section" title="Copy link to this section">#&lt;/a>
&lt;/h2>&lt;p>&lt;figure class="article-figure">
 &lt;img src="https://blog-pic-ck.oss-cn-beijing.aliyuncs.com/posts/en/abstract-algebra/figures/aa01_dihedral_d4.png" alt="Dihedral group D4: all 8 symmetries of a square" loading="lazy" decoding="async" class="content-image">
 
&lt;/figure>
&lt;/p>
&lt;p>Before any definitions, here is the picture I want you to keep in mind. A group is a set in which you can combine any two elements to get a third, undo any element you have produced, and rearrange parentheses without consequence. That is the entire idea, dressed up. The rest of this article is a slow unpacking of that one sentence.&lt;/p></description></item></channel></rss>