Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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.

Frobenius normal two complement for S_3

Example

Let G=S3 be the symmetric group on 0,1,2 and let p=2 (The finite symmetric group Sn, one-line notation, and cycle notation). Then:

  1. A3={id⁡,(0 1 2),(0 2 1)} is a normal 2-complement of S3, so that S3 is 2-nilpotent (Normal p complement and p nilpotent group, The alternating group An=ker⁡(sgn⁡) of even permutations);
  2. for a Sylow 2-subgroup P of S3 the only nontrivial 2-local normalizer NG(Q) with 1≠Q≤P is NS3(P)=P itself, so there is one such normalizer for fixed P. As P varies, these are the three subgroups of order 2, forming one conjugacy class (P local normalizer for normal complement theory); each is a finite 2-group, hence 2-nilpotent with trivial normal 2-complement;
  3. a Sylow 2-subgroup of S3 controls its own element fusion (Control of fusion in a sylow p subgroup).

Consequently all three conditions of the Frobenius normal p-complement theorem hold for (S3,2), in accordance with Frobenius normal p complement theorem.

Facts & Assumptions

Given: The symmetric group S3=Sym⁡({0,1,2}) and the prime p=2.

[F1]

Elements, conjugacy classes and order-2 subgroups of S3: one-line notation identifies the permutations of {0,1,2} with the lists [b0,b1,b2] whose entries are 0,1,2 each occurring once, so ∣S3∣=3⋅2⋅1=6 and S3={id⁡,(0 1),(0 2),(1 2),(0 1 2),(0 2 1)}; conjugation relabels the entries of a cycle, g(a b)g−1=(g(a) g(b)) and g(a b c)g−1=(g(a) g(b) g(c)), so the conjugacy classes are {id⁡}, {(0 1),(0 2),(1 2)} and {(0 1 2),(0 2 1)}; and the conjugates ⟨(0 1)⟩g=⟨(g(0) g(1))⟩ of ⟨(0 1)⟩ are exactly the three subgroups {id⁡,(0 1)},{id⁡,(0 2)},{id⁡,(1 2)} of order 2 (The finite symmetric group Sn, one-line notation, and cycle notation, Conjugating a cycle relabels each entry: g(a1 … ak)g−1=(g(a1) … g(ak)), S3 as a Frobenius group).

[F3]

Sylow and subgroup order facts: ∣S3∣=6=2⋅3, so the exact power of 2 dividing ∣S3∣ is 2, and every subgroup of order 2 is a Sylow 2-subgroup; a subgroup of S3 has order dividing 6, so every 2-subgroup of S3 has order 1 or 2; a group of order 2 is a finite 2-group (Sylow p-subgroups of a finite group, Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G, A finite p-group has order pn for a prime p and some n∈N, Every subgroup of a finite p-group has order a power of p).

[F4]

Normal p-complement: a normal subgroup K⊴G with p∤∣K∣ and [G:K] a power of p is a normal p-complement of G; the trivial subgroup has order 1, which is prime to every p, and if G is a finite p-group then K={1} is a normal p-complement because [G:{1}]=∣G∣ is a power of p (Normal p complement and p nilpotent group, Sylow p-subgroups of a finite group, A finite p-group has order pn for a prime p and some n∈N, Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

[F5]

Local normalizers and fusion: for 1≠Q≤P with P∈Syl⁡p(G) the normalizer NG(Q) is the local subgroup of the theory; and P controls fusion in P with respect to G when every G-conjugacy between two elements of P is realized by an element of P (P local normalizer for normal complement theory, Control of fusion in a sylow p subgroup, The conjugacy class Cl⁡G(x) and centralizer CG(x) of an element, Conjugation x↦gxg−1 is an automorphism).

[F6]

Frobenius normal p-complement theorem: for a finite group G, a prime p and P∈Syl⁡p(G), the conditions (a) G has a normal p-complement, (b) every NG(Q) with 1≠Q≤P has a normal p-complement, and (c) P controls fusion in P, are equivalent (Frobenius normal p complement theorem).

Verification

technique · direct
1.1

P:={id⁡,(0 1)} is a subgroup of S3 of order 2 by [F1], hence is a Sylow 2-subgroup of S3 by [F3].

F1F3
1.2

A3 is normal in S3 of order 3 by [F2], so 2∤∣A3∣ and [S3:A3]=6/3=2=21 is a power of 2 by [F1] and [F3]; hence A3 is a normal 2-complement of S3 by [F4]. This is assertion 1.

F1F2F3F4
2.1

Let Q≠{1} be a 2-subgroup of P. By [F3] the order of Q divides ∣P∣=2, so Q=P; hence the only nontrivial 2-local normalizer with respect to P is NS3(P). By [F1] the conjugates of P=⟨(0 1)⟩ are the three distinct subgroups of order 2 of S3, and Pg=P means {g(0),g(1)}={0,1}, which holds exactly for g∈P, that is NS3(P)=P: for this fixed P, condition (b) contains only NS3(P)=P. Varying P yields three conjugate subgroups, each equal to its own normalizer.

F1F3F5step 1.1
2.2

We show that P controls fusion in P with respect to S3. Let x,y∈P and g∈S3 with y=xg. If x=id⁡ then y=id⁡=xid⁡ with id⁡∈P. If x≠id⁡ then x=(0 1) by [F1], and y=xg is a transposition, hence lies in the conjugacy class {(0 1),(0 2),(1 2)} of x by [F1]; as y∈P={id⁡,(0 1)} we get y=(0 1)=x=xid⁡. In both cases y is conjugate to x by an element of P. This is assertion 3.

F1F5step 1.1
3.1

Each of these local normalizers is a group of order 2, hence a finite 2-group by [F3]; therefore its trivial subgroup is a normal 2-complement by [F4].

F3F4step 2.1
4.1

By step 1.2 condition (a) holds, by steps 2.1 and 3.1 condition (b) holds, and by step 2.2 condition (c) holds; in accordance with [F6] the three equivalent conditions of the Frobenius normal p-complement theorem are satisfied for (S3,2). ∎

F6step 1.2step 3.1step 2.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

73 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources