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.
Every irreducible complex character occurs in the induction of an irreducible constituent of its restriction
Statement
Let be a finite group, let , and let be an irreducible complex character of . Then some irreducible constituent of satisfies
Equivalently, occurs in the induced character .
Facts & Assumptions
Given: A finite group , a subgroup , and an irreducible complex character of .
Over , every finite-dimensional representation of a finite group is completely reducible (If , every finite-dimensional representation of is completely reducible).
The multiplicity of an irreducible constituent is the corresponding character inner product (The multiplicity of an irreducible summand is a character inner product).
Frobenius reciprocity gives (Frobenius reciprocity for complex characters).
Proof
Let be an irreducible representation of affording . Its restriction to is completely reducible by [F1], so for irreducible -representations with characters .
Because is nonzero, some multiplicity is positive. By [F2], this means .
Applying [F3] to gives .
The strict positivity in step 3.1 means that occurs in the induced character , by the multiplicity interpretation of [F2].
The chosen irreducible constituent therefore has the required property.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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
- Peter Webb, A Course in Finite Group Representation Theory, Corollary 4.3.8 (standard reference, not scraped)
- Anupam Singh, Representation Theory of Finite Groups, Chapter 19 (standard reference, not scraped)