Abstract Algebra Exercise Solutions

Warning

The problems and solutions are only reviewed by AI and provided “as is”, without warranty of any kind, express or implied, including but not limited to the warranties of correctness of proof, fitness for a particular purpose and noninfringement.

Tip

View PDF if MathML is not rendered properly in your browser.

1 Groups, Orders, and Permutation Groups

Problem 1.1

Prove that every subgroup of (ℤ,+) is of the form

𝑚 ℤ = { 𝑚 𝑡 | 𝑡 ∈ ℤ } ,
where 𝑚∈ℤ≥0.

Proof. Let 𝐺≤(ℤ,+). When 𝐺={0}, 𝐺=0ℤ. Otherwise, 𝐺 contains at least one non-zero element and its inverse, which implies it contains at least one positive integer. Let 𝑚=min{𝑔∈𝐺|𝑔>0}. 11 Well-ordering principle.

  1. Prove 𝐺⊆𝑚ℤ. For any 𝑔∈𝐺, if 𝑔∉𝑚ℤ, write 𝑔=𝑘𝑚+𝑟 where 𝑘∈ℤ, 𝑟∈ℕ and 0<𝑟<𝑚. Then 𝑟=𝑔−𝑘𝑚∈𝐺, contradiction.
  2. 𝑚ℤ⊆𝐺 is obvious because 𝑚∈𝐺 and 𝑚ℤ=⟨𝑚⟩≤𝐺.⁠∎

Problem 1.2

In a group 𝐺, let 𝐻1≤𝐺 and 𝐻2≤𝐺, and define

𝐻 1 𝐻 2 ≔ { ℎ 1 ℎ 2 | ℎ 1 ∈ 𝐻 1 , ℎ 2 ∈ 𝐻 2 } .
Give an example showing that, in general, 𝐻1𝐻2 need not be a subgroup.

Proof. Let 𝐺=𝑆3 be a symmetric group, 𝐻1=⟨(12)⟩={𝑒,(12)}, 𝐻2=⟨(23)⟩={𝑒,(23)}.

𝐻1𝐻2={𝑒,(12),(23),(123)} 22 Using the usual right-to-left composition, (12)(23)=(123)., but (123)(12)=(13)∉𝐻1𝐻2.⁠∎

Problem 1.3

Let 𝐺 be a finite group. Prove that for any two distinct elements 𝑎,𝑏∈𝐺, 𝑜(𝑎𝑏)=𝑜(𝑏𝑎).

Note that 𝑎𝑏 and 𝑏𝑎 conjugate. In fact, conjugate elements have the same order.

Proposition 1.4

Let 𝐺 be a group. Prove that for any two conjugate elements 𝑎,𝑏∈𝐺, 𝑜(𝑎𝑏)=𝑜(𝑏𝑎).

Proof. Write 𝑏=𝑔𝑎𝑔−1 where 𝑔∈𝐺. For any positive integer 𝑛,

𝑏 𝑛 = ( 𝑔 𝑎 𝑔 − 1 ) 𝑛 = 𝑔 𝑎 𝑛 𝑔 − 1 ,

which implies

𝑏 𝑛 = 𝑒 ⇔ 𝑔 𝑎 𝑛 𝑔 − 1 = 𝑒 ⇔ 𝑎 𝑛 = 𝑒 .

Problem 1.5

  1. Let 𝐺 be a group and let 𝑔∈𝐺 be an element of finite order 𝑛. Let 𝑟 be a positive integer and let 𝑑=gcd{𝑟,𝑛} be the greatest common divisor of 𝑟 and 𝑛. Prove that 𝑜(𝑔𝑟)=𝑛𝑑.
  2. Let 𝐺 be a cyclic group of order 𝑚 (𝑚>1). Determine all generators of 𝐺.
  1. Proof. Note that

    ( 𝑔 𝑟 ) 𝑛 𝑑 = ( 𝑔 𝑛 ) 𝑟 𝑑 = 𝑒 𝑟 𝑑 = 𝑒 ,

    so 𝑜(𝑔𝑟)|𝑛𝑑. There exists 𝑘∈ℕ+ such that 𝑛𝑑=𝑘𝑜(𝑔𝑟), which implies 𝑑𝑘|𝑛.

    We shall prove 𝑘=1. On the other hand,

    𝑒 = ( 𝑔 𝑟 ) 𝑜 ( 𝑔 𝑟 ) = 𝑔 𝑟 𝑛 𝑑 𝑘 ⇒ 𝑛 | 𝑟 𝑛 𝑑 𝑘 ⇒ 𝑑 𝑘 | 𝑟 .

    So 𝑑𝑘 is a common divisor of 𝑟 and 𝑛. Given 𝑑=gcd{𝑟,𝑛}, 𝑑𝑘|𝑑. Hence 𝑘=1.⁠∎

  2. Let 𝐺=⟨𝑔⟩={𝑒,𝑔,𝑔2,…,𝑔𝑚−1}, 𝑟∈{1,2,…,𝑚−1}. We prove the following are equivalent:

    1. 𝑔𝑟 generates 𝐺;
    2. 𝑜(𝑔𝑟)=𝑚;
    3. gcd{𝑟,𝑚}=1.

    Proof. (1) ⇔ (2) is trivial. (2) ⇔ (3) is a special case of (a).⁠∎

Problem 1.6

Let 𝐺 be a group of order 10. Prove that 𝐺 contains at most 4 nontrivial elements of order 5.

Proof. If there is no element of order 5, we are done. Otherwise choose 𝑔∈𝐺 of order 5. By Problem 1.5, 𝑔2,𝑔3,𝑔4 are order 5 elements since their exponents are coprime to 5. The order of 𝑔 ensures that 𝑔,𝑔2,𝑔3,𝑔4 are distinct.

If there is another element ℎ∈𝐺\⟨𝑔⟩ of order 5, then ℎ,ℎ2,ℎ3,ℎ4 also are distinct elements of order 5. Observe that {𝑔,𝑔2,𝑔3,𝑔4}∩{ℎ,ℎ2,ℎ3,ℎ4}=∅. 33 Otherwise one could deduce ℎ∈{𝑔,𝑔2,𝑔3,𝑔4}.

Now we have identified 9 distinct elements in 𝐺: {𝑒,𝑔,…,𝑔4,ℎ,…,ℎ4}. Let 𝑥 denote the remaining one. We wish to derive a contradiction by questioning its order. Recall 𝑜(𝑥)|𝑜(𝐺)=10.

  1. 𝑜(𝑥)=1 is definitely impossible.
  2. 𝑜(𝑥)=2, in which case 𝑔ℎ=ℎ𝑔=𝑥. 44 Verified through elimination: it always leads to contradiction if 𝑔ℎ is equal to any other element in 𝐺. Same for ℎ𝑔. It follows that

    𝑒 = 𝑔 5 ℎ 5 = ( 𝑔 ℎ ) 5 = 𝑥 5 = 𝑥 ,
    contradicting the choice of 𝑥.
  3. 𝑜(𝑥)=5 makes 𝐺 contain 𝑥2,𝑥3,𝑥4 that are disjoint from ⟨𝑔⟩ and ⟨ℎ⟩. So you get at least 1+4+4+4=13 elements.
  4. 𝑜(𝑥)=10. In 𝐺=⟨𝑥⟩, the four elements 𝑥2,𝑥4,𝑥6,𝑥8 form the unique subgroup of order 5. 55 By Problem 1.5. Thus if 𝑔 is one of them, then ℎ must also lie in ⟨𝑔⟩, contradicting the choice of ℎ.

Therefore, all order-5 elements lie in ⟨𝑔⟩, which has exactly four nontrivial elements.⁠∎

Problem 1.7

Let ℝ denote the set of real numbers and let ℝ∗=ℝ\{0}. For any 𝑎∈ℝ∗ and 𝑏∈ℝ, define a map 𝑓𝑎,𝑏:ℝ→ℝ as follows:

𝑓 𝑎 , 𝑏 ( 𝑥 ) = 𝑎 𝑥 + 𝑏 , ∀ 𝑥 ∈ ℝ .

Let 𝐺={𝑓𝑎,𝑏|𝑎∈ℝ∗,𝑏∈ℝ} be the set of all such maps.

  1. Prove that 𝐺 forms a group under composition of maps.
  2. Find the center of 𝐺.
  1. Proof. Composition of maps is associative. For every 𝑓𝑎,𝑏,𝑓𝑐,𝑑∈𝐺:

    ( 𝑓 𝑎 , 𝑏 ∘ 𝑓 𝑐 , 𝑑 ) ( 𝑥 ) = 𝑎 ( 𝑐 𝑥 + 𝑑 ) + 𝑏 = 𝑎 𝑐 𝑥 + 𝑎 𝑑 + 𝑏 = 𝑓 𝑎 𝑐 , 𝑎 𝑑 + 𝑏 ∈ 𝐺 ,

    so 𝐺 is closed under multiplication. Clearly, 𝑓1,0 is the identity of 𝐺, and 𝑓𝑎,𝑏−1=𝑓1𝑎,−𝑏𝑎.⁠∎

  2. Solution. For every 𝑓𝛼,𝛽∈𝑍(𝐺):

    ∀ 𝑓 𝑎 , 𝑏 ∈ 𝐺 , ∀ 𝑥 ∈ ℝ , 𝑓 𝛼 , 𝛽 𝑓 𝑎 , 𝑏 ( 𝑥 ) = 𝑓 𝑎 , 𝑏 𝑓 𝛼 , 𝛽 ( 𝑥 ) .

    By definition of 𝑓𝑎,𝑏:

    𝛼 ( 𝑎 𝑥 + 𝑏 ) + 𝛽 = 𝑎 ( 𝛼 𝑥 + 𝛽 ) + 𝑏 𝛽 𝑎 + ( 1 − 𝛼 ) 𝑏 = 𝛽 , ∀ 𝑎 ∈ ℝ ∗ , 𝑏 ∈ ℝ .

    Hence 𝛼=1,𝛽=0. 𝐺 has a trivial center {𝑓1,0}.

Problem 1.8

Let

SL 2 ( ℤ ) = { ( 𝑎 𝑏 𝑐 𝑑 ) | 𝑎 , 𝑏 , 𝑐 , 𝑑 ∈ ℤ , 𝑎 𝑑 − 𝑏 𝑐 = 1 } .

Prove that SL2(ℤ) is generated by the matrices

𝑻 = ( 1 1 0 1 ) , 𝑺 = ( 0 1 − 1 0 ) .

Proof. Clearly, SL2(ℤ) forms a group under matrix multiplication with identity 𝑰𝟐. It suffices to prove that, by multiplying 𝑨=(𝑎𝑏𝑐𝑑)∈SL2(ℤ) by finitely many 𝑻,𝑺,𝑻−1, we can always reduce it to 𝑰2.

We use the notation 𝑨→𝑷𝑩 to denote 𝑷𝑨=𝑩.

When 𝑐≠0, write 𝑎=𝑘𝑐+𝑟 where 𝑘∈ℤ,0≤𝑟<|𝑐|. Do the following transformation

( 𝑎 𝑏 𝑐 𝑑 ) → 𝑻 − 𝑘 ( 𝑟 ∗ 𝑐 ∗ ) → 𝑺 ( 𝑐 ∗ − 𝑟 ∗ )

finitely many times to reduce 𝑐 to 0. 66 This process terminates because the absolute value of the lower-left entry strictly decreases. It is essentially the Euclidean algorithm on the first column.

When 𝑐=0, 𝑨 has the form (1𝑏01) or (−1𝑏0−1) since det𝑨=1. Then we can further reduce it to 𝑰2:

( 1 𝑏 0 1 ) → 𝑻 − 𝑏 𝑰 2 ;
( − 1 𝑏 0 − 1 ) → 𝑻 𝑏 − 𝑰 2 → 𝑺 2 𝑰 2 .

⁠∎

Problem 1.9

Compute the cycle decomposition of 𝜎=(1357)(2345)(567)∈𝑆7.

Solution.

1 → 1 → 1 → 3 3 → 3 → 4 → 4 4 → 4 → 5 → 7 7 → 5 → 2 → 2 2 → 2 → 3 → 5 5 → 6 → 6 → 6 6 → 7 → 7 → 1

(1357)(2345)(567)=(1347256).

Problem 1.10

Let 𝜎∈𝑆𝑛(𝑛>2). Write 𝜎 as a product of finitely many disjoint cycles 𝜎1,𝜎2,…,𝜎𝑘 where 𝜎𝑖 has length 𝑟𝑖. Find the order of 𝜎.

Lemma 1.11

Let 𝜎1,𝜎2,⋯,𝜎𝑘(𝑘≥2) be disjoint cycles in 𝑆𝑛, then ⟨𝜎1⟩∩⟨𝜎2,…,𝜎𝑘⟩={𝑒}.

Proof. Let

𝜎 = 𝜎 1 𝑎 1 = ∏ 𝑖 = 2 𝑘 𝜎 𝑖 𝑎 𝑖 , 𝑎 𝑖 ∈ ℤ for each 1 ≤ 𝑖 ≤ 𝑘 .

We shall prove 𝜎=𝑒. If 𝜎1=𝑒, we are done. Otherwise, take 𝑥∈supp(𝜎1), then 𝑥∉supp(𝜎𝑖) for each 2≤𝑖≤𝑘, which implies 𝜎𝑖𝑎𝑖(𝑥)=𝑥. Therefore

𝜎 1 𝑎 1 ( 𝑥 ) = ( ∏ 𝑖 = 2 𝑘 𝜎 𝑖 𝑎 𝑖 ) ( 𝑥 ) = ( ∏ 𝑖 = 2 𝑘 − 1 𝜎 𝑖 𝑎 𝑖 ) ( 𝜎 𝑘 𝑎 𝑘 ( 𝑥 ) ) = ( ∏ 𝑖 = 2 𝑘 − 1 𝜎 𝑖 𝑎 𝑖 ) ( 𝑥 ) = ⋯ = 𝜎 2 𝑎 2 ( 𝑥 ) = 𝑥 .

Let 𝑟 be the length of 𝜎1, since 𝜎1 is a cycle, 𝑟∣𝑎1. Note that 𝑜(𝜎1)=𝑟, so 𝜎=𝜎1𝑎1=𝑒.⁠∎

Proposition 1.12

Let 𝜎1,𝜎2,⋯,𝜎𝑘 be disjoint cycles in 𝑆𝑛, then

𝐺 = ∏ 𝑖 = 1 𝑘 ⟨ 𝜎 𝑖 ⟩
is a direct product.

Proof. Every element of ⟨𝜎𝑖⟩ commutes with every element of ⟨𝜎𝑗⟩ since disjoint cycles commute. For each 𝑖,

