Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Integrable bounded-above quantum modules with finite-dimensional weight spaces are direct sums of simple highest weight modules

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let M be a Uq(g)-module over Q(q) for a finite symmetrizable Cartan datum such that

(a) M is a weight module with dim⁡Q(q)Mμ<∞ for every μ∈P (Quantum weight modules, weights in P, and integrability);

(b) the weight set wt(M) is bounded above: it is contained in a finite union ⋃j=1s(λj−Q+);

(c) M is integrable, i.e. Ei and Fi act locally nilpotently for every i.

Then M is isomorphic to an algebraic direct sum of simple integrable highest weight modules L(λ), λ∈P+ (The integrable quantum highest weight module exists and is unique); concretely, every nonzero submodule of M contains a maximal vector v whose cyclic submodule Uq(g)v is isomorphic to L(λ) for some λ∈P+, and M is the direct sum of the submodules generated by the vectors of any maximal independent family of simple submodules. AC is used exactly to select a maximal independent family of simple submodules simultaneously; restricted to any module generated by one finite-dimensional U≥0-submodule the decomposition is obtained by a finite induction and is choice-free. The finite-cone modules use the explicit label grading, and the regularization supplier is used when the original pairing is not separating (Finite-support regularization of quantum label-weight modules).

Facts & Assumptions

Given: The module M satisfying (a)-(c), the subalgebra U≥0=Uq≥0 generated by Uq0 and the Ei (Positive, negative and toral quantum subalgebras and their root gradings), and the rank-one subalgebras Ai=⟨Ei,Fi,Ki±1⟩.

[F1]

Rank-one relations and divided formulas: KiEiKi−1=qi2Ei, KiFiKi−1=qi−2Fi, [Ei,Fi]=(Ki−Ki−1)/(qi−qi−1), and FiFi(n)=[n+1]iFi(n+1). If Eiy=0 and Kiy=qiay, then EiFi(n)y=[a−n+1]iFi(n−1)y. The divided-power commutation formula moves an Ei to the right of an Fi-power with only lower Fi-powers and toral coefficients. The qi-integers vanish exactly at integer 0 (Divided-power commutation and the simple Uqi(sl2) string modules, Quantum integers, factorials, Gaussian binomials and divided powers at qi).

[F2]

For every x∈M there are integers A,N≥0 with FiAx=0 and EiNx=0 (local nilpotence); weight spaces are finite-dimensional and weights are bounded above as in (b) (Quantum weight modules, weights in P, and integrability).

[F3]

Simple integrable highest weight modules: for λ∈P+, L(λ) is the unique (up to isomorphism) integrable cyclic highest weight module of highest weight λ, realized as the Serre quotient of the Verma module and simple also as an ordinary module; it carries the normalized nondegenerate contravariant form (The integrable quantum highest weight module exists and is unique, Cartan projection constructs the Verma contravariant form and identifies its radical).

[F4]

The restricted dual M∗=⨁μHom⁡Q(q)(Mμ,Q(q)) is a Uq(g)-module under (u⋅f)(x):=f(σ(u)x) for the linear anti-involution σ with σ(Kh)=Kh, σ(Ei)=qiFiKi−1, σ(Fi)=qi−1KiEi, and the evaluation pairing is invariant; for a functional supported on finitely many weights the shifted supports remain finite, so restricted duals and their submodules are honest weight modules with finite-dimensional weight spaces (The contravariant form on an integrable highest weight module).

[F5]

Local nilpotence is inherited by every ordinary submodule. Graded submodules and graded quotients inherit the chosen label grading, finite-dimensional label spaces and the finite upper-cone bound. Taking the label components of a finite-dimensional subspace gives a finite-dimensional graded hull; if the original subspace is U≥0-stable, its graded hull is too, since Ei shifts labels and the torus acts diagonally (Submodule of a module, Quantum weight modules, weights in P, and integrability).

[F6]

The regularization supplier replaces the datum by an auxiliary one with the same labels, preserving gradings, actions and weight dimensions, so all statements proved for separating labels transport back (Finite-support regularization of quantum label-weight modules, Local q=1 deformation proves integrable highest weight universality).

