Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck escalatedjudge pass (gpt-6-luna)
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.

Rank-one Weyl strings, tensor filtrations, and tilting classification

Statement

Use the full integral-weight divided-power category of The specified rank-one divided-power tilting category, with q=eπi/ℓ and every ℓ≥3. The displayed strings define Δ(a), and ∇(a)=Δ(a)∨. For all a,b≥0,

dim⁡Hom⁡(Δ(a),∇(b))=δab,Ext⁡1(Δ(a),∇(b))=0.

Here Ext vanishing means that every short exact sequence in the finite-dimensional full-weight category with those end terms splits. The tensor product Δ(a)⊗Δ(b) has one Weyl factor of each label a+b,a+b−2,…,∣a−b∣, and the analogous dual-Weyl assertion holds. Both filtration classes are closed under direct summands. Thus tiltings are closed under tensor products, duals and direct summands. For every a≥0 there is exactly one indecomposable tilting T(a) of highest weight a; its weight-a space is one-dimensional, and it occurs as a summand of V⊗a, where V=Δ(1). Every finite tilting is a finite direct sum of these T(a), so the additive idempotent-complete tensor category generated by V is the entire tilting category.

Facts & Assumptions

Given: The full toral-character convention, all ℓ≥3, and the displayed Weyl strings and duals.

[F1]

The specified rank-one divided-power tilting category fixes the coproduct, antipode, integral weights, full toral binomials, Weyl modules and filtrations.

[F2]

The Lusztig divided-power integral form UA and Divided-power commutation and the simple Uqi(sl2) string modules give the generic divided-power string and the toral product; specialization preserves every Laurent-integral matrix identity.

Proof

1.1F1F2F3givenalgebra

The generic string lattice is stable under every divided power by [F2,F3], and Tc,tvj=[a−2j+ct]qvj by the toral product. Hence it specializes to the stated full-weight module. More generally, if a full-weight module is supported on [−a,a] and w has weight a, the assignment vj↦F(j)w defines its unique map from Δ(a). Indeed the support kills every E(r)w for r>0 and every F(j)w for j>a. Divided-power straightening gives E(r)F(j)w=[a−j+rr]qF(j−r)w, while F(r)F(j)=[r+jr]qF(r+j). These are Laurent identities, obtained by commuting E past F and applying Pascal before specialization. They verify all divided actions; the full toral characters verify the remaining generators.

2.1F1F2step 1.1algebra

The contragredient action (xφ)(u)=φ(S(x)u) defines ∇(a); its weights are the negatives of the original weights and its toral character at weight m is the full character at m, by substituting K−1 in the generic toral product. Double duality is identified by K, since S2=Ad⁡K. A map Δ(a)→∇(b) vanishes for a>b because the generating weight-a vector has nowhere to go. For a<b, dualizing gives a map Δ(b)→∇(a), also zero. For a=b, step 1.1 maps onto the one-dimensional highest line of ∇(a), and every map is determined by that line. This proves the Hom formula.

3.1F1F2F3step 2.1constructalgebra

Work integrally over A=Z[v,v−1] in the quantum plane P=A⟨x,y⟩/(yx−vxy). Let x,y have weights 1,−1, Ex=0, Ey=x, Fx=y, Fy=0. The coproduct of [F1] preserves the relation: E(yx−vxy)=vx2−vx2=0 and F(yx−vxy)=vy2−vy2=0. On Pn, with basis Xj=xn−jyj, direct induction gives E(r)Xj=[jr]vXj−r and F(r)Xj=[n−jr]vXj+r. These matrices and the full toral characters are Laurent integral. This is the dual Weyl lattice: if wj=(vn−j)∗ in Δ(n)∨, then Ewj=−vn−2j+2[j]wj−1 and Fwj=−v−n+2j[n−j]wj+1. Rescale by c0=1, cj/cj−1=−v−n+2j−2; the resulting coefficients are [j] and [n−j]. The same calculation for divided powers proves the asserted integral identification.

4.1F1F3step 3.1constructalgebra

