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.
Induced Representations, Frobenius Reciprocity and Applications — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Characters and the Orthogonality Relations
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Induced Representations, Frobenius Reciprocity and Applications
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Maschke's Theorem, Complete Reducibility and the Structure of k[G]
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Group Algebra and Representations of Finite Groups
- The ZFC Axioms and the Basic Set Constructions
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The companion examples keep the computations inside one legal witness family. The subgroup supplies the nontrivial induction whose character is already irreducible of degree two, while a subgroup of order two supplies the contrasting induction that splits as . Those two witnesses are enough to see Frobenius reciprocity numerically and to refute the common mistakes that induction and restriction preserve irreducibility or compose to the identity.
The last example changes theme from multiplicities to divisibility. The cyclic group shows that the theorem is only a necessary condition for an irreducible degree: divisors of the group order need not all occur.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
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 .
Restricting that degree-two character to the three-cycle subgroup gives the two nontrivial linear characters
Example
Let be the degree-two irreducible character of from the previous example. Then
the sum of the two nontrivial linear characters of .
Facts & Assumptions
Given: The degree-two character of from the previous example, and the two nontrivial linear characters and of .
The previous example identifies with the induced character (Inducing a nontrivial character of a three-cycle subgroup of gives an irreducible degree-two character).
Frobenius reciprocity identifies multiplicities before and after induction (Frobenius reciprocity for complex characters).
Verification
Restricting the values from [F1] to gives .
Frobenius reciprocity [F2] gives , and the same computation with gives multiplicity for .
The restriction has degree at the identity, while the two nontrivial linear characters already account for degree . Hence no trivial summand occurs, and .
Inducing the trivial character of a subgroup of order two in gives plus an irreducible degree-two character
Example
Let . Then is the permutation character on the three left cosets of , so it has values on the class types , transpositions, and -cycles. Subtracting the trivial character gives the irreducible degree-two character .
Facts & Assumptions
Given: The subgroup and its trivial character .
Inducing the trivial character gives the permutation representation on (Inducing the trivial representation gives the permutation representation on ).
The character of a permutation representation counts fixed points (The character of a permutation representation counts fixed points).
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 ).
Verification
By [F1] and [F2], the induced character counts fixed cosets of the left action on the three cosets of . The identity fixes all three cosets, a transposition fixes exactly one coset, and a -cycle fixes none, so .
Subtracting the trivial character gives the class function . Its self-inner-product is , so [F3] makes it irreducible; its value at the identity is , so it has degree .
Therefore with irreducible of degree .
Frobenius reciprocity matches multiplicities in the two preceding inductions
Example
For the two inductions on this page, Frobenius reciprocity gives the same multiplicity on both sides:
and
Facts & Assumptions
Given: The character and the two induced characters from the preceding examples.
The induction from of a nontrivial linear character is exactly (Inducing a nontrivial character of a three-cycle subgroup of gives an irreducible degree-two character).
The induction from a subgroup of order two is (Inducing the trivial character of a subgroup of order two in gives plus an irreducible degree-two character).
Frobenius reciprocity matches the two inner products (Frobenius reciprocity for complex characters).
Verification
By [F1], . By [F3], the matching inner product on is therefore also .
By [F2], . Again [F3] makes the inner product after restriction equal to the same value.
So both preceding inductions realize Frobenius reciprocity numerically with multiplicity on each side.
shows that divisibility of irreducible degrees by is not an equivalence
Example
The divisor of is not the degree of any irreducible complex character of . So the theorem is a necessary condition for irreducible degrees, not a characterization.
Facts & Assumptions
Given: The cyclic group .
A cyclic group of order exists and is finite (Every cyclic group is isomorphic to or to for its finite order ).
Every irreducible representation of a finite abelian group over a splitting field is one-dimensional (Every irreducible representation of a finite abelian group over a splitting field is one-dimensional).
Irreducible complex character degrees divide the group order (The degree of an irreducible complex character divides ).
Verification
By [F1], is a finite cyclic group of order , hence finite abelian.
Over , every irreducible representation of the finite abelian group has degree by [F2]. Therefore no irreducible complex character of has degree , even though .
This shows that [F3] is not an equivalence: a divisor of need not occur as an irreducible degree.
An induced irreducible complex character is always irreducible
Statement
False claim: if is an irreducible complex character of a subgroup , then is irreducible.
Facts & Assumptions
Given: The subgroup and its trivial character .
The induced character equals , where is irreducible of degree (Inducing the trivial character of a subgroup of order two in gives plus an irreducible degree-two character).
Refutation
The trivial character of the order-two subgroup is irreducible because every one-dimensional character is irreducible.
But [F1] shows that its induction to is , a nontrivial sum of two characters. So the induced character is reducible.
This single witness refutes the claim that induced irreducible characters are always irreducible.
Induction followed by restriction is the identity on complex representations
Statement
False claim: for every subgroup , the composite is the identity on complex representations of .
Facts & Assumptions
Given: The subgroup and the nontrivial linear character of .
Inducing to gives the irreducible degree-two character (Inducing a nontrivial character of a three-cycle subgroup of gives an irreducible degree-two character).
Restricting that degree-two character back to gives (Restricting that degree-two character to the three-cycle subgroup gives the two nontrivial linear characters).
Refutation
By [F1], .
Applying restriction and then [F2] gives .
So induction followed by restriction is not the identity in general.
Restriction of an irreducible complex representation is always irreducible
Statement
False claim: if a complex representation of is irreducible, then its restriction to every subgroup is irreducible.
Facts & Assumptions
Given: The irreducible degree-two character of and the subgroup .
The restriction of to is (Restricting that degree-two character to the three-cycle subgroup gives the two nontrivial linear characters).
Refutation
The character is irreducible on by the example that constructs it.
But [F1] writes its restriction to as the sum of two distinct nontrivial characters, so the restricted representation is reducible.
Therefore restriction does not preserve irreducibility in general.
Every divisor of is an irreducible character degree
Statement
False claim: if divides , then is the degree of some irreducible complex character of .
Facts & Assumptions
Given: The cyclic group .
In , the divisor of is not an irreducible character degree ( shows that divisibility of irreducible degrees by is not an equivalence).
Refutation
The integer divides .
But [F1] shows that no irreducible complex character of has degree .
Hence not every divisor of the group order occurs as an irreducible character degree.