[F7]

A module that is the sum of a family of simple submodules that is maximal with respect to having a direct sum is the algebraic direct sum of that family: if a simple submodule is not contained in the sum, it intersects it in zero and enlarges the independent family. The family {L(\lambda):\lambda\in P^+} is a set and every simple submodule of M is isomorphic to one L(λ) by [F3]; AC is invoked exactly here, in the form of a maximal independent family in the set of simple submodules (The direct sum of an indexed family of modules, The Axiom of Choice).

Proof

technique · finite upper-cone support makes each positive cyclic span finite. The rank-one string decomposition bounds each fixed simple-root line, proving integrability of the restricted dual. A maximal label in a finite graded generating space gives a duality retraction; induction splits its finite generated module, and AC selects a maximal independent family only at the final algebraic direct-sum step
1.1F1F2algebra

Finite rank-one reduction. For homogeneous x, choose N≥1 with EiNx=0 and put Wx:=span⁡{Fi(a)Eibx:0≤b<N, a≥0}. Local nilpotence of Fi on each of the finitely many Eibx makes this span finite. The divided commutation formula of [F1] proves Ei preserves it, while Fi and Ki±1 preserve it directly. Thus Wx is a finite-dimensional type-one Ai-module, with Ei,Fi nilpotent and Ki diagonalizable; its labels lie on the single line through wt(x). A general vector has finite label support, so it too lies in a finite sum of such modules.

2.1step 1.1F1F2algebra

Finite rank-one strings, proved locally. In a finite-dimensional type-one Ai-module, a nonzero Ei-highest eigenvector y of integer weight a has a minimal t≥1 with Fi(t)y=0. Applying Ei and [F1] gives [a−t+1]iFi(t−1)y=0, hence t=a+1 and a≥0; the positions Fi(n)y, 0≤n≤a, are nonzero and have distinct Ki-eigenvalues. Each simple composition factor has such a vector (take an eigencomponent of a last nonzero Ei-iterate), whose string is a nonzero submodule and therefore the entire factor. Put C:=FiEi+(qiKi+qi−1Ki−1)/(qi−qi−1)2. The relations of [F1] give [C,Ei]=[C,Fi]=[C,Ki]=0, and C acts on a highest string of weight a by ca=(qia+1+qi−a−1)/(qi−qi−1)2. These scalars are distinct for a≥0: equality factors as (qia+1−qib+1)(1−qi−a−b−2)=0, forcing a=b. Split a finite module into its generalized C-eigenspaces. In the ca-block all composition factors are strings of highest weight a, so if their number is k, the Ki-weight spaces a,a−2,…,−a all have dimension k and there are no other weights. Its top space is killed by Ei; the maps Fi(n) on that space are injective for n≤a by the first endpoint argument and vanish for n>a. Their images therefore exhaust the block's distinct weight spaces. This proves the finite string decomposition without assuming rank-one complete reducibility. Applied to Wx, the tops and positions have the chosen labels: on its single root line, the Ki-eigenvalue determines the label since ⟨αi,hi⟩=2.

3.1step 2.1F2F4F5algebra

Positive spans and restricted-dual integrability. The labels of U≥0x lie above one of the finitely many labels of x and below one of the finitely many upper labels λj. Each interval contains finitely many labels because the simple roots freely generate Q, and each label space is finite-dimensional, so U≥0x is finite-dimensional. Fix μ,i and an integer T≥0 with Mμ+tαi=0 for all integers t>T; such a bound follows from the αi coefficient in each possible expression λj−μ−tαi∈Q+. Put a=⟨μ,hi⟩. By step 2.1, any vector on this line is a sum of positions of strings whose top is μ+tαi with t≤T, highest integer a+2t≥0 and position 0≤n≤a+2t. The position label μ+(t−n)αi satisfies −a−T≤t−n≤T. Thus the line has finite support. Under [F4], Ei raises and Fi lowers a functional's support by αi; both sufficiently high powers vanish for a functional at μ. Finite maxima over its finite label support prove that M∗, and the restricted dual of any graded submodule with the same upper bound, is integrable. No global coroot bound is used.

