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.

17 results · all verified · 11 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 6 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Characters and the Orthogonality Relations — Examples

1 · Prerequisites

2 · Summary

These examples turn the companion page's theorems into explicit tables. The cyclic group opens the page: its n irreducible characters are the powers of a primitive n-th root of unity, and its table checks both orthogonality relations and the sum-of-squares formula. The standard representation of Sn is then computed from fixed points, and that character supplies the degree data for the full S3 table, which is verified against both relations and used to decompose the tensor square χ22=1+sgn+χ2.

The larger symmetric groups follow the same route. The normal Klein four subgroup of A4 yields its three lifted degree-one characters and its four conjugacy classes, completing the A4 table; the five cycle-type classes of S4 complete its table, whose kernels are intersected to recover exactly {1}, V4, A4, and S4 as the normal subgroups.

The final pair of tables is the cautionary landmark. Q8 and Dih(C4) have identical character tables although the groups are not isomorphic, so a character table cannot always distinguish a finite group. The companion false statements isolate the other easy mistakes: a character is not a homomorphism, irreducible character values need not be real, distinct irreducibles may share a degree, and a class function of self-inner product 1 need not be a character.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

The irreducible complex characters of a finite cyclic group are the n powers of a primitive nth root

Example

Let G=g be a cyclic group of order n1, and let ζC be a primitive n-th root of unity. The irreducible complex characters of G are exactly

χk(gm):=ζkm(0kn1),

and they are pairwise distinct.

Facts & Assumptions

Given: A cyclic group G=g of order n1.

[F2]

Choosing a basis identifies degree-one representations with homomorphisms GC×, and two such representations are equivalent exactly when the homomorphisms agree (Equivalence classes of degree-one representations are exactly homomorphisms Gk×; equivalently they factor through G/G, and they form an abelian group).

[F3]

The roots of xn1 in a field form a finite cyclic subgroup μn whose order divides n. This group contains a primitive n-th root exactly when it has order n, and in that case its generators are exactly the primitive n-th roots. (μn(K) is cyclic of order dividing n, and has a primitive n-th root of unity exactly when its order is n)

[F4]

Over a field of characteristic not dividing n, a splitting field of tn1 has exactly n distinct n-th roots of unity, and they form a cyclic group of order exactly n (tn1 is separable over K exactly when the characteristic does not divide n, and then a splitting field carries n distinct n-th roots of unity).

[F5]

Over an algebraically closed field, every endomorphism of an irreducible representation is scalar (Over an algebraically closed field, every endomorphism of an irreducible representation is scalar).

[F6]

A field is a splitting field for a finite group exactly when every irreducible representation has scalar endomorphism ring (A splitting field for a finite group: every irreducible representation has scalar endomorphism ring).

[F7]

Every irreducible representation of a finite abelian group over a splitting field has degree 1 (Every irreducible representation of a finite abelian group over a splitting field is one-dimensional).

Verification

technique · direct
1.1

Since gn=1, a homomorphism φ:GC× sends g to an n-th root of unity: φ(g)n=φ(gn)=φ(1)=1. By [F4] the n-th roots of unity in C are exactly the n distinct powers ζ0,,ζn1 of a primitive root ζ of [F3].

F3F4given
1.2

For each k, the formula χk(gm)=ζkm is well defined by [F1] and is a homomorphism, since χk(gagb)=ζk(a+b)=ζkaζkb. They are pairwise distinct because ζkk1 for 0<kk<n by primitivity of [F3].

F1F3givenalgebra
2.1

By [F5] and [F6], C is a splitting field for the finite abelian group G; then [F7] shows every irreducible representation of G has degree 1. By [F2] it corresponds to a homomorphism φ:GC×, and step 1.1 shows φ(g)=ζk for some k, so φ=χk. Hence the irreducible characters are exactly the χk.

F2F5F6F7step 1.1step 1.2
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

The character table of a finite cyclic group over C

Example

For G=g cyclic of order n and ζ a primitive n-th root of unity, the character table has rows χk and columns gm with entry ζkm (0k,mn1). Both orthogonality relations hold, and the squared degrees sum to n=G.

Facts & Assumptions

Given: A cyclic group G=g of order n1 and a primitive n-th root of unity ζ.

[F1]

The irreducible characters are χk(gm)=ζkm for 0kn1, pairwise distinct (The irreducible complex characters of a finite cyclic group are the n powers of a primitive nth root).

[F2]

Vieta's formulas: if the monic f(t)=tn+a1tn1++an splits as i=1n(tαi), then a1=iαi (Vieta's formulas identify the coefficients of a split monic polynomial with elementary symmetric functions of its roots).

[F3]

