Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck 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 n≥5, the only proper nontrivial normal subgroup of Sn is An

Statement

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

Facts & Assumptions

Given: n≥5 and N⊴Sn.

[F1]

An⊴Sn and 2∣An∣=n! for n≥2 (An is normal in Sn; for n≥2, 2 ∣An∣=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 n≥5 (An is simple for every n≥5).

[F4]

Z(Sn)={1} for n≥3 (Z(Sn) is trivial for n≥3).

[F5]

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

Proof

technique · cases
1.1

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

F2F5algebra
1.2

Suppose N∩An=An.

assume-case full
1.3

Suppose N∩An={1}.

assume-case trivial
2.1

In the case of step 1.2, An⊆N. 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 ∣N∣≤2.

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 t∈Z(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

Dependency tree · two levels

36 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