⟨ 𝜎 𝑖 ⟩ ∩ ⟨ 𝜎 1 ⟩ ⋯ ⟨ 𝜎 𝑖 − 1 ⟩ ⟨ 𝜎 𝑖 + 1 ⟩ ⋯ ⟨ 𝜎 𝑘 ⟩ = ⟨ 𝜎 𝑖 ⟩ ∩ ⟨ 𝜎 1 , … , 𝜎 𝑖 − 1 , 𝜎 𝑖 + 1 , … , 𝜎 𝑘 ⟩ = { 𝑒 }

by Lemma 1.11.⁠∎

Hence

𝑜 ( 𝜎 ) = lcm { 𝑜 ( 𝜎 1 ) , … , 𝑜 ( 𝜎 𝑘 ) } = lcm { 𝑟 1 , … , 𝑟 𝑘 } .

Problem 1.13

Let 𝑛>2.

  1. Let 𝑟 denote the transformation of 𝐷𝑛 that sends the vertex pair (1,2) to (2,3), and let 𝑠 denote the transformation that sends (1,2) to (2,1). Prove that

    𝐷 𝑛 = ⟨ 𝑟 , 𝑠 | 𝑟 𝑛 = 𝑠 2 = 𝑟 𝑠 𝑟 𝑠 = 𝑒 ⟩ .
  2. Find all elements of order 2 and all elements of order 𝑛 in 𝐷𝑛.
  1. Proof. According to geometry, rotations of a regular 𝑛-gon are 𝑟𝑖(1≤𝑖≤𝑛−1) and reflections are 𝑟𝑖𝑠(0≤𝑖≤𝑛−1), hence

    𝐷 𝑛 = { 𝑒 , 𝑟 , 𝑟 2 , … , 𝑟 𝑛 − 1 , 𝑠 , 𝑟 𝑠 , 𝑟 2 𝑠 , … , 𝑟 𝑛 − 1 𝑠 } .

    Obviously, 𝑟𝑛=𝑠2=𝑒 and 𝑠𝑟𝑠=𝑟−1, which implies 𝑟𝑠𝑟𝑠=𝑒.⁠∎

  2. Solution. Elements of order 𝑛 are rotations 𝑟𝑖(1≤𝑖≤𝑛−1) where gcd{𝑛,𝑖}=1. 77 By Problem 1.5. Elements of order 2 are all reflections: 𝑟𝑖𝑠(0≤𝑖≤𝑛−1) and the 180° rotation 𝑟𝑛2 when 𝑛 is even.

Problem 1.14

Find the number of permutations of order 6 in 𝑆8.

Solution.

  1. Permutations of type [132131]: 8!3!⋅2⋅3=1120;
  2. Permutations of type [112231]: 8!22⋅2!⋅3=1680;
  3. Permutations of type [2132]: 8!2⋅32⋅2!=1120;
  4. Permutations of type [1261]: 8!2!⋅6=3360;
  5. Permutations of type [2161]: 8!2⋅6=3360.

Hence there are 10640 permutations of order 6.

Problem 1.15

Let 𝜎∈𝑆𝑛. Write 𝜎 as a product of finitely many disjoint nontrivial cycles, and let 𝑐(𝜎) be the sum of the number of these cycles and the number of fixed points of 𝜎.

  1. Prove that 𝜎 is an even permutation if and only if 𝑛−𝑐(𝜎) is even.
  2. Let 𝜏 be a transposition. Prove that

    𝑐 ( 𝜎 𝜏 ) = 𝑐 ( 𝜎 ) + 1 or 𝑐 ( 𝜎 𝜏 ) = 𝑐 ( 𝜎 ) − 1 ,
    and explain when each of the two cases above occurs.
  3. Prove that the minimum number of transpositions needed to express 𝜎 as a product of transpositions is 𝑛−𝑐(𝜎).
  1. Proof. Write 𝜎=𝜎1𝜎2⋯𝜎𝑘 where 𝜎𝑖 has length 𝑟𝑖≥2. By definition,

    𝑘 + ( 𝑛 − 𝑟 1 − 𝑟 2 − ⋯ − 𝑟 𝑘 ) = 𝑐 ( 𝜎 ) .

    So 𝜎 is an even permutation if and only if

    ( 𝑟 1 − 1 ) + ( 𝑟 2 − 1 ) + ⋯ + ( 𝑟 𝑘 − 1 ) = 𝑟 1 + 𝑟 2 + ⋯ + 𝑟 𝑘 − 𝑘 = 𝑛 − 𝑐 ( 𝜎 )

    is even.⁠∎

  2. Proof. Write

    𝜎 𝑖 = ( 𝑎 𝑖 1 𝑎 𝑖 2 ⋯ 𝑎 𝑖 𝑟 𝑖 ) , 1 ≤ 𝑖 ≤ 𝑘 .

    Let 𝜏=(𝑎,𝑏). Since 𝜎𝑖 and 𝜎𝑗 are disjoint for all 𝑖≠𝑗, there are only four cases for the relation between 𝜏 and the cycles 𝜎𝑖. 88 If we allow trivial cycles (fixed points) in the product representation of 𝜎, there would be only two cases: either 𝜏 splits a cycle or 𝜏 merges two cycles.
    The original problem handles nontrivial cycles and fixed points separately.

    Case I: 𝜏 is disjoint from all 𝜎𝑖, then 𝜎𝜏=𝜎1⋯𝜎𝑘𝜏 (disjoint nontrivial cycles), so 𝜎𝜏 gets an additional cycle 𝜏 while losing two fixed points 𝑎 and 𝑏, thus 𝑐(𝜎𝜏)=𝑐(𝜎)−1.

    Case II: 𝜏 is contained in one 𝜎𝑖 and disjoint from any other 𝜎𝑗(𝑗≠𝑖),i.e. there exists 1≤𝑝≠𝑞≤𝑟𝑖 such that 𝑎𝑖𝑝=𝑎 and 𝑎𝑖𝑞=𝑏.

    For simplicity, we only consider 𝑝+1<𝑞<𝑟𝑖. Compute

    𝜎 𝑖 𝜏 = ( 𝑎 𝑖 1 𝑎 𝑖 2 ⋯ 𝑎 𝑖 𝑟 𝑖 ) ( 𝑎 𝑖 𝑝 𝑎 𝑖 𝑞 ) = ( 𝑎 𝑖 𝑝 𝑎 𝑖 , 𝑞 + 1 𝑎 𝑖 , 𝑞 + 2 ⋯ 𝑎 𝑖 𝑟 𝑖 𝑎 𝑖 1 𝑎 𝑖 2 ⋯ 𝑎 𝑖 , 𝑝 − 1 ) ( 𝑎 𝑖 , 𝑝 + 1 𝑎 𝑖 , 𝑝 + 2 ⋯ 𝑎 𝑖 𝑞 ) .

    Hence 𝜎𝑖𝜏 can be expressed as two disjoint nontrivial cycles that are also disjoint from any other 𝜎𝑗(𝑗≠𝑖). Since disjoint cycles commute,

    𝜎 𝜏 = 𝜎 1 𝜎 2 ⋯ 𝜎 𝑘 𝜏 = 𝜎 1 ⋯ 𝜎 𝑖 − 1 ( 𝜎 𝑖 𝜏 ) 𝜎 𝑖 + 1 ⋯ 𝜎 𝑘 ,

    so 𝜎𝜏 gets one additional cycle with fixed points unchanged, hence 𝑐(𝜎𝜏)=𝑐(𝜎)+1.

    Similarly, one can compute 𝜎𝑖𝜏 under other conditions of 𝑝 and 𝑞, and 𝑐(𝜎𝜏)=𝑐(𝜎)+1 still holds.

    Case III: one endpoint of 𝜏 lies in 𝜎𝑖 and the other lies in 𝜎𝑗(𝑖≠𝑗). Similarly, one can prove 𝜎𝜏 loses one cycle with fixed points unchanged, hence 𝑐(𝜎𝜏)=𝑐(𝜎)−1.

    Case IV: one endpoint of 𝜏 lies in 𝜎𝑖 and the other is a fixed point of 𝜎. Similarly, this case also gives 𝑐(𝜎𝜏)=𝑐(𝜎)−1.⁠∎

  3. Proof. Note that 𝑐(𝑒)=𝑛, and 𝑐(𝑥) changes by ±1 each time we multiply 𝑥 by a transposition. So the minimum number of transpositions needed to express 𝜎 as a product of transpositions is no less than 𝑛−𝑐(𝜎).

    On the other hand, write

    𝜎 = ∏ 𝑖 = 1 𝑘 𝜎 𝑖 = ∏ 𝑖 = 1 𝑘 ∏ 𝑗 = 1 𝑟 𝑖 − 1 ( 𝑎 𝑖 𝑗 𝑎 𝑖 , 𝑗 + 1 ) ,

    there are exactly

    𝑟 1 + 𝑟 2 + ⋯ + 𝑟 𝑘 − 𝑘 = 𝑛 − 𝑐 ( 𝜎 )

    transpositions.⁠∎

2 Normal Subgroups, Quotient Groups, and Commutators

Problem 2.1

Let 𝐺 be a group and let 𝐴⊴𝐺. Define

[ 𝐴 , 𝐺 ] = ⟨ 𝑎 − 1 𝑔 − 1 𝑎 𝑔 | 𝑎 ∈ 𝐴 , 𝑔 ∈ 𝐺 ⟩ .
Prove that [𝐴,𝐺]⊴𝐺.

Proof. For every 𝑎−1𝑔−1𝑎𝑔∈[𝐴,𝐺] and 𝑔′∈𝐺, 𝑔′−1𝑎𝑔′∈𝐴 because 𝐴⊴𝐺. Hence

𝑔 ′ − 1 𝑎 − 1 𝑔 − 1 𝑎 𝑔 𝑔 ′ = ( 𝑔 ′ − 1 𝑎 − 1 𝑔 ′ ) ( 𝑔 ′ − 1 𝑔 − 1 𝑔 ′ ) ( 𝑔 ′ − 1 𝑎 𝑔 ′ ) ( 𝑔 ′ − 1 𝑔 𝑔 ′ ) = ( 𝑔 ′ − 1 𝑎 𝑔 ′ ) − 1 ( 𝑔 ′ − 1 𝑔 𝑔 ′ ) − 1 ( 𝑔 ′ − 1 𝑎 𝑔 ′ ) ( 𝑔 ′ − 1 𝑔 𝑔 ′ ) = [ 𝑔 ′ − 1 𝑎 𝑔 ′ , 𝑔 ′ − 1 𝑔 𝑔 ′ ] ∈ [ 𝐴 , 𝐺 ] .

Problem 2.2

Let 𝐷𝑛=⟨𝑟,𝑠|𝑟𝑛=𝑠2=𝑟𝑠𝑟𝑠=𝑒⟩ be the dihedral group (𝑛≥3). Prove the following statements:

  1. If 𝑛 is odd, then [𝐷𝑛,𝐷𝑛]=⟨𝑟⟩=⟨𝑟2⟩;
  2. If 𝑛 is even, then [𝐷𝑛,𝐷𝑛]=⟨𝑟2⟩.

Proof. 𝐷𝑛/⟨𝑟⟩={𝑒,𝑠} is abelian, so [𝐷𝑛,𝐷𝑛]⊆⟨𝑟⟩. 99 Recall that [𝐺,𝐺] is the ⊆-minimum of all 𝑁⊴𝐺 such that 𝐻/𝑁 is abelian. Furthermore, we have ⟨𝑟2⟩⊆[𝐷𝑛,𝐷𝑛]⊆⟨𝑟⟩ because 𝑟2=(𝑠𝑟𝑠)−1𝑟=𝑠−1𝑟−1𝑠𝑟=[𝑠,𝑟]∈[𝐷𝑛,𝐷𝑛].

  1. If 𝑛 is odd, ⟨𝑟⟩=⟨𝑟2⟩, so ⟨𝑟2⟩=[𝐷𝑛,𝐷𝑛]=⟨𝑟⟩;
  2. If 𝑛 is even, 𝐷𝑛/⟨𝑟2⟩={𝑒,𝑟,𝑠,𝑟𝑠}≅𝐶2×𝐶2 is abelian, hence [𝐷𝑛,𝐷𝑛]⊆⟨𝑟2⟩, then [𝐷𝑛,𝐷𝑛]=⟨𝑟2⟩.⁠∎

Problem 2.3

Let 𝑆 be a set of representatives of left cosets of a subgroup 𝐻≤𝐺, i.e. 𝐺=⨆𝑎∈𝑆𝑎𝐻. Prove that 𝑆−1 is a set of representatives of right cosets of 𝐻, i.e. 𝐺=⨆𝑎′∈𝑆−1𝐻𝑎′.

Proof.

𝐺 = 𝐺 − 1 = ⨆ 𝑎 ∈ 𝑆 ( 𝑎 𝐻 ) − 1 = ⨆ 𝑎 ∈ 𝑆 𝐻 − 1 𝑎 − 1 = ⨆ 𝑎 ∈ 𝑆 𝐻 𝑎 − 1 = ⨆ 𝑎 ′ ∈ 𝑆 − 1 𝐻 𝑎 ′ .

Problem 2.4

Let 𝐺 be a group and let 𝑁⊴𝐺. If 𝐺/𝑁 is finite and |𝐺/𝑁|=𝑛, prove that 𝑎𝑛∈𝑁 for every 𝑎∈𝐺.

Proof. Note that 𝑎𝑁∈𝐺/𝑁 and 𝑜(𝑎𝑁)||𝐺/𝑁|=𝑛, so (𝑎𝑁)𝑛=𝑎𝑛𝑁=𝑁, which implies 𝑎𝑛∈𝑁.⁠∎

Problem 2.5

Let 𝐺 be a finite group and let 𝐾⊴𝐻⊴𝐺. If gcd{|𝐾|,|𝐻/𝐾|}=1, prove that 𝐾⊴𝐺.

Proof. For every 𝑔∈𝐺, we shall prove 𝐾=𝑔−1𝐾𝑔. Clearly, |𝐾|=|𝑔−1𝐾𝑔|. 1010 One can consider the bijection 𝜑:𝑘↦𝑔−1𝑘𝑔. It suffices to prove 𝑔−1𝐾𝑔⊆𝐾.

For every 𝑔−1𝑘𝑔∈𝑔−1𝐾𝑔, there exists ℎ∈𝐻 such that 𝑘𝑔=𝑔ℎ since 𝑘∈𝐻⊴𝐺. So 𝑔−1𝑘𝑔=𝑔−1𝑔ℎ=ℎ∈𝐻, which implies 𝑔−1𝐾𝑔≤𝐻.

