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.

Parabolic semi-regular duality and the reverse-column label map

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let g=gln, with its upper Borel and Cartan, and let p be the standard parabolic of the tableau column sizes n1,…,nl. Let pˉ=lˉ⊕uˉ be the standard parabolic with these block sizes reversed. Set αi(ζ)=0 on the simple Levi roots and αi(ζ)=1 on the remaining simple roots, and grade by ad⁡ζ. Thus g0=lˉ,g>0=uˉ,g<0=uˉ−. Degrees greater than one are retained. Put U=U(g), B=U(pˉ), N=U(uˉ−), and γ=2ρg−2ρlˉ, a character of lˉ extended by zero to uˉ. For a graded vector space V, write V#=⨁d(V−d)∗ and Hom⁡‾(V,W)=⨁dHom⁡d(V,W). Here Hom⁡d consists of maps homogeneous of degree d; the direct sum allows only finitely many degrees. These conventions are essential.

(1) The algebraic space S=N#⊗B has commuting left and right U-actions and identifications S≅N#⊗NU≅U⊗NN#. Its left action is obtained from the restricted coinduction model S≅Hom⁡‾B(U,Cγ⊗B). No completion of S is taken. With P and Q the projections of g to g≥0 and g<0, respectively, the polarization trace governing normal ordering is ω(X,Y)=tr⁡g≥0(Pad⁡XQad⁡YP−Pad⁡YQad⁡XP)=γ0([X,Y]), where γ0 is zero outside degree zero. In particular, for X∈g1 and Y∈g−1 this is γ([X,Y])=tr⁡g0(ad⁡Xad⁡Y), not the full adjoint-composition trace.

(2) On graded U-modules free over N of finite graded rank, T=S⊗U− is an exact equivalence onto the graded U-modules cofree over N of finite graded rank. Its inverse is H=Hom⁡‾U(S,−); finite graded rank means a finite sum of grading shifts of N, respectively N#. In this restricted sense End⁡‾N(N#)≅Nop. This equality is not an assertion about unrestricted endomorphisms: for N=C[x] with deg⁡x=−1, the unrestricted ring is C[ ⁣[x] ⁣].

(3) With the principal contragredient action (Xf)(v)=−f(Xv) on the restricted dual, Φ(M)=(S⊗UM)# is an exact contravariant equivalence of the finite generalized-standard flag category for pˉ with its own opposite. On a finite-dimensional simple lˉ-module E, Φ(Δpˉ(E))≅Δpˉ(C−γ⊗E∗). The parabolic in this formula is unchanged.

(4) Let c(X)=−w0XTw0, which carries the upper Borel to itself and reverses the Levi blocks, and set Ψ=c∗Φ. For a lower-bounded tableau shape set nj=mj+1−inf⁡(I) and use the concatenated ordinary highest-weight reading ai, with each column read from top to bottom in strictly decreasing order, and λA,i=ai+i−1. The source reading is the reversed sequence of columns, without reversing positions within a column. Then Ψ:F(Δˉ)⟶F(Δ)op,Ψ(Δˉ(A))≅Δ(A). This is an exact contravariant equivalence. It preserves the tableau label and the corresponding central-character summands, including the scalar central coordinate, and the reverse-column label order is opposite to the target order. More explicitly its weight map is λ⟼w0wJˉλ+2w0ρuˉ.

(5) For restricted BGG transpose duality D, the composite F=DΨ is an exact covariant equivalence F(Δˉ)≃F(∇) with F(Δˉ(A))≅∇(A).

For category-O modules these constructions use finite weight spaces and the finite direct sum of ζ-eigenvalue cosets modulo Z. Internal homogeneous Hom becomes the ζ-locally finite part of Hom, and the dual is the weight-restricted dual. No equivalence on arbitrary category-O objects or unrestricted completed Hom spaces is asserted.

Facts & Assumptions

Given: The type-A Lie algebra, reversed-block parabolic, grading element, algebras U,B,N, restricted dual and internal Hom conventions, and tableau readings of the Statement.

[F1]

PBW and root structure (PBW gives an ordered monomial basis for the enveloping algebra, The root sl_2 triple, Brackets of root spaces): ordered monomials give both decompositions U=B⊗N=N⊗B as vector spaces; the simple positive and negative root vectors and the Cartan generate g.

[F2]

Parabolic structure (Standard parabolic and Levi subalgebras from a subset of simple roots, Parabolic category O for a standard parabolic, Parabolic category O is a highest weight category): lˉ is reductive, standards are U⊗BE with E finite-dimensional simple and radical acting trivially, and finite flags have finite-dimensional weight spaces and locally finite Levi action.

[F3]

Restricted BGG duality (Restricted duality is exact and involutive on O) is exact, preserves weights and central-character summands, and sends standards to costandards.

[F4]

Tableau conventions (The higher-level wedge-tensor Fock module): the normally ordered top-to-bottom decreasing column reading and fixed-total-weight prefix-dominance order. Use that same column reading for the ordinary highest-weight tuple here and put λA,i=ai+i−1.