The first orthogonality relation reads χi,χj=δij (The first orthogonality relation for irreducible complex characters).

[F4]

The second orthogonality relation reads iχi(g)χi(h)=CG(g) when h is conjugate to g and 0 otherwise (The second orthogonality relation for irreducible complex characters).

[A1]

In C[x], tn1=m=0n1(tζm), because the two sides have the same degree, the same roots, and are monic.

Verification

technique · direct
1.1

By [F1] the entry in row χk and column gm is ζkm, so the table has the stated shape.

F1given
1.2

If n=1, then G is trivial and m=0n1ζkm=1 for the unique value k=0. Assume now that n>1. Then the polynomial tn1 has coefficient 0 at tn1, so [A1] and [F2] give m=0n1ζm=0. More generally, if k0(modn) then m=0n1ζkm=n; if 0<k<n, the element η=ζk has order n/d, where d=gcd(k,n), so m=0n1ζkm=dr=0n/d1ηr. Here n/d>1, and the inner sum vanishes by the same Vieta argument applied to tn/d1. Thus m=0n1ζkm is n when k0(modn) and 0 otherwise.

F2A1givenalgebra
2.1

Row orthogonality: by [F3] and step 1.1, δkl=χk,χl=1nmζkmζlm=1nmζ(kl)m, and the last sum is n when kl(modn) and 0 otherwise by step 1.2, which matches δkl.

F3step 1.1step 1.2algebra
2.2

Column orthogonality: by [F4] and step 1.1, kχk(gm)χk(gm)=kζk(mm), which is n when mm(modn) and 0 otherwise by step 1.2; since G is abelian every centralizer is G, so this is exactly CG(g)δmm.

F4step 1.1step 1.2algebra
3.1

All n degrees are 1, so knk2=n=G.

F1step 1.1algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

The standard representation of Sn has character equal to the number of fixed points minus 1

Example

For n1, let Sn act on {1,,n} by permutation and let Cn be the permutation representation. The standard representation is the subrepresentation

Vstd:={(x1,,xn)Cn:ixi=0},

and its character is χstd(σ)=fix(σ)1, where fix(σ) is the number of fixed points of σ.

Facts & Assumptions

Given: An integer n1 and a permutation σSn acting on {1,,n}.

[F1]

The character of a permutation representation is the number of fixed points of the action (The character of a permutation representation counts fixed points).

[A1]

The permutation representation decomposes as Cn=LVstd, where L={(x,,x):xC} is a copy of the trivial representation and Vstd is its stated complement.

Verification

technique · direct
1.1

The line L of constant vectors is fixed pointwise by every permutation, so it is a trivial subrepresentation, and the sum map (x1,,xn)ixi is preserved by every permutation, so its kernel Vstd is a subrepresentation. Every vector decomposes uniquely as a constant vector plus a vector of sum zero, which is [A1].

A1given
1.2

By [F2] applied to [A1], the permutation character χCn satisfies χCn=χtriv+χstd. The trivial character is the constant 1, so χstd(σ)=χCn(σ)1.

F2A1given
2.1

By [F1], χCn(σ)=fix(σ), the number of fixed points. Combining with step 1.2 gives χstd(σ)=fix(σ)1.

F1step 1.2algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-29Open item page →

S3 has three irreducible complex characters of degrees 1, 1, and 2

Example

The symmetric group S3 has exactly three irreducible complex characters: the trivial character 1, the sign character sgn, and the standard character χstd; their degrees are 1, 1, and 2.

Facts & Assumptions

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

[F2]

The degrees of all irreducible characters satisfy ini2=G (The regular character gives a second proof of the sum-of-squares formula).

[F3]

The sign representation is the one-dimensional representation in which σ acts by sgn(σ) (The sign representation of Sn and the restriction ResHG(V) of a representation to a subgroup).

[F4]

The standard character of Sn is χstd(σ)=fix(σ)1 (The standard representation of Sn has character equal to the number of fixed points minus 1).

[F5]

A complex character is irreducible exactly when its self-inner-product is 1 (A complex character is irreducible if and only if its self-inner-product is 1).

[A1]

The standard inner product of class functions on a group of order n is f,h=1ngf(g)h(g).

Verification

technique · direct
1.1

By [F1] the cycle types of S3 are the identity type, the type of a transposition, and the type of a 3-cycle, so S3 has three conjugacy classes; a direct count of each type gives class sizes 1, 3, and 2.

F1given
1.2

By [F3] the trivial and sign characters are distinct one-dimensional characters, hence irreducible: a one-dimensional space has no proper nonzero subspaces. Their degrees are 1 and 1.

F3given
2.1

