Alphabeta Math
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 11 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Sylow's Theorems, p-Groups and Nilpotent Groups — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The Sylow subgroups of S4

Example

The group S4 has three Sylow 2-subgroups, each of order 8, and four Sylow 3-subgroups, each generated by a pair of inverse 3-cycles. See The number np(G) of Sylow p-subgroups.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

For a finite group G and a prime p, let Syl⁡p(G) be the set of Sylow p-subgroups (def-sylow-p-subgroup). Define np(G):=∣Syl⁡p(G)∣. This cardinal is defined even before existence is proved because Syl⁡p(G) is a subset of the finite power set of G; thm-sylow-first-theorem later shows it is nonzero. (The number np(G) of Sylow p-subgroups).

[L2]

Let ∣G∣=pam with p∤m. Then the number of Sylow p-subgroups satisfies np(G)≡1(modp),np(G)∣m.. (Sylow III: np≡1(modp) and np∣m when ∣G∣=pam with p∤m).

[L3]

Let n∈N, so that n={0,1,…,n−1} (def-natural-numbers). The symmetric group on n letters is Sn:=Sym⁡(n)=Sym⁡({0,1,…,n−1}), the group of all bijections of n under composition (def-symmetric-group), with the composition convention. (The finite symmetric group Sn, one-line notation, and cycle notation).

[L4]

For σ,τ∈Sn, there is a g∈Sn with τ=gσg−1 if and only if σ and τ have the same cycle type, including their numbers of fixed points. (Two elements of Sn are conjugate if and only if they have the same cycle type).

Verification

technique · direct
1.1L1L2L3L4givenalgebra

Relabel the underlying set as {1,2,3,4}. Each of its three partitions into two unordered pairs has a stabilizer of order 22⋅2=8: one may swap within either pair and may swap the two pairs. These three distinct stabilizers are therefore Sylow 2-subgroups.

2.1step 1.1givenalgebra∎

A subgroup of order 3 is generated by a 3-cycle. Choosing its unique fixed point gives four subgroups, because the two cycles on the remaining three letters are inverse generators of the same subgroup. Thus n2=3 and n3=4, consistent with n2∣3, n2≡1(mod2), n3∣8, and n3≡1(mod3). This proves the stated claim.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The Sylow subgroups of A5

Example

The group A5 has five Sylow 2-subgroups, ten Sylow 3-subgroups, and six Sylow 5-subgroups. See The number np(G) of Sylow p-subgroups.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

For a finite group G and a prime p, let Syl⁡p(G) be the set of Sylow p-subgroups (def-sylow-p-subgroup). Define np(G):=∣Syl⁡p(G)∣. This cardinal is defined even before existence is proved because Syl⁡p(G) is a subset of the finite power set of G; thm-sylow-first-theorem later shows it is nonzero. (The number np(G) of Sylow p-subgroups).

[L2]

Let ∣G∣=pam with p∤m. Then the number of Sylow p-subgroups satisfies np(G)≡1(modp),np(G)∣m.. (Sylow III: np≡1(modp) and np∣m when ∣G∣=pam with p∤m).

[L3]

For n∈N, the alternating group is the kernel of the sign homomorphism, An:=ker⁡(sgn⁡:Sn→{+1,−1})={σ∈Sn:sgn⁡(σ)=1}. Thus An consists exactly of the even permutations. The subgroup and normality assertions implicit in the word “group” follow from thm-image-subgroup-and-kernel-normal. (The alternating group An=ker⁡(sgn⁡) of even permutations).

[L4]

The conjugacy classes of Sn are in bijection with the tuples of nonnegative integers (c1,…,cn) satisfying ∑k=1nkck=n. For n=0, the unique empty tuple indexes the identity class of S0. (The conjugacy classes of Sn are indexed by the tuples (c1,…,cn) with ∑kck=n).

Verification

technique · direct
1.1L1L2L3L4givenalgebra

There are (53)⋅2=20 three-cycles, and each order-3 subgroup has two nonidentity elements, giving n3=10. There are 4!=24 five-cycles, and each order-5 subgroup has four nonidentity elements, giving n5=6.

