Alphabeta Math
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.

✓ 17 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 17 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Group Actions: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-03Open item page →

The trivial action of Z/2 on a singleton is transitive but not faithful

Example

Let Z/2 act on the singleton X={∗} by a⋅∗=∗ for both residue classes a. This action is transitive, but it is not faithful.

Facts & Assumptions

Given: The additive group Z/2 and the singleton set X={∗}.

[L2]

An action satisfies 0⋅x=x and (a+b)⋅x=a⋅(b⋅x); it is transitive when one group element carries every point to every other point, and faithful only when an element fixing every point is the identity (Left group actions, transitive actions, and faithful actions).

Verification

technique · direct
1.1

Dividing any integer by 2 shows that the two residue classes are 0 and 1; they are distinct because 1−0 is not a multiple of 2, and 1+1=0.

L1algebra
1.2

The rule a⋅∗=∗ satisfies 0⋅∗=∗ and (a+b)⋅∗=∗=a⋅(b⋅∗), so it is an action.

L1L2given
1.3

There is only one point of X, so the action is transitive.

L2given
2.1

The nonidentity class 1 fixes ∗, and therefore fixes every point of X. Hence the action is not faithful.

step 1.1L2given∎
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-11Open item page →

Left multiplication gives a free and transitive action of every group on itself

Example

Every group G acts on its underlying set by left multiplication, g⋅x=gx. This left regular action is free and transitive, and every stabilizer is the trivial subgroup.

Facts & Assumptions

Given: A group G acting on its underlying set by g⋅x=gx.

[L1]

A left action satisfies e⋅x=x and (gh)⋅x=g⋅(h⋅x) and is transitive when some group element carries any point to any other (Left group actions, transitive actions, and faithful actions).

[L2]

An action is free when g⋅x=x implies g=e (A free group action has no nonidentity element fixing a point).

[L3]

The stabilizer is Gx={g:g⋅x=x} (The orbit G⋅x and stabilizer Gx of a point in a group action).

Verification

technique · direct
1.1

The identities e⋅x=ex=x and (gh)⋅x=(gh)x=g(hx)=g⋅(h⋅x) verify the action laws.

L1algebra
2.1

Given x,y∈G, the element g=yx−1 satisfies g⋅x=y, so the action is transitive.

step 1.1L1choosealgebra
3.1

If g⋅x=x, then gx=x and right cancellation gives g=e; by [L2] the action is free, and [L3] gives Gx={e} for every x.

step 1.1L2L3algebra∎
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

The natural action of S3 on three points is faithful and transitive but not free

Statement refuted

False claim. Every faithful transitive group action is free.

Facts & Assumptions

Given: The symmetric group S3=Sym⁡({1,2,3}) acting on X={1,2,3} by evaluation.

[L1]

An action is transitive when every point can be carried to every other and faithful when only the identity fixes every point (Left group actions, transitive actions, and faithful actions).

[L2]

An action is free when no nonidentity element fixes any point (A free group action has no nonidentity element fixing a point).

[L3]

Stabilizers record the elements fixing a chosen point (The orbit G⋅x and stabilizer Gx of a point in a group action).

[L4]

The symmetric group consists of all bijections of the set (The symmetric group Sym⁡(X): the bijections of a set X under composition).

Counterexample

technique · direct
1.1

Evaluation satisfies e(i)=i and (στ)(i)=σ(τ(i)), so [L4] and [L5] give an action of S3 on X.

L4L5
2.1

For any i,j∈X, a permutation carries i to j, so the action is transitive. If a permutation fixes all three points, it is the identity function, so the action is faithful.

step 1.1L1L4
3.1

The nonidentity transposition (2 3) fixes 1, so G1 is nontrivial and the action is not free by [L2] and [L3]. Thus the false claim fails.

step 2.1L2L3∎
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

The action of Z/2 on two disjoint two-point orbits is free but not transitive

Statement refuted

False claim. Every free group action is transitive.

Facts & Assumptions

Given: The additive group A=Z/2 and the set X=A×{0,1}, with a⋅(b,i)=(a+b,i).

[L1]

A left action satisfies the identity and composition laws and is transitive when one orbit is the whole set (Left group actions, transitive actions, and faithful actions).

[L2]