For a,b≥1, multiplication and insertion of the invariant tensor x⊗y−v−1y⊗x give a sequence 0⟶Pa−1⊗Pb−1→iPa⊗Pb→μPa+b⟶0, where i(f⊗g)=fx⊗yg−v−1fy⊗xg. Both maps are module maps by the module-algebra identities of step 3.1; invariance for higher divided powers follows from their integral matrices, or directly from their weight shifts on the two-factor tensor. Also μi=0 by yx=vxy. Here is exactness over A, before any root specialization. For fi=xa−1−iyi and gj=xb−1−jyj, i(fi⊗gj)=vi+b−1−jXi⊗Yj+1−v−1Xi+1⊗Yj. For each fixed i+j these are adjacent differences along the consecutive path of target basis pairs, with unit coefficients. Successively eliminating from its first vertex proves independence and a free rank-one quotient. Multiplication sends each target vertex to a unit multiple of the same monomial, so it identifies this quotient with that monomial line. This proves exactness and freeness in every degree. It therefore remains exact at every specialization. When a=0 or b=0, P0=A is the tensor unit and the assertion is immediate. Iterating gives the dual-Weyl factors a+b,a+b−2,…,∣a−b∣; dualizing reverses tensor order and gives the Weyl factors. Tensoring finite filtrations is exact over C, proving tensor closure of both filtration classes and hence of tiltings.

5.1step 1.1step 2.1step 4.1algebra

Consider 0→∇(b)→M→Δ(a)→0. If a≥b, its support is [−a,a]. A weight-a lift of the quotient generator is highest by support; step 1.1 supplies a map Δ(a)→M whose composite with the quotient fixes that generator and is the identity. This splits the sequence. If a<b, dualizing gives the already proved case with a,b interchanged. This proves Ext vanishing. Induction along two finite filtrations gives the same splitting/lifting property with a Weyl-filtered first end and dual-Weyl-filtered second end: at each filtration step lift across the preceding short exact sequence, whose obstruction is an extension of the displayed type; its splitting removes that obstruction. Equivalently, applying the elementary Hom-extension exact sequence at each step gives Ext⁡1(D,N)=0 for every such pair D,N.

6.1step 1.1step 2.1step 5.1inductionalgebra

Let M be Weyl-filtered with maximal label a. Its support is [−a,a]. An occurrence of a quotient Δ(a) can be moved to the bottom of the filtration: lift its weight-a generator across the preceding submodule and apply step 1.1, splitting that extension. Repeating for all occurrences gives the injective evaluation map Δ(a)⊗CMa→M, whose image is the sum of all maps from Δ(a) and whose quotient is Weyl-filtered with labels below a. It is injective because after these splittings it is precisely the direct sum of the top standard factors, each with a one-dimensional highest line. Any idempotent e on M preserves this image and acts there as 1⊗ea. Its image and kernel therefore have top submodules that are sums of Δ(a)'s, and their quotients are summands of the lower-label filtered quotient. Induction on the maximal label shows both are Weyl-filtered. Duality gives the corresponding assertion for dual-Weyl filtrations. Thus every summand of a tilting is tilting.

7.1step 3.1step 4.1step 6.1constructalgebra

The module V=Δ(1) is its own dual Weyl, as the rescaling of step 3.1 shows at n=1. Its powers are tilting by step 4.1. Recursively splitting a finite-dimensional module into nontrivial direct sums terminates by dimension, giving an indecomposable decomposition. Summand closure makes these tiltings. Exactly one summand of V⊗a has weight a, whose whole space is one-dimensional; denote it by T(a). For a finite-dimensional indecomposable module, an endomorphism h is either invertible or nilpotent: for large N, stabilized kernel and image give M=ker⁡hN⊕im⁡hN. Consequently an endomorphism nonzero on a preserved one-dimensional highest line is invertible.

8.1step 5.1step 6.1step 7.1algebra∎

Let M be any indecomposable finite tilting, of maximal label a. Step 6.1 embeds Δ(a)⊗Ma into M, with lower-label Weyl-filtered quotient. Choose a vector and linear functional on Ma pairing to 1. They define maps between the standard submodules of T(a) and M. Step 5.1 extends them to maps f:T(a)→M and g:M→T(a), because the source quotients are Weyl-filtered and the targets dual-Weyl-filtered. The composite gf fixes the highest line, hence is invertible by step 7.1. Thus T(a) is a nonzero summand of M; indecomposability forces an isomorphism. It also forces dim⁡Ma=1, proves uniqueness for each a, and distinguishes different a by their maximal integral weights. Decomposing any finite tilting proves all the asserted classification and generation claims. The choices here concern individual finite-dimensional vector spaces and terminating finite decompositions, not a choice axiom.

Depends on

Used by

Dependency tree · two levels

17 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