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.
Inducing a nontrivial character of a three-cycle subgroup of gives an irreducible degree-two character
Example
Let , let , and let be the nontrivial linear character of with and . Then has values
on the conjugacy classes , the transpositions, and the -cycles respectively. Its self-inner-product is , so it is irreducible of degree .
Facts & Assumptions
Given: The subgroup and the nontrivial character defined in the Example.
The induced character is computed by Frobenius' formula (Frobenius' formula for the character of an induced representation).
A complex character is irreducible if and only if its self-inner-product is (A complex character is irreducible if and only if its self-inner-product is ).
The notation is the induced character from The induced character of a complex character.
Verification
Since , Frobenius' formula [F1] at the identity gives . If is a transposition, no conjugate of lies in , so Frobenius' formula gives .
If is a -cycle, then is normal in , so every satisfies . Exactly three of those conjugates equal and three equal , so [F1] gives .
Therefore the induced character has values on the three class types of . Its self-inner-product is , so [F2] makes it irreducible; the value at shows that its degree is .
Depends on
Used by
Dependency tree · two levels
10 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
- Pavel Etingof et al., Introduction to Representation Theory, Section 4.11 (standard reference, not scraped)