Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Dixmier's lemma: endomorphisms of a simple module over a countable-dimensional algebra

Statement

Let A be a unital C-algebra which admits a countable C-basis, and let M be a simple left A-module. Then every A-endomorphism of M is multiplication by a scalar: End⁡A(M)=C⋅id⁡M. Consequently the center Z(A) acts on M by scalars and there is a unital C-algebra homomorphism χ ⁣:Z(A)→C with zm=χ(z)m for all z∈Z(A), m∈M. In particular this applies to A=U(g) for a finite-dimensional complex Lie algebra g.

Facts & Assumptions

Given: A unital C-algebra A with a countable C-basis, a simple left A-module M, and D:=End⁡A(M).

[F1]

A nonzero homomorphism between simple modules is an isomorphism, and the endomorphism ring of a simple module is a division ring (Schur's lemma for simple modules, Division ring: a ring with 1≠0 in which every nonzero element is a unit).

[F2]

D=End⁡A(M) is a unital ring under pointwise addition and composition, and it is a C-algebra whose scalars λid⁡M are central: λid⁡M is A-linear because the scalar action of A is C-linear (The endomorphism ring End⁡R(M) under addition and composition, Division ring: a ring with 1≠0 in which every nonzero element is a unit).

[F3]

M is simple and nonzero, so for every 0≠v∈M the submodule Av is nonzero, hence equal to M (Simple module: a nonzero module with no proper nonzero submodule).

[F4]

C is algebraically closed, so every nonconstant polynomial in C[t] is a product of linear factors; in a division ring a product of nonzero elements is nonzero, so a product of nonzero factors is zero only if one factor is zero (The complex numbers are algebraically closed, Division ring: a ring with 1≠0 in which every nonzero element is a unit).

[F6]

If a vector space over a field is spanned by n vectors, then every linearly independent subset is finite with at most n elements (If V has a spanning set with n elements, then every linearly independent subset of V is finite with at most n elements; in particular V has no linearly independent subset equinumerous with N); N×N≈N (N×N≈N); every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable); R is uncountable (R is uncountable (Cantor's nested intervals, 1874)) and embeds in C as the constant classes, whence C is uncountable (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i, Finite, countably infinite, countable, uncountable).

[F7]

For a finite-dimensional complex Lie algebra g with ordered basis x1,…,xr, the ordered monomials x1a1⋯xrar form a basis of U(g) (PBW gives an ordered monomial basis for the enveloping algebra, The universal enveloping algebra as a tensor quotient); the set of exponent tuples is a finite product of copies of N, hence at most countable (A product of two at most countable sets is at most countable, Finite, countably infinite, countable, uncountable).

Proof

technique · contradiction
1.1F1F2given

By [F1], D is a division ring. The map C→D, λ↦λid⁡M, is an injective unital ring homomorphism onto a central copy of C by [F2], so D is a C-division algebra containing C in its center.

1.2F6construct

Let V be a C-vector space spanned by a sequence b1,b2,… and let L⊆V be linearly independent. Then L is at most countable. Indeed, put Vk=span⁡(b1,…,bk); the recursive rule that retains bi exactly when bi∉span⁡(retained bj, j<i) is a definition by recursion on i and is a canonical ordered basis (c1,…,cdk) of Vk with dk≤k: retained elements are independent and each bi lies in the span of the retained elements up to i. Hence every v∈Vk has a unique coordinate vector in Cdk. Order C by real part and then imaginary part, and Cdk lexicographically. Since V=⋃kVk, for v∈L the set of k with v∈Vk is nonempty and n(v):=min⁡{k:v∈Vk} is well defined; let Lk={v∈L:n(v)=k}. Each Lk is linearly independent in Vk, hence finite of size at most dk≤k by [F6], so the set {w∈Lk:w<v} is finite. Now f(v):=(n(v),#{w∈Ln(v):w<v}) lies in N×N and is injective: if n(v)=n(w) and the two counts agree, then the coordinate vectors of v and w are not distinct, because if one preceded the other lexicographically the corresponding counts would differ; totality of the lexicographic order gives v=w. Thus L injects into the at most countable set N×N and is at most countable.

1.3F7

For g finite-dimensional, U(g) has a countable C-basis by [F7].

2.1F3step 1.2given

Since M is a quotient of A as a C-vector space — the map a↦av is a surjective C-linear map for any 0≠v∈M by [F3] — it is spanned by the images of a countable basis of A. Applying step 1.2 with this spanning sequence, every linearly independent subset of M is at most countable.

2.2F4step 1.1assume-contragiven

Suppose, for contradiction, that D≠C and choose x∈D∖C; then x is transcendental over C. For otherwise p(x)=0 for a nonzero p∈C[t]; by [F4] write p=c∏i(t−ai) with c≠0, so c∏i(x−ai)=0 and one factor x−ai is zero, giving x=ai∈C, a contradiction.

3.1F5step 2.2algebra

Let x be transcendental as in step 2.2. Evaluation C[t]→D, p↦p(x), is an injective unital homomorphism whose image is commutative because x commutes with the central copy of C. Every nonzero p has p(x)≠0 and D is a division ring, so p(x) is a unit; the formula f/g↦f(x)g(x)−1 is therefore well defined — two representations of the same fraction cross-multiply, and multiplying the resulting identity by the inverses gives equality — and defines an injective field homomorphism C(t)→D by [F5]. In particular, for a∈C the elements ua:=(x−a)−1 exist in D. They are C-linearly independent: if ∑iλiuai=0 with distinct ai, multiplying by ∏i(x−ai) gives p(x)=0 for p(t)=∑iλi∏j≠i(t−aj); injectivity of p↦p(x) forces p=0, and evaluating at t=aj gives λj∏i≠j(aj−ai)=0, so λj=0 because the factors aj−ai are nonzero.

4.1F3F6step 3.1algebra

Fix 0≠v∈M. The evaluation map ev⁡v ⁣:D→M, T↦Tv, is C-linear and injective: if Tv=0 then T(av)=a(Tv)=0 for every a∈A because T is A-linear, and Av=M by [F3], so T=0. Hence the vectors (ev⁡v(ua))a∈C=((x−a)−1v)a∈C form a C-linearly independent subset S⊆M by step 3.1. The assignment a↦(x−a)−1v is a bijection C→S — injective because its values are linearly independent — and C is uncountable by [F6], so S is uncountable.

5.1step 1.3step 2.1step 4.1givenalgebradischarge-contradiction∎

Step 2.1 makes every linearly independent subset of M, in particular S, at most countable, while step 4.1 makes S uncountable; this contradiction forces D=C, so every A-endomorphism of M is a scalar. Consequently, for z∈Z(A) the map μz ⁣:M→M, m↦zm, is A-linear because μz(am)=z(am)=(az)m=a(zm) for a∈A, so μz=χ(z)id⁡M for some χ(z)∈C; the assignment χ ⁣:Z(A)→C is a unital algebra homomorphism since μzz′=μz∘μz′ and μ1=id⁡M with M≠0. By step 1.3 the hypotheses hold for A=U(g) with g finite-dimensional.

Depends on

Used by

Dependency tree · two levels

103 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