Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Translation identifies the regular integral blocks

Statement

Assume the Axiom of Choice. Let λ,μ be dominant regular integral weights for the same complex type-A semisimple Lie algebra and fixed positive system. Let ν be the unique dominant member of W(μ−λ) and E=L(ν) the finite-dimensional simple. The actual translation functors F=Tλμ=pr⁡χμ(E⊗−)incl⁡χλ,G=Tμλ=pr⁡χλ(E∗⊗−)incl⁡χμ are exact mutually inverse equivalences, with natural adjunction isomorphisms Id⁡≅GF and FG≅Id⁡. They preserve the dot-orbit labels: for every w∈W, FΔ(w⋅λ)≅Δ(w⋅μ),FL(w⋅λ)≅L(w⋅μ),FP(w⋅λ)≅P(w⋅μ), and conversely for G. Consequently the two blocks have identical Verma-flag and composition multiplicities, both equal to Py,w(1), and F transports the inverse-Kazhdan–Lusztig character identity as a Grothendieck-group identity with the same signed weighted-inverse coefficients qw,x′(1) and the same support x≥w. Formal characters in the two blocks use their respective weights x⋅λ and x⋅μ; they need not be equal as weight series. The dominant/antidominant, Bruhat, left/right and inverse-Soergel-label conventions are preserved. This is an ungraded categorical transport and supplies no Ext or Koszul grading.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the category-O suppliers cited below), dominant regular integral weights λ,μ of a fixed type-A root datum, the weights a:=λ+ρ, b:=μ+ρ (both strictly dominant), the dominant weight ν with Wν=W(μ−λ), the finite-dimensional simple E=L(ν), and the translation functors F=Tλμ, G=Tμλ.

[F1]

Translation functors and central characters (Translation functors by tensoring and projection, Central characters are dot-Weyl orbits): Tχ,E,χ′=pr⁡χ′∘(E⊗−)∘incl⁡χ for a finite-dimensional h-semisimple E, with exact inclusions and projections of the central-character decomposition; for weights, Tλμ=pr⁡χμ(E⊗−)incl⁡χλ and Tμλ=pr⁡χλ(E∗⊗−)incl⁡χμ with ν the unique dominant member of W(μ−λ); χλ′=χμ if and only if λ′∈W⋅μ, so a Verma Δ(λ′) is killed by pr⁡χμ exactly when λ′∉W⋅μ, and is preserved identically when λ′∈W⋅μ.

[F2]

Exactness and biadjunction (Translation functors are exact and biadjoint): for every finite-dimensional h-semisimple E the functor Tχ,E,χ′ is exact and Tχ′,E∗,χ is both a left and a right adjoint of it; in particular F and G are exact, F has G as both a left and a right adjoint, and exactness of the right adjoint makes F send projectives to projectives and G send projectives to projectives.

[F3]

Verma flags under finite-dimensional tensoring (Finite-dimensional tensoring preserves Verma flags): for a weight μ′, the object E⊗Δ(μ′) has a finite Verma flag with factors Δ(μ′+η), the factor occurring dim⁡Eη times.

[F4]

Dominant norm comparison (A dominant vector minimises its distance to a dominant weight): for dominant ξ,η and every w∈W, ∣ξ−wη∣≥∣ξ−η∣, with equality if and only if wη∈Wξη; for regular ξ equality forces wη=η.

[F5]

Weight-norm bound and multiplicity one (Weights of a finite-dimensional simple module lie in the norm ball): every weight γ of L(ν) satisfies ∣γ∣≤∣ν∣ with equality if and only if γ∈Wν, and every orbit weight Wν occurs with multiplicity one in L(ν).

[F6]

Homomorphism spaces between Vermas (Homomorphism spaces between Verma modules have dimension at most one): dim⁡Hom⁡g(M(μ′),M(λ′))≤1 for all weights, so End⁡(M)=M↦ scalars on every Verma: the identity spans End⁡(M) and every nonzero endomorphism of a Verma is an isomorphism.

[F7]

Projectives have Verma flags (Projectives in category O have finite Verma flags): every projective object of O has a finite Verma flag.

[F8]

Enough projectives and covers (Category O has enough projectives): every simple admits a projective cover, unique up to isomorphism and indecomposable; every object of O has finite length and is a quotient of a finite direct sum of projective covers.

[F9]

Abelian and extension closed (Category O is abelian and extension closed among weight modules): O is abelian and closed under submodules, quotients and finite direct sums, so kernels and cokernels of morphisms between its objects lie in O.

[F10]

Finite-dimensional simples and their duals (Finite-dimensional simple modules are classified by dominant highest weights, Translation functors by tensoring and projection): for the dominant integral weight ν there is a unique finite-dimensional simple E=L(ν) of highest weight ν, and its dual E∗ is the finite-dimensional simple with highest weight −w0ν, whose extremal orbit is W(λ−μ) and whose weights obey [F5] with the same norm ∣ν∣.

[F11]