By [F4], the standard character has values 2, 0, and 1 on the three classes of step 1.1 (fixed points 3, 1, and 0 minus 1). Using [A1], χstd,χstd=16(4+30+21)=1, so by [F5] the standard character is irreducible, of degree χstd(1)=2.

F4A1F5step 1.1algebra
3.1

The three irreducible characters of steps 1.2 and 2.1 have squared degrees 1+1+4=6=S3. By [F2] the sum over all irreducible characters is also 6, so no further irreducible character exists.

F2step 1.2step 2.1algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

The character table of S3

Example

The character table of S3, with columns indexed by the classes of 1, (12), and (123) (sizes 1, 3, 2), is

1(12)(123)1111sgn111χstd201

Both orthogonality relations hold for this table.

Facts & Assumptions

Given: The symmetric group S3 with its three irreducible characters 1, sgn, χstd.

[F1]

S3 has exactly three irreducible characters of degrees 1, 1, and 2, and its classes have sizes 1, 3, 2 (S3 has three irreducible complex characters of degrees 1, 1, and 2).

[F2]

The first orthogonality relation: the rows are orthonormal (The first orthogonality relation for irreducible complex characters).

[F3]

The second orthogonality relation: distinct columns are orthogonal and the squared norm of a column is the centralizer size (The second orthogonality relation for irreducible complex characters).

[A1]

sgn(σ)=1 for even σ and 1 for odd σ, so on the three class representatives it is 1, 1, 1.

[A2]

The standard character is fix(σ)1, with values 2, 0, 1 on the three representatives.

Verification

technique · direct
1.1

By [F1] there are three irreducible characters and three classes; [A1] and [A2] supply the second and third rows, and the trivial character is the constant 1. Hence the displayed table is the character table.

F1A1A2given
2.1

Row orthogonality: the rows 1 and sgn have inner product 16(13+2)=0, the row 1 with χstd gives 16(2+02)=0, sgn with χstd gives 16(202)=0, and each row has self-inner-product 1; this matches [F2].

F2step 1.1algebra
3.1

Column orthogonality: the first column has squared norm 1+1+4=6=CS3(1); the second has 1+1+0=2=CS3((12)); the third has 1+1+1=3=CS3((123)); and each pair of distinct columns has inner product 11+0=0, 1+12=0, 11+0=0, matching [F3].

F3step 1.1algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-29Open item page →

The square of the two-dimensional S3 character decomposes as 1+sgn+χ2

Example

The tensor square of the two-dimensional irreducible representation of S3 has character χ22, and

χ22=1+sgn+χ2.

Facts & Assumptions

Given: The irreducible characters 1, sgn, χ2=χstd of S3.

[F1]

The character table of S3 gives the values χ2=(2,0,1) on the classes of 1, (12), (123) (The character table of S3).

[F3]

The multiplicity of an irreducible character in a given character is the inner product with it (The multiplicity of an irreducible summand is a character inner product).

[A1]

The inner product is f,h=16σf(σ)h(σ).

Verification

technique · direct
1.1

By [F2], the tensor square of the two-dimensional representation has character χ22; from [F1] its values are (2,0,1)2=(4,0,1) on the three classes.

F1F2given
2.1

Using [A1] and the values of step 1.1, the multiplicities are χ22,1=16(4+0+2)=1, χ22,sgn=16(4+0+2)=1, and χ22,χ2=16(8+02)=1. By [F3] these are the coefficients of 1, sgn, and χ2.

A1F3step 1.1algebra
3.1

The value at 1 checks: χ22(1)=4=11+11+12, the sum of the degrees with the multiplicities of step 2.1; hence χ22=1+sgn+χ2.

F1step 2.1algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

A4 has a normal Klein four subgroup and four conjugacy classes

Example

Let V4={1,(12)(34),(13)(24),(14)(23)}A4. Then V4 is a normal subgroup of A4 of order 4, the quotient A4/V4 has order 3, and A4 has four conjugacy classes, of sizes 1, 3, 4, and 4.

Facts & Assumptions

Given: The alternating group A4S4 and the subset V4={1,(12)(34),(13)(24),(14)(23)}.

[F1]

Two permutations of Sn are conjugate exactly when they have the same cycle type (Two elements of Sn are conjugate if and only if they have the same cycle type).

[F2]

For n2, the Sn-class of an element of An splits into two An-classes of equal size exactly when all cycle lengths, 1-cycles included, are odd and pairwise distinct. (For n2, an Sn-class of an even permutation splits in An exactly when all cycle lengths, including 1-cycles, are odd and distinct)

[F3]

For finite G and NG, G/N=G/N (If [G:N] is finite then G/N=[G:N]; for finite G this equals G/N).

[A1]

The product of two distinct double transpositions on four letters is the remaining double transposition, and a product of two transpositions is an even permutation; A4=12.

