Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
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 prime p, a transitive subgroup of Sp containing a transposition is all of Sp

Statement

Let p be prime and let GSp act transitively on {0,1,,p1}. If G contains a transposition, then G=Sp.

Facts & Assumptions

Given: A prime p, a transitive subgroup GSp, and a transposition τG.

[F1]

A transitive action is one with a single orbit (Left group actions, transitive actions, and faithful actions).

[L1]
[L2]

If a prime divides the order of a finite group, the group contains an element of that prime order (Cauchy's theorem: if a prime p divides G, then G has an element of order p).

[L3]

The order of a permutation is the least common multiple of its nontrivial cycle lengths (The order of a permutation is the least positive common multiple of its nontrivial cycle lengths, with value 1 for the identity).

[L4]

The adjacent transpositions generate the full symmetric group on p letters (The adjacent transpositions (12),(23),,(n1n) generate Sn).

Proof

technique · direct
1.1

Because the action of G on {0,1,,p1} is transitive, the orbit of any point has size p. Hence [L1] gives pG. By [L2], the group G contains an element c of order p.

F1L1L2
1.2

By [L3], a permutation of order p in Sp must be a p-cycle: every nontrivial cycle length divides p, so each is 1 or p, and there must be one nontrivial cycle. Conjugating inside Sp, we may relabel so that c=(01p1).

L3L5algebra
2.1

Write the given transposition as τ=(ij) with ij, and put dji(modp), choosing d{1,,p1}. For each k, ckτck=(i+kj+k), so G contains every transposition of the form (xx+d), with indices read modulo p. Because p is prime, d is invertible modulo p, so the sequence 0, d, 2d, , (p1)d lists all p symbols exactly once modulo p. Therefore the p1 transpositions joining consecutive terms in that order all lie in G.

step 1.2L5algebra
3.1

Let π be the relabelling permutation carrying k to kd modulo p. By step 2.1 and [L5], the conjugates π(kk+1)π1 for 0kp2 are exactly the p1 transpositions joining consecutive terms in the ordering of step 2.1, so they lie in G. Since [L4] says the standard adjacent transpositions generate Sp, their conjugates also generate Sp. Hence G contains a generating set of Sp, so G=Sp.

L4L5step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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