Furthermore, for every ℎ∈𝐻, there exists ℎ′∈𝐻 such that 𝑔ℎ=ℎ′𝑔, so ℎ−1𝑔−1𝐾𝑔ℎ=(𝑔ℎ)−1𝐾(𝑔ℎ)=(ℎ′𝑔)−1𝐾ℎ′𝑔=𝑔−1ℎ′−1𝐾ℎ′𝑔=𝑔−1𝐾𝑔, which implies 𝑔−1𝐾𝑔⊴𝐻.

Therefore, 𝐾(𝑔−1𝐾𝑔) is normal in 𝐻, and 𝐾 is normal in 𝐾(𝑔−1𝐾𝑔). 1111 Recall that if 𝐻⊴𝐺 and 𝐾≤𝐺, then 𝐻⊴𝐻𝐾≤𝐺; When 𝐾⊴𝐺, 𝐻𝐾 is also normal in 𝐺. So we have

| 𝐾 ( 𝑔 − 1 𝐾 𝑔 ) | | | 𝐻 | ⇒ | 𝐾 ( 𝑔 − 1 𝐾 𝑔 ) | | 𝐾 | | | 𝐻 | | 𝐾 | .

On the other hand,

| 𝐾 ( 𝑔 − 1 𝐾 𝑔 ) | = | 𝐾 | ⋅ | 𝑔 − 1 𝐾 𝑔 | | 𝐾 ∩ 𝑔 − 1 𝐾 𝑔 | = | 𝐾 | 2 | 𝐾 ∩ 𝑔 − 1 𝐾 𝑔 | ,

thus

| 𝐾 ( 𝑔 − 1 𝐾 𝑔 ) | | 𝐾 | = | 𝐾 | | 𝐾 ∩ 𝑔 − 1 𝐾 𝑔 | ⇒ | 𝐾 ( 𝑔 − 1 𝐾 𝑔 ) | | 𝐾 | | | 𝐾 | .

So |𝐾(𝑔−1𝐾𝑔)||𝐾| is a common divisor of |𝐾| and |𝐻||𝐾|. Given

gcd { | 𝐾 | , | 𝐻 | | 𝐾 | } = gcd { | 𝐾 | , | 𝐻 / 𝐾 | } = 1 ,

then |𝐾(𝑔−1𝐾𝑔)|=|𝐾|, hence 𝐾=𝐾(𝑔−1𝐾𝑔) because 𝐾⊆𝐾(𝑔−1𝐾𝑔), which implies 𝑔−1𝐾𝑔⊆𝐾.⁠∎

Caution

One may want to do something with the normality of 𝐾∩(𝑔−1𝐾𝑔), but the division

| 𝐾 ∩ ( 𝑔 − 1 𝐾 𝑔 ) | | 𝐾 | | | 𝐻 | | 𝐾 |
is invalid.

Problem 2.6

Prove the following statements.

  1. For every positive integer 𝑛, ⟨1𝑛+ℤ⟩ is the unique subgroup of ℚ/ℤ of order 𝑛.
  2. Every subgroup of ℚ/ℤ generated by finitely many elements is cyclic.
  1. Proof. Let 𝐺 be a subgroup of ℚ/ℤ of order 𝑛. For each 𝑞∈𝐺, if 𝑞=0, then 𝑞∈⟨1𝑛+ℤ⟩. Otherwise, write 𝑞=𝑎𝑏≠0 with 𝑎∈ℤ∗,𝑏∈ℕ+. Since 𝑜(𝑞)|𝑛,

    𝑛 𝑞 = ( 𝑛 𝑎 𝑏 ) = 0 ⇒ 𝑛 𝑎 𝑏 ∈ ℤ .

    Thus

    𝑞 = ( 1 𝑛 ) ⋅ ( 𝑛 𝑎 𝑏 ) = ( 𝑛 𝑎 𝑏 ) ( 1 𝑛 ) ∈ ⟨ 1 𝑛 + ℤ ⟩ ,

    Hence 𝐺≤⟨1𝑛+ℤ⟩ and furthermore 𝐺=⟨1𝑛+ℤ⟩ because |𝐺|=|⟨1𝑛+ℤ⟩|=𝑛.⁠∎

  2. Proof. Let 𝐺 = ⟨𝑞1,…,𝑞𝑛⟩, 𝑞𝑖∈ℚ. Write 𝑞𝑖=𝑎𝑖𝑏𝑖, 𝑎𝑖∈ℤ,𝑏𝑖∈ℕ+.

    Let 𝑚=lcm{𝑏1,…,𝑏𝑛}∈ℕ+, then

    𝑞 𝑖 = ( 𝑎 𝑖 𝑚 𝑏 𝑖 𝑚 ) = ( 𝑎 𝑖 𝑚 𝑏 𝑖 ) ( 1 𝑚 ) ∈ ⟨ 1 𝑚 + ℤ ⟩ ,

    so 𝐺≤⟨1𝑚+ℤ⟩ is cyclic. 1212 Recall that all subgroups of a cyclic group is cyclic.⁠∎

Problem 2.7

Let 𝐺 be a finite group and let 𝐻 be a proper subgroup of 𝐺. Subgroups of the form 𝑔𝐻𝑔−1(𝑔∈𝐺) are called conjugates of 𝐻. Prove the following statements.

  1. 𝐻 has [𝐺:𝑁𝐺(𝐻)] conjugates.
  2. The set of all conjugates of 𝐻 cannot cover the whole group 𝐺.
  1. Proof. Let 𝑥,𝑦∈𝐺. Note that

    𝑥 𝐻 𝑥 − 1 = 𝑦 𝐻 𝑦 − 1 ⇔ 𝐻 = ( 𝑦 − 1 𝑥 ) − 1 𝐻 ( 𝑦 − 1 𝑥 ) ⇔ 𝑦 − 1 𝑥 ∈ 𝑁 𝐺 ( 𝐻 ) ⇔ 𝑥 𝑁 𝐺 ( 𝐻 ) = 𝑦 𝑁 𝐺 ( 𝐻 ) .

    1313 Recall that two cosets 𝑥𝐻 and 𝑦𝐻 are either disjoint or equal, and 𝑥𝐻=𝑦𝐻⇔𝑥𝑦−1∈𝐻. By the definition of group index, 𝐻 has [𝐺:𝑁𝐺(𝐻)] distinct conjugates.⁠∎

  2. Proof. If 𝑁𝐺(𝐻)=𝐺, 𝐻 itself is the only conjugate of 𝐻, and it does not cover 𝐺 because 𝐻 is a proper subgroup.

    Otherwise, 𝑁𝐺(𝐻) is a proper subgroup of 𝐺, so |𝑁𝐺(𝐻)|<|𝐺|. Let 𝑆 denote the set of representatives for the left cosets of 𝑁𝐺(𝐻) in 𝐺, then

    𝐾 = { 𝑔 𝐻 𝑔 − 1 | 𝑔 ∈ 𝑆 }

    is the set of conjugates of 𝐻. We shall prove |⋃𝐾|<|𝐺|.

    Since |𝑔𝐻𝑔−1|=|𝐻| and each conjugate contains the identity:

    | ⋃ 𝐾 | = | ⋃ { 𝑒 , ⋃ 𝑔 ∈ 𝑆 ( 𝑔 𝐻 𝑔 − 1 \ { 𝑒 } ) } | ≤ 1 + ∑ 𝑔 ∈ 𝑆 ( | 𝑔 𝐻 𝑔 − 1 | − 1 ) = 1 + | 𝑆 | ⋅ ( | 𝐻 | − 1 ) = 1 + | 𝐺 | ⋅ ( | 𝐻 | − 1 ) | 𝑁 𝐺 ( 𝐻 ) | < | 𝐺 | | 𝑁 𝐺 ( 𝐻 ) | + | 𝐺 | ⋅ ( | 𝐻 | − 1 ) | 𝑁 𝐺 ( 𝐻 ) | = | 𝐺 | ⋅ | 𝐻 | | 𝑁 𝐺 ( 𝐻 ) | ≤ | 𝐺 | .

Problem 2.8

Let 𝐺 be a finite group and let 𝐻,𝐾 be subgroups of 𝐺. If

gcd { [ 𝐺 : 𝐻 ] , [ 𝐺 : 𝐾 ] } = 1 ,
prove that 𝐺=𝐻𝐾.

Proof. Recall that

| 𝐻 ∩ 𝐾 | = | 𝐻 | ⋅ | 𝐾 | | 𝐻 𝐾 | ,

then

| 𝐺 | | 𝐻 ∩ 𝐾 | = | 𝐺 | 2 | 𝐻 | ⋅ | 𝐾 | ⋅ | 𝐻 𝐾 | | 𝐺 | .

Since 𝐻∩𝐾≤𝐻≤𝐺,

| 𝐻 ∩ 𝐾 | | | 𝐻 | , | 𝐻 | | | 𝐺 | ,

so

| 𝐺 | | 𝐻 | | | 𝐺 | | 𝐻 ∩ 𝐾 | .

Similarly,

| 𝐺 | | 𝐾 | | | 𝐺 | | 𝐻 ∩ 𝐾 | .

Given

gcd { [ 𝐺 : 𝐻 ] , [ 𝐺 : 𝐾 ] } = gcd { | 𝐺 | | 𝐻 | , | 𝐺 | | 𝐾 | } = 1 ,

we have

| 𝐺 | 2 | 𝐻 | ⋅ | 𝐾 | | | 𝐺 | | 𝐻 ∩ 𝐾 | .

Hence

| 𝐺 | | 𝐻 ∩ 𝐾 | / | 𝐺 | 2 | 𝐻 | ⋅ | 𝐾 | = | 𝐻 𝐾 | | 𝐺 | ∈ ℤ ⇒ | 𝐺 | | | 𝐻 𝐾 | ,

which implies 𝐺=𝐻𝐾 because 𝐻𝐾⊆𝐺.⁠∎

Caution

Recall that 𝐻𝐾 is not necessarily a subgroup, do not claim something like 𝐻≤𝐻𝐾≤𝐺.

Problem 2.9

Let 𝐺 be a subgroup of 𝑆2024, and 𝐺 contains an 𝑛-cycle, where 𝑛≥4 is even. Prove that 𝐺 is not simple.

Proof. Consider the intersection 𝐻=𝐺∩𝐴2024⊴𝐺. 1414 Normality is ensured by the isomorphic theorems.

Let 𝜎∈𝐺 be an 𝑛-cycle with 𝑛≥4 even, then 𝐻 is proper because 𝜎 is odd, so 𝜎∉𝐻. 𝐻 is also nontrivial because 𝜎2 is even. 1515 𝜎2≠𝑒 is a product of two 𝑛2 cycles, so it can be expressed as a product of 2⋅(𝑛2−1) transpositions.⁠∎

Problem 2.10

Find the structure of the following two subgroups of 𝑆5:

  1. ⟨(12)(34),(12345)⟩;
  2. ⟨(12)(35),(12345)⟩.
  1. Solution. Let 𝐻=⟨(12)(34),(12345)⟩. Note that 𝐻≤𝐴5, 1616 The generators (12)(34) and (12345) are both even. so |𝐻|||𝐴5|=60.

    Since

    ( 1 2 ) ( 3 4 ) ∈ 𝐻 , ( 1 2 3 4 5 ) ∈ 𝐻 , ( 1 2 ) ( 3 4 ) ( 1 2 3 4 5 ) = ( 2 4 5 ) ∈ 𝐻 ,

    we have

    lcm { 𝑜 ( ( 1 2 ) ( 3 4 ) ) , 𝑜 ( ( 1 2 3 4 5 ) ) , 𝑜 ( ( 2 4 5 ) ) } = 30 | | 𝐻 | .

    Thus |𝐻|=30 or |𝐻|=60. Index 2 would force 𝐻⊴𝐴5, impossible. Hence 𝐻=𝐴5.

  2. Solution. Let

    𝑠 = ( 1 2 ) ( 3 5 ) , 𝑟 = ( 1 2 3 4 5 ) , 𝐺 = ⟨ 𝑟 , 𝑠 ⟩ .

    Note that

    𝑠 2 = 𝑟 5 = 𝑟 𝑠 𝑟 𝑠 = 𝑒 ,

    so 𝐺≅𝐷5.

Problem 2.11

Let 𝐴∞=⋃𝑛≥2𝐴𝑛. Prove the following statements.

  1. 𝐴∞ has a natural group structure such that 𝐴𝑛<𝐴∞ for every 𝑛≥2.
  2. 𝐴∞ is simple.
  1. Proof. For every 𝑥∈𝐴∞, let 𝑁𝑥 denote the nonempty set {𝑛∈ℕ+|𝑥∈𝐴𝑛} because 𝑥 belongs to at least one 𝐴𝑛, and let 𝑛(𝑥)=min𝑁𝑥. Define the inverse of 𝑥 to be 𝑥−1 in 𝐴𝑛(𝑥).

    For every 𝑥,𝑦∈𝐴∞, define the product 𝑥⋅𝑦 to be 𝑥𝑦 in 𝐴max{𝑛(𝑥),𝑛(𝑦)}.

    Clearly, 𝐴∞ forms a group under these operations with identity (1). And there is an infinite chain of proper subgroups:

    𝐴 2 < 𝐴 3 < ⋯ < 𝐴 𝑛 < ⋯ < 𝐴 ∞ .

  2. Proof. Let 𝑁 be a normal subgroup of 𝐴∞. We shall prove 𝑁={𝑒} or 𝑁=𝐴∞.

    For each 𝑛≥5, consider the intersection 𝑁∩𝐴𝑛⊴𝐴𝑛. 1717 𝑁⊴𝐴∞ and 𝐴𝑛≤𝐴∞. Because of the simplicity of 𝐴𝑛, either 𝑁∩𝐴𝑛={𝑒} or 𝑁∩𝐴𝑛=𝐴𝑛.

    If 𝑁∩𝐴5={𝑒}, we actually have

    𝑁 ∩ 𝐴 𝑛 = { 𝑒 } for each 𝑛 ≥ 5 ,

    1818 If there exists 𝑛>5 such that 𝑁∩𝐴𝑛=𝐴𝑛, then 𝐴5⊆𝐴𝑛⊆𝑁, contradicting to 𝑁∩𝐴5={𝑒}. so

    𝑁 = 𝑁 ∩ 𝐴 ∞ = 𝑁 ∩ ( ⋃ 𝑛 = 5 ∞ 𝐴 𝑛 ) = ⋃ 𝑛 = 5 ∞ ( 𝑁 ∩ 𝐴 𝑛 ) = { 𝑒 } .

    Similarly, if 𝑁∩𝐴5=𝐴5, we have

    𝑁 ∩ 𝐴 𝑛 = 𝐴 𝑛 for each 𝑛 ≥ 5 ,

    so

    𝑁 = 𝑁 ∩ 𝐴 ∞ = 𝑁 ∩ ( ⋃ 𝑛 = 5 ∞ 𝐴 𝑛 ) = ⋃ 𝑛 = 5 ∞ ( 𝑁 ∩ 𝐴 𝑛 ) = ⋃ 𝑛 = 5 ∞ 𝐴 𝑛 = 𝐴 ∞ .