[F5]

The Axiom of Choice (The Axiom of Choice) is available for the choice of bases and splittings; trace forms are symmetric and invariant (Trace forms are symmetric and invariant).

Proof

technique · direct
1.1F1F2algebra

All graded pieces and the crossing trace. A positive root has degree equal to the number of omitted simple roots in its support. Hence the full positive radical is ⨁d>0gd, not generally g1. The simple outside root vectors lie in g1 and their negatives in g−1; together with g0 they generate the Lie algebra. For H∈g0, tr⁡g>0ad⁡H=∑α∈Φ+∖ΦJˉ+α(H)=γ(H) on the Cartan. Both sides vanish on the derived Levi, so this identity holds on all of g0. In particular γ is a Levi character.

1.2F1F2F5construct

Restricted coinduction and the two actions. Every component N−r is finite dimensional and N0=C. Give N# its regular transpose bimodule actions (nf)(a)=f(an) and (fn)(a)=f(na). PBW gives N#⊗NU=N#⊗B, carrying its right U-action. On the other hand restrict a B-linear map U→Cγ⊗B to N using U=B⊗N. A homogeneous map of degree d sends N−r into Bd−r, hence is zero for r>d. Consequently it has finite support in r, and the remaining domains are finite dimensional. This proves Hom⁡‾B(U,Cγ⊗B)=N#⊗B even though B0 is infinite dimensional. The left action is (XG)(u)=G(uX). Its Lie relations follow from associativity in U; restriction to N gives an algebraic action on S. The left N-action and right B-action already commute with the entire opposite action.

2.1F1F2F5step 1.1algebra

For homogeneous X,Y of opposite degrees, take the P-block trace of [ad⁡X,ad⁡Y]. Its terms entirely within Pg form a commutator and have trace zero, leaving exactly ω(X,Y). The bracket has degree zero; its adjoint trace on g0 is zero since that algebra is reductive, so step 1.1 gives ω(X,Y)=γ([X,Y]). For degrees whose sum is nonzero the crossing operators have nonzero degree and trace zero, and γ0([X,Y])=0; degree-zero pairs have no crossing terms and γ annihilates their bracket. This proves the displayed identity for all X,Y. For degrees 1,−1, only g0 crosses the boundary, giving the stated g0 trace. For the root sl2 example it is 2, whereas the full trace on sl2 is 4.

2.2F1step 1.2algebra

Normal ordering. Choose a basis Hi of g0. For X∈g1, PBW uniquely defines maps CiX,RX:N→N by aX=Xa+∑iHiCiX(a)+RX(a). All these maps have degree 1; higher negative degrees of a are retained. On f⊗1 the left formulas are H(f⊗1)=−(fad⁡H)⊗1+f⊗(H+γ(H)) and X(f⊗1)=f⊗X+∑i(fCiX)⊗(Hi+γ(Hi))+(fRX)⊗1. For Y∈g−1 right multiplication gives (f⊗1)Y=(fLY)⊗1, where LY is left multiplication on N. Comparing the two PBW expansions of (Ya)X=Y(aX), with [Y,X]=∑iciHi, gives CiXLY=LYCiX+ciid⁡ and RXLY=LYRX+∑iL[Y,Hi]CiX.

2.3F1step 1.2algebra

Restricted endomorphisms and the inverse functor. Transposing a homogeneous left N-endomorphism of N# gives a homogeneous right N-endomorphism of N, because its homogeneous pieces are finite dimensional. Such an endomorphism is multiplication by its value at 1. Transposition reverses composition, and summing finitely many degrees gives End⁡‾N(N#)=Nop. For unrestricted maps this argument produces a product of degrees: in the polynomial example x acts locally nilpotently on the dual basis, so every power series in x acts, and these are all the endomorphisms. Its ζ-locally finite subspace under commutator is exactly the polynomial subalgebra; unrestricted completion is therefore explicitly excluded.

3.1F1step 1.1step 2.1step 1.2step 2.2algebra

Substitute these two identities into X((f⊗1)Y)−(X(f⊗1))Y. All terms with a nonconstant operator on N cancel; the remaining scalar is the difference γ([X,Y])−tr⁡g0(ad⁡Xad⁡Y), multiplied by f⊗1, and is zero by step 2.1. For H,Y the cancellation is [ad⁡H,LY]=L[H,Y]. The same relations on f⊗b follow by induction on a word in the generators g0,g1 of B: commute right multiplication by the next generator past Y, whose bracket lies in g0 or g−1. Since U is generated by g0,g±1, both actions commute everywhere. Thus higher radical degrees require no extra assumption; their relations are already relations in the coinduction and tensor models, and their crossing traces were checked in step 2.1.

4.1F1step 2.2step 3.1algebra