2.1step 1.1givenalgebra∎

Each of the five choices of a fixed letter gives the Klein four group of the three double transpositions on the remaining letters. The resulting five groups partition the fifteen double transpositions, so n2=5. The values satisfy 5∣15, 10∣20, 6∣12 and the respective congruences modulo 2, 3, and 5. This proves the stated claim.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-17Open item page →

Sylow subgroups of Aff⁡(Z/5): n2=5 and n5=1

Example

In Aff⁡(Z/5), the translation subgroup is the unique Sylow 5-subgroup and the five point stabilizers are the Sylow 2-subgroups. Thus n5=1 and n2=5. See Sylow III: np≡1(modp) and np∣m when ∣G∣=pam with p∤m.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

Let ∣G∣=pam with p∤m. Then the number of Sylow p-subgroups satisfies np(G)≡1(modp),np(G)∣m.. (Sylow III: np≡1(modp) and np∣m when ∣G∣=pam with p∤m).

[L2]

A Sylow p-subgroup of a finite group is normal if and only if it is the unique Sylow p-subgroup. (A Sylow p-subgroup is normal if and only if it is unique).

[L3]

Let N and H be groups (def-group), and let α:H→Aut⁡(N) be an action by automorphisms (def-action-by-automorphisms). The external semidirect product N⋊αH is the set N×H with multiplication. ( The external semidirect product N⋊αH).

[L4]

For every prime p, the operations of addition and multiplication on Z/p make it a field (def-field). (For every prime p, the two operations on Z/p make it a field).

Verification

technique · direct
1.1L1L2L3L4givenalgebra

Composition identifies the affine maps x↦ax+b, with a∈F5× and b∈F5, with F5⋊F5×. The multiplier map has the translation subgroup as its kernel, so that normal subgroup has order 5 and is the unique Sylow 5-subgroup.

2.1step 1.1givenalgebra

For each c∈F5, the stabilizer of c consists of the four maps x↦a(x−c)+c. It has order 4, the full 2-part of the group order 20, and hence is Sylow.

3.1step 2.1givenalgebra∎

The five point stabilizers are distinct, and Sylow III permits at most five Sylow 2-subgroups. Consequently they are all of them, so n2=5 and n5=1. This proves the stated claim.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-17Open item page →

The unique Sylow p-subgroup of Aff⁡(Z/p2)

Example

For every prime p, the affine group of Z/p2 has a unique Sylow p-subgroup, consisting of the maps x↦ax+b with a≡1(modp). It has order p3, including when p=2. See Sylow III: np≡1(modp) and np∣m when ∣G∣=pam with p∤m.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

Let ∣G∣=pam with p∤m. Then the number of Sylow p-subgroups satisfies np(G)≡1(modp),np(G)∣m.. (Sylow III: np≡1(modp) and np∣m when ∣G∣=pam with p∤m).

[L2]

A Sylow p-subgroup of a finite group is normal if and only if it is the unique Sylow p-subgroup. (A Sylow p-subgroup is normal if and only if it is unique).

[L3]

Let N and H be groups (def-group), and let α:H→Aut⁡(N) be an action by automorphisms (def-action-by-automorphisms). The external semidirect product N⋊αH is the set N×H with multiplication. ( The external semidirect product N⋊αH).

[L4]

For every prime p and natural k≥1, φ(pk)=pk−pk−1. Equivalently, among the pk standard classes modulo pk, the nonunits are exactly those whose standard representatives are divisible by p. (For a prime p and k≥1, φ(pk)=pk−pk−1).

[L5]

Let n≥1 and a∈Z. Then [a]n is a unit of Z/n (def-unit-group-modulo-n-and-euler-totient) if and only if gcd⁡(a,n)=1, that is, if and only if a and n are coprime (def-coprime). Consequently the condition gcd⁡(a,n)=1 depends only on the class [a]n. (For n≥1, [a]n is a unit if and only if gcd⁡(a,n)=1).

Verification

technique · direct
1.1L1L2L3L4L5givenalgebra

