Group Theory, Actions & Sylow Structure

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/10

encourage image

There's no tags or description

Looks like no tags are added yet.

11 Terms

1
New cards

State Sylow's Theorems (I, II, and III) for a finite group GG where ∣G∣=pkm|G| = p^k m and gcd⁡(p,m)=1\gcd(p, m) = 1.

1. Sylow I (Existence): GG contains at least one subgroup of order pkp^k (a Sylow pp-subgroup). (Note: More generally, for any pi∣∣G∣p^i \mid |G|, GG contains a subgroup of order pip^i).

2. Sylow II (Conjugacy & Embedding): Any two Sylow pp-subgroups of GG are conjugate. Furthermore, every pp-subgroup of GG is contained in some Sylow pp-subgroup.

3. Sylow III (Counting): The number of Sylow pp-subgroups np=∣Sylp(G)∣n_p = |\text{Syl}_p(G)| satisfies: i) np≡1(modp)n_p \equiv 1 \pmod p

ii) np∣mn_p \mid m

iii) np=[G:NG(P)]n_p = [G : N_G(P)] for any P∈Sylp(G)P \in \text{Syl}_p(G).

2
New cards

State the Orbit-Stabilizer Theorem for a group GG acting on a set XX, and write out the Class Equation.

1. Orbit-Stabilizer: For any x∈Xx \in X, ∣Orbit(x)∣⋅∣Stab(x)∣=∣G∣|\text{Orbit}(x)| \cdot |\text{Stab}(x)| = |G|. If GG is finite, ∣Orbit(x)}=[G:Gx]|\text{Orbit}(x)\} = [G : G_x]. 2. Class Equation (Conjugation Action of GG on itself): ∣G∣=∣Z(G)∣+∑i=1r[G:CG(xi)]|G| = |Z(G)| + \sum_{i=1}^{r} [G : C_G(x_i)] where xix_i are representatives of the non-central conjugacy classes.

3
New cards

[Qual Trigger] Prove that if ∣G∣=pk|G| = p^k (k≥1k \ge 1), then Z(G)≠1Z(G) \neq 1 (the center is non-trivial).

1. Use the Class Equation: ∣G∣=∣Z(G)}+∑[G:CG(xi)]|G| = |Z(G)\} + \sum [G : C_G(x_i)]. 2. Each centralizer CG(xi)C_G(x_i) is a proper subgroup containing Z(G)Z(G), so its index [G:CG(xi)][G : C_G(x_i)] is a positive power of pp (paip^{a_i} where ai>0a_i > 0). 3. Thus, pp divides every term in the sum except ∣Z(G)∣|Z(G)|, implying p∣∣Z(G)∣p \mid |Z(G)|. 4. Since 1∈Z(G)1 \in Z(G), ∣Z(G)∣≥p>1|Z(G)| \ge p > 1, so Z(G)Z(G) is non-trivial.

4
New cards

[Qual Trigger] What is the standard modular arithmetic trick to prove a Sylow pp-subgroup is normal, and why does it work?

1. Check np≡1(modp)n_p \equiv 1 \pmod p and np∣mn_p \mid m. 2. If the only divisor of mm congruent to 1 mod p1 \bmod p is 11, then np=1n_p = 1. 3. If np=1n_p = 1, the unique Sylow pp-subgroup PP is invariant under all inner automorphisms (conjugation by any g∈Gg \in G), hence P⊴GP \trianglelefteq G.

5
New cards

[Qual Trigger] Outline the proof that any group GG of order 99=32⋅1199 = 3^2 \cdot 11 is abelian.

1. Sylow 1111: n11∣9n_{11} \mid 9 and n11≡1(mod11)  ⟹  n11=1n_{11} \equiv 1 \pmod{11} \implies n_{11} = 1. Let P11P_{11} be the unique normal Sylow 1111-subgroup. 2. Sylow 33: n3∣11n_3 \mid 11 and n3≡1(mod3)  ⟹  n3∈{1,11}n_3 \equiv 1 \pmod 3 \implies n_3 \in \{1, 11\}. But 11≢1(mod3)11 \not\equiv 1 \pmod 3, so n3=1n_3 = 1. Let P9P_9 be the unique normal Sylow 33-subgroup. 3. Direct Product: P9∩P11={e}P_9 \cap P_{11} = \{e\} and both are normal   ⟹  G≅P9×P11\implies G \cong P_9 \times P_{11}. 4. Groups of order p2p^2 are always abelian (P9P_9 is abelian). Thus GG is a direct product of abelian groups, hence abelian.

6
New cards

[Qual Trigger] Prove that a group GG of order p2qp^2 q (where p,qp, q are distinct primes) cannot be simple.