Left PBW, without a dimension shortcut. The map U⊗NN#→S is left multiplication on the inclusion f↦f⊗1. Its PBW domain is B⊗N#. For a homogeneous f filter first by its nonnegative dual degree and then by the ordinary PBW length of the B-word. In the formula for X, every correction decreases the dual degree; in the formula for H, corrections preserve that degree but decrease the B-length. Thus the map on the associated successive quotients is precisely the vector-space interchange b⊗f↦f⊗b. Inducting over the dual degree and, at fixed degree, over PBW length proves surjectivity. A finite linear relation has a largest pair of filtration indices; its leading symbols are independent under the interchange, proving injectivity. Each expression involves finitely many words, so the argument needs neither finite dimension of B0 nor a completed series.

5.1step 1.2step 4.1step 2.3algebra

From the right PBW model T(M)=N#⊗NM, so free finite rank becomes cofree finite rank. From the left PBW model H(K)=Hom⁡‾N(N#,K), which is free finite rank by step 2.3. Tensor-Hom adjunction supplies the unit and counit. On each shifted rank-one summand they are the identity under the endomorphism identification and the evaluation map, respectively, so both are isomorphisms. A short exact sequence of graded free finite-rank objects splits over N since its quotient is graded free. A sequence of graded cofree objects splits over N since its subobject is graded injective: N# is the graded coinduction of the field, and its Hom functor is the exact dual of the corresponding homogeneous component. Hence T,H preserve the exact sequences at issue.

6.1F1F2step 2.2step 5.1algebra

Duality and standards. Restricted duality with the principal antipode gives an exact anti-equivalence from finite cofree to finite free objects; the transpose of that antipode identifies the two regular transpose actions on N#. Finite homogeneous components give biduality, so composing with T gives Φ with inverse H∘(−)#; no involutivity of T is assumed. For M=U⊗BE, tensor cancellation gives T(M)=S⊗BE=N#⊗E. On the augmentation vector ε⊗E, the Levi action in step 2.2 is the original E-action plus γ, since εad⁡H=0. Dualizing makes the generator space C−γ⊗E∗. The positive radical annihilates this generator space by degree, and the negative regular action makes the dual free on it. The induced PBW map is therefore an isomorphism Φ(M)=U⊗B(C−γ⊗E∗). This is a standard for the same parabolic.

7.1F1F2step 5.1step 6.1induction

A finite standard flag is graded free over N of finite rank, since its standard sections are such and every extension splits over N. Applying Φ gives a reversed finite standard flag by step 6.1. Conversely H∘(−)# sends a standard back to a standard: the transformation E↦C−γ⊗E∗ is involutive, and the unit and counit give its inverse. Induction on flag length thus restricts the equivalence precisely to the standard-flag categories. In category O, ζ is semisimple; a finite generating set gives finitely many eigenvalue cosets modulo Z. Choose a grading origin on each coset. Each standard has finite-dimensional graded components, because its finite Levi space has scalar ζ-action and the graded pieces of N are finite dimensional; the same holds for finite flags. Weight restriction and degree restriction therefore agree here. All U-morphisms preserve the actual ζ-eigenvalues. Changing origins just shifts gradings, so the construction descends to the ungraded flag category using the ζ-locally finite internal Hom. On outputs the eigenvalue cosets are shifted by γ(ζ) and negated by the principal dual; this is part of the construction, not an extra integrality assumption on highest weights.

7.2F2F4step 6.1algebra

Reverse-column shifts. The automorphism c preserves the upper Borel and carries pˉ to p. If the source Levi highest weight is λ, that of E∗ is −wJˉλ, so step 6.1 gives ν=−wJˉλ−2ρuˉ before applying c∗. Pullback by c sends a highest weight to −w0ν, giving the displayed weight map. A target block of length r starting after b coordinates has reversed source offset b′=n−b−r. The map w0wJˉ preserves its position k=1,…,r inside the column. The value of 2ρuˉ on the source block is n−2b′−r=b−b′, hence the value of 2w0ρuˉ on the target block is b−b′. The source coordinate ai+b′+k−1 is consequently transported to ai+b′+k−1+b−b′=ai+i−1. Thus Ψ(Δˉ(A))=Δ(A) including the scalar trace-centre coordinate.

8.1F2F4step 7.1step 7.2algebra

With ρi=(n+1−2i)/2, the shifted coordinate is λA,i+ρi=ai+(n−1)/2. Reversing columns preserves its multiset, so corresponding source and target standards belong to matching central-character summands; extensions of standards in one summand remain in it, and hence so do the images under Ψ. At fixed total weight, each reversed-column prefix is the complementary suffix of the original reading; subtracting from the total changes the direction of each prefix-dominance inequality. This reverses the tableau order. Neither connectedness of a central summand nor an equivalence on arbitrary objects is used.

9.1F3step 7.1step 7.2step 8.1∎

Covariant equivalence. Restricted BGG duality is exact and contravariant, sends target standards to costandards and preserves the target central summands. Composing it with the contravariant equivalence Ψ gives the covariant exact equivalence F=DΨ and F(Δˉ(A))=∇(A). The label order reversal comes from step 8.1, whereas applying D changes the variance and the kind of flag. This proves all the stated algebraic and filtered-category assertions with their restricted-Hom boundary.

Depends on

Used by

Dependency tree · two levels

75 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