The affine group is (Z/p2)⋊(Z/p2)× and has order p2φ(p2)=p3(p−1). Reduction of the multiplier modulo p is a homomorphism to (Z/p)×.

2.1step 1.1givenalgebra

Its kernel consists of arbitrary translations and the p units 1+pt with t∈Z/p. It is therefore normal of order p2⋅p=p3, the full p-part of the affine-group order, and so is the unique Sylow p-subgroup.

3.1step 2.1givenalgebra∎

For p=2, both units modulo 4 are congruent to 1 modulo 2, so the kernel is the whole affine group of order 8; the same conclusion holds without exception. This proves the stated claim.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The finite Heisenberg group is the unique Sylow p-subgroup of its coordinate upper-triangular group

Example

Let Hp=Fp3 with (a,b,c)(a′,b′,c′)=(a+a′,b+b′,c+c′+ab′), and let D=(Fp×)3 act by diagonal coordinate scaling. In the coordinate upper-triangular group Bp=Hp⋊D, the subgroup Hp is the unique Sylow p-subgroup. See The external direct product G×H with componentwise multiplication.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

Let G and H be groups. Their external direct product has underlying set G×H:={(g,h):g∈G, h∈H} and componentwise operation (g,h)(g′,h′):=(gg′,hh′). The fact that this operation makes G×H a group, with the indicated identity and inverses, is proved in thm-external-direct-product-is-a-group. Until that result is used, this definition introduces only the set and its componentwise binary operation. (The external direct product G×H with componentwise multiplication).

[L2]

For groups G and H, the componentwise operation of def-external-direct-product-of-groups makes G×H a group. Its identity is (eG,eH), and (g,h)−1=(g−1,h−1). Moreover the coordinate maps πG(g,h)=g and πH(g,h)=h are group homomorphisms. (G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections).

[L3]

An action of a group H on a group N by automorphisms is a homomorphism α:H⟶Aut⁡(N). Here automorphisms are those of def-group-isomorphism-and-automorphism. Writing αh=α(h), this means that every αh is an automorphism of N, αhk=αh∘αk, and α1=id⁡N. Equivalently, by thm-group-actions-correspond-to-homomorphisms, it is a group action (def-group-action) on the underlying set of N for which every acting permutation is an automorphism. (An action of a group H on a group N by automorphisms).

[L4]

For an action α:H→Aut⁡(N), the external semidirect product N⋊αH is N×H with multiplication (n,h)(n′,h′)=(nαh(n′),hh′). ( The external semidirect product N⋊αH).

[L5]

Let α:H→Aut⁡(N) be an action by automorphisms. The multiplication (n,h)(n′,h′)=(nαh(n′),hh′) makes N×H a group with identity (1N,1H) and inverse (n,h)−1=(αh−1(n−1),h−1).. ( The semidirect-product multiplication makes N×H a group).

[L6]

In N⋊αH, the canonical copies Nˉ={(n,1):n∈N} and Hˉ={(1,h):h∈H} are subgroups, Nˉ is normal, their intersection is trivial, every element has a unique factorization (n,1)(1,h), and (1,h)(n,1)(1,h)−1=(αh(n),1). (The canonical copy of N is normal, the canonical copy of H is a complement, and conjugation induces the action).

[L7]

A Sylow p-subgroup of a finite group is normal if and only if it is the unique Sylow p-subgroup. (A Sylow p-subgroup is normal if and only if it is unique).

[L8]

For every prime p, the operations of addition and multiplication on Z/p make it a field (def-field). (For every prime p, the two operations on Z/p make it a field).

[L9]

Let n be a positive integer. Every class in Z/n (def-integers-modulo-n) contains exactly one integer r with 0≤r<n. Consequently the map r⟼[r]n(0≤r<n) is a bijection from the von Neumann natural n to Z/n, and ∣Z/n∣=n. This includes n=1, where the only representative is 0. For n=0, the map a↦[a]0 is a bijection Z→Z/0. (For n≥1, every class in Z/n has one representative r with 0≤r<n, so ∣Z/n∣=n; while Z/0 is in bijection with Z).

