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 A5

Example

The group A5 has five Sylow 2-subgroups, ten Sylow 3-subgroups, and six Sylow 5-subgroups. 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]

For n∈N, the alternating group is the kernel of the sign homomorphism, An:=ker⁡(sgn⁡:Sn→{+1,−1})={σ∈Sn:sgn⁡(σ)=1}. Thus An consists exactly of the even permutations. The subgroup and normality assertions implicit in the word “group” follow from thm-image-subgroup-and-kernel-normal. (The alternating group An=ker⁡(sgn⁡) of even permutations).

[L4]

The conjugacy classes of Sn are in bijection with the tuples of nonnegative integers (c1,…,cn) satisfying ∑k=1nkck=n. For n=0, the unique empty tuple indexes the identity class of S0. (The conjugacy classes of Sn are indexed by the tuples (c1,…,cn) with ∑kck=n).

Verification

technique · direct
1.1L1L2L3L4givenalgebra

There are (53)⋅2=20 three-cycles, and each order-3 subgroup has two nonidentity elements, giving n3=10. There are 4!=24 five-cycles, and each order-5 subgroup has four nonidentity elements, giving n5=6.

2.1step 1.1givenalgebra∎

Each of the five choices of a fixed letter gives the Klein four group of the three double transpositions on the remaining letters. The resulting five groups partition the fifteen double transpositions, so n2=5. The values satisfy 5∣15, 10∣20, 6∣12 and the respective congruences modulo 2, 3, and 5. 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