[A2]

Conjugating a double transposition (ab)(cd) by a permutation σ of the four letters gives the double transposition (σ(a)σ(b))(σ(c)σ(d)).

Verification

technique · direct
1.1

By [A1] the three nonidentity elements of V4 are even permutations and multiply pairwise to the third, so V4 is a subgroup of A4 of order 4.

A1given
1.2

For the 3-cycle (123), the cycle lengths are 3 and 1, odd and distinct, so [F2] applies: its S4-class, of size 8, splits into two A4-classes of equal size 4. These two classes account for all eight 3-cycles of A4.

F2givenalgebra
2.1

By [A2], any conjugate of a double transposition is again a double transposition, and there are exactly three of them; by [F1] they all lie in the single S4-class of cycle type (2,2). Hence every conjugate of every element of V4 lies in V4, so V4A4.

F1A2step 1.1given
2.2

By [F3], A4/V4=A4/V4=12/4=3.

F3step 1.1A1
3.1

The identity class of A4 is {1}. For the double transposition (12)(34), the cycle type (2,2) has two equal lengths, so [F2] does not apply and its S4-class does not split: its A4-class is the whole class of double transpositions, of size 3 by step 2.1.

F2step 2.1given
4.1

Every nonidentity element of A4 is a double transposition or a 3-cycle, so steps 3.1 and 1.2 list all classes: sizes 1, 3, 4, 4.

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

The character table of A4

Example

Let ω=e2πi/3 and let the classes of A4 be represented by 1, (12)(34), (123), and (132) (sizes 1, 3, 4, 4). The character table is

1(12)(34)(123)(132)11111χ11ωω2χ211ω2ωψ3100

Both orthogonality relations hold.

Facts & Assumptions

Given: The group A4, its normal subgroup V4, a primitive cube root of unity ω, and the class representatives 1, (12)(34), (123), (132).

[F1]

A4 has a normal subgroup V4 of order 4 with quotient of order 3, and its conjugacy classes have sizes 1, 3, 4, 4 (A4 has a normal Klein four subgroup and four conjugacy classes).

[F4]

The squared degrees of the irreducible characters sum to G (The regular character gives a second proof of the sum-of-squares formula).

[F5]

Row orthogonality: irreducible characters are orthonormal (The first orthogonality relation for irreducible complex characters).

[F6]

Column orthogonality: distinct columns are orthogonal, and a column has squared norm the centralizer size (The second orthogonality relation for irreducible complex characters).

[A1]

A homomorphism A4C× that is trivial on V4 factors through the quotient A4/V4; conversely, a homomorphism from A4/V4 pulls back to one on A4 that is trivial on V4.

[A2]

The commutator [(123),(124)] equals (12)(34), and a homomorphism to the abelian group C× is constant on conjugacy classes.

Verification

technique · direct
1.1

By [F1] and [F2] the quotient A4/V4 has order 3, hence is cyclic. Its three homomorphisms to C× send a generator to 1, ω, or ω2; by [F3] and [A1], they pull back to three one-dimensional characters of A4 whose values are the first three rows. Conversely, every homomorphism A4C× kills commutators, so [A2] makes it kill (12)(34) and therefore, by conjugacy, every nonidentity element of V4. Hence every degree-one character is trivial on V4 and factors through A4/V4 by [A1]. Thus these are exactly the three one-dimensional characters of A4.

F1F2F3A1A2given
2.1

By [F4], the remaining irreducible degree d satisfies 1+1+1+d2=12, so d=3.

F4step 1.1algebra
3.1

By [F6], the column of (12)(34) is orthogonal to the column of 1: 1+1+1+ψ((12)(34))=0, so ψ((12)(34))=1.

F6step 1.1step 2.1algebra
4.1

By [F6], the column of (123) is orthogonal to the column of (12)(34): 11+1ω+1ω2+(1)ψ((123))=0. Since 1+ω+ω2=1+ω2+ω=0, this forces ψ((123))=0, hence ψ((123))=0; the same argument gives ψ((132))=0.

F6step 1.1step 3.1algebra
5.1

The four rows assembled in steps 1.1 through 4.1 form the displayed table. Row orthogonality holds by [F5]: the first three rows are orthonormal (112(4+31+4+4)=1 for the identity, with cross terms 1+31+4ω+4ω2=1+34=0), and ψ,ψ=112(9+31)=1, while ψ is orthogonal to each of the first three rows.

F5step 1.1step 4.1algebra
6.1

Column orthogonality holds by [F6]: the squared norms are 12, 4, 3, 3, matching the centralizer sizes 12, 4, 3, 3 of the four classes, and distinct columns are orthogonal.

F6step 1.1step 5.1algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-29Open item page →

