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.
Isotypical evaluation and multiplicity subspaces
Statement
Let be a finite group, let be an irreducible complex -module with character , and let be a finite-dimensional -isotypical -module, allowing . Put and give the trivial -action. Evaluation is an -isomorphism Every -submodule is for a unique subspace , namely viewed inside by inclusion. If is another such module and , then every -map is uniquely for a linear map . These identifications preserve composition.
Facts & Assumptions
Given: The groups, modules, characters, and hypotheses in the statement. All representations here are finite-dimensional complex left representations.
Finite-dimensional complex representations of a finite group are completely reducible. (If , every finite-dimensional representation of is completely reducible).
Every endomorphism of an irreducible representation over an algebraically closed field is scalar. (Over an algebraically closed field, every endomorphism of an irreducible representation is scalar).
The tensor representation has diagonal action on elementary tensors; in particular, when the second factor is trivial, . (The tensor product of two complex representations).
A balanced map on a right and a left module induces a unique homomorphism from their tensor product, with the specified values on elementary tensors. (Universal property of the tensor product for balanced maps into abelian groups).
Proof
The map is complex bilinear, so the tensor universal property defines evaluation. It is complex linear since this is true on elementary tensors, and it is -linear because and acts trivially on the second factor.
Complete reducibility and the isotypical hypothesis give for some integer . Fix inclusions from such a decomposition. Each component of an -map is a scalar endomorphism of , so the form a basis of . Evaluation sends to and is therefore an isomorphism. When , both spaces and this map are zero.
If is an -submodule, it is completely reducible. Every simple summand of is isomorphic to : some coordinate projection is nonzero, and its kernel and image are submodules, forcing an isomorphism. Apply step 2.1 to . Inclusion of its Hom space into intertwines the two evaluation maps on every elementary tensor, hence gives equality of actual subspaces , with .
For any subspace , the space is -stable. The natural map , sending to , is an isomorphism by the scalar-coordinate calculation of step 2.1, and agrees with inclusion into . Thus recovery of is exact and unique, including and .
Choose simple decompositions of and . An -map between them is a matrix whose entries are endomorphisms of , hence scalars. Those scalar matrices are exactly the linear maps . This proves the map assertion and uniqueness, also if either multiplicity space is zero. Composition satisfies on elementary tensors, proving compatibility.
Depends on
- If $\operatorname{char} k \nmid |G|$, every finite-dimensional representation of $G$ is completely reducible
- Over an algebraically closed field, every endomorphism of an irreducible representation is scalar
- The tensor product of two complex representations
- Universal property of the tensor product for balanced maps into abelian groups
Used by
Dependency tree · two levels
16 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
- Ivan Losev, Representation Theory, Chapter 0. Basics — §2.3 Theorem 2.14, Corollary 2.16 and Proposition 2.17 pp.10–11 (standard reference, not scraped)