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

Strong affine linkage for root Weyl modules and tilting sections

Statement

Assume the inherited Axiom of Choice. Use the finite simply-laced full weight datum P, root lattice Q, positive roots Φ+ and root normalization (α,α)=2. Let ord⁡(ζ2)=ℓ be odd and greater than the Coxeter number. Both ord⁡(ζ)=ℓ and 2ℓ are allowed. Work in the full toral-weight Lusztig category of Integral Weyl and dual Weyl families at a root of unity.

Define η⪯ℓλ to mean that η+ρ is obtained from λ+ρ by a finite sequence, possibly empty, of reflections

rα,k(x)=x−((x,α)−kℓ)α,α∈Φ+,k∈Z,

where each step is strictly downward: (x,α)>kℓ. Intermediate labels need not be dominant. Every composition label η of Δζ(λ) or ∇ζ(λ) satisfies η⪯ℓλ. Every Weyl section and every composition label of the indecomposable tilting Tζ(λ) also satisfies η⪯ℓλ.

Facts & Assumptions

Given: The root data, parameter and actual full toral-weight category above.

[F1]

The ordinary-generator small image u has finite residue root-PBW bases, a finite torus T, braid-transformed triangular decompositions, and free right induction from simple-root minimal parabolics. Its negative half has a nonzero unique maximum-height PBW monomial. Use the type-1 quotient Kiℓ=1 when ord⁡(ζ)=ℓ; Ki2ℓ=1 suffices otherwise. All restrictions retain formal P labels (Braid-stable PBW decompositions of the small ordinary image).

[F2]

Every nonzero finite dimensional Hopf algebra has a nondegenerate associative Frobenius form (Finite-dimensional Hopf algebras are Frobenius).

[F3]

Root Weyl modules have the classical Weyl characters, unique simple heads and cyclic highest vectors; exact ordinary duality exchanges the Weyl families with label involution λ∗=−w0λ (Root specialization of integral Weyl lattices and their characters, The Weyl character formula).

[F4]

Finite dominance ideals have actual projective covers with Weyl-filtered kernels and reciprocity (Pμ:Δζ(ν))=[∇ζ(ν):Lζ(μ)] (Finite highest weight truncations from integral lowest-highest tensors). The finite universal-extension construction starts at Δζ(λ), adds lower Weyl quotients to kill their degree-one Ext groups, and extracts Tζ(λ) as its unique highest-label summand; Weyl filtrations are summand closed (Existence and highest weight classification of root-of-unity tiltings, Weyl flag summands, standard-costandard orthogonality and tilting uniqueness).

[A1]

Choice is inherited from the root-Weyl, character and finite-truncation suppliers (The Axiom of Choice); the new rank-one and finite-Hopf arguments add no choice use.

Proof

Given: These data. All small modules and their composition factors below belong to the category of finite dimensional formally P-graded u-modules; repeated K eigenvalues do not identify their labels. Put [a]=(ζa−ζ−a)/(ζ−ζ−1), define Z(κ)=u⊗u0u+Cκ, and write Zw(κ) for its transformed-Borel versions.

1.1F1algebra

Put R=u− and H=R⋊C[T]. This is an actual finite Hopf algebra: Δ(Fi)=Fi⊗1+Ki⊗Fi, the torus is group-like, and the antipode preserves this Borel. The odd-order type-1 toral quotient is a Hopf quotient because the Kiℓ−1 generate a Hopf ideal. The positive-height ideal R+ is nilpotent, and J=R+H=HR+ is nilpotent with quotient C[T]. This quotient is semisimple: its commuting toral operators diagonalize simultaneously, since their finite-order minimal polynomials divide separable polynomials Xd−1. A nilpotent ideal annihilates every simple module, and a semisimple quotient has zero radical; hence J=rad⁡H and R+=rad⁡R.

1.2F1algebra