An action is free when a⋅x=x implies that a is the identity (A free group action has no nonidentity element fixing a point).

[L3]

The orbit of x is the set of all a⋅x (The orbit G⋅x and stabilizer Gx of a point in a group action).

Counterexample

technique · direct
1.1

The identity class satisfies 0⋅(b,i)=(b,i), and (a+c)⋅(b,i)=(a+c+b,i)=a⋅(c⋅(b,i)), so [L1] and [L4] give an action.

L1L4
2.1

If a⋅(b,i)=(b,i), then a+b=b in Z/2 and cancellation gives a=0; hence the action is free by [L2].

step 1.1L2L4L5
3.1

The second coordinate is unchanged by the action, so the two sets A×{0} and A×{1} are distinct orbits by [L3]. The action is not transitive, refuting the claim.

step 1.1L1L3∎
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

The four rotations of a square act freely, transitively and faithfully on its vertices

Example

Label the vertices of a square by Z/4 in cyclic order. The rotation group Z/4 acts by a⋅x=a+x. This action is free, transitive, and faithful.

Facts & Assumptions

Given: The additive group A=Z/4 acting on X=A by translation.

[L1]

A left action is transitive and faithful as defined in Left group actions, transitive actions, and faithful actions.

[L2]

An action is free when only the identity can fix a point (A free group action has no nonidentity element fixing a point).

Verification

technique · direct
1.1

One has 0⋅x=x and (a+b)⋅x=(a+b)+x=a+(b+x)=a⋅(b⋅x), so [L1] and [L3] give an action.

L1L3
2.1

Given vertices x,y, the unique class a=y−x satisfies a⋅x=y, proving transitivity. If a⋅x=x, cancellation gives a=0, so the action is free.

step 1.1L1L2L3L4
3.1

An element fixing every vertex fixes 0, so it is 0 by step 2.1; hence the action is faithful.

step 2.1L1∎
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

The action of Z/6 on the cosets of {0,3} is transitive with kernel {0,3} and is not faithful

Example

In the additive group G=Z/6, let H={0,3}. The action of G on G/H by translation is transitive and has kernel H, so it is not faithful.

Facts & Assumptions

Given: The additive group G=Z/6 and the subset H={0,3}.

[L1]

The left-coset action is transitive and its kernel is the core of the subgroup (Left multiplication on G/H is transitive, has stabiliser H at H, and has kernel Core⁡G(H)).

[L4]

A subgroup contains the identity and is closed under the operation and inverses (Subgroup).

Verification

technique · direct
1.1

The set H contains 0, is closed under addition since 3+3=0, and contains additive inverses; hence H≤G by [L2], [L3], and [L4]. Its cosets are H={0,3}, 1+H={1,4}, and 2+H={2,5}.

L2L3L4
2.1

Since G is abelian, every conjugate of H is H, so Core⁡G(H)=H.

step 1.1L2algebra
3.1

By [L1], the coset action is transitive and has kernel H. Since 3≠0 lies in the kernel, the action is not faithful.

step 1.1step 2.1L1L3∎
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-11Open item page →

The class equation of S3 is 6=1+2+3

Example

For S3=Sym⁡({1,2,3}), the conjugacy classes are

{e},{(1 2 3),(1 3 2)},{(1 2),(1 3),(2 3)}.

Thus the class equation is 6=1+2+3.

Facts & Assumptions

Given: The symmetric group S3 on {1,2,3}.

[L1]

The class equation splits a finite group into its central singleton classes and its non-singleton conjugacy classes (The class equation ∣G∣=∣Z(G)∣+∑i[G:CG(xi)] for a finite group).

[L3]

The symmetric group consists of all permutations of the underlying set (The symmetric group Sym⁡(X): the bijections of a set X under composition).

Verification

technique · direct
1.1

The identity, the three transpositions, and the two 3-cycles are six distinct permutations; by [L3] and [L5], they exhaust S3.

L3L4L5
2.1

Conjugation relabels cycle entries: every transposition is conjugate to every other, and the two 3-cycles are conjugate. Cycle type is preserved by conjugation, so the three displayed sets are exactly the conjugacy classes.

step 1.1L2algebra
3.1

Their cardinalities are 1, 2, and 3, so [L1] gives 6=1+2+3.

