Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-13
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.

For n5, the only proper nontrivial normal subgroup of Sn is An

Statement

For n5, the normal subgroups of Sn are {1}, An, and Sn. Thus An is the only proper nontrivial one.

Facts & Assumptions

Given: n5 and NSn.

[F1]

AnSn and 2An=n! for n2 (An is normal in Sn; for n2, 2An=n!, while An=Sn for n=0,1); with Sn=n! and Sn=[Sn:An]An (Lagrange's theorem: G=[G:H]H for every subgroup H of a finite group G) this gives [Sn:An]=2, so Sn is the union of An and one other coset.

[F2]

An is simple for n5 (An is simple for every n5).

[F4]

Z(Sn)={1} for n3 (Z(Sn) is trivial for n3).

[F5]

A subgroup is normal exactly when it is invariant under conjugation (Normal subgroup: invariance under conjugation).

Proof

technique · cases
1.1

The intersection NAn is normal in An by [F5], so [F2] makes it either {1} or An.

F2F5algebra
1.2

Suppose NAn=An.

assume-case full
1.3

Suppose NAn={1}.

assume-case trivial
2.1

In the case of step 1.2, AnN. Since [F1] gives only two cosets, N=An or N=Sn.

F1step 1.2algebra
2.2

In the case of step 1.3, the restriction of sign to N is injective by [F3], so N2.

F3step 1.3algebra
3.1

If the subgroup in step 2.2 were nontrivial, it would have a unique nonidentity element t. Normality [F5] would make every conjugate of t the same unique element, so tZ(Sn), contradicting [F4]. Thus this case gives N={1}.

F4F5step 2.2
4.1

The alternatives in step 1.1 are exhaustive, and steps 2.1 and 3.1 give exactly N{{1},An,Sn}.

step 1.1step 2.1step 3.1cases-exhaustive

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 99 results over 20 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources