Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

The Sylow subgroups of S4

Example

The group S4 has three Sylow 2-subgroups, each of order 8, and four Sylow 3-subgroups, each generated by a pair of inverse 3-cycles. See The number np(G) of Sylow p-subgroups.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

For a finite group G and a prime p, let Syl⁡p(G) be the set of Sylow p-subgroups (def-sylow-p-subgroup). Define np(G):=∣Syl⁡p(G)∣. This cardinal is defined even before existence is proved because Syl⁡p(G) is a subset of the finite power set of G; thm-sylow-first-theorem later shows it is nonzero. (The number np(G) of Sylow p-subgroups).

[L2]

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).

[L3]

Let n∈N, so that n={0,1,…,n−1} (def-natural-numbers). The symmetric group on n letters is Sn:=Sym⁡(n)=Sym⁡({0,1,…,n−1}), the group of all bijections of n under composition (def-symmetric-group), with the composition convention. (The finite symmetric group Sn, one-line notation, and cycle notation).

[L4]

For σ,τ∈Sn, there is a g∈Sn with τ=gσg−1 if and only if σ and τ have the same cycle type, including their numbers of fixed points. (Two elements of Sn are conjugate if and only if they have the same cycle type).

Verification

technique · direct
1.1L1L2L3L4givenalgebra

Relabel the underlying set as {1,2,3,4}. Each of its three partitions into two unordered pairs has a stabilizer of order 22⋅2=8: one may swap within either pair and may swap the two pairs. These three distinct stabilizers are therefore Sylow 2-subgroups.

2.1step 1.1givenalgebra∎

A subgroup of order 3 is generated by a 3-cycle. Choosing its unique fixed point gives four subgroups, because the two cycles on the remaining three letters are inverse generators of the same subgroup. Thus n2=3 and n3=4, consistent with n2∣3, n2≡1(mod2), n3∣8, and n3≡1(mod3). This proves the stated claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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