Alphabeta Math
Session-authored (Fable 5 assisted)
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.

Counting up to Symmetry: Burnside and Pólya — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: Not suppliedjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The cycle index of C_4

Example

The rotation action of C4 on a square gives

Z(C4)=14(s14+s22+2s4).

Indeed, the identity has cycle type 14, the half-turn has cycle type 22, and the two quarter-turns each have cycle type 4.

ExampleConstruction: AI-adaptedVerification: Not suppliedjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The cycle index of D_8

Example

For the square,

Z(D8)=18(s14+2s12s2+3s22+2s4).

The four rotations contribute

s14, s22, s4, s4,

the two reflections through opposite vertices contribute s12s2, and the two reflections through opposite edges contribute s22.

ExampleConstruction: AI-generatedVerification: Not suppliedjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The cycle index of S_3

Example

The three cycle types in S3 are:

  • one identity of type 13;
  • three transpositions of type 12;
  • two 3-cycles of type 3.

Therefore

Z(S3)=16(s13+3s1s2+2s3).

ExampleConstruction: AI-generatedVerification: Not suppliedjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

A nonfree action can have 3 orbits on 4 points

Example

Let the group C2={1,τ} act on

X={1,2,3,4}

by the transposition τ=(12) and with 3,4 fixed.

The orbits are

{1,2},{3},{4},

so there are 3 orbits. This is a nonfree action, and the naive quotient X/C2=4/2=2 is the wrong count.

ExampleConstruction: AI-generatedVerification: Not suppliedjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Pattern inventory of square colourings by number of red vertices

Example

Give blue weight 1 and red weight r in the dihedral action on the square. Substituting

si=1+ri

into the cycle index of The cycle index of D_8 yields

1+r+2r2+r3+r4.

So, up to dihedral symmetry, there is:

  • 1 colouring with 0 red vertices;
  • 1 colouring with 1 red vertex;
  • 2 colourings with 2 red vertices, namely adjacent and opposite pairs;
  • 1 colouring with 3 red vertices;
  • 1 colouring with 4 red vertices.
ExampleConstruction: AI-generatedVerification: Not suppliedjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Two-colour necklaces of length 6 by Pólya

Example

Evaluating the necklace formula at n=6 and m=2 gives

16(φ(1)26+φ(2)23+φ(3)22+φ(6)2)=16(64+8+8+4)=14.

So there are 14 binary necklaces of length 6.

ExampleConstruction: AI-generatedVerification: Not suppliedjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Two-colour necklaces of length 6 by the published CYC formula

Example

The published symbolic-method necklace formula gives the same evaluation at n=6 and m=2:

16(64+8+8+4)=14.

So the cycle-construction route and the Pólya route both count 14 binary necklaces of length 6.

ExampleConstruction: AI-generatedVerification: Not suppliedjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Two-colour bracelets of length 6

Example

For n=6 and m=2, the bracelet formula gives

112(64+8+8+4)+14(23+24)=7+6=13.

So there are 13 binary bracelets of length 6.

ExampleConstruction: AI-generatedVerification: Not suppliedjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Colourings of the faces of a cube up to rotation

Example

The 24 rotational symmetries of the cube act on its 6 faces with cycle types:

  • 1 identity of type 16;
  • 6 quarter-turns of type 124;
  • 3 half-turns through opposite faces of type 1222;
  • 8 third-turns through opposite vertices of type 32;
  • 6 half-turns through opposite edges of type 23.

Therefore the number of face-colourings up to rotation with m colours is

m6+3m4+12m3+8m224.

ExampleConstruction: AI-generatedVerification: Not suppliedjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

There are 11 S_4-orbits of edge-sets on the pairs of [4]

Example

For the action of S4 on the 6 unordered pairs of [4], the induced cycle-index polynomial is

124(s16+9s12s22+8s32+6s2s4).

Substituting si=1+xi gives

1+x+2x2+3x3+2x4+x5+x6.

In particular, setting x=1 yields

1+1+2+3+2+1+1=11,

so there are 11 edge-set orbits, equivalently 11 simple graphs on 4 vertices up to isomorphism.

CounterexampleConstruction: AI-generatedVerification: AI-generatedaudited 2026-08-28Open item page →

C_4 and V_4 can share the same cycle index through nonfaithful actions

Statement refuted

Nonisomorphic groups cannot act on the same finite set with the same cycle index.

Facts & Assumptions

Given: the four-point set X={1,2,3,4} and the transposition product τ=(12)(34).

[F1]

Both C4 and V4 admit surjective homomorphisms onto the two-element permutation group {1,τ}.

Counterexample

technique · direct
1.1

Use [F1] to let both C4 and V4 act on X through the same quotient image {1,τ}. In each action, exactly two group elements act as the identity and exactly two act as τ.

F1
2.1

Therefore both actions have the same averaged cycle monomials, namely 14(2s14+2s22)=12(s14+s22). But C4 and V4 are not isomorphic. Hence the displayed claim is false.

step 1.1algebra
CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The substitution x_i=x^i can erase colour-profile information

Statement refuted

Replacing every cycle-index variable by the one-variable specialization

xi=xi

still retains the full colour-profile information of a weighted inventory.

Facts & Assumptions

Given: the trivial action on the one-point set with two colours, blue and red.

[F1]

For the trivial action on one point, the cycle index is the single variable s1, and a blue/red weighting records the two colour orbits by the polynomial b+r.

Counterexample

technique · direct
1.1

Give blue weight b and red weight r. By [F1], the full weighted inventory is b+r, which distinguishes the blue orbit from the red orbit.

F1
2.1

The one-variable specialization named in the statement replaces the cycle-index variables by si=xi, so here it sends s1 to x. The resulting polynomial x no longer distinguishes blue from red, so the specialization has erased colour-profile information. Therefore the displayed claim is false.

step 1.1F1algebra

Sources