Alphabeta Math
DefinitionDefinition: 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.

The Kashiwara operators e~i and f~i of an integrable module

Definition

Let M be an integrable chosen P-graded type-1 module (Quantum weight modules, weights in P, and integrability) and fix i∈I. By Uniqueness of the i-string decomposition of an integrable module every u∈Mλ has a unique admissible decomposition u=∑n≥0Fi(n)un,un∈Hλ+nαi=ker⁡(Ei)∩Mλ+nαi, with un=0 whenever n>⟨λ+nαi,hi⟩. Define the Kashiwara operators e~iu:=∑n≥1Fi(n−1)un,f~iu:=∑n≥0Fi(n+1)un. Both are linear maps on M, shifting the label weight by +αi, respectively −αi. Along each string, e~i moves Fi(n)un to Fi(n−1)un and kills the top position n=0, while f~i moves it to Fi(n+1)un and kills a string exactly at its bottom, where n=⟨wt(un),hi⟩.

Let ptop and pbottom be the projections onto the top positions and the bottom positions of these strings: ptopu:=u0,pbottomu:=∑n: n=⟨λ+nαi,hi⟩Fi(n)un. Then ker⁡e~i=ker⁡Ei,ker⁡f~i=ker⁡Fi,f~ie~i=id−ptop,e~if~i=id−pbottom, so e~i and f~i are inverse to each other on each existing string edge. Module homomorphisms commute with both operators, ptop and pbottom. On ker⁡Ei one has f~i=Fi, and on ker⁡Fi one has e~i=Ei. At interior positions the operators differ from the generators: in the rank-one module Li(2) with highest vector v and u=Fiv, one has Fiu=[2]iFi(2)v while f~iu=Fi(2)v, and [2]i≠1. No choice principle is used. The analogous Kashiwara operators on the negative half Uq− are the shifts of its unique ei′-string decomposition (The i-string decomposition of the negative half), constructed using the skew derivation of Kashiwara's skew derivations ei′ and ei′′ on the negative half. Their strings have no bottom: e~if~i=id and f~ie~i=id−Pi, where Pi projects onto ker⁡ei′; the second identity follows by subtracting the position-zero coefficient u0=Piu from the string expansion. These string-shift operators are distinct from the skew derivations ei′,ei′′. No negative-half operator is used in the module verification below.

Facts & Assumptions

Given: An integrable chosen P-graded type-1 module M, an index i, and for every u∈Mλ its unique admissible decomposition u=∑n≥0Fi(n)un with un∈Hλ+nαi.

[F1]

M=⨁μ∈PMμ with Kh acting on Mμ by q⟨μ,h⟩, EiMμ⊆Mμ+αi, FiMμ⊆Mμ−αi, and Ei,Fi locally nilpotent; a nonzero element of Hμ has ⟨μ,hi⟩≥0, and Fi(n) is injective on Hμ for 0≤n≤⟨μ,hi⟩ and zero for n>⟨μ,hi⟩, with hi the simple coroot of the datum (Quantum weight modules, weights in P, and integrability, Uniqueness of the i-string decomposition of an integrable module).

[F2]

The decomposition of [F1] is unique and Mλ is the internal direct sum of the nonzero spaces Fi(n)Hλ+nαi; in particular the coefficient un and the position of each string are well defined (Uniqueness of the i-string decomposition of an integrable module).

[F3]

Divided powers satisfy FiFi(n)=[n+1]iFi(n+1) and EiFi(n)w=[a−n+1]iFi(n−1)w for w∈Hμ with a=⟨μ,hi⟩; the module Li(2) of dimension 3 has a highest vector v with Fiv=[1]iv1, Fiv1=[2]iv2, Fiv2=0, and [2]i=qi+qi−1≠1 (Divided-power commutation and the simple Uqi(sl2) string modules, parts (ii)-(iii), Quantum integers, factorials, Gaussian binomials and divided powers at qi).