Problem 2.12

Let 𝑛≥2 be a positive integer.

  1. Let 𝐺𝑛=[𝑆𝑛,𝑆𝑛]. Prove that 𝐺𝑛=𝐴𝑛 for 𝑛≥3.
  2. Find [𝐴𝑛,𝐴𝑛].
  1. Proof. Since 𝑆𝑛/𝐴𝑛≅𝐶2 is abelian, 𝐺𝑛=[𝑆𝑛,𝑆𝑛]⊆𝐴𝑛. For each 3≤𝑖≤𝑛,

    [ ( 1 2 ) , ( 1 𝑖 ) ] = ( 1 2 ) − 1 ( 1 𝑖 ) − 1 ( 1 2 ) ( 1 𝑖 ) = ( 1 2 𝑖 ) ∈ 𝐺 𝑛 ,

    so 𝐺𝑛 contains all the generators of 𝐴𝑛 1919 Recall that 𝐴𝑛=⟨(123),(124),…,(12𝑛)⟩. , then 𝐴𝑛⊆𝐺𝑛. Hence 𝐺𝑛=𝐴𝑛.⁠∎

  2. Solution.

    1. If 𝑛≤3, 𝐴𝑛 is abelian, then [𝐴𝑛,𝐴𝑛]={𝑒}.
    2. If 𝑛≥5, 𝐴𝑛 is simple, so [𝐴𝑛,𝐴𝑛]={𝑒} or [𝐴𝑛,𝐴𝑛]=𝐴𝑛. Compute

      [ ( 1 2 3 ) , ( 1 2 4 ) ] = ( 1 2 3 ) − 1 ( 1 2 4 ) − 1 ( 1 2 3 ) ( 1 2 4 ) = ( 1 2 ) ( 3 4 ) ∈ [ 𝐴 𝑛 , 𝐴 𝑛 ] ,
      so [𝐴𝑛,𝐴𝑛]=𝐴𝑛.
    3. If 𝑛=4, 𝑉4 is normal in 𝐴4 and 𝐴4/𝑉4≅𝐶3 is abelian, so [𝐴4,𝐴4]⊆𝑉4. 2020 Recall that 𝑉4={𝑒,(12)(34),(13)(24),(14)(23)} which is isomorphic to ⟨𝑎,𝑏|𝑎2=𝑏2=(𝑎𝑏)2=𝑒⟩.

      Also compute [(123),(134)]=(14)(23)∈[𝐴4,𝐴4], so 𝑉4=⟨(12)(34),(14)(23)⟩⊆[𝐴4,𝐴4].

      Therefore, [𝐴4,𝐴4]=𝑉4.

3 Normal Subgroups and Automorphisms

Problem 3.1

  1. Let 𝑁 be a normal subgroup of 𝐴4 that contains a 3-cycle. Prove that 𝑁=𝐴4.
  2. Find all normal subgroups of 𝐴4.
  1. Proof. Since 3||𝑁| and |𝑁|||𝐴4|=12, |𝑁|∈{3,6,12}.

    1. If |𝑁|=12, we are done.
    2. If |𝑁|=3, 𝑁=⟨𝜎⟩ where 𝜎=(𝑎𝑏𝑐). Let {𝑑}={1,2,3,4}\{𝑎,𝑏,𝑐} and let 𝜏=(𝑎𝑑𝑏)∈𝐴4. Compute

      𝜏 𝜎 𝜏 − 1 = ( 𝜏 ( 𝑎 ) 𝜏 ( 𝑏 ) 𝜏 ( 𝑐 ) ) = ( 𝑑 𝑎 𝑐 ) ∉ 𝑁 ,
      contradicting the normality of 𝑁.
    3. If |𝑁|=6, 𝐴4/𝑁≅𝐶2 is abelian, so 𝑉4=[𝐴4,𝐴4]≤𝑁. But |𝑉4|=4∤6, contradiction.

    ⁠∎

  2. Solution. Let 𝑁⊴𝐴4, then |𝑁|∈{1,2,3,6,12}. |𝑁|=1 and |𝑁|=12 are trivial cases, and we have proved |𝑁|=3 and |𝑁|=6 are impossible.

    1. If |𝑁|=2, then 𝑁=⟨(𝑎𝑏)(𝑐𝑑)⟩, but

      ( 𝑎 𝑏 𝑐 ) ( 𝑎 𝑏 ) ( 𝑐 𝑑 ) ( 𝑎 𝑏 𝑐 ) − 1 = ( 𝑎 𝑑 ) ( 𝑏 𝑐 ) ∉ 𝑁 ,
      contradiction.
    2. If |𝑁|=4, 𝐴4/𝑁≅𝐶3 is abelian, so 𝑉4=[𝐴4,𝐴4]≤𝑁, which implies 𝑁=𝑉4.

    In conclusion, normal subgroups of 𝐴4 are {𝑒},𝑉4,𝐴4.

Problem 3.2

Find all normal subgroups of 𝑆𝑛(𝑛≥1).

Lemma 3.3

If 𝐺 is a group with trivial center, then it cannot have a normal subgroup of order 2.

Proof. Let 𝑁⊴𝐺 and |𝑁|=2, then 𝑁={𝑒,𝑥} with 𝑥2=𝑒.

For every 𝑔∈𝐺,

𝑔 𝑁 𝑔 − 1 = { 𝑒 , 𝑔 𝑥 𝑔 − 1 } = 𝑁 = { 𝑒 , 𝑥 } ⇒ 𝑔 𝑥 𝑔 − 1 = 𝑥

by the normality of 𝑁.

This implies

𝑥 ∈ 𝑍 ( 𝐺 ) ⇒ 𝑥 = 𝑒 ⇒ 𝑁 = { 𝑒 } ,

contradiction.⁠∎

Solution of Problem 3.2.

  1. 𝑛=1: {𝑒}.
  2. 𝑛=2: {𝑒},𝑆2.
  3. 𝑛=3: {𝑒},𝐴3,𝑆3.
  4. 𝑛=4: {𝑒},𝑉4,𝐴4,𝑆4.
  5. 𝑛≥5: Let 𝑁⊴𝑆𝑛. Consider the intersection 𝐻=𝑁∩𝐴𝑛⊴𝐴𝑛, then 𝐻={𝑒} or 𝐻=𝐴𝑛 since 𝐴𝑛 is simple.

    1. 𝐻={𝑒} implies every nontrivial permutation in 𝑁 is odd. Let 𝜑:𝑁→𝑆𝑛/𝐴𝑛 defined as 𝑔↦𝑔𝐴𝑛, Ker𝜑=𝑁∩𝐴𝑛={𝑒}, so

      | 𝑁 | = | Im ( 𝜑 ) | ≤ | 𝑆 𝑛 / 𝐴 𝑛 | = 2 .
      Recall that 𝑆𝑛 has trivial center when 𝑛≥3. By Lemma 3.3, 𝑁={𝑒}.
    2. 𝐻=𝐴𝑛 implies 𝐴𝑛≤𝑁. But 𝐴𝑛 is already the maximal proper subgroup of 𝑆𝑛, so 𝑁=𝐴𝑛 or 𝑁=𝑆𝑛.

    Hence there are three normal subgroups: {𝑒},𝐴𝑛,𝑆𝑛.

Problem 3.4

For 𝑛≥2, determine all integers 𝑖 with 2≤𝑖≤𝑛 such that 𝑆𝑛=⟨(1𝑖),(12⋯𝑛)⟩.

Solution. The indices in our solution should wrap around 1 and 𝑛.

Note that

( 1 2 ⋯ 𝑛 ) 𝑘 ( 1 𝑖 ) ( 1 2 ⋯ 𝑛 ) − 𝑘 = ( 1 + 𝑘 , 1 + 𝑘 + 𝑖 − 1 ) ,

so we can get transpositions of the form (𝑎,𝑎+𝑖−1) by conjugations of the two generators.

Let 𝐺=(𝑉,𝐸) be an undirected graph with 𝑉={1,2,…,𝑛} and 𝐸={(𝑎,𝑎+𝑖−1)|1≤𝑎≤𝑛}. The connected components of 𝐺 are cosets of ⟨𝑖−1⟩ in ℤ/𝑛ℤ, hence

( 1 𝑖 ) and ( 1 2 ⋯ 𝑛 ) generates 𝑆 𝑛 ⇔ 𝐺 is connected ⇔ ⟨ 𝑖 − 1 ⟩ = ℤ / 𝑛 ℤ ⇔ gcd { 𝑛 , 𝑖 − 1 } = 1 .

Problem 3.5

Let 𝑛 be a positive integer. Prove that 𝜎,𝜏∈𝑆𝑛 are conjugate if and only if they have the same type.

Proof. Recall that

𝑔 ( 𝑎 1 𝑎 2 ⋯ 𝑎 𝑘 ) 𝑔 − 1 = ( 𝑔 ( 𝑎 1 ) 𝑔 ( 𝑎 2 ) ⋯ 𝑔 ( 𝑎 𝑘 ) ) , ∀ 𝑔 ∈ 𝑆 𝑛 ,

so conjugation of permutations preserves the cycle type. It remains to prove the converse.

Let 𝜎,𝜏∈𝑆𝑛 with the same type. Decompose them into disjoint cycles (including trivial ones):

𝜎 = ∏ 𝑖 = 1 𝑘 𝜎 𝑖 = ∏ 𝑖 = 1 𝑘 ( 𝑎 𝑖 1 𝑎 𝑖 2 ⋯ 𝑎 𝑖 𝑟 𝑖 ) , 𝜏 = ∏ 𝑖 = 1 𝑘 𝜏 𝑖 = ∏ 𝑖 = 1 𝑘 ( 𝑏 𝑖 1 𝑏 𝑖 2 ⋯ 𝑏 𝑖 𝑟 𝑖 ) .

Define 𝜋:𝑎𝑖𝑗↦𝑏𝑖𝑗, then 𝜋∈𝑆𝑛 and 𝜋𝜎𝜋−1=𝜏.⁠∎

Problem 3.6

Let 𝑓:𝐺→𝐻 be a group homomorphism and let 𝑎∈𝐺 be an element of finite order. Prove that the order of 𝑓(𝑎) divides the order of 𝑎.

Proof.

( 𝑓 ( 𝑎 ) ) 𝑜 ( 𝑎 ) = 𝑓 ( 𝑎 𝑜 ( 𝑎 ) ) = 𝑓 ( 𝑒 ) = 𝑒 ⇒ 𝑜 ( 𝑓 ( 𝑎 ) ) | 𝑜 ( 𝑎 ) .

Problem 3.7

Let 𝐺 be a group and define 𝑓:𝐺→𝐺 to be the map 𝑥↦𝑥−1.

  1. Give a necessary and sufficient condition for 𝑓 to be a group homomorphism.
  2. If 𝐺 is finite and |Aut(𝐺)|=1, prove that |𝐺|≤2.
  1. Solution.

    𝑓 is a group homomorphism ⇔ ∀ 𝑎 , 𝑏 ∈ 𝐺 , 𝑓 ( 𝑎 ) 𝑓 ( 𝑏 ) = 𝑓 ( 𝑎 𝑏 ) ⇔ ∀ 𝑎 , 𝑏 ∈ 𝐺 , 𝑎 − 1 𝑏 − 1 = ( 𝑎 𝑏 ) − 1 = 𝑏 − 1 𝑎 − 1 ⇔ 𝐺 is abelian, equivalently 𝑍 ( 𝐺 ) = 𝐺 .

  2. Proof. Since Inn(𝐺)⊴Aut(𝐺) and |Aut(𝐺)|=1, |Inn(𝐺)|=1.

    Consider the homomorphism 𝜑:𝑔↦𝜃𝑔=(𝑥↦𝑔𝑥𝑔−1), then 2121 Recall that Ker𝜑=𝑍(𝐺) and Im𝜑=Inn(𝐺).

    𝐺 / 𝑍 ( 𝐺 ) ≅ Inn ( 𝐺 ) ⇒ | 𝐺 | | 𝑍 ( 𝐺 ) | = | Inn ( 𝐺 ) | = 1 ⇒ 𝐺 = 𝑍 ( 𝐺 ) ,

    which makes 𝑓 a homomorphism. Furthermore, 𝑓∈Aut(𝐺), so 𝑓=id. We have

    𝑥 = 𝑥 − 1 for each 𝑥 ∈ 𝐺

    and every element has order at most 2.

    If |𝐺|>2, then 𝐺≅(ℤ/2ℤ)𝑑,𝑑≥2. Clearly, such a group has nontrivial automorphisms, 2222 e.g. swap two basis vectors. contradiction.⁠∎

Problem 3.8

Let 𝐺 be a group with trivial center, prove that Aut(𝐺) also has trivial center.

Proof. For every 𝜎∈𝑍(Aut(𝐺)) and 𝑥∈𝐺, let 𝜃𝑥∈Aut(𝐺) denote the conjugation induced by 𝑥, i.e. 𝜃𝑥:𝑔↦𝑥𝑔𝑥−1.

Note that 𝜎𝜃𝑥=𝜃𝜎(𝑥)𝜎, we have

𝜎 𝜃 𝑥 = 𝜃 𝜎 ( 𝑥 ) 𝜎 = 𝜃 𝑥 𝜎 ⇒ 𝜃 𝑥 = 𝜃 𝜎 ( 𝑥 )

since 𝜎 commutes with 𝜃𝑥.

By injectivity of 𝑔↦𝜃𝑔 2323 The kernel 𝑍(𝐺) is trivial.,

𝜃 𝑥 = 𝜃 𝜎 ( 𝑥 ) ⇒ 𝜎 ( 𝑥 ) = 𝑥 ⇒ 𝜎 = id .

Hence Aut(𝐺) has trivial center.⁠∎

Problem 3.9

Let 𝐺 be a finite group such that |𝐺|=𝑝1𝑝2⋯𝑝𝑠, where the 𝑝𝑖 are distinct primes. If 𝐺 has 𝑛 normal subgroups, prove that 𝑛≤2𝑠.

Note that |𝐺| has exactly 2𝑠 positive divisors, so there would be two distinct normal subgroups sharing the same order if 𝑛>2𝑠. If we can prove “identical orders imply identical groups”, then we are done.

Lemma 3.10

Let 𝐺 be a finite group such that |𝐺|=𝑝1𝑝2⋯𝑝𝑠, where the 𝑝𝑖 are distinct primes. If 𝑁1 and 𝑁2 are normal subgroups of 𝐺 with the same order 𝑚, then 𝑁1=𝑁2.