In rank one of highest coordinate m=(κ,α), take vj=F(j)v0 for 0≤j<ℓ; in the opposite module of lowest coordinate m′=m−2(ℓ−1) take vj′=E(j)v0′. Their actions are Fvj=[j+1]vj+1, Evj=[m−j+1]vj−1, Evj′=[j+1]vj+1′ and Fvj′=−[m′+j−1]vj−1′, with out-of-range vectors zero. The map vj↦cjvℓ−1−j′, where c0=1 and cj+1=−[m−ℓ−j]cj/[j+1], intertwines these actions. For E compatibility use [ℓ−j]=−s[j] and [a−ℓ]=s[a], where s=ζℓ∈{1,−1}; F compatibility is its defining recurrence, and the endpoint and toral relations follow from the displayed actions and weights. All denominators are nonzero. If 1≤n≤ℓ is congruent to m+1 modulo ℓ, then cj≠0 exactly for j<n. The kernel is zero for n=ℓ and otherwise is spanned by vn,…,vℓ−1, generated by the singular vector F(n)v0. It is an image of the baby Verma of label κ−nα: the i-th positive generator kills that vector because [m−n+1]=0, and the other simple positive generators commute with Fi.

2.1F1F2step 1.1algebra

By [F2], choose a Frobenius functional f on H. Then b↦[a↦f(ab)] identifies the left regular module H with H∗ under (hϕ)(a)=ϕ(ah). The socle of H∗ is the annihilator of J, of dimension dim⁡(H/J)=∣T∣. On the other hand soc⁡HH={h:Jh=0}={h:R+h=0}=soc⁡RH, since J=HR+. As a left R-module, H=⨁t∈TRKt, so ∣T∣dim⁡soc⁡RR=∣T∣. Thus R has one-dimensional regular socle, spanned by its nonzero maximum-height PBW monomial; every positive-height factor annihilates it. This transports to braid-transformed halves and to u+ by algebra isomorphisms; transformed Borels need not be Hopf subalgebras for the original coproduct.

2.2F1step 1.2algebra

Free right induction from the minimal parabolic in [F1] transports this exact rank-one kernel calculation. For adjacent Borels w,wsi, β=wαi and w-highest label κ, it gives a homomorphism Zw(κ)→Zwsi(κ−(ℓ−1)β). If 1≤n≤ℓ is congruent to (κ+wρ,β) modulo ℓ, its kernel is zero for n=ℓ and otherwise is an image of Zw(κ−nβ). This is exact induction of an actual module map; it is not deduced from character equality.

3.1F1step 2.1algebra

Each baby Verma is regular over its transformed negative half. Every nonzero submodule therefore contains its lowest PBW line by step 2.1, and that line generates its simple socle. Also Z(κ) has a unique simple head Lu(κ): the sum of all submodules missing its one-dimensional highest line still misses that line and is the unique maximal submodule. Every finite graded simple has such a highest label, by taking a maximal label in its finite support. Their formal characters are linearly independent, since a maximal highest label in a finite relation occurs with coefficient one only in its own simple character.

3.2F1step 2.2algebra

Choose a reduced expression w0=si1⋯siN, write wj=si1⋯sij−1 and βj=wjαij>0, and put κ(w)=κ+(ℓ−1)(wρ−ρ). Compose step 2.2 along these successive Borels from Z(κ) to Zw0(κ−2(ℓ−1)ρ). Every module in this chain has the character of Z(κ): the transformed root-product character changes by e(ℓ−1)(ρ−wρ), canceled by its label shift. Each map is nonzero on the unique label-κ line. Indeed in its source that line has exponent ℓ−1 along already inverted roots and zero along not-yet-inverted roots. The current positive root βj is not yet inverted, so its rank-one exponent is zero and its image coefficient is c0=1; the complementary free parabolic basis makes the resulting vector nonzero.

4.1step 2.1step 3.1step 2.2step 3.2induction

The composite image is generated by its label-κ line. In the opposite-Borel target this is the maximum-height line of its regular u+ representation, so step 2.1 makes its u-span the simple socle. Thus the composite image is the simple head Lu(κ) of its source. Every other composition factor Lu(η) of Z(κ) consequently occurs in its kernel. The successive-image filtration of the kernel of a finite composite places it among the composition factors of one of the individual kernels. Step 2.2 makes that kernel an image of Zwj(κ(wj)−njβj) with 1≤nj<ℓ and nj≡(κ+ρ,βj)(modℓ), because κ(wj)+wjρ−(κ+ρ)=ℓ(wjρ−ρ). This transformed baby Verma has the character of Z(κ−njβj); independence of simple characters in step 3.1 transfers the composition factor to that ordinary baby Verma. Repeat: the nonnegative root height of the current highest label minus η strictly decreases, so the procedure terminates. Each change κ↦κ−njβj is a strict downward affine reflection, in the level kℓ=(κ+ρ,βj)−nj. Hence every baby-Verma composition label satisfies η⪯ℓκ.

