Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-26 (gpt-6-sol)
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 a complex character, χ(1)=dim⁡V, χ is a class function, and ∣χ(g)∣≤χ(1) with equality exactly at scalars

Statement

Let G be a finite group, let V be a finite-dimensional complex representation of G, and let χ=χV be its character. Then, for all g,h∈G:

  1. χ(1)=dim⁡V;
  2. χ(ghg−1)=χ(h), so χ is a class function;
  3. χ(g) is a sum of dim⁡V roots of unity, namely the eigenvalues of ρ(g) counted with multiplicity;
  4. ∣χ(g)∣≤χ(1), with equality if and only if ρ(g) is a scalar operator;
  5. χ(g−1)=χ(g)‾.

Facts & Assumptions

Given: A finite group G, a finite-dimensional complex representation ρ:G→GL⁡(V) with character χ.

[F1]

The character is χ(g)=tr⁡ρ(g), the trace of the action operator (The character χV(g)=tr⁡(ρV(g)) of a finite-dimensional complex representation).

[F2]

In a finite group, every element g has finite order dividing ∣G∣ (The order of every element of a finite group divides the order of the group).

[A1]

An element of finite order acts diagonalisably on a finite-dimensional space over an algebraically closed field of characteristic zero (Over an algebraically closed field of characteristic 0, every element of finite order acts diagonalisably in a finite-dimensional representation).

[A2]

If the characteristic polynomial of an endomorphism splits as ∏i(x−λi), then its trace is the sum of the eigenvalues ∑iλi (If χT(x)=∏i<n(x−λi) in F[x], then tr⁡(T)=∑i<nλi: trace is the sum of the eigenvalues counted with algebraic multiplicity).

[A3]

tr⁡(AB)=tr⁡(BA) whenever the products are defined (For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA)).

[A4]

Complex conjugation distributes over addition and multiplication, fixes real numbers, and satisfies ∣z‾∣=∣z∣ (Real and imaginary parts, complex conjugation, and modulus).

[A5]

For complex numbers z1,…,zd, the triangle inequality ∣∑izi∣≤∑i∣zi∣ holds, and equality holds exactly when all the nonzero zi share one argument.

[A6]

A function f:G→C is a class function exactly when it is constant on every conjugacy class (Class functions and the complex vector space cf(G)).

Proof

technique · direct
1.1F1givenalgebra

In any ordered basis of V the matrix of ρ(1)=id⁡V is the identity matrix, whose trace is the number of basis vectors. Hence χ(1)=tr⁡(id⁡V)=dim⁡V, which is claim 1.

1.2F1A3given

For the same reason ρ(g) and ρ(h) compose as in the group, so χ(ghg−1)=tr⁡(ρ(g)ρ(h)ρ(g)−1)=tr⁡(ρ(h)ρ(g)−1ρ(g))=tr⁡ρ(h)=χ(h), the middle step being [A3] applied to A=ρ(g) and B=ρ(h)ρ(g)−1.

1.3F2A1given

By [F2], g has finite order n with n∣∣G∣, so ρ(g)n=ρ(gn)=id⁡V. Since C is algebraically closed of characteristic zero, [A1] gives a basis of V in which ρ(g) is diagonal with diagonal entries λ1,…,λd, where d=dim⁡V; each λin=1, so each λi is a root of unity.

2.1step 1.2A6

By step 1.2 the value of χ does not change under conjugation, so χ is constant on each conjugacy class and hence is a class function in the sense of [A6], which is claim 2.

2.2F1A2step 1.3step 1.1

In that basis the characteristic polynomial of ρ(g) is ∏i=1d(x−λi), so [A2] gives χ(g)=tr⁡ρ(g)=∑i=1dλi, a sum of d=dim⁡V roots of unity, which is claim 3.

2.3F1step 1.1step 1.3algebra

Conversely, if ρ(g)=λid⁡V for a scalar λ, first consider the degenerate case V=0. Then χ(g)=0=χ(1), so the equality clause of claim 4 holds. If V≠0, then the identity ρ(g)n=id⁡V of step 1.3 reads λnid⁡V=id⁡V, and evaluating it on a nonzero vector gives λn=1. Thus λ is a root of unity and ∣λ∣=1; then χ(g)=λdim⁡V and ∣χ(g)∣=dim⁡V=χ(1). This closes the biconditional in claim 4.

2.4step 1.3A4algebra

The inverse operator has the inverse eigenvalues, and a root of unity λ satisfies λ−1=λ‾ because ∣λ∣=1=λλ‾.

3.1A5step 2.2step 1.3step 1.1

Applying [A5] to the eigenvalues of step 1.3 gives ∣χ(g)∣=∣∑iλi∣≤∑i∣λi∣=d=dim⁡V=χ(1), which is the inequality in claim 4.

4.1A5step 1.3algebra

If V=0, its only endomorphism is scalar, so the equality case is immediate. If V≠0, equality holds in step 3.1 exactly when the equality clause of [A5] applies: since every ∣λi∣=1, all the eigenvalues share one argument, so all the λi are equal to one root of unity λ. The diagonal form of step 1.3 then shows ρ(g)=λid⁡V, a scalar operator.

5.1A2A4step 2.4step 2.2∎

Hence, using [A2] for ρ(g−1)=ρ(g)−1 and the additivity of conjugation from [A4], χ(g−1)=∑iλi−1=∑iλi‾=∑iλi‾=χ(g)‾, which is claim 5.

Depends on

Used by

Dependency tree · two levels

33 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