Proof. By induction on 𝑠. When 𝑠=1, 𝐺 is cyclic with prime order, so either 𝑁1=𝑁2={𝑒} or 𝑁1=𝑁2=𝐺.

Next, we assume the lemma holds for 1,2,…,𝑠−1.

  1. If 𝑚=1, 𝑁1=𝑁2={𝑒}.
  2. If 𝑚≥2 and 𝑁1𝑁2=𝐺, we have

    | 𝐺 | = | 𝑁 1 𝑁 2 | = | 𝑁 1 | | 𝑁 2 | | 𝑁 1 ∩ 𝑁 2 | = 𝑚 2 | 𝑁 1 ∩ 𝑁 2 |
    which forces |𝑁1∩𝑁2|=𝑚 because |𝐺| is squarefree. Thus 𝑁1∩𝑁2=𝑁1=𝑁2.
  3. If 𝑚≥2 and 𝑁1𝑁2<𝐺, since 𝑁1 and 𝑁2 normal in 𝑁1𝑁2 with the same order, and |𝑁1𝑁2| is a product of 𝑘 distinct primes (1≤𝑘≤𝑠−1), we have 𝑁1=𝑁2 by the induction hypothesis.

⁠∎

Problem 3.11

For 𝑛≥3, find |Aut(𝐷𝑛)|.

Problem 3.12

Let 𝜑:𝑆𝑛→𝑆𝑛 be an automorphism of the symmetric group 𝑆𝑛, and suppose 𝑛≠6. Prove the following.

(a) 𝜑 sends transpositions in 𝑆𝑛 to transpositions.

(b) Aut(𝑆𝑛)≅𝑆𝑛.

Problem 3.13

Let 𝐺 be a finite group and let 𝑓:𝐺→𝐺 be a group homomorphism. Prove that there exists a positive integer 𝑁 such that 𝐺=Ker(𝑓𝑁)Im(𝑓𝑁) and Ker(𝑓𝑁)∩Im(𝑓𝑁)={𝑒}.

Problem 3.14

Let 𝐺 and 𝐻 be finite groups. Solve the following problems.

(a) For every 𝑁⊴𝐺, if 𝐺/𝑁≅𝐻, prove that there are exactly |Aut(𝐻)| surjective homomorphisms 𝑓:𝐺↠𝐻 satisfying Ker𝑓=𝑁.

(b) Hence prove that |{𝑓:𝐺↠𝐻|𝑓is a group homomorphism}|=|Aut(𝐻)||{𝑁⊴𝐺|𝐺/𝑁≅𝐻}|.

4 Direct Products, Free Products, and Semidirect Products

Problem 4.1

Let 𝑛>1. If 𝑛 is odd, prove that 𝐷2𝑛≅𝐷𝑛×ℤ2. Show that this conclusion fails when 𝑛 is even.

Problem 4.2

Determine whether each of the following statements is true, and explain your reasoning.

  • 𝐷𝑛≅ℤ𝑛×ℤ2.

  • 𝑆𝑛≅𝐴𝑛×ℤ2.

  • GL2(ℝ)≅SL2(ℝ)×ℝ∗.

Problem 4.3

Let 𝐺1 and 𝐺2 be finite groups such that gcd(|𝐺1|,|𝐺2|)=1. Prove that Aut(𝐺1×𝐺2)≅Aut(𝐺1)×Aut(𝐺2).

Problem 4.4

Solve the following problems.

(a) Give an example of 𝐻<𝐺1×𝐺2 such that 𝐻 cannot be written as the direct product of a subgroup 𝐻1<𝐺1 and a subgroup 𝐻2<𝐺2.

(b) Let 𝐺1 and 𝐺2 be groups. Prove that every subgroup of 𝐺1×𝐺2 has the form 𝐻1×𝐻2, where 𝐻𝑖<𝐺𝑖 for 𝑖=1,2, if and only if for every 𝑔1∈𝐺1 and 𝑔2∈𝐺2, both 𝑔1 and 𝑔2 have finite order and gcd(𝑜(𝑔1),𝑜(𝑔2))=1.

Problem 4.5

Let 𝐺 be a group satisfying 𝑥2=𝑒 for every 𝑥∈𝐺.

(a) Prove that 𝐺 is abelian.

(b) If 𝐺 is finite, prove that there exists a nonnegative integer 𝑛 such that 𝐺≅⊕𝑛ℤ2, the direct sum of 𝑛 copies of ℤ2.

Problem 4.6

Let 𝐺1 and 𝐺2 be groups. Prove that

  • 𝐶(𝐺1×𝐺2)=𝐶(𝐺1)×𝐶(𝐺2);

  • [𝐺1×𝐺2,𝐺1×𝐺2]=[𝐺1,𝐺1]×[𝐺2,𝐺2].

Problem 4.7

Solve the following problems.

(a) Let 𝐺=𝐺1×⋯×𝐺𝑛 be a direct product of groups, let 𝑝𝑖:𝐺→𝐺𝑖 be the projection onto the 𝑖-th component, and let 𝜑𝑖:𝑆→𝐺𝑖 be group homomorphisms for 𝑖=1,…,𝑛. Prove that there exists a unique group homomorphism 𝜑:𝑆→𝐺 such that 𝑝𝑖∘𝜑=𝜑𝑖 for every 𝑖=1,…,𝑛.

(b) Let 𝐺=𝐺1×⋯×𝐺𝑛, let 𝑗𝑖:𝐺𝑖→𝐺 be the natural homomorphisms, and let 𝜓𝑖:𝐺𝑖→𝑆 be group homomorphisms for 𝑖=1,…,𝑛. Give an example showing that there need not exist a unique group homomorphism 𝜓:𝐺→𝑆 such that 𝜓∘𝑗𝑖=𝜓𝑖 for every 𝑖=1,…,𝑛.

Problem 4.8

Let 𝐺 be a group and let 𝐻,𝐾 be subgroups of 𝐺. Suppose that

  • 𝐺=𝐻𝐾,

  • 𝐻∩𝐾={𝑒},

  • ℎ𝑘=𝑘ℎ for every ℎ∈𝐻 and 𝑘∈𝐾.

Prove that the map 𝐻×𝐾→𝐺, (ℎ,𝑘)↦ℎ𝑘, is a group isomorphism, and that 𝐺/𝐻≅𝐾 and 𝐺/𝐾≅𝐻.

Problem 4.9

Let {𝐺𝛼}𝛼∈𝐼 be a family of groups indexed by 𝐼. For a positive integer 𝑛, call an 𝑛-tuple 𝑎=(𝑥1,𝑥2,…,𝑥𝑛) a word of length 𝑛 over {𝐺𝛼}, where 𝑥𝑖∈⨆𝛼∈𝐼𝐺𝛼 (the symbol ⨆ denotes disjoint union). Also define the empty word 𝑒 of length 0.

(a) Define an equivalence relation ∼ on the set of all words over {𝐺𝛼} as follows.

(a1) If 𝑒𝛼 denotes the identity element of 𝐺𝛼, then (𝑥1,…,𝑥𝑖−1,𝑒𝛼,𝑥𝑖+1,…,𝑥𝑛)∼(𝑥1,…,𝑥𝑖−1,𝑥𝑖+1,…,𝑥𝑛).

(a2) If 𝑥𝑖 and 𝑥𝑖+1 both belong to some 𝐺𝛼, then (𝑥1,…,𝑥𝑖,𝑥𝑖+1,…,𝑥𝑛)∼(𝑥1,…,𝑥𝑖𝑥𝑖+1,…,𝑥𝑛).

Denote the equivalence class of a word 𝑎 by [𝑎]. For words 𝑎=(𝑥1,…,𝑥𝑛) and 𝑏=(𝑦1,…,𝑦𝑚), define their product by 𝑎𝑏=(𝑥1,…,𝑥𝑛,𝑦1,…,𝑦𝑚). Let ∗𝛼∈𝐼𝐺𝛼 denote the set of all equivalence classes of words over {𝐺𝛼}. Prove that multiplication [𝑎][𝑏]=[𝑎𝑏] is well-defined on ∗𝛼∈𝐼𝐺𝛼 and makes it a group. This group is called the free product of {𝐺𝛼}𝛼∈𝐼.

(b) Let 𝐺=𝐺1∗⋯∗𝐺𝑛 be a free product of groups, let 𝑞𝑖:𝐺𝑖→𝐺 send 𝑥𝑖 to [(𝑥𝑖)], and let 𝜓𝑖:𝐺𝑖→𝑆 be group homomorphisms for 𝑖=1,…,𝑛. Prove that there exists a unique group homomorphism 𝜓:𝐺→𝑆 such that 𝜓∘𝑞𝑖=𝜓𝑖 for every 𝑖=1,…,𝑛.

Problem 4.10

Let 𝑆 be a nonempty set. For 𝛼∈𝑆, let 𝐺𝛼={…,𝛼−1,𝑒𝛼=𝛼0,𝛼=𝛼1,𝛼2,…} be the infinite cyclic group generated by 𝛼. The free product ∗𝛼∈𝑆𝐺𝛼 is called the free group generated by 𝑆 and is denoted by 𝐹(𝑆). Let 𝑅 be a subset of 𝐹(𝑆), let 𝑁 be the smallest normal subgroup of 𝐹(𝑆) containing 𝑅, and put 𝐺=𝐹(𝑆)/𝑁. Then 𝐺 is called the group generated by the set of generators 𝑆 with the set of relations 𝑅, also written 𝐺=⟨𝑆|𝑅⟩. If 𝑆={𝑠1,…,𝑠𝑛} and 𝑅={𝑟1,…,𝑟𝑚}, this may be written in more detail as ⟨𝑠1,…,𝑠𝑛|𝑟1=⋯=𝑟𝑚=𝑒⟩. In particular, when 𝑟𝑖=𝛼−𝑖𝛽𝑗, the relation 𝑟𝑖=𝑒 may also be written 𝛼𝑖=𝛽𝑗.

(a) Determine the structure of the groups ⟨𝑟,𝑠|𝑟𝑛=𝑠2=𝑒,𝑠−1𝑟𝑠=𝑟−1⟩ and ⟨𝑖,𝑗|𝑖4=𝑒,𝑖2=𝑗2,𝑗−1𝑖𝑗=𝑖−1⟩.

(b) Write down one possible set of generators and relations for ℤ×ℤ and for 𝑆4.

Problem 4.11

Given groups 𝐻 and 𝐾 and a group homomorphism 𝜑:𝐾→Aut(𝐻), one can define the semidirect product 𝐻⋊𝜑𝐾. As a set, 𝐻⋊𝜑𝐾={(ℎ,𝑘)|ℎ∈𝐻,𝑘∈𝐾}, and the group operation is defined by (ℎ,𝑘)(ℎ′,𝑘′)≔(ℎ𝜑𝑘(ℎ′),𝑘𝑘′), where 𝜑𝑘≔𝜑(𝑘), and the identity element is (1𝐻,1𝐾).

  • Verify that 𝐻⋊𝜑𝐾 is a group.

  • Explain that the external direct product is a special case of the

semidirect product.

  • Verify the group isomorphisms 𝐻≅𝐻×1𝐾={(ℎ,1𝐾)|ℎ∈𝐻},ℎ↦(ℎ,1𝐾), 𝐾≅1𝐻×𝐾={(1𝐻,𝑘)|𝑘∈𝐾},𝑘↦(1𝐻,𝑘). Also prove that 𝐻≅𝐻×1𝐾 is a normal subgroup of 𝐻⋊𝜑𝐾.

  • Prove that 𝐾≅1𝐻×𝐾 is a normal subgroup of

𝐻⋊𝜑𝐾 if and only if 𝜑:𝐾→Aut(𝐻) is trivial, in which case 𝐻⋊𝜑𝐾=𝐻×𝐾.

  • Let 𝐻 and 𝐾 be subgroups of a group 𝐺 satisfying

    • 𝐺=𝐻𝐾,

    • 𝐻∩𝐾={1},

    • 𝐻⊴𝐺.

    Consider the group homomorphism 𝜑:𝐾→Aut(𝐻), 𝜑𝑘(ℎ)=𝑘ℎ𝑘−1 for every ℎ∈𝐻. Prove that the map 𝑓:𝐻⋊𝜑𝐾→𝐺, (ℎ,𝑘)↦ℎ𝑘, is a group isomorphism, and that 𝐺/𝐻≅𝐾.

  • Prove the following semidirect product decompositions.

    • 𝐷𝑛≅⟨𝑟⟩⋊{1,𝑠}≅ℤ𝑛⋊ℤ2.

    • 𝑆𝑛≅𝐴𝑛⋊⟨𝜏⟩≅𝐴𝑛⋊ℤ2, where 𝜏∈𝑆𝑛 is

    any transposition.

    • GL2(ℝ)≅SL2(ℝ)⋊𝐾≅SL2(ℝ)⋊ℝ∗, where

    𝐾={diag(𝑎,1)|𝑎∈ℝ∗}.

  • For a fixed odd integer 𝑛>1, prove that the direct product

SL𝑛(ℝ)×ℝ∗ can be realized as a nontrivial semidirect product SL𝑛(ℝ)⋊ℝ∗.

5 Group Actions and the Sylow Theorems

Problem 5.1

Let the group GL3(ℝ) act on the column-vector space ℝ3, regarded as a set, by matrix multiplication. Solve the following problems.

(a) Prove that the column vectors (1,0,0)𝑡 and (0,1,0)𝑡 lie in the same orbit.

(b) Is this group action transitive? Explain why.

(c) Find the stabilizer subgroup 𝐻=Stab((0,0,1)𝑡).

Problem 5.2

Let 𝐺 be a group of order 𝑛. Let 𝑝 be the smallest prime divisor of 𝑛, and let 𝐻 be a subgroup of 𝐺 of index 𝑝. Prove that 𝐻 is a normal subgroup of 𝐺.

Problem 5.3

Let a group 𝐺 act on a set 𝑋. The action of 𝐺 on 𝑋 is called faithful if, for every 𝑔∈𝐺 satisfying 𝑔𝑥=𝑥 for all 𝑥∈𝑋, one has 𝑔=𝑒. It is called free if, for every 𝑥∈𝑋 and 𝑔∈𝐺 satisfying 𝑔𝑥=𝑥, one always has 𝑔=𝑒. Determine whether each of the following group actions is faithful and whether it is free.

(a) The conjugation action of the dihedral group 𝐷4 on itself.

(b) The action of SO𝑛(ℝ) on ℝ𝑛∖{0}, where 𝑛≥2.

Problem 5.4

Let 𝑈𝑛 denote the group of all 𝑛×𝑛 unitary matrices under matrix multiplication, and let 𝑆2𝑛−1 denote the unit sphere in ℂ𝑛. Let 𝑈𝑛 act naturally on 𝑆2𝑛−1, where 𝑛≥2.

(a) Prove that this action is transitive.