S4 has five conjugacy classes of sizes 1, 6, 8, 6, and 3

Example

The group S4 has five conjugacy classes, represented by 1, (12), (123), (1234), and (12)(34), with sizes 1, 6, 8, 6, and 3 respectively.

Facts & Assumptions

Given: The symmetric group S4.

[F2]

The class equation counts permutations by cycle type: n!=cn!kkckck! over all tuples c with kkck=n (The class equation of Sn is n!=kck=nn!/kkckck!).

[A1]

The cycle types of elements of S4 are (4), (3,1), (2,2), (2,1,1), and (1,1,1,1).

Verification

technique · direct
1.1

By [F1] and [A1], the classes of S4 are exactly those five cycle types.

F1A1given
1.2

The class size of a cycle type c is 4!kkckck! by [F2]. For the types of [A1] these sizes are 244=6, 243=8, 24222=3, 242=6, and 1.

F2A1algebra
2.1

Matching the representatives 1, (12), (123), (1234), (12)(34) with their cycle types in [A1] and the corresponding values from step 1.2 gives class sizes 1, 6, 8, 6, 3. The sum 1+6+8+6+3=24=S4, so the count is complete.

A1step 1.1step 1.2algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-29Open item page →

The character table of S4 and the normal subgroups it reveals

Example

The character table of S4, with columns 1, (12), (123), (1234), (12)(34) (sizes 1, 6, 8, 6, 3), is

1(12)(123)(1234)(12)(34)111111ε11111χ331011εχ331011χ220102

The normal subgroups of S4 are exactly {1}, V4, A4, and S4.

Facts & Assumptions

Given: The group S4 with class representatives 1, (12), (123), (1234), (12)(34).

[F1]

S4 has five conjugacy classes, of sizes 1, 6, 8, 6, 3 (S4 has five conjugacy classes of sizes 1, 6, 8, 6, and 3).

[F2]

The sign representation is the one-dimensional representation in which σ acts by sgn(σ) (The sign representation of Sn and the restriction ResHG(V) of a representation to a subgroup).

[F5]

A complex character is irreducible exactly when its self-inner-product is 1 (A complex character is irreducible if and only if its self-inner-product is 1).

[F6]

The irreducible complex characters form an orthonormal basis of the class functions (The irreducible complex characters form an orthonormal basis of cf(G)).

[F7]

The squared degrees of the irreducible characters sum to G (The regular character gives a second proof of the sum-of-squares formula).

[F8]

Column orthogonality: distinct columns are orthogonal and a column has squared norm the centralizer size (The second orthogonality relation for irreducible complex characters).

[F9]

Normal subgroups are exactly intersections of kernels of irreducible characters (The normal subgroups of a finite group are exactly the intersections of kernels of irreducible complex characters).

[A1]

The kernel of a character of a representation is {g:χ(g)=χ(1)}.

[A2]

The kernel of a direct sum of representations is the intersection of the kernels of the summands, and a permutation of a set of four letters with exactly two fixed points is a transposition.

[A3]

For class functions on S4, the standard inner product is f,h=124(f(1)h(1)+6f((12))h((12))+8f((123))h((123))+6f((1234))h((1234))+3f((12)(34))h((12)(34))).

Verification

technique · direct
1.1

By [F2] the sign row is (1,1,1,1,1) on the representatives: values +1 on even permutations and 1 on odd ones. By [F3], the permutation character of S4 has values 4, 2, 1, 0, 0 (fixed points), so the standard character has values 3, 1, 0, 1, 1.

F2F3given
2.1

By [F4], the sign twist εχ3 has values (3,1,0,1,1).

F4step 1.1algebra
3.1

The trivial and sign characters are one-dimensional, hence irreducible. Using [A3] and the values from steps 1.1 and 2.1 gives χ3,χ3=124(9+6+0+6+3)=1,χ3,1=124(3+6+063)=0. Because ε(g)=1 for every gS4, the same computation gives εχ3,εχ3=1, and multiplying one factor by ε preserves orthogonality with 1 and with ε. Therefore 1, ε, χ3, and εχ3 are four pairwise orthogonal irreducible characters, the last two by [F5].

F5step 1.1step 2.1A3algebra
4.1

By [F6], irreducible characters form an orthonormal basis of the 5-dimensional class-function space of S4, so after the four orthogonal irreducibles of step 3.1 there is exactly one remaining irreducible character, call it χ2. By [F7], its degree d satisfies 1+1+9+9+d2=24, so d=2.

F6F7F1step 3.1algebra
5.1