step 1.1step 2.1L1L2algebra∎
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

S3 has trivial center, so the finite p-group hypothesis in the nontrivial-center theorem is necessary

Statement refuted

False claim. Every nontrivial finite group has nontrivial center.

Facts & Assumptions

Given: The symmetric group S3.

[L2]

The conjugacy classes of S3 have sizes 1, 2, and 3, with only the identity class a singleton (The class equation of S3 is 6=1+2+3).

[L3]

A central element commutes with every group element (The center Z(G) of a group).

Counterexample

technique · direct
1.1

An element is central exactly when its conjugacy class is a singleton. By [L2], the only such element of S3 is e, so Z(S3)={e}.

L2L3
2.1

The group S3 is nontrivial and finite but has trivial center. Thus the false claim fails, and [L1] shows precisely why the p-group hypothesis cannot be omitted.

step 1.1L1L2∎
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-11Open item page →

The square-symmetry group has class equation 8=2+2+2+2

Example

Let D≤S4 be generated by the square rotation r=(1 2 3 4) and the reflection s=(1 3). Its conjugacy classes are

{e},{r2},{r,r3},{s,r2s},{rs,r3s}.

Thus Z(D)={e,r2} and the class equation is 8=2+2+2+2.

Facts & Assumptions

Verification

technique · direct
1.1

Pointwise calculation gives r4=e, s2=e, and sr=r−1s.

L3L5L6algebra
2.1

The relations reduce every word in r,s to one of e,r,r2,r3,s,rs,r2s,r3s and show this set is closed under products and inverses. These eight permutations are distinct, so [L3] and [L4] make them a subgroup D of order 8; also sr≠rs, so D is nonabelian.

step 1.1L3L4L5L6algebra
3.1

Using sr=r−1s, conjugation by r and s gives the five displayed conjugacy classes: e and r2 are central, r is conjugate to r3, and the reflections split into the two displayed pairs.

step 1.1step 2.1L2algebra
4.1

Their sizes give 8=1+1+2+2+2=2+2+2+2, and [L1] identifies the two singleton classes with the center {e,r2}.

step 3.1L1L2algebra∎
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

The square-symmetry group has order 23 and is nonabelian, so the order-p2 theorem does not extend to order p3

Statement refuted

False claim. Every group of order p3, for prime p, is abelian.

Facts & Assumptions

Given: The square-symmetry group D constructed in the preceding example.

[L1]

Every group of order p2 is abelian (Every group of order p2, for prime p, is abelian).

[L2]

The square-symmetry group has eight displayed elements and contains r,s with sr≠rs (The square-symmetry group has class equation 8=2+2+2+2).

Counterexample

technique · direct
1.1

By [L2], D is nonabelian and has order 8=23.

L2algebra
2.1

Since 2 is prime, D refutes the false claim and shows that the exponent 2 in [L1] cannot be replaced by 3.

step 1.1L1∎
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-11Open item page →

The three subgroups of order 2 in S3 are conjugate and each is self-normalizing

Example

The subgroups

⟨(1 2)⟩,⟨(1 3)⟩,⟨(2 3)⟩

are the three subgroups of order 2 in S3. They form one conjugacy orbit, and each equals its own normalizer.

Facts & Assumptions

Given: The symmetric group S3 and H=⟨(1 2)⟩.

[L1]
[L2]

The normalizer consists of the elements preserving H under conjugation (The normalizer NG(H)={g∈G:gHg−1=H} of a subgroup).

[L3]
[L5]

The identity, the three transpositions, and the two 3-cycles exhaust the six elements of S3 (The class equation of S3 is 6=1+2+3).

Verification

technique · direct
1.1

Each transposition generates a two-element subgroup, and these are distinct. Every element of order 2 in S3 is a transposition, so these are all the subgroups of order 2.

L3L4algebra
2.1

Conjugation relabels the two moved points, so the three subgroups in step 1.1 are conjugate.

step 1.1L2L3
3.1

By [L1], [S3:NS3(H)]=3. Since ∣S3∣=6 by [L5], the normalizer has order 2; it contains H, so it equals H. The same holds for each conjugate subgroup.

step 1.1step 2.1L1L2L5algebra∎
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

An involution on five points has three fixed points and one two-point orbit, verifying 5≡3(mod2)