(b) Fix a point on 𝑆2𝑛−1. Prove that its stabilizer subgroup is isomorphic to 𝑈𝑛−1.

Problem 5.5

Let O𝑛(ℝ)≔{𝑀∈𝑀𝑛(ℝ)|𝑀𝑡𝑀=𝐼} denote the set of all 𝑛×𝑛 real orthogonal matrices. It is a group under matrix multiplication and is called the orthogonal group of order 𝑛. Let SO𝑛(ℝ)≔{𝑀∈O𝑛(ℝ)|det𝑀=1}. It is also a group under matrix multiplication and is called the special orthogonal group of order 𝑛.

(a) Prove that SO𝑛(ℝ)⊴O𝑛(ℝ) and [O𝑛(ℝ):SO𝑛(ℝ)]=2.

The group of all automorphisms of a regular 𝑛-hedron in ℝ3 under composition is called the symmetry group of the regular 𝑛-hedron and is denoted by 𝐸𝑛, where 𝑛=4,6,8,12,20. Regard 𝐸𝑛 as a subgroup of the orthogonal group O3(ℝ). The group 𝐸𝑛∩SO3(ℝ) is called the rotation group of the regular 𝑛-hedron and is denoted by 𝐹𝑛, where 𝑛=4,6,8,12,20.

(b) For 𝑛=4,6,8,12,20, find the orders of 𝐸𝑛 and 𝐹𝑛.

(c) Prove that 𝐹4≅𝐴4.

(d) Prove that 𝐹6≅𝐹8≅𝑆4.

(e) Prove that 𝐹12≅𝐹20≅𝐴5.

Problem 5.6

Prove that a group of order 56 and a group of order 𝑝𝑞𝑟, where 𝑝<𝑞<𝑟 are primes, are not simple.

Problem 5.7

Let 𝐻 be a Sylow 𝑝-subgroup of a finite group 𝐺. Let 𝐿<𝐺 and suppose 𝑝∣|𝐿|. Prove that there exists 𝑔∈𝐺 such that 𝑔𝐻𝑔−1∩𝐿 is a Sylow 𝑝-subgroup of 𝐿.

Problem 5.8

Let 𝐺 be a group of order 𝑝2𝑞, where 𝑝 and 𝑞 are primes and 𝑝<𝑞. Prove that either 𝐺 has a normal Sylow 𝑞-subgroup or 𝐺≅𝐴4.

Problem 5.9

Let 𝐺 be a simple group of order 60. Prove that 𝐺 is isomorphic to 𝐴5. (Hint: You may assume that 𝐺 is not isomorphic to 𝐴5 and prove that there exist two distinct Sylow 2-subgroups 𝑃 and 𝑄 of 𝐺 satisfying |𝑁𝐺(𝑃∩𝑄)|≥12, thereby obtaining a contradiction.)

Problem 5.10

Let 𝐺 be a simple group of order 360. We will use proof by contradiction to determine the number of Sylow 3-subgroups of 𝐺.

(a) Assume that 𝐺 has 40 Sylow 3-subgroups. Prove that there exist two Sylow 3-subgroups 𝑃≠𝑄 such that |𝑃∩𝑄|>1.

(b) Under the assumption in (a), let 𝐻=𝑃∩𝑄. Prove that 𝐶𝐺(𝐻)/𝐻≅𝐴4, and that 𝐶𝐺(𝐻) has a normal Sylow 2-subgroup 𝐾, where 𝐶𝐺(𝐻)={𝑔∈𝐺|∀ℎ∈𝐻,ℎ𝑔=𝑔ℎ} is the centralizer of 𝐻 in 𝐺.

(c) Under the assumption in (a), prove that |𝑁𝐺(𝐾)|≥72, and derive a contradiction.

(d) Find the number of Sylow 3-subgroups of 𝐺.

6 Rings, Ideals, and Nilpotent Elements

Problem 6.1

Let 𝑅 be a ring such that 𝑎2=𝑎 for every 𝑎∈𝑅. Prove the following.

(a) For every 𝑎∈𝑅, 2𝑎=𝑎+𝑎=0.

(b) 𝑅 is commutative.

Problem 6.2

Solve the following problems.

(a) If 𝑅 is a commutative ring and 𝑎,𝑏∈𝑅 are nilpotent, prove that 𝑎+𝑏 is nilpotent.

(b) Give an example showing that, in a noncommutative ring, the sum of two nonzero nilpotent elements need not be nilpotent.

Problem 6.3

Let 𝐴=ℤ[2]={𝑎+𝑏2|𝑎,𝑏∈ℤ}⊂ℝ. For 𝑥=𝑎+𝑏2∈ℤ[2], define 𝑁(𝑥)=𝑎2−2𝑏2. Prove the following.

(a) 𝐴 is a subring of the field ℝ.

(b) 𝑥∈ℤ[2]∗ if and only if 𝑁(𝑥)=±1.

(c) The group of units ℤ[2]∗ is infinite.

Problem 6.4

Let 𝐹 be a field and let 𝑇2(𝐹) denote the set of all matrices 𝑇2(𝐹)={(𝑎𝑏0𝑐):𝑎,𝑏,𝑐∈𝐹}.

(a) Find all invertible elements of 𝑇2(𝐹).

(b) Prove that 𝐼={(0𝑏00):𝑏∈𝐹} is an ideal satisfying 𝐼2=0, and prove that 𝑇2(𝐹)/𝐼≅𝐹×𝐹.

(c) Find the center of 𝑇2(𝐹).

Problem 6.5

Let 𝑅 and 𝑆 be unital rings. Prove that every ideal of 𝑅×𝑆 can be written uniquely in the form 𝐼×𝐽, where 𝐼⊴𝑅 and 𝐽⊴𝑆. Now suppose in addition that 𝑅 and 𝑆 are nonzero unital commutative rings. Prove the following.

(a) The prime ideals of 𝑅×𝑆 are exactly 𝑃×𝑆 and 𝑅×𝑄, where 𝑃 and 𝑄 are prime ideals of 𝑅 and 𝑆, respectively.

(b) The same conclusion about prime ideals also holds for maximal ideals.

Problem 6.6

Let 𝑛≥2 be a positive integer and let 𝑅=𝑀𝑛(ℂ) be the ring of 𝑛×𝑛 complex matrices. If 𝐼 is an ideal of 𝑅, prove that 𝐼=0 or 𝐼=𝑅.

Problem 6.7

Let 𝑅 be a commutative ring and let 𝐼⊂𝑅 be an ideal. Define 𝐼={𝑟∈𝑅|there exists a positive integer𝑛such that𝑟𝑛∈𝐼}. Verify that 𝐼 is an ideal.

Problem 6.8

Give an example of a maximal ideal 𝐼 in a noncommutative ring 𝑅 such that 𝐼 is not a prime ideal of 𝑅.

Problem 6.9

Let 𝑅 be a ring and let Nil(𝑅)={𝑎∈𝑅|𝑎is nilpotent}.

(a) Suppose 𝑅 satisfies the property that if 𝑎2=0, then 𝑎=0. Prove that Nil(𝑅)={0}.

(b) If 𝑅 is commutative, prove that Nil(𝑅) is an ideal.

(c) Give an example showing that, in a noncommutative ring, Nil(𝑅) need not be an ideal.

Problem 6.10

Let 𝑅 be a unital ring. Let {𝐼𝑖}𝑖∈Λ be a family of ideals of 𝑅, where Λ is a nonempty index set. If for every 𝑖,𝑗∈Λ one has 𝐼𝑖⊆𝐼𝑗 or 𝐼𝑗⊆𝐼𝑖, prove that ⋃𝑖∈Λ𝐼𝑖 is an ideal of 𝑅.

7 Ring Homomorphisms, Polynomial Rings, and Ideals

Problem 7.1

Let 𝑅 be a unital commutative ring and let 𝐼1,𝐼2,𝐼3 be ideals of 𝑅.

(a) If 𝐼1 and 𝐼2 are comaximal, prove that 𝐼1𝐼2=𝐼1∩𝐼2.

(b) If 𝐼1 and 𝐼3 are comaximal, and 𝐼2 and 𝐼3 are comaximal, prove that 𝐼1𝐼2 and 𝐼3 are comaximal.

(c) Prove Theorem 4.7.

Problem 7.2

Let 𝑅 and 𝑆 be unital rings and let 𝑓:𝑅→𝑆 be a nonzero ring homomorphism. Solve the following problems.

(a) If 𝐼 is a prime ideal of 𝑆, prove that 𝑓−1(𝐼) is a prime ideal of 𝑅.

(b) If 𝐽 is a prime ideal of 𝑅, must 𝑓(𝐽) be a prime ideal of 𝑆? Explain why.

(c) If 𝐼 is a maximal ideal of 𝑆, must 𝑓−1(𝐼) be a maximal ideal of 𝑅? Explain why.

(d) If 𝐽 is a maximal ideal of 𝑅, must 𝑓(𝐽) be a maximal ideal of 𝑆? Explain why.

Problem 7.3

Let 𝐴=ℤ×ℤ be an abelian group and define End(𝐴)≔{𝑓:𝐴→𝐴|𝑓is a group homomorphism}.

(a) Prove that End(𝐴) has a natural ring structure. State its addition and multiplication operations, and find the zero element and the multiplicative identity of End(𝐴).

(b) Prove that End(𝐴) is isomorphic to the ring of 2×2 integer matrices.

Problem 7.4

Let 𝑓:𝑅→𝑆 be a ring homomorphism, let 𝐼 and 𝐽 be ideals of 𝑅 and 𝑆, respectively, and suppose 𝑓(𝐼)⊆𝐽. Define 𝑓:𝑅/𝐼→𝑆/𝐽, 𝑎+𝐼↦𝑓(𝑎)+𝐽.

(a) Prove that 𝑓 is well-defined and is a ring homomorphism.

(b) Prove that 𝑓 is a ring isomorphism if and only if 𝑓(𝑅)+𝐽=𝑆 and 𝑓−1(𝐽)=𝐼.

Problem 7.5

Let 𝑅 be a unital ring and let 𝑀𝑛(𝑅) be the ring of 𝑛×𝑛 matrices over 𝑅. If 𝐼 is an ideal of 𝑅, let 𝑀𝑛(𝐼) denote the set of all 𝑛×𝑛 matrices whose entries all belong to 𝐼. Prove the following.

(a) 𝑀𝑛(𝐼) is an ideal of 𝑀𝑛(𝑅).

(b) Every ideal of 𝑀𝑛(𝑅) has the form 𝑀𝑛(𝐽), where 𝐽 is some ideal of 𝑅.

(c) There is a ring isomorphism 𝑀𝑛(𝑅)/𝑀𝑛(𝐼)≅𝑀𝑛(𝑅/𝐼).

Problem 7.6

Solve the following problems.

(a) Prove that ℝ[𝑥]/(𝑥2+1) is isomorphic to the field of complex numbers ℂ.

(b) Prove that the quotient ring ℤ[𝑥]/(𝑥2+1) is isomorphic to the ring of Gaussian integers ℤ[𝑖]={𝑎+𝑏𝑖|𝑎,𝑏∈ℤ}.

Problem 7.7

Let 𝑓(𝑥)=𝑥4+1. Discuss separately whether 𝑓(𝑥) is irreducible in ℚ[𝑥] and whether it is irreducible in ℝ[𝑥], and explain your reasoning.

Problem 7.8

Let 𝐴=ℤ[2]={𝑎+𝑏2|𝑎,𝑏∈ℤ}.

(a) Let 𝐼=(𝑥2)⊆𝐴[𝑥] be the ideal generated by 𝑥2. Is the quotient ring 𝐴[𝑥]/𝐼 an integral domain? Explain why.

(b) Is the ideal 𝐽=(4,𝑥) of 𝐴[𝑥] principal? Explain why.

Problem 7.9

Let 𝐹 be a field. Prove that 𝐹[𝑥] contains infinitely many monic irreducible polynomials.

Problem 7.10

Let 𝑅 be a unital commutative ring and let 𝑅[𝑥] be the polynomial ring in one indeterminate over 𝑅. Let 𝑓=𝑎𝑛𝑥𝑛+⋯+𝑎1𝑥+𝑎0∈𝑅[𝑥], where 𝑎𝑖∈𝑅 for 0≤𝑖≤𝑛 and 𝑎𝑛≠0. Prove the following.

(a) 𝑓 is a unit in 𝑅[𝑥] if and only if 𝑎0∈𝑅 is a unit and 𝑎1,…,𝑎𝑛 are nilpotent elements of 𝑅.

(b) 𝑓 is nilpotent in 𝑅[𝑥] if and only if 𝑎0,𝑎1,…,𝑎𝑛 are all nilpotent.

(c) 𝑓 is a zero divisor in 𝑅[𝑥] if and only if there exists 𝑎∈𝑅∖{0} such that 𝑎𝑓=0.

Problem 7.11

Let 𝜑:ℤ[𝑥]→ℤ[𝑥] be a nonzero ring homomorphism. Determine all such ring homomorphisms, and in each case determine when the homomorphism is injective, when it is surjective, and when it is a ring automorphism.

Problem 7.12

Let 𝑅 be a unital commutative ring and let 𝑎1,…,𝑎𝑛∈𝑅, where 𝑛≥1. Define the map Φ:𝑅[𝑥]→𝑅𝑛, 𝑓(𝑥)↦(𝑓(𝑎1),…,𝑓(𝑎𝑛)). Solve the following problems.

(a) Prove that Φ is surjective if and only if 𝑎𝑖−𝑎𝑗∈𝑅∗ for every 𝑖≠𝑗.

(b) Under the equivalent condition above, prove that KerΦ=(∏𝑖=1𝑛(𝑥−𝑎𝑖)), and hence prove that 𝑅[𝑥]/(∏𝑖=1𝑛(𝑥−𝑎𝑖))≅𝑅𝑛.

(c) Under the equivalent condition above, prove that for every 𝑏1,…,𝑏𝑛∈𝑅, there exists a unique polynomial 𝑓(𝑥)∈𝑅[𝑥] of degree less than 𝑛 such that 𝑓(𝑎𝑖)=𝑏𝑖 for all 1≤𝑖≤𝑛, and write down such a polynomial 𝑓(𝑥).

8 Domains, Fields of Fractions, and Factorization

Problem 8.1

Let 𝑅 be an integral domain and let 𝐹 be a field. Let 𝑖:𝑅→𝐾(𝑅), 𝑖(𝑎)=𝑎1 for all 𝑎∈𝑅, be the natural embedding, and let 𝑓:𝑅→𝐹 be an injective ring homomorphism. Prove that there exists a unique ring homomorphism 𝑓:𝐾(𝑅)→𝐹 such that 𝑓∘𝑖=𝑓.

Problem 8.2

