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.

Finite semisimple matrix density and the double commutant over Q

Statement

Let G be a finite group, W a finite-dimensional rational representation, and B⊆End⁡Q(W) the image of Q[G]. Then B=End⁡End⁡B(W)(W). No algebraic-closure, splitting, or commutativity hypothesis on the division algebras of simple summands is required.

Facts & Assumptions

Given: A finite group G, a finite-dimensional left Q[G]-module W, and the finite-complement result below.

[F1]

Every submodule of a finite direct sum of simple modules is a direct sum of a subfamily and has a complement; finite-dimensional modules have finite composition series (Finite matrix and module preliminaries: right inverses, rank invariance, finite length and nilpotent trace).

Proof

Given: The data in [F1].

1.1givenF1algebra

Let U⊆W be a G-submodule and choose a rational linear projection p:W→U that is the identity on U. The average P=∣G∣−1∑g∈Ggpg−1 has image in U, restricts to the identity on U, and satisfies hPh−1=P for every h∈G by reindexing the finite sum. Thus P is a G-linear projection and ker⁡P complements U. Selecting a nonzero submodule of least positive rational dimension makes it simple; splitting it off and inducting on dimension writes W=⨁λSλmλ with finitely many pairwise nonisomorphic simple modules Sλ.

1.2givenF1algebra

For a simple S, D=End⁡B(S) is a division ring: a nonzero module map has zero kernel and nonzero image, so is bijective and its inverse is again a module map. Give S the right Dop-action s⋅dop=d(s). It has a finite basis over this division ring: a Dop-independent list is rationally independent because Q idS⊆D, so its length is bounded by dim⁡QS; a list of maximal length spans. Write this basis as v1,…,vd.

2.1givenF1step 1.2algebra

The evaluation image I={(bv1,…,bvd):b∈B}⊆Sd is a B-submodule. If it were proper, [F1] would give a nonzero complement; projecting onto one simple summand of that complement and identifying it with S gives a nonzero B-map f:Sd→S that vanishes on I. Every such map has the form f(x1,…,xd)=∑jdj(xj) with dj∈D. For b∈B, 0=f(bv1,…,bvd)=b∑jdj(vj), so at b=1 one gets ∑jvj⋅djop=0. The chosen right Dop-basis forces every dj=0, contradicting f≠0. Hence evaluation is onto. Any Dop-linear endomorphism of S is therefore the action of some b∈B: choose b with the prescribed values on the basis, then both maps are Dop-linear and agree on that basis. Thus the image of B on S is End⁡Dop(S).

3.1givenF1step 1.2step 2.1algebra

Apply the same evaluation argument simultaneously to one chosen Dλop-basis of each Sλ. The target is X=⨁λSλdλ. If the image of B→X, b↦(bvλ,j)λ,j, were proper, [F1] would provide a nonzero B-map f:X→Sμ killing that image for some simple type μ. A map from Sλ to Sμ is zero for λ≠μ, since a nonzero map between simple modules is an isomorphism; the remaining coordinates of f are maps dj∈Dμ. Evaluating at b=1 contradicts the Dμop-independence of the chosen basis of Sμ, exactly as in step 2.1. Therefore every tuple of target values on all these bases is attained by one b, and the image of B on the distinct simple types is the full independent product ∏λEnd⁡Dλop(Sλ).

4.1step 3.1algebra∎

On Wλ=Sλmλ this product acts by the same full algebra Rλ=End⁡Dλop(Sλ) on each copy. Its commutant on Sλ is exactly Dλ: a map commutes with Rλ iff it commutes with the image of B, which is equivalent to being in End⁡B(Sλ). Hence End⁡B(W)=⨁λMmλ(Dλ). To take its commutant on Wλ, first commute with the diagonal and off-diagonal copy matrix units; this forces zero off-diagonal blocks and the same map g:Sλ→Sλ on every diagonal block. Commuting with the diagonal Dλ maps is exactly the condition g(s⋅dop)=g(s)⋅dop, so g∈End⁡Dλop(Sλ)=Rλ. The independent central block projections eliminate maps between distinct λ. Thus the commutant of End⁡B(W) is precisely ⨁λRλ acting diagonally on the multiplicity copies, which is the image of B from step 3.1.

Depends on

Used by

Dependency tree · two levels

33 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