[L10]

For n≥1, the unit group is (Z/n)×:={u∈Z/n:some v∈Z/n satisfies uv=[1]n}, and Euler's totient is φ(n):=∣(Z/n)×∣. (The unit group (Z/n)× and Euler's totient φ(n)=∣(Z/n)×∣ for n≥1).

[L11]

Euler's totient satisfies φ(1)=1. If p is prime (def-prime), then φ(p)=p−1.. (φ(1)=1, and φ(p)=p−1 for every prime p).

[L12]
  1. If A and B are finite then A×B is finite and ∣A×B∣=∣A∣⋅∣B∣ (def-finite-cardinality). 2. Let m∈N and let A0,…,Am−1 be finite sets. Write ∏i<mAi:={ f:f is a function with domain m and f(i)∈Ai for every i<m }. Then ∏i<mAi is finite and ∣∏i<mAi∣=∏i<m∣Ai∣, the right-hand product being the N-valued one of def-nat-finite-sum-and-product. (The product rule: ∣A×B∣=∣A∣ ∣B∣, and ∣∏i<mAi∣=∏i<m∣Ai∣).

Verification

technique · direct
1.1L1L2L3L4L5L6L7L8L9L10L11L12givenalgebra

In Hp=Fp3, expanding both triple products gives the same third coordinate c+c′+c′′+ab′+ab′′+a′b′′; hence the operation is associative, with identity (0,0,0) and inverse (a,b,c)−1=(−a,−b,−c+ab).

2.1step 1.1givenalgebra

For d=(d1,d2,d3)∈D=(Fp×)3, the scaling factors on a,b,c are λ=d1d2−1, μ=d2d3−1, and λμ=d1d3−1. This identity preserves the cross term ab′, so the scaling is an automorphism, and coordinate multiplication makes D→Aut⁡(Hp) a homomorphism.

3.1step 2.1givenalgebra

The semidirect product Bp=Hp⋊D is therefore defined, and its canonical copy of Hp is normal.

4.1step 1.1step 3.1givenalgebra∎

Since ∣Hp∣=p3 and ∣Bp∣=p3(p−1)3, Hp has the full p-part of ∣Bp∣; normality makes it the unique Sylow p-subgroup. For p=2, D is trivial and Bp=Hp. This proves the stated claim.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-17Open item page →

Sylow p-subgroups of Aut⁡((Z/p)2): np=p+1

Example

For Ep=(Z/p)2, the Sylow p-subgroups of Aut⁡(Ep) have order p and number p+1. Distinct ones meet trivially, and their union contains exactly p2−1 nonidentity elements. See For prime p, ∣Aut⁡((Z/p)×(Z/p))∣=(p2−1)(p2−p).

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

For every prime p, ∣Aut⁡((Z/p)×(Z/p))∣=(p2−1)(p2−p).. (For prime p, ∣Aut⁡((Z/p)×(Z/p))∣=(p2−1)(p2−p)).

[L2]

Let G be a finite group, let p be prime, and write ∣G∣=pam with a∈N and p∤m. A subgroup P≤G is a Sylow p-subgroup when ∣P∣=pa. Equivalently, its order is the largest power of p dividing ∣G∣. This is a property of a subgroup and does not presume that such a subgroup exists; existence is proved in thm-sylow-first-theorem. (Sylow p-subgroups of a finite group).

[L3]

For a finite group G and a prime p, let Syl⁡p(G) be the set of Sylow p-subgroups (def-sylow-p-subgroup). Define np(G):=∣Syl⁡p(G)∣. This cardinal is defined even before existence is proved because Syl⁡p(G) is a subset of the finite power set of G; thm-sylow-first-theorem later shows it is nonzero. (The number np(G) of Sylow p-subgroups).

[L4]

If P is a Sylow p-subgroup of a finite group G, then np(G)=[G:NG(P)].. (Sylow III*: np(G)=[G:NG(P)]).

[L5]

For every prime p, the operations of addition and multiplication on Z/p make it a field (def-field). (For every prime p, the two operations on Z/p make it a field).

