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

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

Statement

Every group of order 30 has normal Sylow 3- and 5-subgroups and is not simple. See Cauchy's theorem: if a prime p divides G, then G has an element of order p.

Facts & Assumptions

Given: The hypotheses and objects in the Statement.

[L1]

Let G be a finite group and let p be prime. If pG, then G contains an element of order p. (Cauchy's theorem: if a prime p divides G, then G has an element of order p).

[L2]

For HG, left multiplication gives a transitive action on G/H and a homomorphism ρ:GSym(G/H) with kerρ=CoreG(H). (Left multiplication on G/H is transitive, has stabiliser H at H, and has kernel CoreG(H)).

[L3]

For every natural n, the function sgn:Sn{+1,1} is a group homomorphism. It is surjective exactly when n2; for n=0 and n=1 its image is {1}. (The sign is a homomorphism Sn{+1,1}, surjective exactly when n2).

[L4]

A cycle of length k has sign (1)k1. If σSn and c(σ) is the number of cycles after every fixed point is included as a one-cycle, then sgn(σ)=(1)nc(σ).. (A k-cycle has sign (1)k1, and sgn(σ)=(1)nc(σ) when fixed points are counted as cycles).

[L5]

The image of a group homomorphism is a subgroup and its kernel is a normal subgroup. For every group homomorphism f:GH, one has imfH and kerfG. (The image of a group homomorphism is a subgroup and its kernel is a normal subgroup).

[L6]

First isomorphism theorem for groups: G/kerfimf. For every homomorphism f:GH, the rule gkerff(g) is an isomorphism from G/kerf onto imf. (First isomorphism theorem for groups: G/kerfimf).

[L7]

Let NG. If [G:N] is finite, then the quotient group G/N is finite and G/N=[G:N]. In particular, if G is finite, then G/N=GN.. (If [G:N] is finite then G/N=[G:N]; for finite G this equals G/N).

[L8]

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

[L9]

If NG and P is a normal Sylow p-subgroup of N, then PG. (A normal Sylow subgroup of a normal subgroup is normal in the whole group).

[L10]

A group G is simple if G{1} and its only normal subgroups are {1} and G, where normality is as in def-normal-subgroup. (Simple groups).

Proof

technique · direct
1.1

Choose an involution by Cauchy's theorem and use the left regular permutation representation.

L1L2L3L4L5L6L7L8L9L10givenalgebra
2.1

Left multiplication by the involution is a product of fifteen transpositions, so composing with sign gives a surjection to ±1 whose normal kernel has order 15.

step 1.1givenalgebra
3.1

The published order-pq classification makes that kernel cyclic.

step 2.1givenalgebra
4.1

Its Sylow 3- and 5-subgroups are normal in the kernel and hence normal in G.

step 3.1givenalgebra
5.1

Either is a nontrivial proper normal subgroup. This proves the stated claim.

step 4.1givenalgebra

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 154 results over 23 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