Verification

technique · direct. All operators are read off the unique string decomposition string by string
1.1F1F2

Linearity and weights. On a string position Fi(n)un with un∈Hλ+nαi put e~i(Fi(n)un):=Fi(n−1)un for n≥1 and 0 for n=0, and f~i(Fi(n)un):=Fi(n+1)un. By [F2] every u is a unique sum of such positions inside its decomposition, so these prescriptions define linear maps on M; the shifted vectors lie in Mλ+αi and Mλ−αi respectively, since Fi(n−1)un∈Mλ+αi and Fi(n+1)un∈Mλ−αi by [F1].

2.1step 1.1F2

The top projection. Writing ptopu:=u0 gives a well-defined linear idempotent by [F2]. For u=∑nFi(n)un one has f~ie~iu=∑n≥1Fi(n)un by step 1.1, hence u−f~ie~iu=u0=ptopu; equivalently f~ie~i=id−ptop, and on each position with n≥1 the composition f~ie~i is the identity.

2.2F1step 1.1F2

The bottom projection. Put an:=⟨λ+nαi,hi⟩. A nonzero admissible coefficient has n≤an, and when n=an its shifted term Fi(n+1)un is zero by [F1]. Thus f~iu=∑n<anFi(n+1)un. Its admissible top coefficients are v0=0 and, for m≥1, vm=um−1 if m≤am−1, and vm=0 otherwise. Indeed vm∈Hλ−αi+mαi and the surviving positions satisfy m≤am−1, so [F2] identifies this as the unique admissible decomposition; bottom coefficients are discarded. Applying step 1.1 gives e~if~iu=∑n<anFi(n)un, hence u−e~if~iu=∑n=anFi(n)un=pbottomu; on every position that is not a bottom this composition is the identity.

2.3F1F3step 1.1

Kernels. For u=∑nFi(n)un, step 1.1 gives e~iu=0 exactly when un=0 for all n≥1, that is u=u0∈Hλ. On the other hand [F3] gives Eiu=∑n≥1[an−n+1]iFi(n−1)un with an=⟨λ+nαi,hi⟩; here an−n+1≥1 for n≤an by admissibility and the term vanishes for n>an, so Eiu=0 exactly when un=0 for all n≥1 as well; hence ker⁡e~i=ker⁡Ei. Likewise f~iu=∑n<anFi(n+1)un=0 exactly when un=0 for all n<an, and Fiu=∑n<an[n+1]iFi(n+1)un vanishes exactly then because [n+1]i≠0; hence ker⁡f~i=ker⁡Fi.

2.4F2F3step 1.1

Agreement on the kernels. If u∈ker⁡Ei then u=u0 by [F2], so f~iu=Fiu0=Fiu; if u∈ker⁡Fi then every nonzero coefficient un sits at a bottom, n=an, so Eiu=∑n≥1[an−n+1]iFi(n−1)un=∑n≥1Fi(n−1)un=e~iu; the n=an=0 strings contribute zero to both raising operators by [F3].

2.5step 1.1F2

Naturality. Let φ:M→N be a homomorphism of weight-graded Ai-modules, so φ commutes with Ei, Fi and Ki and preserves each Hμ and each weight space. Applying φ to the admissible decomposition of u gives the admissible decomposition of φ(u) by uniqueness [F2], because φ commutes with divided powers; hence φe~iu=e~iφ(u), φf~iu=f~iφ(u), and the same holds for the projections.

3.1F3step 1.1∎

Interior comparison. In Li(2) take the highest vector v=v0 and u=Fiv=[1]iv1; by [F3] Fiu=[2]iFi(2)v, whereas u is the position-1 vector of the string of v of length 2, so f~iu=Fi(2)v. Since [2]i=qi+qi−1 and qi is transcendental over Q, [2]i≠1, so f~i differs from Fi at this interior position.

Depends on

Used by

Dependency tree · two levels

21 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