Let 𝑝 be a prime and let 𝐹 be a finite field of characteristic 𝑝. Define a map 𝑓:𝐹→𝐹 by 𝑓(𝑎)=𝑎𝑝 for all 𝑎∈𝐹. Prove that 𝑓 is a field isomorphism.

Problem 8.3

Let 𝑅 be a unital commutative ring. Consider the ring homomorphism 𝑓:ℤ→𝑅, 𝑓(𝑛)=𝑛⋅1. If Ker𝑓=𝑚ℤ, where 𝑚 is a nonnegative integer, then 𝑚 is called the characteristic of 𝑅.

(a) If 𝑅 is an integral domain, prove that the characteristic of 𝑅 is either a prime or 0.

(b) If 𝑅 is a unital commutative ring of prime characteristic 𝑝, prove that for every 𝑎,𝑏∈𝑅 and every positive integer 𝑛, (𝑎+𝑏)𝑝𝑛=𝑎𝑝𝑛+𝑏𝑝𝑛.

Problem 8.4

Let 𝑝 be a prime and let 𝑥 be an indeterminate. Put 𝐴={∑𝑖=0𝑛𝑎𝑖𝑥𝑝𝑖|𝑛∈ℤ≥0,𝑎𝑖∈𝔽𝑝}⊆𝔽𝑝[𝑥]. Use the usual polynomial addition on 𝐴, and define multiplication by 𝑓∗𝑔=𝑓∘𝑔=𝑓(𝑔(𝑥)). Solve the following problems.

(a) Prove that 𝐴 is a unital commutative ring under the above addition and multiplication.

(b) Construct a ring isomorphism 𝔽𝑝[𝑡]≅𝐴, where 𝑡 is an indeterminate.

Problem 8.5

Let (𝑅,𝜑) be a Euclidean domain that is not a field. Let 𝑅0 be the set of all nonzero nonunit elements of 𝑅, and let 𝑎∈𝑅0 satisfy 𝜑(𝑎)=min𝑏∈𝑅0𝜑(𝑏). Prove that the quotient ring 𝑅/(𝑎)={𝑟+(𝑎)|𝑟∈𝑅∗∪{0}}. In particular, 𝑅/(𝑎) is a field.

Problem 8.6

Give detailed proofs of Example 6 in this section.

(a) In the ring ℤ[−5], the ideal (2,1+−5) is not principal.

(b) In the ring ℤ[𝑥], the ideal (2,𝑥) is not principal.

Problem 8.7

Let 𝐹 be a field. Let 𝐹[[𝑥]]={∑𝑛=0∞𝑎𝑛𝑥𝑛|𝑎𝑛∈𝐹} be the set of all formal power series over 𝐹.

(a) For 𝑓=∑𝑛=0∞𝑎𝑛𝑥𝑛 and 𝑔=∑𝑛=0∞𝑏𝑛𝑥𝑛 in 𝐹[[𝑥]], define 𝑓+𝑔=∑𝑛=0∞(𝑎𝑛+𝑏𝑛)𝑥𝑛 and 𝑓𝑔=∑𝑛=0∞(∑𝑖=0𝑛𝑎𝑖𝑏𝑛−𝑖)𝑥𝑛. Verify that 𝐹[[𝑥]] is a unital commutative ring under these addition and multiplication operations.

(b) Find the group of units of 𝐹[[𝑥]].

(c) Find all ideals of 𝐹[[𝑥]]. Which of them are prime ideals and which are maximal ideals? Prove that 𝐹[[𝑥]] is a PID.

(d) Find the field of fractions 𝐾(𝐹[[𝑥]]).

Problem 8.8

Let 𝑅=ℤ[1+−192]={𝑎+𝑏(1+−192)|𝑎,𝑏∈ℤ}⊂ℂ. Prove that 𝑅 is not a Euclidean domain by completing the following steps.

(a) Assume that 𝑅 is a Euclidean domain. Then there is a function 𝜑:𝑅∖{0}→ℕ0 satisfying the conditions in the definition of a Euclidean domain. Let 𝑅0 be the set of all nonzero nonunit elements of 𝑅, and let 𝑎∈𝑅0 satisfy 𝜑(𝑎)=min𝑏∈𝑅0𝜑(𝑏). Prove that |𝑅/(𝑎)|≤3.

(b) Verify that 𝑓(𝑥)=𝑥2−𝑥+5∈𝑅[𝑥] has a root in 𝑅, but that 𝑓(𝑥)∈(𝑅/(𝑎))[𝑥] has no root in 𝑅/(𝑎). Derive a contradiction.

(c) Verify that ℤ[1+−432], ℤ[1+−672], and ℤ[1+−1632] are all not Euclidean domains.

Problem 8.9

Let 𝐹 be a field and let 𝑡 be an indeterminate. Put 𝑅=𝐹[𝑡2,𝑡3]⊆𝐹[𝑡]. Solve the following problems.

(a) Prove that 𝐾(𝑅)=𝐹(𝑡).

(b) Let 𝐼=(𝑡2,𝑡3) be the ideal of 𝑅. Prove that 𝐼 is not principal, and hence prove that 𝑅 is not a PID.

Problem 8.10

Let 𝐹 be a field. Let 𝐹[𝑥,𝑦1,𝑦2,…] be the polynomial ring over 𝐹 in the indeterminates 𝑥,𝑦1,𝑦2,…, where each polynomial involves only finitely many indeterminates. Let 𝑅=𝐹[𝑥,𝑦1,𝑦2,…]/(𝑥−𝑦12,𝑦1−𝑦22,𝑦2−𝑦32,…). Continue to denote the images of 𝑥,𝑦1,𝑦2,… in the quotient ring 𝑅 by the same symbols. For every positive integer 𝑛, let 𝑅𝑛=𝐹[𝑦𝑛]⊆𝑅. Solve the following problems.

(a) Prove that 𝑅1⊆𝑅2⊆⋯, 𝑅=⋃𝑛≥1𝑅𝑛, and that every 𝑅𝑛 is isomorphic to the polynomial ring in one variable 𝐹[𝑡]. Hence prove that every 𝑅𝑛 is a PID.

(b) Prove that every finitely generated ideal of 𝑅 is principal.

(c) Let 𝐼=(𝑦1,𝑦2,𝑦3,…). Prove that 𝐼 is not finitely generated. Hence prove that 𝑅 is not a PID.

Problem 8.11

Consider the subring ℤ[−3]={𝑎+𝑏−3|𝑎,𝑏∈ℤ} of the complex numbers. For 𝑥=𝑎+𝑏−3∈ℤ[−3], put 𝑁(𝑥)=𝑎2+3𝑏2.

(a) Prove that the multiplicative group ℤ[−3]∗={𝑥∈ℤ[−3]|𝑁(𝑥)=1}={1,−1}.

(b) Prove that 2, 1+−3, and 1−−3 are pairwise nonassociate irreducible elements of ℤ[−3].

(c) Prove that ℤ[−3] is not a UFD.

(d) Let 𝑥=4 and 𝑦=2(1+−3). Prove that 𝑥 and 𝑦 have no greatest common divisor in ℤ[−3].

(e) Let 𝐼=(2,1+−3). Prove that 𝐼 is not a principal ideal of ℤ[−3].

Problem 8.12

Let 𝑅 be an integral domain and let 𝑎,𝑏∈𝑅 be nonzero elements.

(a) If 𝑑∈𝑅 is a greatest common divisor of 𝑎 and 𝑏, and 𝑐∈𝑅 is a least common multiple of 𝑎 and 𝑏, prove that 𝑎𝑏 is associate to 𝑐𝑑.

(b) If lcm(𝑎,𝑏) exists, prove that gcd(𝑎,𝑏) also exists.

Problem 8.13

Determine whether each of the following statements is true. Give a proof or a counterexample.

(a) If 𝐼 is a nonzero prime ideal of ℚ[𝑋], then ℚ[𝑋]/𝐼 is a unique factorization domain.

(b) If 𝐼 is a nonzero prime ideal of ℤ[𝑋], then ℤ[𝑋]/𝐼 is a unique factorization domain.

Problem 8.14

If 𝑅 is a UFD, prove that 𝑅 is a PID if and only if for any two principal ideals (𝑎) and (𝑏) of 𝑅, their sum (𝑎)+(𝑏) is also principal.

9 Eisenstein’s Criterion, Modules, and Finite Abelian Groups

Problem 9.1

(Eisenstein’s criterion) Let 𝑅 be a UFD and let 𝐹 be the field of fractions of 𝑅. Let 𝑓(𝑥)∈𝑅[𝑥] be a primitive polynomial and let 𝑝 be an irreducible element of 𝑅. Write 𝑓(𝑥)=𝑎𝑛𝑥𝑛+⋯+𝑎1𝑥+𝑎0. If 𝑝!|𝑎𝑛, 𝑝|𝑎𝑖 for 0≤𝑖≤𝑛−1, and 𝑝2!|𝑎0, prove that 𝑓(𝑥) is irreducible in 𝐹[𝑥].

Problem 9.2

Let 𝑝 be an odd prime and let 𝑛≥1. Prove that the polynomial 𝑥𝑛−𝑝 is irreducible in ℤ[𝑖][𝑥].

Problem 9.3

Let 𝑅 be an integral domain and let 𝑝∈𝑅∖{0}. If the principal ideal (𝑝) generated by 𝑝 is a prime ideal, then 𝑝 is called a prime element.

(a) Prove that 𝑝 is a prime element if and only if, for every 𝑎,𝑏∈𝑅, 𝑝|𝑎𝑏 implies 𝑝|𝑎 or 𝑝|𝑏.

(b) Prove that every prime element is irreducible.

(c) Must every irreducible element be prime? Explain why.

Problem 9.4

Let 𝐹 be a field and let 𝑓(𝑥,𝑦,𝑧)=𝑥𝑧−𝑦2∈𝐹[𝑥,𝑦,𝑧]. Let 𝐼 be the principal ideal generated by 𝑓.

(a) Prove that the quotient ring 𝐹[𝑥,𝑦,𝑧]/𝐼 is an integral domain.

(b) Is 𝐹[𝑥,𝑦,𝑧]/𝐼 a UFD? Explain why.

Problem 9.5

Let 𝐼⊂ℤ[𝑥] be a prime ideal. Prove that 𝐼 has at most two generators. Furthermore, find all prime ideals of ℤ[𝑥].

Problem 9.6

Let 𝑅=ℂ[𝑡], and let 𝑆 be a subring of 𝑅 that contains ℂ but is not equal to ℂ. Prove that 𝑅 is a finitely generated 𝑆-module.

Problem 9.7

Let 𝑅 be a unital ring, let 𝑀 be a finitely generated 𝑅-module, and let 𝑁 be a submodule of 𝑀. Explain whether 𝑀/𝑁 and 𝑁 are also finitely generated.

Problem 9.8

Let 𝑅 be a PID. Prove that every submodule of a finitely generated free 𝑅-module is again free.

Problem 9.9

Let 𝐾 be a field and let 𝐾[𝑥] be the polynomial ring in one indeterminate over 𝐾. Let 𝐴={𝑀|𝑀is a𝐾[𝑥]-module} and 𝐵={(𝑉,𝛼)|𝑉is a𝐾-vector space,𝛼∈End𝐾(𝑉)}. Prove that there is a natural bijection between 𝐴 and 𝐵.

Problem 9.10

Let 𝐺 be a finite abelian group of order 100. Find all isomorphism classes of 𝐺.

Problem 9.11

Let 𝐺 be a finite abelian group of order 𝑛. Let 𝑚 be a positive integer such that 𝑚|𝑛. Prove that 𝐺 has a subgroup of order 𝑚.

10 Field Extensions and Algebraic Elements

Problem 10.1

Let (ℚ∗,×) be the multiplicative group of nonzero rational numbers. Is it a finitely generated abelian group? Is it a free abelian group? Explain why.

Problem 10.2

Let 𝐹 be a field, let 𝐹∗=𝐹∖{0} be its multiplicative group, and let 𝐺 be a finite subgroup of 𝐹∗. Prove that 𝐺 is cyclic.

Problem 10.3

Prove that there is no 3×3 matrix 𝐴 over ℚ such that 𝐴8=𝐼 but 𝐴4≠𝐼. Here 𝐼 denotes the identity matrix.

Problem 10.4

Let ℂ be the field of complex numbers and let 𝑓(𝑥1,…,𝑥𝑛)∈ℂ[𝑥1,…,𝑥𝑛], where 𝑛≥2 and deg𝑓≥1. Prove that the zero set 𝑉(𝑓) of 𝑓(𝑥1,…,𝑥𝑛) is infinite.

Problem 10.5

Prove that ℚ(2) and ℚ(5) are isomorphic as ℚ-vector spaces, but are not isomorphic as fields.

Problem 10.6

Let 𝐿 be a finite extension of 𝐾. Prove that the rational function field 𝐿(𝑥) is also a finite extension of 𝐾(𝑥), and that [𝐿(𝑥):𝐾(𝑥)]=[𝐿:𝐾].

Problem 10.7

Prove that the field of real numbers ℝ has no proper subfield isomorphic to itself. Does the field of complex numbers ℂ have a proper subfield isomorphic to itself?

Problem 10.8

Solve the following problems.

(a) Suppose 𝐾/𝐹 is an algebraic extension of fields. Let 𝑅 be a subring of 𝐾 containing 𝐹. Prove that 𝑅 is a subfield of 𝐾.

(b) Suppose 𝐾/𝐹 is a field extension, and every subring 𝑅 of 𝐾 containing 𝐹 is a field. Prove that 𝐾/𝐹 is an algebraic extension.

Problem 10.9

Let 𝐸/𝐹 be a field extension of degree 𝑚, and let 𝑓(𝑥) be an irreducible polynomial of degree 𝑛 over 𝐹. If 𝑚 and 𝑛 are coprime, prove that 𝑓(𝑥) is irreducible over 𝐸.

Problem 10.10

Let 𝛼=2+3.

(a) Find the minimal polynomial of 𝛼 over ℚ.

(b) Prove that ℚ(𝛼)=ℚ(2,3).

(c) Find the extension degree [ℚ(𝛼):ℚ], and give a set of elements that are linearly independent over ℚ and generate ℚ(𝛼).

Problem 10.11

Let 𝐹 be a field contained in the ring 𝑀𝑛(ℚ) of 𝑛×𝑛 matrices over ℚ. Prove that [𝐹:ℚ]≤𝑛.

11 Splitting Fields and Embeddings

Problem 11.1

For each of the following fields 𝐹 and polynomials 𝑓(𝑥)∈𝐹[𝑥], find the splitting field of 𝑓 over 𝐹.

(a) 𝐹=ℚ, 𝑓(𝑥)=𝑥4−2.

(b) 𝐹=ℚ, 𝑓(𝑥)=𝑥4+𝑥2+1.