3.2step 2.1F3F5algebra

Maximal vectors. Let F⊆M be a nonzero finite-dimensional graded U≥0-stable subspace and choose a maximal label μ in its finite support. Pick 0≠vμ∈Fμ. Since Fμ+αi=0 for each i, every Ei kills vμ. Step 2.1 applied in its finite rank-one module gives ⟨μ,hi⟩≥0 for every i, so μ∈P+. The cyclic module L:=Uqvμ is integrable and isomorphic to the ordinary-simple L(μ) by [F3].

4.1step 3.1step 3.2F3F4F5algebra

The duality retraction. Put N:=UqF=Uq−F. Its support lies in the finite union ⋃ν∈wt(F)(ν−Q+); maximality of μ implies Nμ+αi=0 for each i and Nμ=Fμ, without requiring the other maximal labels to lie below μ. Choose ψ∈(Nμ)∗ with ψ(vμ)=1 and extend it by zero on the other labels. Since σ(Ei) lowers a label by αi, Eiψ=0. By step 3.1, the whole restricted dual N∗ is integrable, so W:=Uqψ is the integrable highest module L(μ) by [F3]. Evaluation gives a grading-preserving module map Φ:N→Wres∗, with Φ(x)(w)=w(x): a finite-label vector x defines a finite-label functional, and invariance follows from [F4]. The homogeneous nondegenerate contravariant form on W identifies W with its restricted dual on each finite-dimensional label space. Choose the unique normalized highest-vector isomorphism W≅L and rescale the composite so that π(vμ)=vμ; this is possible since evaluation on (vμ,ψ) is 1. The grading-preserving module map π:N→L restricts to the identity on the cyclic simple L, hence N=L⊕ker⁡π.

5.1step 3.2step 4.1F3F5algebra

Finite induction. For the graded F of steps 3.2 and 4.1 put G:=(id−π)F. The grading-preserving retraction makes G graded, finite-dimensional and U≥0-stable, and UqG=ker⁡π. Since vμ∈F∩L is killed by id−π, dim⁡G<dim⁡F. Induction on dim⁡F therefore decomposes UqF as a finite direct sum of simple highest modules. This also covers an arbitrary finite-dimensional U≥0-stable generating space F0: its finite graded hull F is stable by [F5], and UqF0 is an ordinary submodule of the finite direct sum UqF. Every submodule of a finite direct sum of ordinary simple modules is itself a finite direct sum of simples: induct on the number of summands, splitting off the first summand if it is contained in the submodule, and otherwise inject the submodule into the remaining summands by projection. Each resulting simple is isomorphic to a summand by a nonzero coordinate projection. This argument uses only finite choices.

6.1step 3.1step 5.1F3F5F6F7choosealgebra∎

The general module. For x∈M, the finite graded hull of U≥0x is finite and stable by step 3.1 and [F5], so step 5.1 places x in a finite sum of ordinary-simple highest modules. Hence M is a sum of simple submodules. By AC choose a maximal independent family in the set of simple submodules; an ordinary simple not contained in its sum has zero intersection with that sum and would enlarge the family, so maximality gives M=⨁αSα. Every Sα is isomorphic to some L(λ) by a nonzero coordinate projection to one of the finite highest-module sums containing a nonzero vector of Sα. For a nonzero ordinary submodule V⊆M, choose 0≠x∈V and a finite simple sum containing x. Its intersection with V is a nonzero submodule of that finite sum, so step 5.1 gives a simple highest-module copy inside V; the image of its highest vector is a maximal vector whose cyclic submodule is that copy. This proves the concrete clause as an ordinary-module assertion, without assuming an ordinary submodule respects the chosen label grading. The original finite label grading and [F6] retain the datum convention throughout. AC occurs only at the maximal-family step; all finite generated cases were choice-free.

Depends on

Used by

Dependency tree · two levels

48 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