Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Representations of diagonalizable groups split into character eigenspaces

Statement

Let k be a field and let G be a diagonalizable group over k, so that O(G)=k[M] for an abelian group M with group-like basis (em)m∈M (Diagonalizable groups and their character modules). Then every rational representation (V,ρ) of G (Rational representations and comodules of an affine group scheme) decomposes as V=⨁χ∈MVχ,Vχ={v∈V:ρ(v)=v⊗eχ}, a direct sum over the characters χ∈X(G)=M of G of the corresponding eigenspaces. The eigenspaces may have arbitrary multiplicities. The decomposition is choice-free and is inherited by subrepresentations, quotients and the middle terms of extensions. In finite dimension, choosing finite bases of the nonzero eigenspaces expresses a representation as a finite direct sum of one-dimensional character representations; in particular G is linearly reductive. Assuming the Axiom of Choice (The Axiom of Choice), the same character-line decomposition holds in arbitrary dimension by Every vector space has a basis; only this last assertion uses arbitrary choice.

Facts & Assumptions

Given: A field k, a diagonalizable group G with O(G)=k[M], and a rational representation (V,ρ) of G.

[F1]

For any abelian group M, A=k[M] has basis (em)m∈M, Δ(em)=em⊗em, ε(em)=1, and S(em)=e−m. For arbitrary M, use the same rational-representation convention as in the finite-type case: a natural family of group homomorphisms rR:G(R)→Aut⁡R(V⊗kR). A coaction is a linear map ρ:V→V⊗kA satisfying the counit and coassociativity identities. The correspondence in this generality is proved in step 1.1 below, rather than assumed from the finite-type suppliers. (Diagonalizable groups and their character modules, Rational representations and comodules of an affine group scheme)

[F2]

For each m, the explicit coordinate functional cm:A→k sends en to δmn. Applying id⁡V⊗cm extracts the coefficient of em uniquely, without choosing a basis of V. The sets Vm={v:ρ(v)=v⊗em} are linear subspaces. (Linear subspace of a vector space)

[F3]

The cited representation/comodule correspondence is stated for finite-type affine group schemes. The coefficient and universal-point argument below establishes the needed extension to Dk(M) with no finiteness restriction on M. In a coaction, the counit identity gives v=∑mvm whenever ρ(v)=∑mvm⊗em. (Rational representations of an affine group scheme are comodules of its coordinate Hopf algebra)

[F4]

Assuming AC, every vector space has a basis (The Axiom of Choice, Every vector space has a basis). Finite-dimensional spaces have finite bases without arbitrary choice.

Proof

Given: A field k, a diagonalizable group G with character group M, and a comodule (V,ρ).

1.1F1F2F3algebra

The correspondence holds for arbitrary M. Given a natural action r, evaluate it at the universal point u=id⁡A∈G(A) and put ρ(v)=rA(u)(v⊗1). Naturality along g:A→R gives rR(g)(v⊗1)=(id⁡V⊗g)ρ(v). At g=ε the identity action yields the counit identity. In G(A⊗A) the two points p1(a)=a⊗1 and p2(a)=1⊗a have product Δ; evaluating r(p1)r(p2)=r(Δ) at v⊗1 yields (ρ⊗id⁡)ρ(v)=(id⁡⊗Δ)ρ(v). Conversely this coassociativity identity makes the displayed formula for rR(g) multiplicative; the counit gives the identity and g−1 gives its inverse. These constructions are inverse by evaluation at u, and a subspace is stable under all rR(g) exactly when it is a subcomodule, by the same evaluation. No finite-type hypothesis or basis of V is used. Finally, the group-like elements of A are exactly em: if a=∑mamem is group-like, comparing coefficients in Δ(a)=a⊗a gives am2=am and aman=0 for m≠n, while ε(a)=1 gives ∑mam=1; over a field exactly one coefficient is 1. Thus X(G)=M.

1.2F1F3algebra

For v∈V write ρ(v)=∑m∈Mvm⊗em with vm∈V, a finite sum by [F1]. Applying (id⁡⊗Δ) and (ρ⊗id⁡) to this expression and using coassociativity gives (ρ⊗id⁡)ρ(v)=∑mρ(vm)⊗em and (id⁡⊗Δ)ρ(v)=∑mvm⊗em⊗em, so comparing the coefficients of the basis elements en⊗em of k[M]⊗k[M] in these two expressions gives ρ(vm)=vm⊗em for every m: indeed the coefficient of en⊗em with n≠m vanishes on the right and equals the en-component of ρ(vm) on the left, and the remaining coefficient identifies the em-component of ρ(vm) with vm.

2.1F1F2step 1.2

The counit identity of [F3] applied to the expansion of [step 1.2] gives v=∑mvm with each vm∈Vm={w:ρ(w)=w⊗em}. Hence V=∑m∈MVm. If ∑mwm=0 is a finite relation with wm∈Vm, applying ρ gives ∑mwm⊗em=0; extraction by id⁡V⊗cn gives wn=0 for every n. Thus the sum is direct.

3.1F1F3step 2.1

If W⊆V is a subrepresentation, coefficient extraction in ρ(W)⊆W⊗k[M] gives W=⨁m(W∩Vm). An equivariant linear map preserves every weight, so a quotient has its corresponding weight decomposition; the middle term of any extension has the decomposition of step 2.1. No eigenspace is asserted to have dimension one. If V is finite-dimensional, there are finitely many nonzero eigenspaces and choosing their finite bases expresses V as a finite direct sum of character lines. Thus finite-dimensional representations are semisimple and G is linearly reductive.

4.1F4step 2.1step 3.1choose∎

For an arbitrary-dimensional V, assume AC and choose a basis of each nonzero Vm simultaneously by [F4]. Their union is a basis of V by the direct sum decomposition, and its one-dimensional spans are character representations. This proves the additional arbitrary-dimensional character-line assertion, with AC spent only in these basis choices.

Depends on

Used by

Dependency tree · two levels

31 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