By [F8], each column is orthogonal to the first column (1,1,3,3,2), so reading off the first four entries gives the fifth entry: at (12), 11+33+2χ2((12))=0, so χ2((12))=0; at (123), 1+1+0+0+2χ2((123))=0, so χ2((123))=1; at (1234), 113+3+2χ2((1234))=0, so χ2((1234))=0; at (12)(34), 1+133+2χ2((12)(34))=0, so χ2((12)(34))=2.

F8step 1.1step 4.1algebra
6.1

The five rows from steps 1.1, 2.1, and 5.1 now form an orthonormal basis of the class functions: step 3.1 already handles the first four rows, and χ2,χ2=124(4+0+8+0+12)=1. Since χ2 is orthogonal to the first four rows by construction from step 5.1, this is the displayed character table.

F6step 3.1step 5.1A3algebra
6.2

The kernels, by [A1]: ker1=S4; kerε=A4 (the even permutations); kerχ3={1}, because χ3(σ)=3 means fix(σ)=4, i.e. σ=1; kerεχ3={1}; kerχ2=V4, because χ2(σ)=2 exactly at the identity and the double transpositions, and [A2] identifies the class with exactly two fixed points as the transpositions.

A1A2F2F3step 5.1algebra
7.1

By [F9], the normal subgroups are exactly the intersections of the five kernels of step 6.2; by [A2] these intersections are {1}, V4, A4, and S4.

F9A2step 6.2algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

The character table of Q8

Example

The character table of Q8={1,1,i,i,j,j,k,k}, with columns 1, 1, i, j, k (sizes 1, 1, 2, 2, 2), is

11ijkχ111111χ211111χ311111χ411111ψ22000

Both orthogonality relations hold.

Facts & Assumptions

Given: The quaternion group Q8={1,1,i,i,j,j,k,k}H×.

[F1]

Q8 has order 8 and 1 is its only element of order 2 (Q8 is a subgroup of H× with eight elements, and 1 is its only element of order 2).

[F3]

The abelianization Gab=G/G is abelian and homomorphisms to abelian groups factor uniquely through it (The derived subgroup is characteristic and the abelianization is universal).

[F4]

The squared degrees of the irreducible characters sum to G (The regular character gives a second proof of the sum-of-squares formula).

[F5]

Row orthogonality: irreducible characters are orthonormal (The first orthogonality relation for irreducible complex characters).

[F6]

Column orthogonality: distinct columns are orthogonal and a column has squared norm the centralizer size (The second orthogonality relation for irreducible complex characters).

[A1]

In Q8, i2=j2=k2=1 and ij=k; the commutator [i,j]=iji1j1 equals 1; the conjugates of i are ±i, of j are ±j, and of k are ±k, so the classes are {1}, {1}, {±i}, {±j}, {±k}.

[A2]

A homomorphism φ:Q8C× satisfies φ(i)2=φ(j)2=φ(i)φ(j)φ(k)=1, and every assignment i±1, j±1 extends to one.

Verification

technique · direct
1.1

By [A1] the conjugacy classes of Q8 are {1}, {1}, {±i}, {±j}, {±k}, of sizes 1, 1, 2, 2, 2.

A1given
1.2

Since [i,j]=1 by [A1], 1Q8; the quotient Q8/{±1} has order 4 by [F1] and every element of it squares to 1, so it is abelian, and [F3] gives Q8={±1} with abelianization of order 4.

A1F1F3given
2.1

By [F2] and [F3], the degree-one characters are the homomorphisms factoring through the abelianization of step 1.2; by [A2] they are exactly the four assignments iε, jδ for ε,δ{±1}, with k=ij sent to εδ. Their values are the first four rows of the table.

F2F3A2step 1.2given
3.1

By [F4], the remaining irreducible degree d satisfies 1+1+1+1+d2=8, so d=2.

F4step 2.1algebra
4.1

By [F6], the column of 1 is orthogonal to the column of 1: 1+1+1+1+2ψ(1)=0, so ψ(1)=2. The column of i is orthogonal to the column of 1: 1+111+2ψ(i)=0, so ψ(i)=0; likewise ψ(j)=0 and ψ(k)=0.

F6step 2.1step 3.1algebra
5.1

The five rows form the displayed table. By [F5], ψ,ψ=18(4+4)=1 and ψ is orthogonal to each degree-one row, so the table is complete; the degrees sum correctly.

F5step 2.1step 4.1algebra
6.1

By [F6], the column squared norms are 8, 8, 4, 4, 4, equal to the centralizer sizes 8, 8, 4, 4, 4, and distinct columns are orthogonal.

F6step 1.1step 4.1algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

The character table of Dih(C4)

Example

For G=Dih(C4)=r,s:r4=s2=1, srs1=r1, the conjugacy classes are represented by 1, r2, r, s, sr (sizes 1, 1, 2, 2, 2), and the character table is

