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.
Induction of an inertia constituent is irreducible
Statement
Let be finite, , , and . If is an irreducible complex -module lying over , then is -isotypical and is irreducible. Its -isotypical component is the identity-coset copy of , consisting of the covariant functions supported on .
Facts & Assumptions
Given: The groups, modules, characters, and hypotheses in the statement. All representations here are finite-dimensional complex left representations.
For an irreducible module of a finite group, restriction to a normal subgroup has one orbit of constituents. (Normal restriction has one orbit of constituents).
An -submodule of a complex -module is the direct sum of its intersections with the normal isotypical components. (Translation permutes normal isotypical components).
Evaluation on a finite left transversal identifies an induced function module with the direct sum of its coset-supported copies of the inducing space. (A left transversal identifies with a direct sum of copies of ).
Proof
Apply the orbit result inside : every element of fixes , so is a positive number of copies of .
Use a left transversal containing , and write , where consists of functions supported on . For , covariance gives . Thus evaluation makes a module of type . These types are distinct for distinct , so the are exactly the normal isotypical components, and as an -module.
If is a nonzero -submodule, the intersection decomposition gives for some . Left translation by carries onto and preserves , so . This intersection is -stable, hence equals by irreducibility of . Translating back fills every , giving . This includes (one block) and (induction of the chosen normal type).
Depends on
Used by
- Clifford correspondence Theorem
Dependency tree · two levels
12 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 — Theorem 4.2.4(1) pp.55–56; Späth Theorem 1.2 (standard reference, not scraped)