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 highest weight truncations from integral lowest-highest tensors

Statement

Assume the inherited Axiom of Choice. For every finite saturated subset Γ⊂P+ (meaning λ∈Γ, μ∈P+ and μ≤λ imply μ∈Γ), the full root module subcategory CΓ with composition labels in Γ is equivalent to the category of finite dimensional modules over a finite dimensional complex algebra. It has projective covers Pλ and injective envelopes Iλ and exact sequences

0⟶Kλ⟶Pλ⟶Δζ(λ)⟶0,0⟶∇ζ(λ)⟶Iλ⟶Cλ⟶0,

where Kλ is Weyl-filtered by strictly greater labels and Cλ is dual-Weyl-filtered by strictly greater labels. Moreover (Pλ:Δζ(μ))=[∇ζ(μ):Lζ(λ)]. The assertion is about the actual root category, not a generic semisimple fibre.

Facts & Assumptions

Given: The full root category and its actual Weyl families.

[F1]

Integral highest lattices have the exact divided-power half presentation with all right singular powers and an adapted global basis (The based quotient: projection of the lower global basis to a highest weight module). Exchanging the two halves gives the corresponding lowest presentation. The mixed divided-power reordering relations are integral (Divided-power multiplication, toral binomials and the Ei(a)Fi(b) reordering identity), and generic triangular decomposition gives independence of ordered half monomials (Triangular decomposition of a quantized enveloping algebra).

[F2]

Finite highest and lowest modules, and their finite tensor products, have actual integral based structures and saturated Weyl filtrations with free quotients (Tensor bars on finite products of based integrable modules, Saturated Weyl filtrations of finite dimensional integral based modules).

[F3]

The root category is abelian and label-preserving, its Weyl modules are universal finite highest modules and classify simple heads (Root specialization of integral Weyl lattices and their characters). Weyl flags are summand-closed, standard-costandard Hom spaces are δλμC, and standard-costandard extensions split (Weyl flag summands, standard-costandard orthogonality and tilting uniqueness).

Proof

Given: These data and Γ.

1.1F1algebra

We first prove the integral cyclic presentation used below. For dominant a,b put ξ=b−a and let CA(ξ) be the universal cyclic UA-module on a vector with full toral character ξ, without a highest or lowest annihilation requirement. Mixed reordering makes its ordered positive-negative half products span. Their independence follows by applying them to the tensor of a lowest Verma vector of label −a and a highest Verma vector of label b: in the two Verma half lattices the leading action of an ordered positive-negative product is the corresponding pure tensor, with a Laurent unit as coefficient, and all other terms have smaller half degree. Induction on the sum of the two nonnegative root heights in this unit triangular transformation gives an integral isomorphism of CA(ξ) with this tensor of the two free Verma lattices. Thus no torsionfreeness-to-freeness or generic direct-sum inference enters.

2.1F1step 1.1algebra

Quotient the two Verma half lattices by their actual integrable highest or lowest kernels from [F1]. Under the map in step 1.1 the kernel from the highest factor is exactly ∑i∑r>b(hi)UAFi(r)vξ, and the kernel from the lowest factor is exactly ∑i∑r>a(hi)UAEi(r)vξ. To check these equalities, use the positive-negative ordered products for the first assertion and the negative-positive ordered products for the second: the rightmost divided power acts on the relevant highest or lowest generator, while the other extreme generator is killed by that color's opposite action. The leading term is the corresponding singular half vector and the correction terms have smaller half degrees; degree induction gives both inclusions. The half kernels are the sums of the specified divided-power ideals by [F1], so summing gives the whole tensor kernel. Consequently ωVA(a)⊗AVA(b) is the cyclic module on vξ with exactly these two families of annihilation relations. Here ω interchanges positive and negative generators and negates weight labels. Both tensor factors are finite free, so specialization preserves this exact presentation by right exactness. This is the integral lowest-highest presentation, not a claim about an arbitrary integral lattice.

3.1F3step 2.1constructalgebra

Put Π=⋃γ∈ΓWt⁡Δζ(γ), with formal label weights rather than torus eigenvalues. It is finite. A finite module has composition labels in Γ exactly when all its weights lie in Π: one direction follows from character additivity, and conversely each simple factor's dominant highest label μ belongs to Π, hence is at most some γ∈Γ, so saturation puts μ in Γ. For a fixed ξ∈Π, choose a,b∈P+ with b−a=ξ and with every a(hi),b(hi) larger than the maximum possible length of any i-string starting at any label in Π. Such a exists by taking an integral multiple of ρ sufficiently large, then setting b=a+ξ. Every vector of label ξ in every M∈CΓ satisfies the two annihilation families in step 2.1. Therefore that specialized lowest-highest tensor Tξ represents the weight-ξ functor on this subcategory: the generator-to-vector correspondence gives Hom⁡(Tξ,M)=Mξ.

4.1F2F3step 3.1algebra

Apply [F2] to the actual integral tensor underlying Tξ. Construct its saturated based Weyl filtration by successively removing maximal highest labels. Because the complement of the lower ideal Γ is upper closed, all sections outside Γ can be removed first. Their sum is a based integral submodule SA, with a free quotient having only Weyl sections in Γ. Specialize to obtain S⊂Tξ and Qξ=Tξ/S∈CΓ, which is Weyl-filtered. Every homomorphism S→M for M∈CΓ is zero: each Weyl section of S has highest label outside Γ, absent from M, so Hom from that section is zero by its cyclic generator, and induction on the section filtration gives Hom from S zero. Thus every map Tξ→M factors uniquely through Qξ, and step 3.1 yields Hom⁡(Qξ,M)=Mξ. Exactness of weight spaces now proves that Qξ is projective in this actual root subcategory.

5.1F3step 4.1algebra

The finite sum Q=⨁ξ∈ΠQξ is a projective generator. Indeed the evaluation map from the finite sum ⨁ξQξ⊗CMξ onto M contains every label vector in its image and hence is surjective. Every Hom space is finite dimensional, so B=End⁡(Q)op is finite dimensional. The functor Hom⁡(Q,−) gives the usual module equivalence directly: finite presentations by sums of Q exist because the evaluation is surjective and its finite kernel has another such evaluation; taking cokernels constructs an inverse from finite presentations by free B-modules, and projectivity makes the two constructions inverse on presentations and morphisms. Therefore projective covers exist, and [F3] and summand closure give each Pλ a Weyl filtration.

6.1F3step 5.1algebra∎

For Weyl-filtered X, [F3] and induction along a flag show (X:Δζ(μ))=dim⁡Hom⁡(X,∇ζ(μ)). For a projective cover Pλ, exactness of Hom and its value δλνC on simple modules give dim⁡Hom⁡(Pλ,N)=[N:Lζ(λ)]. Thus its Weyl multiplicities are the claimed reciprocity numbers. Since a dual Weyl module at μ has composition labels at most μ, and diagonal multiplicity one, Pλ has exactly one Weyl section of label λ, and every other section label is strictly greater. Split adjacent reversed sections to move the λ section to the top of a flag: the extension with a greater-label Weyl quotient and smaller-label Weyl kernel splits by the highest-vector splitting argument of [F3]. The resulting flag gives 0→Kλ→Pλ→Δζ(λ)→0 with the required kernel. Ordinary exact duality, applied in CΓ∗ and relabelled by λ∗=−w0λ, gives the injective sequence and its greater-label dual Weyl flag. This proves the full finite highest weight structure without importing a generic decomposition or an unproved root Kempf theorem.

Depends on

Used by

Dependency tree · two levels

46 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