1r2rssrχ111111χ211111χ311111χ411111ψ22000

Both orthogonality relations hold.

Facts & Assumptions

Given: The dihedral group G=Dih(C4)=C4C2 with C4=r and C2=s.

[F1]

G has order 8, presentation r4=s2=1, srs1=r1, and every element has the unique form ri or ris ( Dih(Cn)=CnC2 with inversion action has order 2n and the dihedral relations).

[F3]

Homomorphisms to abelian groups factor uniquely through the abelianization Gab=G/G (The derived subgroup is characteristic and the abelianization is universal).

[F4]

The squared degrees of the irreducible characters sum to G (The regular character gives a second proof of the sum-of-squares formula).

[F5]

Row orthogonality: irreducible characters are orthonormal (The first orthogonality relation for irreducible complex characters).

[F6]

Column orthogonality: distinct columns are orthogonal and a column has squared norm the centralizer size (The second orthogonality relation for irreducible complex characters).

[A1]

From [F1]'s relations: r2 is central; srs1=r1 conjugates r to r3; rsr1=sr2 conjugates s to sr2; and r(sr)r1=sr3 conjugates sr to sr3. Hence the classes are {1}, {r2}, {r,r3}, {s,sr2}, {sr,sr3}.

[A2]

The commutator [r,s]=rsr1s1 equals r2, the quotient G/r2 has order 4 and is abelian, and every assignment rε, sδ with ε,δ{±1} extends to a homomorphism GC×.

Verification

technique · direct
1.1

By [A1] the classes are {1}, {r2}, {r,r3}, {s,sr2}, {sr,sr3}, of sizes 1, 1, 2, 2, 2.

A1given
1.2

By [A2], r2G, and the quotient G/r2 of order 4 is abelian; by [F3] the homomorphisms to abelian groups factor through it, so G=r2.

A2F3given
2.1

By [F2] and [F3], the degree-one characters are the homomorphisms factoring through the abelianization of step 1.2, namely the four assignments of [A2]: χ(r)=ε, χ(s)=δ. Their values are the first four rows of the table (with χ(sr)=εδ and χ(r2)=1).

F2F3A2step 1.2given
3.1

By [F4], the remaining irreducible degree d satisfies 1+1+1+1+d2=8, so d=2.

F4step 2.1algebra
4.1

By [F6], the column of r2 is orthogonal to the column of 1: 1+1+1+1+2ψ(r2)=0, so ψ(r2)=2. The columns of r, s, and sr are orthogonal to the column of 1, giving 11+11+2ψ(r)=0, 1+111+2ψ(s)=0, and 111+1+2ψ(sr)=0, so ψ(r)=ψ(s)=ψ(sr)=0.

F6step 2.1step 3.1algebra
5.1

The five rows form the displayed table. By [F5], ψ,ψ=18(4+4)=1 and ψ is orthogonal to each degree-one row, so the table is complete; the degrees sum correctly.

F5step 2.1step 4.1algebra
6.1

By [F6], the column squared norms are 8, 8, 4, 4, 4; the norm 8 of the first column is the group order G=8 of [F1], equal to the centralizer size of the identity, and the remaining norms are the centralizer sizes. Distinct columns are orthogonal.

F6F1step 1.1step 4.1algebra
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-29Open item page →

FALSE: nonisomorphic finite groups always have different character tables

Statement

The statement "nonisomorphic finite groups always have different character tables" is false: the quaternion group Q8 and the dihedral group Dih(C4) are nonisomorphic finite groups with the same character table.

Facts & Assumptions

Given: The groups Q8 and Dih(C4), both of order 8.

[F1]

The character table of Q8 has five rows with values (1,1,1,1,1), (1,1,1,1,1), (1,1,1,1,1), (1,1,1,1,1), and (2,2,0,0,0) on the classes of 1, 1, i, j, k (The character table of Q8).

[F2]

The character table of Dih(C4) has five rows with values (1,1,1,1,1), (1,1,1,1,1), (1,1,1,1,1), (1,1,1,1,1), and (2,2,0,0,0) on the classes of 1, r2, r, s, sr (The character table of Dih(C4)).

[F4]

In Dih(C4), the elements r2 and s both have order 2 ( Dih(Cn)=CnC2 with inversion action has order 2n and the dihedral relations).

Refutation

technique · construct
1.1

The row sets of [F1] and [F2] are identical as multisets of tuples, so after a row permutation the two tables agree entry for entry.

F1F2given
1.2

By [F3], Q8 has exactly one element of order 2, while by [F4] Dih(C4) has at least the two elements r2 and s of order 2. The number of elements of order 2 is invariant under isomorphism, so the two groups are not isomorphic.

