Groups, cosets and quotient maps
引入| English | 释义 | 拼音 |
|---|---|---|
| coset/ˈkɒset/ | 陪集 | péi jí |
| normal subgroup/ˈnɔːml ˈsʌbɡruːp/ | 正规子群 | zhèng guī zi qún |
| index/ˈɪndeks/ | 指数 | zhǐ shù |
Grouping the clock
- Twelve clock hours fall into three classes: $\{0,3,6,9\}$, $\{1,4,7,10\}$ and $\{2,5,8,11\}$. Adding hours gives the same resulting class whichever representatives you choose.
- This is a quotient group. To know when that construction works, connect orders, cosets 陪集, kernels and normal subgroups 正规子群.
Element order depends on the operation
- The order of $g$ is the least positive integer $k$ with $g^k=e$; it is infinite if no such integer exists. In the additive group $\mathbb Z$, the element $1$ has infinite order.
- In the additive group $\mathbb Z/n\mathbb Z$, for $n\geq2$, the order of $a$ is $n/\gcd(a,n)$. Thus $3$ in $\mathbb Z/12\mathbb Z$ has order $4$, while the identity $0$ has order $1$.
What is the order of 8 in the additive group $\mathbb Z/20\mathbb Z$?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
In ℤ/nℤ the order of a is n / gcd(a, n) = 20 / gcd(8, 20) = 20 / 4 = 5. Check: 5 · 8 = 40 ≡ 0.
Left and right cosets
- A coset is a translate of a subgroup by a group element. For $H\leq G$, the left coset is $gH=\{gh:h\in H\}$; the right coset is $Hg=\{hg:h\in H\}$. They need not agree.
- Left cosets partition $G$ and each has the same size as $H$, since $h\mapsto gh$ is a bijection. Also $aH=bH$ exactly when $b^{-1}a\in H$; in additive abelian groups this becomes $a-b\in H$.
Index and Lagrange
- The index 指数 is the number of left cosets of a subgroup in its ambient group. For finite $G$, counting equal-sized cosets gives $|G|=[G:H]|H|$, so both subgroup orders and element orders divide $|G|$.
- Index still makes sense for infinite groups: $2\mathbb Z$ has two cosets in $\mathbb Z$ (even and odd), without dividing infinite cardinalities. Every coset other than $H$ misses the identity, so is not itself a subgroup.
A subgroup of order 6 sits inside a group of order 42. What is its index?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
By Lagrange's theorem the index is |G| / |H| = 42 / 6 = 7, the number of cosets.
The clock map, worked through
- In additive $\mathbb Z/12\mathbb Z$, let $H=\{0,3,6,9\}$. The three cosets are $H$, $1+H$ and $2+H$, so the index is $12/4=3$.
- Reduction modulo $3$ sends each whole coset to one value in $\mathbb Z/3\mathbb Z$. Its kernel is $H$ and it is onto; adding cosets therefore matches addition modulo $3$.
H = {0, 3, 6, 9}的哪个陪集?
使用陪集差测试对加群ℤ/12ℤ的元素进行分类。
What makes a subgroup normal?
- A normal subgroup is a subgroup unchanged by conjugation by every element of its ambient group. Equivalently, $gHg^{-1}=H$ for every $g\in G$, or $gH=Hg$ for every $g\in G$.
- Every subgroup of an abelian ambient group is normal. Every index-$2$ subgroup is also normal: for $g\notin H$, both $gH$ and $Hg$ are the entire complement $G\setminus H$.
An abelian subgroup can fail normality
- Compose permutations rightmost first. In $S_3$, take $H=\{e,(1\,2)\}$ and $g=(1\,2\,3)$. Although $H$ is abelian, $g(1\,2)g^{-1}=(2\,3)\notin H$, so $H$ is not normal in $S_3$.
- Direct multiplication gives $gH=\{(1\,2\,3),(1\,3)\}$ but $Hg=\{(1\,2\,3),(2\,3)\}$. A left coset and a right coset can overlap without being equal; cosets on the same side remain a partition.
With rightmost-first composition, $H=\{e,(1\,2)\}$ and $g=(1\,2\,3)$ 入 $S_3$. Which is $gH$?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
Multiply g by each element of H: ge = (1 2 3) and g(1 2) = (1 3). The other two-element set listed is Hg.
Every abelian subgroup is normal in every group containing it.
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
The subgroup {e, (1 2)} is abelian but not normal in S₃. The valid rule requires the ambient group to be abelian.
Why quotient multiplication needs normality
- The usual rule $(aH)(bH)=abH$ defines a group operation on cosets exactly when $H$ is normal. The result must be independent of the representatives chosen inside each coset.
- In the previous example, $e$ and $h=(1\,2)$ both represent $H$. Yet $egH=gH$ while $hgH\ne gH$, since $hg=(2\,3)\notin gH$. Thus the coset set exists, but this multiplication is not well-defined.
In $S_3$, use $H=\{e,(1\,2)\}$ and $g=(1\,2\,3)$ to show explicitly why $(aH)(bH)=abH$ depends on representatives. Compose rightmost first.
The elements $e$ and $h=(1\,2)$ both represent $H$. Choosing $e$ in the first factor gives $egH=gH=\{(1\,2\,3),(1\,3)\}$. Choosing $h$ instead gives $hgH=\{(2\,3),(1\,3\,2)\}$. These are different left cosets, so the proposed product of the same two cosets $H$ and $gH$ is not well-defined.
A quotient matches the image
- A homomorphism preserves the group operation. Its kernel is always normal, and the first isomorphism theorem gives $G/\ker\varphi\cong\operatorname{im}\varphi$. This equals the full codomain only when the map is onto.
- For the additive map $\varphi:\mathbb Z/6\mathbb Z\to\mathbb Z/6\mathbb Z$, $\varphi(x)=2x$, the kernel is $\{0,3\}$ and the image is $\{0,2,4\}$. The quotient has $3$ elements and is isomorphic to $\mathbb Z/3\mathbb Z$, not the six-element codomain.
支持 $\varphi:\mathbb Z/6\mathbb Z\to\mathbb Z/6\mathbb Z$, $\varphi(x)=2x$, how many elements does $(\mathbb Z/6\mathbb Z)/\ker\varphi$ have?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
The kernel is {0, 3}, so the index is 6/2 = 3. The image {0, 2, 4} also has three elements; the six-element codomain is not the image.
In additive $\mathbb Z/20\mathbb Z$, let $H=\langle8\rangle$. List $H$, find its index and identify the quotient using a homomorphism.
The multiples of $8$ give $H=\{0,4,8,12,16\}$, of size $5$. Hence $[\mathbb Z/20\mathbb Z:H]=20/5=4$. Reduction modulo $4$ is a well-defined onto homomorphism because $4$ divides $20$; its kernel is exactly $H$. Therefore $(\mathbb Z/20\mathbb Z)/H\cong\mathbb Z/4\mathbb Z$, with cosets distinguished by remainders $0,1,2,3$ modulo $4$.
Lagrange has no general converse
- The alternating group $A_4$ contains the even permutations of four symbols: the identity, eight $3$-cycles and three products of two disjoint transpositions. Its order is $12$, but it has no subgroup of order $6$.
- If such a subgroup existed, its index would be $2$, so it would be normal. In the quotient of order $2$, every $3$-cycle must map to the identity: its image order divides both $3$ and $2$. All eight $3$-cycles would lie in a subgroup with only six elements, a contradiction.
A group of order 12 need not have a subgroup of every order dividing 12.
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
True. The converse of Lagrange's theorem fails: $A_4$ has order 12 but no subgroup of order 6.
How many $3$-cycles are in $A_4$?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
Choose three of the four symbols in 4 ways. Each chosen triple has two cyclic orientations, giving 4 × 2 = 8. All 3-cycles are even.
Explain why $A_4$ has no subgroup of order $6$. Use index, normality and the eight $3$-cycles.
If $H\leq A_4$ had order $6$, it would have index $2$, hence would be normal. The quotient map to $A_4/H$ would send each $3$-cycle to an element whose order divides $3$. Its order also divides $|A_4/H|=2$, so the image must be the identity. All eight $3$-cycles would therefore belong to the six-element kernel $H$, an impossibility. Dividing the group order is necessary for a subgroup order, but not sufficient.
Permutation order: separate disjoint cycles
- Disjoint cycles act independently, so the permutation order is the least common multiple of their lengths. For example, $(1\,2)(3\,4\,5)$ has order $\operatorname{lcm}(2,3)=6$.
- When cycles overlap, first compute the product: rightmost-first gives $(1\,2)(2\,3)=(1\,2\,3)$, of order $3$, not $2$. Reversing the product gives $(1\,3\,2)$; multiplication need not commute.
What is the order of $(1\,2\,3)(4\,5\,6\,7)$ 入 $S_7$?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
The cycles are disjoint, so the order is the lcm of their lengths: lcm(3, 4) = 12.
Compose rightmost first. What is the order of $(1\,2)(2\,3)$?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
The product is (1 2 3), so its order is 3. Taking lcm(2, 2) directly would be invalid because the two displayed cycles overlap.
Conjugacy in the symmetric group
- In $S_n$, two permutations are conjugate exactly when their disjoint cycle lengths agree, including fixed points. Conjugation relabels the symbols while keeping cycle lengths.
- The five cycle types in $S_4$ are $1+1+1+1$, $2+1+1$, $2+2$, $3+1$ and $4$. Their class sizes are respectively $1,6,3,8,6$, adding to $24$; five types mean five classes, not five elements.
How many conjugacy classes does $S_4$ have?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
Conjugacy classes in Sₙ correspond to cycle types, i.e. partitions of n. The partitions of 4 are 4, 3+1, 2+2, 2+1+1 and 1+1+1+1, so there are 5 classes.
How many permutations in $S_4$ have cycle type $2+2$?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
Pair symbol 1 with 2, 3 or 4; the remaining pair is then forced. The three permutations are (1 2)(3 4), (1 3)(2 4), (1 4)(2 3).
Use conjugacy to test normality
- A subgroup is normal exactly when it is a union of whole conjugacy classes of the ambient group. In $S_3$, $A_3=\{e,(1\,2\,3),(1\,3\,2)\}$ is normal; the subgroup $\{e,(1\,2)\}$ omits the other conjugate transpositions.
- In $S_4$, the identity together with all three double transpositions forms the normal subgroup $V_4$. By contrast, $\langle(1\,2\,3\,4)\rangle$ is not normal: conjugation by $(3\,4)$ gives $(1\,2\,4\,3)$, which is not a power of $(1\,2\,3\,4)$.
在所述环境群中是否正规?
区分内部交换性与环境共轭下的不变性。
Which coset set fails to become a group under the usual coset multiplication?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
Only {e, (1 2)} in S₃ is not normal. A₃ has index 2, every subgroup of the additive abelian clock group is normal, and the identity subgroup is always normal.
Worked example: counting finite abelian groups
- Every finite abelian group is a direct product of cyclic groups of prime-power order. For order $p^k$, the abelian groups match the partitions of $k$: for $p^3$, they are $\mathbb Z_{p^3}$, $\mathbb Z_{p^2}\times\mathbb Z_p$ and $\mathbb Z_p\times\mathbb Z_p\times\mathbb Z_p$.
- $\mathbb Z_m\times\mathbb Z_n$ is cyclic exactly when $\gcd(m,n)=1$. The order of $(a,b)$ is the lcm of the orders of $a$ and $b$.
How many abelian groups of order 72, up to isomorphism?
- $72=2^3\cdot3^2$. The exponent $3$ has three partitions ($3$, $2+1$ and $1+1+1$); the exponent $2$ has two ($2$ and $1+1$).
- Choose independently for each prime: $3\times2=6$ groups.
- Is $\mathbb Z_6\times\mathbb Z_{12}$ cyclic? No: $\gcd(6,12)=6\ne1$. Its largest element order is $\operatorname{lcm}(6,12)=12<72$.
How many abelian groups of order $16$ are there, up to isomorphism?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
16 = 2⁴, and 4 has five partitions: 4, 3+1, 2+2, 2+1+1, 1+1+1+1.
Find the order of the element $(4, 6)$ 入 $\mathbb Z_{10}\times\mathbb Z_{8}$.
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
4 has order 10/gcd(4, 10) = 5 in Z₁₀; 6 has order 8/gcd(6, 8) = 4 in Z₈. lcm(5, 4) = 20.
Worked example: Sylow counting
- If $|G|=p^km$ with $p$ prime and $p\nmid m$, then $G$ has subgroups of order $p^k$ (Sylow $p$-subgroups), a partial converse to Lagrange. Their number $n_p$ divides $m$ and satisfies $n_p\equiv1\pmod p$.
- If $n_p=1$, that subgroup is normal. This counting often settles a structure question in two lines.
Every group of order 15 is cyclic. $15=3\times5$.
- $n_3$ divides $5$ and $n_3\equiv1\pmod3$, so $n_3=1$. $n_5$ divides $3$ and $n_5\equiv1\pmod5$, so $n_5=1$.
- Both Sylow subgroups $P_3$, $P_5$ are normal, cyclic and meet only in the identity, so $G\cong\mathbb Z_3\times\mathbb Z_5\cong\mathbb Z_{15}$.
A group has order $20$. How many Sylow $5$-subgroups can it have?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
n₅ divides 4 (so 1, 2 or 4) and n₅ ≡ 1 (mod 5). Only 1 works, so the Sylow 5-subgroup is normal.
For which order must every group be cyclic?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
For 35 = 5 × 7: n₅ | 7 and n₅ ≡ 1 (mod 5) give 1; n₇ | 5 and n₇ ≡ 1 (mod 7) give 1. Order 6 has S₃, order 21 has a nonabelian group (n₇ = 1 but n₃ can be 7), and order 9 has Z₃ × Z₃.
Choose the theorem, check its conditions
- Specify the operation and ambient group. Use finite-group counting for Lagrange, test normality before quotient multiplication, and identify a quotient with the homomorphism's image.
- Compute disjoint cycle lengths before taking an lcm. Internal commutativity of a subgroup does not prove normality; inspect its conjugates in the full group.
Both $V_4=\{e,(1\,2)(3\,4),(1\,3)(2\,4),(1\,4)(2\,3)\}$ and $C=\langle(1\,2\,3\,4)\rangle$ are abelian subgroups of order $4$ 入 $S_4$. Explain why exactly one is normal.
$V_4$ is a subgroup: every nonidentity element squares to $e$, and the product of two distinct nonidentity elements is the third. It contains the whole double-transposition conjugacy class together with $e$, so is normal in $S_4$. The powers in $C$ are $e$, $(1\,2\,3\,4)$, $(1\,3)(2\,4)$ and $(1\,4\,3\,2)$. Conjugating its generator by $(3\,4)$ produces $(1\,2\,4\,3)$, outside this list. Thus $C$ is not normal. Equal size and internal commutativity do not decide normality.