[L6]

Let G be a finite group and H≤G. Then ∣G∣=[G:H] ∣H∣. Consequently, under the canonical embedding ι:N→Z, ∣H∣ divides ∣G∣. (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

Verification

technique · direct
1.1L1L2L3L4L5L6givenalgebra

For Ep=(Z/p)2, the maps ut(x,y)=(x+ty,y) satisfy usut=us+t, so P={ut:t∈Z/p} has order p. Because ∣Aut⁡(Ep)∣=p(p−1)2(p+1), it is a Sylow p-subgroup.

2.1step 1.1givenalgebra

The common fixed subgroup of P is L={(x,0)}, since ut(x,y)=(x,y) for every t exactly when y=0. A normalizer preserves L; conversely, a coordinate automorphism preserving L conjugates each ut to another element of P.

3.1step 2.1givenalgebra

Such an automorphism has the form (x,y)↦(ax+by,dy) with a,d≠0, giving p(p−1)2 choices. The normalizer-index formula therefore gives np=p+1.

4.1step 1.1step 3.1givenalgebra∎

Two distinct order-p subgroups meet trivially, so their nonidentity elements are disjoint and number (p+1)(p−1)=p2−1. At p=2, the normalizer has order 2 in a group of order 6, giving three Sylow subgroups and three nonidentity elements. This proves the stated claim.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-17Open item page →

Sylow data for finite groups of order at most 15

Example

For finite groups of positive order at most 15, the Sylow subgroup orders and possible counts are as follows. An entry pa:np gives the Sylow order and the permitted values of its count.

∣G∣Sylow dataforced normal Sylow subgroups1nonenone22:1233:1344:1455:1562:1 or 3, 3:1377:1788:1899:19102:1 or 5, 5:151111:111124:1 or 3, 3:1 or 4none from the numerical restrictions alone1313:113142:1 or 7, 7:17153:1, 5:13,5

The order-15 entry also uses the order-pq classification; no classification at orders 8 or 12 is asserted. See Sylow I: every finite group has a Sylow p-subgroup.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

Let G be finite, let p be prime, and write ∣G∣=pam with p∤m. Then G has a subgroup of order pa, hence a Sylow p-subgroup (def-sylow-p-subgroup). (Sylow I: every finite group has a Sylow p-subgroup).

[L2]

Let ∣G∣=pam with p∤m. Then the number of Sylow p-subgroups satisfies np(G)≡1(modp),np(G)∣m.. (Sylow III: np≡1(modp) and np∣m when ∣G∣=pam with p∤m).

[L3]

A Sylow p-subgroup of a finite group is normal if and only if it is the unique Sylow p-subgroup. (A Sylow p-subgroup is normal if and only if it is unique).

[L4]

Let p<q be primes. - If p∤(q−1), every group of order pq is cyclic. - If p∣(q−1), there are exactly two isomorphism classes of groups of order pq: the cyclic group Cpq and one nonabelian semidirect product Cq⋊Cp. (Classification of groups of order pq for primes p<q).

[L5]

Every finite p-group is nilpotent. The trivial group is included and has nilpotency class zero. (Every finite p-group is nilpotent).

Verification

technique · direct
1.1L1L2L3L4L5givenalgebra

Factoring each order and applying np∣∣G∣/pa together with np≡1(modp) gives every entry through order 14, including the two independent possibilities displayed at order 12.

2.1step 1.1givenalgebra

At order 15, Sylow III forces n5=1, while the order-pq classification makes the group cyclic and hence also gives n3=1. The entries at orders 8 and 12 record only Sylow data, not isomorphism types.

3.1step 2.1givenalgebra∎

At order 1 no prime divides the group order, so there is no Sylow subgroup to list. This proves the stated claim.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-17Open item page →

The four isomorphism types of groups of order 30

Example

Up to isomorphism, the groups of order 30 are the four semidirect products C15⋊C2 in which the involution acts trivially, by inversion on both prime factors, by inversion on C3 only, or by inversion on C5 only. See Every group of order 30 has normal Sylow 3- and 5-subgroups and is not simple.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

Every group of order 30 has normal Sylow 3- and 5-subgroups and is not simple. (Every group of order 30 has normal Sylow 3- and 5-subgroups and is not simple).

[L2]

Let p<q be primes. - If p∤(q−1), every group of order pq is cyclic. - If p∣(q−1), there are exactly two isomorphism classes of groups of order pq: the cyclic group Cpq and one nonabelian semidirect product Cq⋊Cp. (Classification of groups of order pq for primes p<q).

[L3]

Let α,β:H→Aut⁡(N) be actions. If u∈Aut⁡(N) and v∈Aut⁡(H) satisfy βv(h)=uαhu−1(h∈H), then N⋊αH≅N⋊βH. (Actions changed by automorphisms of the kernel and complement give isomorphic semidirect products).

[L4]

Let N and H be groups (def-group), and let α:H→Aut⁡(N) be an action by automorphisms (def-action-by-automorphisms). The external semidirect product N⋊αH is the set N×H with multiplication. ( The external semidirect product N⋊αH).

Verification

technique · direct
1.1L1L2L3L4givenalgebra

The normal Sylow 3- and 5-subgroups commute and form a cyclic normal subgroup N≅C15. A Sylow 2-subgroup C2 meets N trivially and NC2=G, so G≅C15⋊C2.

2.1step 1.1givenalgebra

Under C15≅C3×C5, an involutory automorphism acts independently on the prime factors. Each factor admits either the trivial action or inversion, giving the four actions stated in the Example.

3.1step 2.1givenalgebra∎

The corresponding centers have orders 30, 1, 5, and 3, respectively, so the groups are pairwise nonisomorphic. Every group of order 30 arose in step 1.1, proving exhaustiveness. This proves the stated claim.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

A4 is not nilpotent

Example

The group A4 has a normal Klein four Sylow 2-subgroup and four nonnormal Sylow 3-subgroups. Consequently A4 is not nilpotent. See Sylow and maximal-subgroup characterizations of finite nilpotence.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

For a finite group G, the following are equivalent: G is nilpotent; every Sylow subgroup is normal; G is the internal direct product of its Sylow subgroups; and every maximal subgroup of G is normal. (Sylow and maximal-subgroup characterizations of finite nilpotence).

[L2]

For n∈N, the alternating group is the kernel of the sign homomorphism, An:=ker⁡(sgn⁡:Sn→{+1,−1})={σ∈Sn:sgn⁡(σ)=1}. Thus An consists exactly of the even permutations. The subgroup and normality assertions implicit in the word “group” follow from thm-image-subgroup-and-kernel-normal. (The alternating group An=ker⁡(sgn⁡) of even permutations).

[L3]

A Sylow p-subgroup of a finite group is normal if and only if it is the unique Sylow p-subgroup. (A Sylow p-subgroup is normal if and only if it is unique).

Verification

technique · direct
1.1L1L2L3givenalgebra

The eight 3-cycles in A4 occur in four inverse pairs, so they generate four distinct subgroups of order 3. These are all the Sylow 3-subgroups.

2.1step 1.1givenalgebra∎

Since there is more than one Sylow 3-subgroup, none is normal and the Sylow characterization rules out nilpotence. By contrast, the identity together with the three double transpositions is a conjugation-invariant Klein four group, hence the normal Sylow 2-subgroup. This proves the stated claim.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-17Open item page →

The Fitting and Frattini subgroups of S3

Example

For S3, one has O3(S3)=A3, O2(S3)=1, F(S3)=A3, and Φ(S3)=1. Hence F(S3/Φ(S3))=F(S3)/Φ(S3). See The Fitting subgroup F(G)=∏pOp(G) of a finite group.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

For a finite group G, the Fitting subgroup is F(G):=∏p∣∣G∣Op(G), the product of its p-cores (def-p-core-of-a-finite-group). The factors are normal, so their finite product is a normal subgroup and does not depend on the order of multiplication. For the trivial group the product is empty and equals 1. (The Fitting subgroup F(G)=∏pOp(G) of a finite group).

[L2]

For a finite group G, the Frattini subgroup is Φ(G):=⋂{M≤G:M is maximal proper}. If G=1, the family is empty and its intersection inside G is G itself. Thus Φ(1)=1. (The Frattini subgroup Φ(G) as the intersection of the maximal subgroups of a finite group).

[L3]

For every finite group G, F(G) is nilpotent and normal, and every normal nilpotent subgroup of G is contained in F(G). (The Fitting subgroup is nilpotent and is the largest normal nilpotent subgroup of a finite group).

[L4]

Let n∈N, so that n={0,1,…,n−1} (def-natural-numbers). The symmetric group on n letters is Sn:=Sym⁡(n)=Sym⁡({0,1,…,n−1}), the group of all bijections of n under composition (def-symmetric-group), with the composition convention. (The finite symmetric group Sn, one-line notation, and cycle notation).

Verification

technique · direct
1.1L1L2L3L4givenalgebra

The subgroup A3 is the unique Sylow 3-subgroup, so O3(S3)=A3. The three order-2 subgroups are conjugate, so no nontrivial 2-subgroup is normal and O2(S3)=1. Therefore F(S3)=A3.

2.1step 1.1givenalgebra∎

The maximal subgroups are A3 and the three order-2 subgroups, whose intersection is 1; hence Φ(S3)=1. The quotient identity reduces to F(S3)=F(S3) and is therefore satisfied. This proves the stated claim.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-17Open item page →

The p-cores, Fitting subgroup, and Frattini subgroup of S4

Example

For S4, one has O2(S4)=V4, Op(S4)=1 for every odd prime p, F(S4)=V4, and Φ(S4)=1. Hence F(S4/Φ(S4))=F(S4)/Φ(S4). See The p-core Op(G) as the largest normal p-subgroup.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

For a finite group G and a prime p, the p-core Op(G) is the subgroup generated by all normal p-subgroups of G. There are finitely many such subgroups, their product is normal, and repeated use of ∣AB∣=∣A∣∣B∣/∣A∩B∣ shows that the product is again a p-group. It contains every normal p-subgroup, so it is the unique largest normal p-subgroup. (The p-core Op(G) as the largest normal p-subgroup).

[L2]

For a finite group G, the Fitting subgroup is F(G):=∏p∣∣G∣Op(G), the product of its p-cores (def-p-core-of-a-finite-group). The factors are normal, so their finite product is a normal subgroup and does not depend on the order of multiplication. For the trivial group the product is empty and equals 1. (The Fitting subgroup F(G)=∏pOp(G) of a finite group).

[L3]

For a finite group G, the Frattini subgroup is Φ(G):=⋂{M≤G:M is maximal proper}. If G=1, the family is empty and its intersection inside G is G itself. Thus Φ(1)=1. (The Frattini subgroup Φ(G) as the intersection of the maximal subgroups of a finite group).

[L4]

For every finite group G, F(G/Φ(G))=F(G)/Φ(G).. (F(G/Φ(G))=F(G)/Φ(G) for every finite group).

[L5]

Let n∈N, so that n={0,1,…,n−1} (def-natural-numbers). The symmetric group on n letters is Sn:=Sym⁡(n)=Sym⁡({0,1,…,n−1}), the group of all bijections of n under composition (def-symmetric-group), with the composition convention. (The finite symmetric group Sn, one-line notation, and cycle notation).

Verification

technique · direct
1.1L1L2L3L4L5givenalgebra

The identity and the three double transpositions form a normal Klein four group V4. Since the three Sylow 2-subgroups are not normal, no normal 2-subgroup can properly contain V4, so O2(S4)=V4. The four Sylow 3-subgroups are nonnormal, and no other odd prime divides 24, so every odd p-core is trivial and F(S4)=V4.

2.1step 1.1givenalgebra∎

The four point stabilizers are maximal subgroups isomorphic to S3, and their intersection fixes every point and is therefore 1. Thus the intersection of all maximal subgroups is Φ(S4)=1. Again the quotient formula reduces to the identity F(S4)=F(S4). This proves the stated claim.

Sources