Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 N be a finite group, let S be an irreducible complex N-module with character θ, and let U be a finite-dimensional θ-isotypical N-module, allowing U=0. Put M=HomN(S,U) and give M the trivial N-action. Evaluation is an N-isomorphism EU:SCMU,sff(s). Every N-submodule U0U is EU(SM0) for a unique subspace M0M, namely M0=HomN(S,U0) viewed inside M by inclusion. If U is another such module and M=HomN(S,U), then every N-map UU is uniquely EU(1Sa)EU1 for a linear map a:MM. 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.

[F1]

Finite-dimensional complex representations of a finite group are completely reducible. (If charkG, every finite-dimensional representation of G is completely reducible).

[F2]

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).

[F3]

The tensor representation has diagonal action on elementary tensors; in particular, when the second factor is trivial, n(sm)=(ns)m. (The tensor product of two complex representations).

[F4]

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

technique · direct
1.1

The map (s,f)f(s) is complex bilinear, so the tensor universal property defines evaluation. It is complex linear since this is true on elementary tensors, and it is N-linear because f(ns)=nf(s) and N acts trivially on the second factor.

F3F4given
2.1

Complete reducibility and the isotypical hypothesis give USm for some integer m0. Fix inclusions j1,,jm:SU from such a decomposition. Each component of an N-map SU is a scalar endomorphism of S, so the ja form a basis of M. Evaluation sends sja to ja(s) and is therefore an isomorphism. When m=0, both spaces and this map are zero.

F1F2step 1.1
3.1

If U0U is an N-submodule, it is completely reducible. Every simple summand R of U0 is isomorphic to S: some coordinate projection RS is nonzero, and its kernel and image are submodules, forcing an isomorphism. Apply step 2.1 to U0. Inclusion of its Hom space into M intertwines the two evaluation maps on every elementary tensor, hence gives equality of actual subspaces U0=EU(SM0), with M0=HomN(S,U0).

F1step 2.1algebra
4.1

For any subspace M0M, the space EU(SM0) is N-stable. The natural map M0HomN(S,EU(SM0)), sending m to (sEU(sm)), is an isomorphism by the scalar-coordinate calculation of step 2.1, and agrees with inclusion into M. Thus recovery of M0 is exact and unique, including M0=0 and M0=M.

F3step 2.1step 3.1
5.1

Choose simple decompositions of U and U. An N-map between them is a matrix whose entries are endomorphisms of S, hence scalars. Those scalar matrices are exactly the linear maps a:MM. This proves the map assertion and uniqueness, also if either multiplicity space is zero. Composition satisfies (1Sb)(1Sa)=1S(ba) on elementary tensors, proving compatibility.

F2step 2.1algebra

Depends on

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