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
Statement
Let be a finite group and let be an irreducible complex character of . Then divides .
Facts & Assumptions
Given: A finite group , an irreducible complex character of , and an irreducible complex representation of affording .
An irreducible complex character has self-inner-product (A complex character is irreducible if and only if its self-inner-product is ).
The class-function inner product is (The standard inner product on ).
A central class sum acts on an irreducible representation by a scalar (Class sums act on an irreducible representation by central-character scalars).
The degree of an irreducible complex character divides the order of the group (The degree of an irreducible complex character divides ).
The center is (The center of a group).
Proof
Let . For each integer , let act on by . Its character is , so by [F2] and [F1] its self-inner-product is . Hence is irreducible by [F1].
If , then the conjugacy class of is the singleton by [F5], so [F3] gives for some scalar . Therefore acts on as the scalar .
Let . Since is multiplicative, step 2.1 shows that every element of acts trivially on . Thus the irreducible representation of step 1.1 descends to an irreducible representation of the quotient , still of degree .
The map , , is bijective, so . Hence . Applying [F4] to the irreducible quotient representation from step 3.1 yields for every .
Fix a prime and write and with . If , then choosing so large that makes too large to divide , contradicting step 4.1. Therefore for every prime , so divides .
Since , the degree of the irreducible character divides the index of the center.
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
- K. Conrad, Degrees of irreducible representations (standard reference, not scraped)
- John Tate's tensor-power argument, as summarized in expository sources (standard reference, not scraped)