F3F4given
2.1

The two tables have the same number of rows and columns with the same class sizes 1, 1, 2, 2, 2, so they are the same character table up to the labelling of the groups.

step 1.1algebra
3.1

Steps 2.1 and 1.2 exhibit nonisomorphic finite groups with the same character table, so the claimed statement is refuted.

step 2.1step 1.2discharge-construct: counterexample
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

FALSE: a complex character of a finite group is always a group homomorphism

Statement

The statement "a complex character of a finite group is always a group homomorphism" is false: the standard character χ2 of S3 is not a homomorphism S3C×.

Facts & Assumptions

Given: The group S3 and its standard character χ2.

[F1]

The character table of S3 gives χ2((12))=0 on the class of the transposition (12) (The character table of S3).

[A1]

A group homomorphism φ:S3C× takes values in the multiplicative group C×, in which 0 is not an element.

Refutation

technique · construct
1.1

By [F1], χ2((12))=0.

F1given
2.1

If χ2 were a homomorphism S3C×, then by [A1] its value at (12) would be an element of C×, in particular nonzero, contradicting step 1.1.

A1step 1.1
3.1

Hence χ2 is not a group homomorphism, so the claimed statement is refuted.

step 2.1discharge-construct: counterexample
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

FALSE: every value of an irreducible complex character is real

Statement

The statement "every value of an irreducible complex character is real" is false: the nontrivial one-dimensional characters of A4 take the primitive cube root of unity ω=e2πi/3, which is not real, on the 3-cycles.

Facts & Assumptions

Given: The group A4, a primitive cube root of unity ω, and the irreducible character χ of the character table with χ((123))=ω.

[F1]

The character table of A4 contains the irreducible character χ with χ((123))=ω and χ((132))=ω2 (The character table of A4).

[A1]

A primitive cube root of unity ω satisfies ωR: its imaginary part is nonzero.

Refutation

technique · construct
1.1

By [F1], the irreducible character χ of A4 satisfies χ((123))=ω.

F1given
2.1

By [A1], ωR, so this value of the irreducible character χ is not real.

A1step 1.1
3.1

Hence the claimed statement, that every value of an irreducible complex character is real, is refuted by the character χ at (123).

step 2.1discharge-construct: counterexample
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

FALSE: distinct irreducible complex characters of a finite group have distinct degrees

Statement

The statement "distinct irreducible complex characters of a finite group have distinct degrees" is false: the group Q8 has four distinct irreducible characters of degree 1.

Facts & Assumptions

Given: The group Q8 and its character table.

[F1]

The character table of Q8 has the four distinct irreducible characters χ1, χ2, χ3, χ4, whose rows all begin with the value 1 (The character table of Q8).

[A1]

The degree of an irreducible character is its value at the identity, the first column of the table.

Refutation

technique · construct
1.1

By [F1], the four characters χ1,χ2,χ3,χ4 of Q8 are distinct irreducible characters.

F1given
2.1

By [F1] and [A1], each of these four has degree 1, since each row begins with the value 1 at the identity.

F1A1step 1.1
3.1

Hence four distinct irreducible characters share the degree 1, so the claimed statement is refuted.

step 2.1discharge-construct: counterexample
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

FALSE: every complex class function with self-inner-product 1 is a character

Statement

The statement "every complex class function with self-inner-product 1 is a character" is false: for a nontrivial finite group G with trivial character 1, the class function 1 has self-inner-product 1 but is not a character.

Facts & Assumptions

Given: A finite cyclic group G of order n2, its trivial character 1, and the class function 1 defined by (1)(g)=1 for every g.

[F1]

The cyclic group of order n2 has the trivial irreducible character 1 with 1(g)=1 for every g (The character table of a finite cyclic group over C).

[F2]

A complex character is irreducible exactly when its self-inner-product is 1 (A complex character is irreducible if and only if its self-inner-product is 1).

[A1]

The inner product satisfies cφ,cψ=c2φ,ψ for a scalar c, so 1,1=1,1.

[A2]

Every character χ of a representation satisfies χ(1)=dimV0.

Refutation

technique · construct
1.1

The constant function 1 is a class function, because it is constant on G, hence constant on every conjugacy class.

given
1.2

By [F1] and [F2], the trivial character satisfies 1,1=1; by [A1], 1,1=1,1=1.

F1F2A1given
1.3

If 1 were a character of some representation, then by [A2] its value at 1 would be nonnegative, but (1)(1)=1<0. Hence 1 is not a character.

A2given
2.1

Steps 1.1 through 1.3 exhibit a class function with self-inner-product 1 that is not a character, so the claimed statement is refuted.

step 1.1step 1.2step 1.3discharge-construct: counterexample

Sources