Example

Let Z/2 act on X={1,2,3,4,5} so that its nonidentity element interchanges 1 and 2 and fixes 3,4,5. Then ∣XZ/2∣=3 and 5≡3(mod2).

Facts & Assumptions

Given: The additive group P=Z/2 and the displayed permutation of X.

[L1]

A finite p-group action satisfies ∣X∣≡∣XP∣(modp) (If a finite p-group P acts on a finite set X, then ∣X∣≡∣XP∣(modp)).

Verification

technique · direct
1.1

Map 0 to the identity permutation and 1 to (1 2). Since (1 2)2=e, [L2] and [L3] give an action of P on X.

L2L3
2.1

Its orbit partition is {1,2},{3},{4},{5}, and the global fixed set is {3,4,5}.

step 1.1L1
3.1

Hence ∣X∣=5, ∣XP∣=3, and 5−3=2 is divisible by 2, verifying [L1] by [L4].

step 2.1L1L4algebra∎
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

S3 acting on three points has ∣X∣=3 and ∣XS3∣=0, so the fixed-point congruence modulo 2 fails without the p-group hypothesis

Statement refuted

False claim. For every finite group G acting on a finite set X, one has ∣X∣≡∣XG∣(mod2).

Facts & Assumptions

Given: The natural action of S3 on X={1,2,3}.

[L2]

The global fixed set consists of the points fixed by every group element (The fixed-point sets Xg and XG of a group action).

[L3]

The natural S3-action on three points is faithful and transitive (The natural action of S3 on three points is faithful and transitive but not free).

[L4]

The group S3 has order 6 (The class equation of S3 is 6=1+2+3).

Counterexample

technique · direct
1.1

For each i∈X, some transposition moves i, so no point is fixed by every element of S3 and XS3=∅. Thus ∣X∣=3 and ∣XS3∣=0.

L2L3
2.1

The difference 3−0=3 is not divisible by 2, so [L5] shows that the congruence fails. By [L4], ∣S3∣=6 is not a power of 2, so this does not contradict [L1] and isolates its p-group hypothesis.

step 1.1L1L4L5algebra∎
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-11Open item page →

The subgroup ⟨(1 2 3),(1 2)(3 4)⟩≤S4 has order 12 but no subgroup of order 6, so Cauchy's theorem does not extend to composite divisors

Statement refuted

False claim. If a positive integer d divides the order of a finite group G, then G has a subgroup of order d.

Facts & Assumptions

Given: In S4, let a=(1 2 3), b=(1 2)(3 4), and A=⟨a,b⟩.

[L1]

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

[L2]

A subgroup of index 2 is normal (Every subgroup of index two is normal).

[L4]

The generated subgroup is the smallest subgroup containing the generators (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups, Subgroup).

[L6]

Conjugation by a group element is an automorphism (Conjugation x↦gxg−1 is an automorphism).

Counterexample

technique · contradiction
1.1

Direct multiplication shows that A consists of the identity, the eight 3-cycles on {1,2,3,4}, and the three double transpositions (1 2)(3 4), (1 3)(2 4), (1 4)(2 3). This set is closed under multiplication by a±1 and b=b−1, and every listed element is a word in a,b, so [L3] and [L4] give ∣A∣=12.

L3L4algebra
2.1

Suppose, for contradiction, that H≤A has order 6. Then [L5] gives [A:H]=2, so H⊴A by [L2]. Since 3∣∣H∣, [L1] gives an element c∈H of order 3, necessarily one of the eight 3-cycles in step 1.1.

assume-contrastep 1.1L1L2L5
3.1

The subgroup H contains c−1. Normality and [L6] make it contain every A-conjugate of both c and c−1. Conjugating by the displayed generators gives two disjoint four-element classes, together all eight 3-cycles, so H would contain at least eight elements, contradicting ∣H∣=6.

step 1.1step 2.1L3L6algebra
4.1

Thus 6 divides ∣A∣=12 but is not the order of a subgroup of A. The arbitrary-divisor claim is false, whereas [L1] remains valid for prime divisors.

step 1.1step 3.1L1discharge-contradiction∎
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-11Open item page →

There are six two-colourings of the vertices of a square up to its eight symmetries

Example

