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.
Brauer induction
Statement
For every finite group , every complex virtual character of is an integral linear combination of characters , where is -elementary for some prime and is a linear complex character of .
Facts & Assumptions
The elementary detection relation is Elementary detection at a fixed element.
Elementary induction subgroups are ideals by The induction subgroup is an ideal.
Characters of elementary groups reduce integrally to induced linear characters by Characters of elementary groups are induced from linear characters.
Induction is transitive by Induction is transitive along subgroup chains.
Proof
Given: is the family of all elementary subgroups of , and is its induction ideal.
If is trivial, the assertion is immediate. Otherwise, for every prime , write with . By [F1], . The integers have greatest common divisor : for each prime divisor of , the particular integer is prime to . Bézout therefore gives .
By [F2], every satisfies . Thus it is an integral sum of characters with elementary and .
By [F3], each such is an integral combination of characters induced from linear characters of elementary subgroups . Transitivity [F4] changes into , which is exactly the claimed form. ∎
Depends on
Used by
Dependency tree · two levels
20 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
- Wen-Wei Li, Yanqi Lake Lectures on Algebra I, Theorem 14.3.1 and Corollary 14.3.2 (Lecture 14.3, PDF pp. 168–170) (standard reference, not scraped)
- János Kramár, Artin's and Brauer's Theorems on Induced Characters, Theorem 2 (standard reference, not scraped)