Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 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 105 has normal Sylow 5- and 7-subgroups and is not simple

Statement

Every group of order 105 has normal Sylow 5- and 7-subgroups and is not simple. See Sylow III: np≡1(modp) and np∣m when ∣G∣=pam with p∤m.

Facts & Assumptions

Given: The hypotheses and objects in the Statement.

[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]

If H≤G and N⊴G, then HN is a subgroup and H∩N⊴H. Here HN:={hn:h∈H, n∈N}. (If H≤G and N⊴G, then HN is a subgroup and H∩N⊴H).

[L4]

Let H≤G. Left multiplication defines a transitive action on G/H, and the corresponding homomorphism ρ:G→Sym⁡(G/H) has ker⁡ρ=Core⁡G(H). (Left multiplication on G/H is transitive, has stabiliser H at H, and has kernel Core⁡G(H)).

[L5]

The image of a group homomorphism is a subgroup and its kernel is a normal subgroup. For every group homomorphism f:G→H, one has im⁡f≤H and ker⁡f⊴G. (The image of a group homomorphism is a subgroup and its kernel is a normal subgroup).

[L6]

First isomorphism theorem for groups: G/ker⁡f≅im⁡f. For every homomorphism f:G→H, the rule gker⁡f↦f(g) is an isomorphism from G/ker⁡f onto im⁡f. (First isomorphism theorem for groups: G/ker⁡f≅im⁡f).

[L7]

Let N⊴G. 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∣=∣G∣∣N∣.. (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∤(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).

[L9]

If N⊴G and P is a normal Sylow p-subgroup of N, then P⊴G. (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).

[L11]

If H≤G and G is finite, then ∣G∣=[G:H]∣H∣; in particular ∣H∣ divides ∣G∣. (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

[L12]

A set of cardinality n has exactly n! bijections to itself; in particular the symmetric group on three points has order 3!=6. (A finite set A with ∣A∣=n has exactly n! bijections onto itself, and n! bijections onto any set of the same cardinality).

[L13]

For H≤G, the core K=Core⁡G(H) is a normal subgroup of G, satisfies K≤H, and contains every normal subgroup of G that is contained in H. (Core⁡G(H) is the largest normal subgroup of G contained in H).

Proof

technique · direct
1.1L1L2L3L4L5L6L7L8L9L10givenalgebra

The nonunique counts n5=21 and n7=15 would already contribute 84+90 distinct nonidentity elements, so at least one of the two Sylow subgroups is normal.

2.1L3step 1.1givenalgebra

Let P be the normal Sylow subgroup supplied by step 1.1 and let Q be a Sylow subgroup for the other prime. By [L3], H=PQ is a subgroup. Its multiplication map P×Q→PQ has fibres indexed by P∩Q=1, so ∣H∣=∣P∣∣Q∣=35.

3.1L4L5L6L7L11L12L13step 2.1givenalgebra

The action on the three left cosets has kernel K=Core⁡G(H), and K≤H by [L13]. By [L6], G/K is isomorphic to a subgroup of the symmetric group on three points, so [L11] and [L12] give [G:K]∣6. Also [L7] and [L11] give [G:K]∣105, while K≤H gives 3=[G:H]∣[G:K]. Hence [G:K]=3=[G:H], so K=H and H⊴G.

4.1L8L9L10step 3.1given∎

The order-pq classification [L8] makes H cyclic, and its Sylow 5- and 7-subgroups are normal in H and therefore normal in G by [L9]. Either is a nontrivial proper normal subgroup of G, so [L10] also shows that G is not simple.

Depends on

Used by

Dependency tree · two levels

59 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