Block conventions and multiplicities (The regular integral dot-orbit labelling convention, Projective Verma multiplicities are Kazhdan–Lusztig values at one, Simple Verma composition multiplicities are Kazhdan–Lusztig values, BGG reciprocity): in each of the regular integral blocks Oλ, Oμ the standards, simples and indecomposable projectives are labelled by W, the dominant label is e, the antidominant one w0, (P(w⋅λ):Δ(y⋅λ))=[M(y⋅λ):L(w⋅λ)] by BGG reciprocity, and both multiplicities equal Py,w(1), vanishing unless y≤w.

[F12]

The inverse-Kazhdan–Lusztig character formula (The Kazhdan–Lusztig character formula in regular integral category O): in Oλ, [L(w⋅λ)]=∑xqw,x′(1)[M(x⋅λ)] with qx,w′ the inverse Kazhdan–Lusztig coefficients, supported on x≥w.

Proof

technique · direct
1.1F4F5F10

Since λ and μ are dominant regular integral, the shifted weights a=λ+ρ and b=μ+ρ are strictly dominant and have trivial stabilizers in W; the dominant member ν of W(μ−λ)=W(b−a) satisfies ∣ν∣=∣b−a∣, and by [F5] and [F10] every weight γ of E=L(ν) has ∣γ∣≤∣b−a∣, with equality exactly on Wν, where the multiplicity is one.

1.2F2

By [F2] the functors F and G are exact, and G is both a left and a right adjoint of F (with the roles of E and E∗ exchanged for the reverse pair); exactness of the right adjoint on the other side makes F preserve projectives and G preserve projectives. Write η:Id⁡→GF and ε:FG→Id⁡ for the unit and counit of the adjunction F⊣G; both composites GF and FG are exact as compositions of exact functors.

2.1F1F3F4F5step 1.1step 1.2

Compute FΔ(y⋅λ)=pr⁡χμ(E⊗Δ(y⋅λ)) for y∈W. By [F3] the object E⊗Δ(y⋅λ) has a Verma flag with factors Δ(y⋅λ+γ), γ running over the weights of E with multiplicity dim⁡Eγ, and by [F1] the exact projection pr⁡χμ maps this flag to a flag of the projected object whose factor at γ is Δ(y⋅λ+γ) when y⋅λ+γ∈W⋅μ and 0 otherwise. A retained factor has y⋅λ+γ=x⋅μ for some x, that is ya+γ=xb with a,b strictly dominant and regular. Then ∣γ∣=∣xb−ya∣=∣b−x−1ya∣≥∣b−a∣ by [F4] applied to the dominant vectors b and a; regularity of b makes equality of the norm comparison force x−1ya=a, and regularity of a then forces x=y. Comparing with the bound ∣γ∣≤∣b−a∣ of [F5] gives equality, so γ∈Wν and x=y; then γ=y(b−a)=y(μ−λ), the factor is Δ(y⋅λ+y(μ−λ))=Δ(y⋅μ), and by the multiplicity-one clause of [F5] it occurs exactly once. No other retained factor exists, since every retained factor was shown to equal this one. The projected object therefore has a one-step flag with quotient Δ(y⋅μ), so FΔ(y⋅λ)≅Δ(y⋅μ) for every y.

2.2F1F3F4F5F10step 1.1step 1.2

The dual computation gives GΔ(y⋅μ)≅Δ(y⋅λ) for every y. By [F3] applied to the finite-dimensional module E∗ of [F10], the flag factors of E∗⊗Δ(y⋅μ) are Δ(y⋅μ+γ′) with multiplicities dim⁡(E∗)γ′, and a factor retained by pr⁡χλ satisfies yb+γ′=xa for some x∈W. Then ∣γ′∣=∣xa−yb∣=∣a−x−1yb∣≥∣b−a∣ by [F4] applied to the dominant vectors a and b, and regularity of a forces x−1yb=b and then x=y; the weight bound [F5] applied to the weights of E∗ (whose extremal orbit is W(λ−μ) with multiplicity one, [F10]) gives equality ∣γ′∣=∣b−a∣, γ′=y(a−b)=y(λ−μ), and the retained factor Δ(y⋅μ+y(λ−μ))=Δ(y⋅λ) occurs once. Hence GΔ(y⋅μ)≅Δ(y⋅λ).

3.1F6step 1.2step 2.1step 2.2

For each y∈W, the unit ηΔ(y⋅λ):Δ(y⋅λ)→GFΔ(y⋅λ) corresponds under the adjunction isomorphism Hom⁡(FΔ(y⋅λ),FΔ(y⋅λ))≅Hom⁡(Δ(y⋅λ),GFΔ(y⋅λ)) to the identity of FΔ(y⋅λ); since FΔ(y⋅λ)≅Δ(y⋅μ)≠0 by step 2.1, the unit is nonzero. Its target is GFΔ(y⋅λ)≅GΔ(y⋅μ)≅Δ(y⋅λ) by steps 2.1 and 2.2, so ηΔ(y⋅λ) is a nonzero endomorphism of a Verma module after transport along this isomorphism, and by [F6] every nonzero endomorphism of a Verma module is an isomorphism. Hence η is an isomorphism on every standard object of Oλ.

3.2F6step 1.2step 2.1step 2.2