1. Apply Sylow III: nq∣p2  ⟹  nq∈{1,p,p2}n_q \mid p^2 \implies n_q \in \{1, p, p^2\}. 2. If nq=1n_q = 1, Q⊴GQ \trianglelefteq G (not simple, done). 3. If nq>1n_q > 1, then nqn_q must be pp or p2p^2. Since nq≡1(modq)n_q \equiv 1 \pmod q, analyze cases: if q>pq > p, nq≡1(modq)n_q \equiv 1 \pmod q cannot be pp or p2p^2 unless q∣p−1q \mid p-1 or similar constraints. 4. Alternatively, count elements of order qq: each non-trivial subgroup of order qq has q−1q-1 elements of order qq, and they intersect trivially. If nq=p2n_q = p^2, counting elements forces the Sylow pp-subgroup to be unique and normal (np=1n_p = 1).

7
New cards

Define a transitive action and a doubly transitive (2-transitive) action. What is the relation to stabilizers?

1. Transitive: An action of GG on XX is transitive if for any x,y∈Xx, y \in X, there exists g∈Gg \in G such that g⋅x=yg \cdot x = y (i.e., there is only one orbit: XX). 2. Doubly Transitive (2-transitive): For any two pairs of distinct points (x1,x2)(x_1, x_2) and (y1,y2)(y_1, y_2) in X×XX \times X, there exists g∈Gg \in G such that g⋅x1=y1g \cdot x_1 = y_1 and g⋅x2=y2g \cdot x_2 = y_2. 3. Stabilizer Link: An action of GG on XX is 2-transitive if and only if for any x∈Xx \in X, the induced action of the stabilizer GxG_x on X∖{x}X \setminus \{x\} is transitive.

8
New cards

[Qual Trigger] Given a short exact sequence 1→A→B→C→11 \to A \to B \to C \to 1, what are the standard Q1 proof patterns regarding centers and normal subgroups?

1. Exactness Property: Im⁡(f)=ker⁡(g)\operatorname{Im}(f) = \ker(g) at every step. In particular, AA embeds normally into BB (A⊴BA \trianglelefteq B), and B/A≅CB/A \cong C. 2. Center/Centralizer Lemma: If A⊆Z(B)A \subseteq Z(B), then B/AB/A acting on elements or centralizer extensions allows lifting central elements from CC back to BB. 3. Splitting: The sequence splits (B≈A⋊CB \approx A \rtimes C) if there exists a homomorphism s:C→Bs: C \to B such that g∘s=id⁡Cg \circ s = \operatorname{id}_C.

9
New cards

[Qual Trigger] Let H≠1H \neq 1 be a normal subgroup of a finite group GG. Prove that H∩Z(G)≠1H \cap Z(G) \neq 1.

1. GG acts on HH by conjugation: g⋅h=ghg−1∈Hg \cdot h = ghg^{-1} \in H (since H⊴GH \trianglelefteq G). 2. Apply the class equation / orbit-size breakdown to this action on HH. 3. The fixed points of this action are elements h∈Hh \in H such that ghg−1=hghg^{-1} = h for all g∈Gg \in G, which is precisely CG(H)∩H=Z(G)∩HC_G(H) \cap H = Z(G) \cap H. 4. The size of HH satisfies ∣H}=∣Z(G)∩H∣+∑[H:CH(xi)]|H\} = |Z(G) \cap H| + \sum [H : C_H(x_i)]. Modulo prime power arguments or orbit size divisions, non-trivial orbits must balance, forcing ∣Z(G)∩H∣>1|Z(G) \cap H| > 1.

10
New cards

Define the commutator subgroup G′G' and state the universal property regarding abelian quotients G/NG/N.

1. Definition: G′=⟨[x,y]∣x,y∈G⟩G' = \langle [x, y] \mid x, y \in G \rangle where [x,y]=xyx−1y−1[x, y] = xyx^{-1}y^{-1}. 2. Quotient Criterion: For any normal subgroup N⊴GN \trianglelefteq G, G/NG/N is abelian if and only if G′⊆NG' \subseteq N. 3. Universal Property: G′G' is the smallest normal subgroup of GG such that the quotient is abelian. Any homomorphism from GG to an abelian group factors through G/G′G/G'.

11
New cards

[Qual Trigger] Let H≤GH \le G have index [G:H]=p[G : H] = p, where pp is the smallest prime dividing ∣G∣|G|. Prove that H⊴GH \trianglelefteq G.

  1. Consider the left multiplication action of GG on the set of cosets G/HG/H, giving a permutation representation ρ:G→Sp\rho: G \to S_p.
  2. The kernel ker⁡(ρ)\ker(\rho) is contained in HH because if g∈ker⁡(ρ)g \in \ker(\rho), then g(1H)=1H  ⟹  g∈Hg(1H) = 1H \implies g \in H.
  3. By the First Isomorphism Theorem, G/ker⁡(ρ)G/\ker(\rho) embeds into SpS_p, so ∣G/ker⁡(ρ)∣∣p!|G/\ker(\rho)| \mid p!.
  4. If pp is the *smallest* prime dividing ∣G∣|G|, any factor of ∣G/H∣|G/H| or index analysis forces ker⁡(ρ)=H\ker(\rho) = H, making HH a normal subgroup.