Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-09
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 three conjugacy-class indicators of the symmetric group S3

Example

For S3 and any field k, the indicators of C1={e}, C2={(12),(13),(23)}, and C3={(123),(132)} form a basis of the k-valued class functions. In particular that space has dimension three.

Facts & Assumptions

Given: S3 is the permutation group of {1,2,3}; products act rightmost first, and k is a field.

[F1]

For conjugation on a finite group, the distinct conjugacy-class indicators form a basis of class functions over any field (Orbit indicators form a basis of invariant functions).

Verification

technique · direct
1.1

Conjugation sends a transposition (ab) to (τ(a)τ(b)): at τ(a) the composite τ(ab)τ1 sends τ(a) to τ(b), at τ(b) it sends it to τ(a), and it fixes every other point. In particular (23)(12)(23)=(13) and (13)(12)(13)=(23). Thus all three transpositions, and no other permutations, constitute one conjugacy class.

givenalgebra
1.2

Similarly, τ(123)τ1 sends τ(1) to τ(2), then to τ(3), then to τ(1), so it is a three-cycle. Directly (12)(123)(12)=(132), so the two three-cycles form one class. Every conjugate of e is e. A permutation of three points is either the identity, a transposition, or a three-cycle: fixing two points forces the third to be fixed; fixing exactly one exchanges the other two; fixing none forces a three-cycle by following any point’s successive images. Hence the three listed classes exhaust S3.

givenalgebra
2.1

The group is finite and these are exactly its three classes by steps 1.1–1.2, so F1 gives the asserted indicator basis over k. More explicitly, for every class function f one has f=f(e)1C1+f((12))1C2+f((123))1C3, because evaluation on each of the three classes picks out its constant value. For example the coefficients (0,1,1) give the function with values 0 at e, 1k on the transpositions, and 1k on the three-cycles. This calculation remains valid in characteristic two, where the last two values coincide, while the indicator basis itself stays independent by evaluation on the three disjoint nonempty classes.

F1step 1.1step 1.2algebra

Sources

Judson, Example 14.2.1 lists these classes; Etingof et al., §4.3(2), p. 65, discusses S3. The indicator-basis calculation is a local illustration, not a character-table computation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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