The eight symmetries of a square act on its two-colour vertex colourings. There are exactly six orbits, so there are six colourings up to symmetry.

Facts & Assumptions

Given: The square-symmetry group D acting on the vertex set V={1,2,3,4} and the colouring set C={0,1}V.

[L1]

Orbit counting gives ∣D∣ ∣C/D∣=∑g∈D∣Cg∣ (Cauchy-Frobenius orbit counting: ∣G∣ ∣X/G∣=∑g∈G∣Xg∣ for a finite group action).

[L2]

The group D has eight elements: four rotations and four reflections (The square-symmetry group has class equation 8=2+2+2+2).

[L3]

A left action satisfies the usual identity and product laws (Left group actions, transitive actions, and faithful actions).

Verification

technique · direct
1.1

Define (g⋅c)(v)=c(g−1v). Inverse precomposition gives e⋅c=c and (gh)⋅c=g⋅(h⋅c), so [L2] and [L3] give an action on the 16 colourings counted by [L4].

L2L3L4
2.1

A colouring fixed by a symmetry is constant on each cycle of that symmetry. Thus the identity fixes 16 colourings; the two quarter-turns fix 2 each; the half-turn fixes 4; the two reflections through opposite vertices fix 8 each; and the two reflections through opposite edges fix 4 each.

step 1.1L2algebra
3.1

The fixed-point sum is 16+2+2+4+8+8+4+4=48. By [L1] and ∣D∣=8, one has 48=8∣C/D∣, so ∣C/D∣=6.

step 2.1L1L2algebra
4.1

The six orbits can also be distinguished by the number of black vertices, with the two-black case split into adjacent and opposite pairs, confirming the count.

step 3.1algebra∎
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-11Open item page →

There are six binary necklaces of length four up to rotation

Example

Binary words of length four, considered up to cyclic rotation, form six orbits. Equivalently, there are six binary necklaces of length four.

Facts & Assumptions

Given: The additive group R=Z/4 acting by rotation on the binary words C={0,1}Z/4.

[L1]

Orbit counting gives ∣R∣ ∣C/R∣=∑g∈R∣Cg∣ (Cauchy-Frobenius orbit counting: ∣G∣ ∣X/G∣=∑g∈G∣Xg∣ for a finite group action).

[L2]

A left action satisfies the identity and product laws (Left group actions, transitive actions, and faithful actions).

[L5]

Verification

technique · direct
1.1

Let (a⋅c)(i)=c(i−a). Addition in [L3] verifies the action laws [L2], and [L4] and [L5] give four rotations acting on 16 words.

L2L3L4L5
2.1

Rotation by 0 fixes all 16 words; rotations by 1 and 3 each force all positions equal and fix 2 words; rotation by 2 permits one colour on each opposite pair and fixes 4 words.

step 1.1L4algebra
3.1

The fixed-point sum is 16+2+4+2=24, so [L1] gives 24=4∣C/R∣ and hence ∣C/R∣=6.

step 2.1L1algebra∎
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11Open item page →

A nonfree action can have ∣X/G∣≠∣X∣/∣G∣

Statement refuted

False claim. For every action of a finite group G on a finite set X, the number of orbits is ∣X∣/∣G∣.

Facts & Assumptions

Given: The trivial action of G=Z/2 on the singleton X={∗}.

[L1]

Orbit counting uses the fixed-point sum ∣G∣ ∣X/G∣=∑g∈G∣Xg∣ (Cauchy-Frobenius orbit counting: ∣G∣ ∣X/G∣=∑g∈G∣Xg∣ for a finite group action).

[L2]

The trivial Z/2-action on a singleton is transitive and nonfaithful (The trivial action of Z/2 on a singleton is transitive but not faithful).

Counterexample

technique · direct
1.1

By [L2], the singleton is one orbit, so ∣X/G∣=1.

L2
2.1

Here ∣X∣=1 and ∣G∣=2, so there is no natural number q with ∣X∣=∣G∣q; in particular the orbit count is not obtained by dividing ∣X∣ by ∣G∣.

step 1.1L2algebra
3.1

Both elements of G fix the unique point, so [L1] correctly gives 2⋅1=1+1. This verifies the orbit-counting identity while refuting the naive division rule.

step 1.1step 2.1L1L2algebra∎

Sources