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.
Mackey's irreducibility criterion for finite groups
Statement
Let be a finite group, let , let be an irreducible complex character of , and let be representatives for with . Then is irreducible if and only if for every ,
Facts & Assumptions
Given: A finite group , a subgroup , an irreducible complex character of , and representatives for with .
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 ).
Frobenius reciprocity gives (Frobenius reciprocity for complex characters).
Mackey's formula expands as a sum over the double cosets in (Mackey's double-coset formula for restricting an induced character).
Proof
Because is irreducible, [F1] gives . Applying [F2] with gives .
Apply [F3] to the restriction on the right side of step 1.1. The term for the identity double coset is exactly , so it contributes . Every other term is , whose inner product with is, by another use of [F2], precisely .
Therefore . Each summand is a multiplicity and hence a nonnegative integer.
The self-inner-product in step 3.1 equals if and only if every nonidentity summand vanishes. By [F1], that is equivalent to being irreducible.
Depends on
Used by
Nothing in the library uses this result yet.
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
- Anupam Singh, Representation Theory of Finite Groups, Theorem 20.9 (standard reference, not scraped)
- Peter Webb, A Course in Finite Group Representation Theory, Section 5.2 (standard reference, not scraped)