Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-30
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 degree of an irreducible complex character divides [G:Z(G)]

Statement

Let G be a finite group and let χ be an irreducible complex character of G. Then χ(1) divides [G:Z(G)].

Facts & Assumptions

Given: A finite group G, an irreducible complex character χ of G, and an irreducible complex representation V of G affording χ.

[F1]

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

[F2]

The class-function inner product is φ,ψ=1GgGφ(g)ψ(g) (The standard inner product on cf(G)).

[F3]

A central class sum acts on an irreducible representation by a scalar (Class sums act on an irreducible representation by central-character scalars).

[F4]

The degree of an irreducible complex character divides the order of the group (The degree of an irreducible complex character divides G).

[F5]

The center is Z(G)={zG:zg=gz for every gG} (The center Z(G) of a group).

Proof

technique · direct
1.1

Let n=χ(1). For each integer N1, let GN act on VN by (g1,,gN)(v1vN)=(g1v1)(gNvN). Its character is ΞN(g1,,gN)=i=1Nχ(gi), so by [F2] and [F1] its self-inner-product is ΞN,ΞNGN=χ,χGN=1. Hence ΞN is irreducible by [F1].

F1F2givenalgebra
2.1

If zZ(G), then the conjugacy class of z is the singleton {z} by [F5], so [F3] gives ρV(z)=λ(z)idV for some scalar λ(z)C×. Therefore (z1,,zN)Z(G)N acts on VN as the scalar λ(z1)λ(zN).

F3F5step 1.1algebra
3.1

Let TN:={(z1,,zN)Z(G)N:z1zN=e}. Since λ is multiplicative, step 2.1 shows that every element of TN acts trivially on VN. Thus the irreducible representation of step 1.1 descends to an irreducible representation of the quotient GN/TN, still of degree nN.

step 1.1step 2.1algebra
4.1

The map Z(G)N1TN, (z1,,zN1)(z1,,zN1,(z1zN1)1), is bijective, so TN=Z(G)N1. Hence GN/TN=GN/Z(G)N1=G([G:Z(G)])N1. Applying [F4] to the irreducible quotient representation from step 3.1 yields nNG([G:Z(G)])N1 for every N1.

F4step 3.1algebra
5.1

Fix a prime p and write n=pau and [G:Z(G)]=pbv with puv. If a>b, then choosing N so large that N(ab)>vp(G)b makes pNa too large to divide Gp(N1)b, contradicting step 4.1. Therefore ab for every prime p, so n divides [G:Z(G)].

step 4.1choosealgebra
6.1

Since n=χ(1), the degree of the irreducible character divides the index of the center.

step 5.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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