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.
A positive integer multiple of the trivial character is an integral combination of cyclic permutation characters
Statement
Let be a finite group. Then there is an integral linear combination of characters induced from trivial characters of cyclic subgroups whose value is . Equivalently,
for cyclic subgroups and integers .
Facts & Assumptions
Given: A finite group and an element .
For every finite cyclic subgroup , the generator-indicator class function on is an integral linear combination of characters with cyclic (The generator-indicator class function of a cyclic group is obtained by Mobius inversion).
Frobenius' formula computes induced character values (Frobenius' formula for the character of an induced representation).
Induction is transitive along subgroup chains (Induction is transitive along subgroup chains).
Proof
For each cyclic subgroup , let be the class function from [F1], and define . The sum is finite because a finite group has only finitely many subgroups.
By [F2], for each cyclic one has . Fix . Among all cyclic subgroups , exactly one of them can make the summand indexed by nonzero, namely ; for that subgroup, the value of is . Therefore the double sum defining contributes exactly for each , so .
Step 2.1 holds for every , hence as class functions. Expanding each by [F1] and then using [F3] to replace by expresses as an integral linear combination of characters with cyclic. Thus has the required form.
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
- Tammo tom Dieck, Representation Theory, Proposition (4.5.1) (standard reference, not scraped)
- Janos Kramar, Artin's and Brauer's Theorems on Induced Characters, the displayed identity in Section 2 (standard reference, not scraped)
- Kay Yang, Rational Valued Characters, Theorem 12 and Corollary 4 (standard reference, not scraped)