Problem 11.2

Let 𝑝 be an odd prime and consider 𝑓(𝑥)=𝑥𝑝−2. Let 𝐿 be the splitting field of 𝑓(𝑥) over ℚ. Prove that [𝐿:ℚ]=𝑝(𝑝−1).

Problem 11.3

The irreducibility of the cyclotomic polynomial Φ𝑛(𝑥) in ℚ[𝑥] can be proved by the following steps.

(a) Let 𝑔(𝑥)∈𝔽𝑝[𝑥] and let ℎ(𝑥)=𝑔(𝑥𝑝). Prove that ℎ(𝑥)=𝑔(𝑥)𝑝.

(b) Let 𝑓(𝑥)∈ℤ[𝑥] be monic and irreducible, and suppose 𝑓(𝑥)|Φ𝑛(𝑥). Let 𝜁∈ℂ be a primitive 𝑛-th root of unity such that 𝑓(𝜁)=0. Let 𝑝 be a prime relatively prime to 𝑛. Prove that 𝑓(𝜁𝑝)=0. (Hint: Use the quotient map ℤ[𝑥]→𝔽𝑝[𝑥] and the fact that 𝑥𝑛−1∈𝔽𝑝[𝑥] has no repeated roots in 𝔽𝑝.)

(c) Prove that Φ𝑛(𝑥) is irreducible in ℤ[𝑥], and deduce that Φ𝑛(𝑥) is irreducible in ℚ[𝑥].

Problem 11.4

Consider the polynomial 𝑓(𝑥)=𝑥4−4𝑥2+2∈ℚ[𝑥] and let 𝛼=2+2.

(a) Prove that 𝑓(𝑥) is irreducible in ℚ[𝑥].

(b) Prove that ℚ(𝛼) already contains every root of 𝑓(𝑥), and hence is the splitting field of 𝑓(𝑥).

(c) Find [ℚ(𝛼):ℚ] and write down all ℚ-embeddings of ℚ(𝛼) into ℂ.

Problem 11.5

Determine whether ℂ(𝑥) and ℂ((𝑥)) are algebraically closed fields, and give proofs. Here ℂ(𝑥) is the field of rational functions over the complex numbers, and ℂ((𝑥)) is the field of fractions of the formal power series ring ℂ[[𝑥]].

Problem 11.6

Compute Emb(ℚ(24,−1)/ℚ) and Emb(ℚ(23)/ℚ).

Problem 11.7

Give all field embeddings of ℚ(2,3) into ℂ.

Problem 11.8

Prove that ℚ(𝑥) cannot be embedded into ℚ. What if ℚ is replaced by the field of complex numbers ℂ?

Problem 11.9

(a) Prove that every finite extension of ℚ can be embedded into the field extension ℂ/ℚ.

(b) Prove that every finitely generated extension of ℚ can be embedded into the field extension ℂ/ℚ.

Problem 11.10

Let 𝐹 be a field and let 𝑓(𝑥)∈𝐹[𝑥] be irreducible. Let 𝐾 be the splitting field of 𝑓(𝑥) over 𝐹, and suppose that there exists an element 𝛼∈𝐾 such that both 𝛼 and 𝛼+1 are roots of 𝑓(𝑥).

(a) Prove that char(𝐹)>0.

(b) Prove that char(𝐹) divides |Aut(𝐾/𝐹)|.

12 Normal and Separable Extensions

Problem 12.1

For each of the following field extensions 𝐸/𝐹, determine whether it is normal and whether it is separable.

  • 𝐹=ℚ, 𝐸=ℚ(214).

  • 𝐹=ℚ, 𝐸=ℚ(2,3,…,𝑛,…).

  • 𝑝 is a prime, 𝐹=𝔽𝑝(𝑡𝑝), 𝐸=𝔽𝑝(𝑡).

  • 𝐹=ℚ(𝑥), 𝐸=ℚ(𝑥)[𝑡]/(𝑡2−𝑥).

Problem 12.2

For a given prime 𝑝, find the normal closure of the field extension ℚ(21𝑝)/ℚ.

Problem 12.3

Give an example of field extensions 𝐹⊆𝐾⊆𝐿 such that both 𝐾/𝐹 and 𝐿/𝐾 are normal extensions, but 𝐿/𝐹 is not.

Problem 12.4

Let 𝐸=ℂ(𝑡) be the field of rational functions and let 𝐹=ℂ(𝑡𝑛+𝑡−𝑛). Prove that 𝐸/𝐹 is a normal extension.

Problem 12.5

For every prime 𝑝, prove that 𝐸=𝔽𝑝[𝑥]/(𝑥𝑝−𝑥+1) is a normal extension of 𝔽𝑝.

Problem 12.6

Let 𝐸/ℚ be a finite normal extension of odd degree. Prove that 𝐸⊆ℝ.

Problem 12.7

Let 𝐸/𝐹 be a field extension and let 𝛼,𝛽∈𝐸. If 𝐹(𝛼)/𝐹 is a normal extension and 𝐹(𝛼)∩𝐹(𝛽)=𝐹, prove that [𝐹(𝛼,𝛽):𝐹]=[𝐹(𝛼):𝐹][𝐹(𝛽):𝐹].

Problem 12.8

In ℂ, let 𝛼=23, let 𝜁3 be a primitive third root of unity, and put 𝐾=ℚ(𝛼) and 𝑀=ℚ(𝜁3𝛼).

(a) Prove that both 𝐾/ℚ and 𝑀/ℚ are separable, nonnormal extensions of degree 3.

(b) Prove that 𝐾≠𝑀, and hence prove that 𝐾∩𝑀=ℚ.

(c) Prove that 𝐾𝑀=ℚ(𝛼,𝜁3) is the splitting field of 𝑥3−2, and find its degree.

Problem 12.9

Let 𝑢 be an indeterminate and let 𝐹=ℚ(𝑢). Let 𝛼3=𝑢 and put 𝐸=𝐹(𝛼).

(a) Prove that 𝑥3−𝑢 is irreducible in 𝐹[𝑥], and find [𝐸:𝐹].

(b) Prove that 𝐸/𝐹 is separable but not normal.

(c) Let 𝜁3 be a primitive third root of unity. Prove that 𝐿=𝐹(𝛼,𝜁3) is the normal closure of 𝐸/𝐹, and find [𝐿:𝐹].

(d) Prove that ℂ(𝑢,𝛼)/ℂ(𝑢) is a normal extension.

Problem 12.10

Verify that the polynomial 𝑓(𝑥)=𝑥𝑝−𝑡 in Example 2 is irreducible in 𝐹[𝑥].

13 Galois Theory and the Fundamental Theorem

Problem 13.1

Prove that the extension 𝐸⊇𝐹 is Galois, determine the Galois group Gal(𝐸/𝐹), all of its subgroups, and the corresponding intermediate fields between 𝐹 and 𝐸.

(a) 𝐹=ℚ, 𝐸=ℚ(24,𝑖).

(b) 𝐹=ℝ(𝑥+1𝑥), 𝐸=ℝ(𝑥).

(c) 𝐹=ℝ(𝑥2+𝑦2,𝑥𝑦), 𝐸=ℝ(𝑥,𝑦).

Problem 13.2

Compute the Galois group of 𝑥5−2 over ℚ and over 𝔽3, respectively.

Problem 13.3

Let 𝐸/𝐹 be a field extension, let 𝐺=Aut(𝐸/𝐹), let 𝐻<𝐺, and put 𝐾=𝐸𝐻. Prove that for every 𝜂∈𝐺, 𝐸𝜂𝐻𝜂−1=𝜂(𝐾).

Problem 13.4

If 𝐸/ℚ is a Galois extension and Gal(𝐸/ℚ)≅𝑆5, prove that 𝐸 is the splitting field of a polynomial of degree 5.

Problem 13.5

Let 𝐸/𝐹 be a separable extension of degree 𝑑, and let 𝑁 be the number of intermediate fields.

(a) Prove that 𝑁≤2𝑑!.

(b) Prove that 𝑁≤2𝑑.

Problem 13.6

Prove that every finite group can be realized as the Galois group of a Galois extension.

Problem 13.7

Suppose 𝐸/𝐹 is a Galois extension of degree 𝑝𝑛, where 𝑝 is a prime and 𝑛 is a positive integer. Prove that 𝐸 contains Galois extensions of 𝐹 of degree 𝑝 and of degree 𝑝𝑛−1.

Problem 13.8

Let 𝑓(𝑥)∈𝐹[𝑥] be an irreducible separable polynomial, and let 𝐸 be the splitting field of 𝑓(𝑥). If Gal(𝐸/𝐹) is abelian, prove that [𝐸:𝐹]=deg𝑓(𝑥).

Problem 13.9

Let 𝑝 be a prime. Suppose that the degree of every finite extension of a field 𝐹 is divisible by 𝑝.

(a) Prove that the degree of every finite separable extension of 𝐹 is a power of 𝑝.

(b) Prove that the degree of every finite extension of 𝐹 is a power of 𝑝.

Problem 13.10

Let 𝑘 be a field, let 𝑛≥2, and let 𝐸=𝑘(𝑥1,…,𝑥𝑛) be the field of rational functions in 𝑛 variables over 𝑘. Let 𝑆𝑛 act on 𝐸 so that every 𝜎∈𝑆𝑛 fixes every element of 𝑘 and satisfies 𝜎(𝑥𝑖)=𝑥𝜎(𝑖) for 1≤𝑖≤𝑛. For 1≤𝑟≤𝑛, put 𝑒𝑟=∑1≤𝑖1<⋯<𝑖𝑟≤𝑛𝑥𝑖1⋯𝑥𝑖𝑟, and let 𝐹=𝑘(𝑒1,…,𝑒𝑛). Solve the following problems.

(a) Prove that 𝐹⊆𝐸𝑆𝑛, and prove that 𝐸/𝐹 is a finite extension with [𝐸:𝐹]≤𝑛!.

(b) Prove that 𝐸/𝐹 is a Galois extension, determine its Galois group, and thereby prove that 𝐸𝑆𝑛=𝐹.

(c) Assume char𝑘≠2 and put Δ=∏1≤𝑖<𝑗≤𝑛(𝑥𝑖−𝑥𝑗). Prove that every element of 𝐴𝑛 fixes Δ, while every odd permutation sends Δ to −Δ. Hence prove that 𝐸𝐴𝑛=𝐹(Δ).

14 Möbius Inversion and Finite Fields

Problem 14.1

Define the Möbius function 𝜇:ℕ→ℤ as follows: 𝜇(𝑑)={1if𝑑=1(−1)𝑘if𝑑=𝑝1⋯𝑝𝑘is the product of𝑘distinct primes0otherwise. Let 𝑓,𝑔:ℕ→ℕ be nonzero functions. If 𝑓(𝑛)=∑𝑑|𝑛𝑔(𝑑), prove that 𝑔(𝑛)=∑𝑑|𝑛𝜇(𝑑)𝑓(𝑛𝑑), and use this to complete the calculation in Example 4.

Problem 14.2

Let 𝛼 be a root in 𝔽3 of the polynomial 𝑥2+2𝑥+2 over 𝔽3, and put 𝐸=𝔽3[𝛼]. Find the following.

(a) The degree 𝑛=[𝐸:𝔽3] of the field extension.

(b) The inverse of 𝛽=𝛼2+1 in 𝐸, expressed as an 𝔽3-linear combination of 1,𝛼,…,𝛼𝑛−1.

Problem 14.3

Find the splitting field of 𝑥8−1∈𝔽3[𝑥].

Problem 14.4

Find the greatest common divisor of the polynomials 𝑓(𝑥)=𝑥6+𝑥4+𝑥+1∈𝔽2[𝑥] and 𝑔(𝑥)=𝑥8−𝑥∈𝔽2[𝑥] over 𝔽2. Use this to explain why 𝑓(𝑥) has exactly four roots in 𝔽8.

Problem 14.5

Find the order of the special linear group SL𝑚(𝔽𝑞) over the finite field 𝔽𝑞.

Problem 14.6

Prove that every element of a finite field can be written as the sum of two squares.

Problem 14.7

For a prime 𝑝 and a positive integer 𝑛, prove that 𝑥𝑝𝑛−𝑥+1 is irreducible over 𝔽𝑝 if and only if 𝑛=1 or 𝑛=𝑝=2.

Problem 14.8

Let 𝑞 be a prime power, let 𝑓(𝑥)∈𝔽𝑞[𝑥] be a monic irreducible polynomial of degree 𝑛, and let 𝑚 be a positive integer. Prove that 𝑓(𝑥) factors in 𝔽𝑞𝑚[𝑥] into exactly gcd(𝑚,𝑛) pairwise distinct monic irreducible factors, and that each irreducible factor has degree 𝑛/gcd(𝑚,𝑛). In particular, prove that 𝑓(𝑥) is irreducible in 𝔽𝑞𝑚[𝑥] if and only if gcd(𝑚,𝑛)=1.

Problem 14.9

Let 𝐾 be a finite field and let 𝐾 be an algebraic closure of 𝐾. Solve the following problems.

(a) Prove that Aut(𝐾/𝐾) is an abelian group.

(b) Let 𝜎∈Aut(𝐾/𝐾). Prove that if there is a positive integer 𝑚 such that 𝜎𝑚=id𝐾, then 𝜎=id𝐾. Hence prove that every nonidentity element of Aut(𝐾/𝐾) has infinite order.

Problem 14.10

Let 𝐹 be a field of characteristic 𝑝>0, let 𝑎∈𝐹, and suppose that 𝑓(𝑥)=𝑥𝑝−𝑥−𝑎∈𝐹[𝑥] is irreducible. If 𝛼 is a root of 𝑓(𝑥), put 𝐸=𝐹(𝛼). Solve the following problems.

(a) Prove that all roots of 𝑓(𝑥) are exactly 𝛼+𝑐, where 𝑐∈𝔽𝑝.

(b) Prove that 𝐸/𝐹 is a Galois extension of degree 𝑝.

(c) For every 𝑐∈𝔽𝑝, prove that there exists a unique 𝜎𝑐∈Aut(𝐸/𝐹) such that 𝜎𝑐(𝛼)=𝛼+𝑐. Prove that Aut(𝐸/𝐹)={𝜎𝑐|𝑐∈𝔽𝑝}, and hence prove that Aut(𝐸/𝐹)≅(𝔽𝑝,+).

Problem 14.11

Let 𝑘 be a finite field of characteristic 𝑝>0, let 𝐹=𝑘(𝑡) be the field of rational functions in one variable over 𝑘, and let 𝐸 be any finite extension of 𝐹. Prove the following.

(a) If 𝐸/𝐹 is inseparable, then 𝑘(𝑡1𝑝)⊆𝐸.

(b) 𝐸/𝐹 is a simple extension.