4.2F1F3step 3.1algebra

Let p(β) denote the Kostant partition numbers, defined by ∑β∈Q+p(β)e−β=∏α>0(1−e−α)−1. The baby PBW character and the actual Weyl formula in [F3] give ch⁡Z(κ)=eκ∏α>01−e−ℓα1−e−α,ch⁡Δζ(λ)=∑w∈W, β∈Q+det⁡(w)p(β)ch⁡Z(w⋅λ−ℓβ). The second identity follows by multiplying the finite Weyl numerator by ∏α>0(1−e−ℓα)−1. It holds in the completion on λ−Q+: w⋅λ≤λ, and only finitely many β contribute to a fixed label. Simple graded characters are a unitriangular basis in that completion: recursively subtract their highest coefficients by increasing root height; every bounded-height interval has finitely many lattice labels, so the recursion is well defined and unique. In particular the coefficient of a fixed simple character on the right is a finite signed sum, since its contributing highest labels must satisfy w⋅λ−ℓβ≥η.

5.1F3step 3.1step 4.1step 4.2algebra

If Lζ(η) is a composition factor of Δζ(λ), restriction to u is exact and its highest vector generates a baby-Verma quotient with simple head Lu(η). Thus Lu(η) has positive multiplicity in the actual restricted Weyl module. The finite signed character coefficient in step 4.2 must therefore have some nonzero baby multiplicity, giving η⪯ℓw⋅λ−ℓβ by step 4.1. This uses virtual characters only to locate a composition factor, not to assert a module filtration.

6.1F3step 5.1algebra

For every x and positive root α, the translation x↦x−ℓα is a downward chain. Write (x,α)=kℓ+r, 0≤r<ℓ. If r>0, reflect in levels kℓ and (k−1)ℓ, subtracting respectively rα and (ℓ−r)α; if r=0, reflect directly in level (k−1)ℓ, subtracting ℓα. For dominant λ, w⋅λ⪯ℓλ as well: build a reduced word by adjoining simple reflections on the left. At a length-increasing step siv, v−1αi is positive, so (v(λ+ρ),αi)>0 and the level-zero reflection is downward. Apply the negative translations to the positive-root summands of β. Thus step 5.1 proves η⪯ℓλ for Weyl composition factors. The isometry −w0 preserves positive roots and these downward chains; exact duality in [F3] proves the same assertion for ∇ζ(λ).

7.1F4step 6.1algebra

Work in the finite dominance ideal Γ={μ∈P+:μ≤λ} and put S={μ∈Γ:μ⪯ℓλ}. Reciprocity in [F4] and step 6.1 show that every Weyl section Δζ(ν) of the projective kernel Kμ has μ≺ℓν. Suppose X has all composition labels in S and μ∉S. Such a section label ν cannot belong to S, since transitivity would give μ⪯ℓλ. Hence Hom⁡(Δζ(ν),X)=0: a nonzero image is a highest quotient with simple head Lζ(ν), absent from X. Induction along the kernel flag gives Hom⁡(Kμ,X)=0. The projective sequence consequently gives Ext⁡1(Δζ(μ),X)=0.

8.1F4A1step 6.1step 7.1induction∎

The actual finite universal-extension construction in [F4] starts with X=Δζ(λ), whose composition labels lie in S by step 6.1. Step 7.1 shows that it never adds a Weyl quotient with label outside S. Adding a section with label in S preserves this composition support by step 6.1 and transitivity. The final tilting and its indecomposable highest-label-λ summand therefore have all Weyl labels in S, using summand closure in [F4]. Their composition labels also lie in S by the Weyl result already proved. This proves every assertion, for both possible orders of ζ and without primality of ℓ; the only scalar zeros used were [a]=0 exactly when ℓ∣a.

Depends on

Used by

Dependency tree · two levels

38 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