The same argument for the counit: for each y∈W, εΔ(y⋅μ):FGΔ(y⋅μ)→Δ(y⋅μ) corresponds to the identity of GΔ(y⋅μ)≠0 under the adjunction, hence is nonzero, and its source is FGΔ(y⋅μ)≅FΔ(y⋅λ)≅Δ(y⋅μ) by steps 2.1 and 2.2; by [F6] it is an isomorphism on every standard object of Oμ.

4.1F7step 1.2step 3.1step 3.2

The isomorphisms of steps 3.1 and 3.2 extend to every Verma-filtered object. If 0→A→B→C→0 is a short exact sequence in Oλ with A and C Verma-filtered and ηA,ηC isomorphisms, then GF is exact by step 1.2, and naturality of η gives a map of short exact sequences from 0→A→B→C→0 to 0→GFA→GFB→GFC→0 with isomorphisms at the outer terms; the five lemma makes ηB an isomorphism. Inducting along a finite Verma flag of X (Finite Verma flags and their multiplicities, the flag decomposition 0=X0⊆⋯⊆Xn=X with Verma quotients) gives that ηX is an isomorphism for every Verma-filtered X, and [F7] makes every projective of Oλ Verma-filtered; the identical induction with FG exact and the counit gives that εY is an isomorphism for every Verma-filtered Y of Oμ, in particular for every projective.

5.1F8F9step 4.1

The isomorphisms extend to all objects by finite projective presentations. By [F8] every object X of Oλ has finite length and is a quotient of a finite direct sum of projective covers; choosing such a cover P0↠X and applying the same to the kernel of this map (an object of Oλ by [F9]) produces an exact sequence P1→P0→X→0 with P0,P1 finite direct sums of projective covers, hence projective and Verma-filtered by [F7]. Applying the exact functor GF and using naturality of η identifies ηX with the map induced on the cokernel of ηP1,ηP0, which are isomorphisms by step 4.1; therefore ηX is an isomorphism. The same argument in Oμ with a finite projective presentation and the exact functor FG makes εY an isomorphism for every Y in Oμ. Thus the unit and counit of the adjunction F⊣G are natural isomorphisms, so F and G are mutually inverse equivalences of categories.

6.1F8F11step 2.1step 2.2step 5.1

Being inverse equivalences, F is exact and reflects the categorical structures. For the labels: FΔ(w⋅λ)≅Δ(w⋅μ) was proved in step 2.1. For each w, FL(w⋅λ) is a simple object, and the exact functor F turns the epimorphism Δ(w⋅λ)↠L(w⋅λ) onto its unique simple quotient into an epimorphism Δ(w⋅μ)≅FΔ(w⋅λ)↠FL(w⋅λ); since the simple quotient of Δ(w⋅μ) is unique and equal to L(w⋅μ), one has FL(w⋅λ)≅L(w⋅μ). Finally P(w⋅λ) is a projective cover of L(w⋅λ) by [F8] and [F11], so FP(w⋅λ) is a projective object mapping onto FL(w⋅λ)≅L(w⋅μ) with essential kernel: if a subobject Z′⊆FP(w⋅λ) mapped onto FL(w⋅λ), then applying the inverse equivalence would exhibit a subobject of P(w⋅λ) mapping onto L(w⋅λ), so essentiality on the source forces Z′=FP(w⋅λ). By uniqueness of projective covers in [F8], FP(w⋅λ)≅P(w⋅μ). The dual statements GΔ(w⋅μ)≅Δ(w⋅λ), GL(w⋅μ)≅L(w⋅λ) and GP(w⋅μ)≅P(w⋅λ) follow from step 2.2 and the identical argument with the roles exchanged.

7.1F11F12step 2.2step 6.1∎

The multiplicities are transported termwise. Since F is an equivalence, it is full and faithful, so applying F to a finite Verma flag of P and applying G to a finite Verma flag of FP are inverse bijections between the flag multiplicities of P and of FP; by steps 6.1 and 2.2 the labels match, giving (FP(w⋅λ):FΔ(y⋅λ))=(P(w⋅λ):Δ(y⋅λ)) and, with step 6.1, (P(w⋅μ):Δ(y⋅μ))=(P(w⋅λ):Δ(y⋅λ))=Py,w(1) by [F11]; BGG reciprocity [F11] likewise transports the composition multiplicities and their vanishing. Transporting the identity of [F12] along the induced isomorphism of Grothendieck groups gives [L(w⋅μ)]=∑xqw,x′(1)[M(x⋅μ)] with the same weighted-inverse coefficients and the same support x≥w, because F carries L(w⋅λ) to L(w⋅μ) and M(x⋅λ)=Δ(x⋅λ) to M(x⋅μ). The conventions are preserved because the label w is unchanged: dominant and antidominant labels, Bruhat comparisons, left/right labels and inverse Soergel labels carry over; the formal characters are read in the respective weight series x⋅λ and x⋅μ and need not coincide. Nothing above uses or produces a grading on O, an Ext-algebra or a Koszul structure.

Depends on

Used by

Dependency tree · two levels

80 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