Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adapted
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.

Separated integral cosets give typed parabolic category equivalences

Statement

Assume AC. Work in genuine type-A parabolic category O for glN(C) with its fixed Borel. Its column Levi has ordered blocks of heights q1≥⋯≥ql. All entries in column j lie in cj+Z, where the original admissibility condition is cj−ck∈Z⇒cj=ck. Use the source highest-weight convention ηi=ai+i−1 and half-sum ρi=(N+1−2i)/2, with the column reading prescribed by the source Borel. For each occurring entry coset κ retain its columns in their original order. Fix an order on the finite set of cosets; no order on C is used.

Subject to the local HC tensor-projective comparison stated in [F1], stable sorting of the coordinates by κ gives an exact, complex-linear equivalence of the genuine parabolic categories, carrying each ordinary Verma label by the dot permutation and carrying the corresponding generalized standard, simple head and projective cover. On each linkage block, the sorted category is equivalent to the product of the corresponding parabolic blocks for glNκ, where Nκ=∑j∈κqj. Product means the abelian category generated by finite presentations of outer tensor products, equivalently modules over the tensor product of the finite block endomorphism algebras.

For the original pyramid with n rows put nκ=max⁡j∈κqj. The component integral entry dictionary is exactly aiint=ai−cκ+n−nκ,mj=qj−nκ,inf⁡Iκ=1−nκ. Thus mj+1−inf⁡Iκ=qj, with the original nonincreasing retained heights and charges. For the admitted-ground subcategories, where each original entry has a nonnegative integral difference from its own ground entry, this dictionary lands in the bounded-below admitted integral component models of [F4]. For other genuine parabolic blocks it records the integral weight/coset dictionary and the trace shift, without asserting membership in that fixed admitted cut. If the component follows Bκ sorted coordinates, its Levi highest weight and the integral highest weight differ by the scalar trace-character shift δκ=Bκ+cκ−n+nκ. This shift is a Lie algebra character and requires no integrality of cκ. Singular repeated-entry linkage blocks are included. The original complex origins, component entry multisets and their scalar centres remain recorded; different complex cosets are not merged into one integral block.

Sorting commutes coherently with finite tensoring and its invariant Casimir and permutation maps. The separated product decomposition is blockwise and does not assert that unrestricted tensoring is componentwise. The proof gives its actual filtration and block-projection comparison. Choices of sorting word with the same stable permutation yield the natural comparison fixed on the chosen reference highest vector and its tensor-projective presentations.

Facts & Assumptions

Given: The original admissible origins and nonincreasing column heights, the source Borel and highest-weight convention, and AC. No realness, mutual comparability, regularity of the subject block, or integrality across different cosets is assumed.

[F1]

The local tensor-projective comparison The regular coset-dominant Harish–Chandra tensor comparison: for a regular weight λ decreasing within each integral shifted-coordinate coset, finite integral-coordinate tensors E⊗Δλ and their direct summands give projective generators of Oλ+ZN; for finite E,F their Hom spaces are naturally (E∗⊗F⊗Uχλ)g, with evaluation and composition. Its same all-weight Duflo input is required for s⋅λ after a distinct-coset adjacent swap. The all-weight action isomorphism is supplied through that local HC lemma; the present proof uses its Hom comparison at both regular reference weights and does not reprove the Duflo theorem.

[F2]

Finite length, projective covers and PBW: Every object of O has finite length, Category O has enough projectives, PBW gives an ordered monomial basis for the enveloping algebra. The scalar centre of glN splits off from the semisimple theory.

[F3]

Actual linkage, not a central-character identification: Central-character summands refine into linkage blocks, The strong linkage principle for Verma modules, Integral reflection linkage is an equivalence relation. In type A, the integral roots are exactly differences of shifted coordinates in the same C/Z coset; their group permutes those coordinates.

[F4]

Genuine parabolic modules and the admitted integral component convention: Parabolic category O for a standard parabolic, The integral parabolic category-O blocks for higher-level Schur-Weyl duality, Finite-dimensional simple modules are classified by dominant highest weights. Only the Levi-integrable simple criterion, Serre property, largest generalized-Verma quotient and the explicit integral charge/height convention are consumed. The proof below constructs the nonintegral product rather than importing integral highest-weight conclusions for arbitrary complex labels.

[F5]

AC The Axiom of Choice, with the exact inherited/projective use recorded above.

Proof

technique · direct

Given: Use the data of the Statement and [F1]–[F5]. Normalize Chevalley matrices by E=Ei,i+1, F=Ei+1,i and H=[E,F]. Twist by ϕ=exp⁡(ad⁡E)exp⁡(ad⁡(−F))exp⁡(ad⁡E) with twisted action x⋅v=ϕ(x)v.

1.1givenalgebra

Every H-weight in the relevant weight-coset category is nonintegral when the adjacent shifted coordinates belong to different entry cosets: η(H)=(η+ρ)i−(η+ρ)i+1−1, and weight changes are integral. This holds in every subquotient. If Fv=0 for a weight vector of weight h, choose r≥0 maximal with Erv≠0, using positive-root local nilpotence in O. The sl2 relation gives FEr+1v=−(r+1)(h+r)Erv, a contradiction. Thus F is injective on every object and subquotient of that category.

2.1F2step 1.1constructalgebra

Powers of F satisfy both Ore conditions in U(g): iterating Fu=uF+[F,u] gives the finite binomial commutation formula, since ad⁡F is locally nilpotent on each enveloping element. PBW makes U a domain. Its localization UF=⋃k≥0F−kU is a directed union of free right U-modules; consequently localization MF=UF⊗UM is exact. Step 1.1 makes M→MF injective, and the diagram of short exact sequences 0→M→MF→MF/M→0 proves exactness of CF(M)=MF/M. Therefore Ts(M)=ϕCF(M) is exact. The adjoint exponentials defining ϕ are finite on every u∈U; they send E,F,H to −F,−E,−H and act as the adjacent permutation on the Cartan.

3.1F2step 2.1constructalgebra

Let v be the normalized highest vector of Δη. The class F−1v becomes a highest vector of weight s⋅η: its new E is −F, whose value lies in Δη; the other transformed positive roots are positive roots distinct from αi, and commuting them through F−1 leaves positive-root terms killing v. The new F sends F−rv to r(η(H)+r+1)F−r−1v, with every scalar nonzero. PBW, ordered with F first, gives the basis of the localized quotient with F-powers −1,−2,…; reflection permutes the remaining positive roots. Hence the displayed vector generates the quotient. Its character is s(eη∑r≥1erαi∏β>0,β≠αi(1−e−β)−1)=ch⁡Δs⋅η. The highest-vector surjection is an isomorphism by equality of each finite weight dimension. This fixes its scalar by vs⋅η↦[F−1vη].

4.1step 2.1constructalgebrastep 3.1

For finite-dimensional X, localization commutes with tensoring. On MF⊗X the total operator FM+FX has inverse FM−1∑k≥0(−FM−1FX)k; the sum is finite since FX is nilpotent. The localization universal property identifies (M⊗X)F with MF⊗X and identifies the embedded M⊗X. Quotienting and the Weyl matrix WX=exp⁡(EX)exp⁡(−FX)exp⁡(EX) identify Ts(M⊗X) naturally with Ts(M)⊗X. For two finite tensor factors, WX⊗Y=WX⊗WY, so associativity and the tensor-unit diagrams commute. The diagonal Weyl action fixes the invariant Casimir and commutes with flips, proving their compatibility as actual operators.

5.1F1step 3.1step 4.1algebra

Choose regular coset-dominant λ in the weight-coset category. Crossing distinct cosets preserves each coset's internal order, so s⋅λ meets the same regular coset-dominance hypotheses; its central character equals χλ. For a generator map encoded by t∈(E∗⊗F⊗Uχ)g, its action is the finite sum of finite-tensor matrix entries followed by enveloping operators on Δλ. The invariant matrix map commutes with the total F on the tensor modules, so its unique localized extension agrees with the same enveloping-operator formula under the tensor localization of step 4.1. Passing to the quotient, twisting and applying the matrices of step 4.1 transforms t by simultaneous Weyl conjugation in its three factors. Each t lies in a finite adjoint submodule, so that conjugation is exp⁡(Ediag)exp⁡(−Fdiag)exp⁡(Ediag) and fixes t, since its diagonal g-action is zero. Thus Ts induces exactly the common Hom identification of [F1], respecting composition and identity. The scalar from step 3.1 is the same on all generators X⊗Δλ, so it cancels on every generator Hom space; an arbitrary unnormalized scalar is not treated as a literal equality of highest vectors.

6.1F1F2F5step 2.1step 5.1constructalgebra

Every object has a finite presentation by finite direct sums and summands of the generators in [F1]. Exactness and steps 3.1–4.1 show that its Ts image is the cokernel of a map between target generators, hence belongs to the target category O. Step 5.1 identifies all generator maps. Every target presentation therefore lifts, proving essential surjectivity. Applying Hom from a generator to a source presentation and its target presentation gives identical cokernel diagrams, since those generators are projective; applying Hom from a presented object gives identical kernel diagrams. This proves full faithfulness on all objects. Idempotents are preserved and reflected by the generator Hom identification, so summands cause no gap. Consequently Ts is an exact category equivalence, established on actual maps and presentations.

7.1F4step 3.1step 6.1constructalgebra

Compose these swaps in a stable bubble sort by the fixed coset order. Each swap crosses different cosets; none permutes indices inside a coset. The composite sends Δη to Δw⋅η and therefore sends its unique simple head to L(w⋅η). It transports projective covers by exact equivalence and essentiality. Every original column consists entirely of one coset; stable sorting retains its coordinates as a consecutive block and retains their internal order. At the end, the original Levi simple roots are therefore positive simple roots of the sorted column Levi. Their highest-weight integral-dominance pairings are unchanged. By the actual Levi simple criterion and Serre property of [F4], the composite and its inverse restrict to the full parabolic subcategories. Because generalized Vermas are the largest parabolic-finite quotients of ordinary Vermas, their quotient universal property is transported, giving the claimed generalized-standard labels as modules. No intermediate swap is asserted to preserve an intermediate parabolic subcategory.

8.1F1step 4.1step 5.1step 6.1constructalgebrastep 7.1

The coherent comparison of two sorting paths can be made on tensor-projective generators. Each path has the common [F1] Hom matrix identification of step 5.1; their final Weyl representatives differ at most by a diagonal torus matrix when they induce the same coordinate permutation. Diagonal simultaneous action again fixes invariant matrices. Their reference-standard highest lines admit a unique comparison after fixing its nonzero scalar; tensor it with X for every generator and summand. The equality on generator Hom matrices makes these comparisons natural, and taking presentation cokernels extends them uniquely to all objects, independently of a presentation by full faithfulness. Comparisons for three paths compose because they coincide on the normalized reference generator and its tensor presentations. This proves the stated normalization and coherence, without asserting an unnormalized inverse-twist or braid identity.

9.1F2F3constructalgebrastep 8.1

After sorting let q have contiguous coset Levi l=⨁κglNκ and positive outside radical u. In a fixed linkage block C, [F3] says exactly that highest labels are obtained by permutations within the coset blocks, including when entries repeat. Hence all highest labels have the same block-centre values zκ. For each initial union of coset blocks, write Zr for its diagonal trace and br for the common highest-label value. Every module weight satisfies br−μ(Zr)∈Z≥0: this holds on simple highest-weight modules by their negative-root weights and on all finite-length objects by their composition series. An outside negative root strictly lowers at least one prefix; an inside root leaves every prefix fixed. The simultaneous top section S(M)={v:Zrv=brv ∀r} is therefore a Levi module and is annihilated by u. It is exact, since it is a direct sum of Cartan weight spaces and the Cartan acts semisimply. These are integer differences from fixed complex values, not inequalities on complex numbers.

10.1F2F3step 9.1algebra

In fact Mu=S(M). If a nonzero homogeneous radical-invariant vector lies in a lower prefix section, its Levi cyclic module has a highest vector: its positive Levi orbit is finite-dimensional and a maximal weight therein is killed by every positive Levi root. Radical invariants are Levi-stable because [l,u]⊂u. That Levi highest vector is thus a full g highest vector. Its cyclic module has a simple highest-weight quotient of the same weight and the same strictly lower prefix, contradicting the actual label restriction in [F3]. Decomposing a general invariant into centre weights gives the same contradiction componentwise. Moreover S detects nonzero objects: every simple of C has a nonzero highest vector in its top section, and exactness plus a composition series proves the assertion for every nonzero finite-length object.

11.1F2F3step 9.1step 10.1constructalgebra

Let Cl be the product integral-reflection orbit for the Levi highest weights with these fixed scalar centres, and define R(X)=U(g)⊗U(q)X, with u acting by zero. PBW makes R exact and identifies S(R(X))=X naturally: every outside negative PBW monomial lowers some prefix, so only its degree-zero term contributes. For a Levi simple Ll(η), induction is a quotient of the ordinary g Verma of label η, hence lies in C by [F3] and has finite length by [F2]. Every composition factor has nonzero top section by step 10.1; exactness and S(R(Ll(η)))=Ll(η) imply that there is only one factor. Thus R(Ll(η))=Lg(η) is simple. Exactness extends block membership and finite length to R(X) for every finite-length X by a Levi composition series.

12.1F4step 10.1step 11.1constructalgebra

Induction and radical invariants are adjoint, and step 10.1 identifies the latter with S. Their unit is PBW's top-section isomorphism X→S(R(X)). For the counit R(S(M))→M, applying exact S gives this identity, so its kernel and cokernel have zero top section; both are finite-length objects of C and vanish by detection in step 10.1. Hence R and S are inverse exact category equivalences. This argument proves full faithfulness from the actual unit and counit. It does not deduce it from composition matrices. By induction transitivity, ordinary Levi Vermas go to ordinary g Vermas; the corresponding column-generalized Vermas go to their genuine column-parabolic inductions. The Levi integrability criterion restricts the equivalence to the column-parabolic subcategories just as in step 7.1; projective covers again follow by exact equivalence.

13.1F2F4step 12.1constructalgebra

Each finite Levi factor block has a finite projective generator (finite label orbit and [F2], or its parabolic reflector). For two outer tensor projectives, their Hom is the tensor product of their factor Homs, by tensor-Hom and the finite-dimensional factor Hom spaces; applying a factor-projective Hom successively is exact: a fixed weight for the other factors cuts a finite-generated factor-O module, since PBW bounds the negative monomials in those fixed coordinates; factor projectivity therefore applies weight by weight. The resulting multiplicity module is in the remaining factor O, by the same PBW finiteness with the finitely many generator weights of the projective. Their outer tensor sum therefore is projective, and its simple quotients cover all factor tuples. Those tuples exhaust the simple labels of the direct-sum Lie algebra: the outer tensor of the factor simples is cyclic on the tensor of their highest vectors. Any nonzero submodule has a highest vector by positive-root local finiteness and bounded highest-weight support; taking invariants successively in the separate positive root algebras leaves only that tensor highest line, because a simple highest-weight factor has no other highest vector. The submodule thus contains the cyclic generator, proving simplicity and identifying the unique simple quotient of the direct-sum Verma. Thus the outer tensor generator gives finite presentations of every object and has the tensor-product endomorphism algebra. Applying the generator Hom and its presentation inverse proves the product description in the Statement. This also proves standard/simple/projective tensor labels as objects, not just as classes.

14.1F4step 7.1step 13.1constructalgebra

The original tableau convention gives ηi+ρi=ai+(N−1)/2, so dot sorting is literally stable sorting of the ai. In the sorted κ block the Levi coordinate is at+Bκ+t−1. The integral coordinate from the Statement is at−cκ+n−nκ+t−1; their difference is exactly δκ. Tensoring with the one-dimensional Lie algebra representation x↦δκtr⁡(x) is an exact inverse equivalence with inverse shift −δκ, and its tensor associativity is ordinary scalar multiplication. It carries highest vectors, induced standards, simple heads and projective covers. Since a ground entry in global row r is cκ+1−r, its integral image is 1−(r−n+nκ); these are the actual bottom-aligned integral ground rows. The retained heights give mj=qj−nκ nonincreasing and mj+1−(1−nκ)=qj. For an admitted-ground label, subtracting its original ground entry gives a nonnegative integer; the displayed dictionary preserves that difference. Its integral entry is therefore at least the corresponding bottom-aligned integral ground entry and lies in the fixed admitted alphabet of [F4]. For an arbitrary genuine label the scalar shift still gives an integral parabolic highest weight, but no fixed-cut membership follows. Thus the height/charge dictionary holds generally and the fixed admitted component hypotheses of [F4] hold on the stated admitted-ground subcategories, without treating a nonintegral scalar trace character as an algebraic determinant character.

15.1F3step 11.1step 12.1constructalgebrastep 14.1

For clarity about tensor transport, the ordinary induction tensor identity is R(X)⊗V≅U(g)⊗U(q)(X⊗Res⁡qV); it follows from the coproduct and antipode and is natural in X,V. The restricted vector representation has its actual prefix-q filtration whose sections are the coset vector modules Vκ with outside radical zero. Exact induction therefore gives a filtration of R(X)⊗V with sections R(X⊗Vκ). A projected linkage/entry-multiset tensor summand admitting an entry change in coset κ kills the other sections: their highest labels change a different coset multiset, so their central characters or linkage classes differ by [F3]. Only the κ section survives, giving its natural component comparison; the dual vector representation has the reversed filtration and the same argument. Thus the residue-projected operators transport to the appropriate integral factor. Iterated tensor comparisons use the same actual filtrations and the associative tensor identity, so their diagrams commute; no unrestricted tensor-product assertion is inferred.

16.1step 4.1step 7.1step 12.1step 13.1step 14.1step 15.1algebra∎

The trace-character shift changes the relevant vector Casimir eigenvalue by its scalar: for Ω=∑i,jEij⊗Eji, replacing the first-factor action by Eij+δijδ adds δ∑i1⊗Eii=δ on a vector representation; the dual gives the corresponding opposite shift. The offset can be computed explicitly: on a vector-tensor Verma section of highest label η+εi, the quadratic central element has value ∑kηk(ηk+N+1−2k), while its value on the vector is N. Taking half the difference gives the global tensor-Casimir eigenvalue ηi+1−i. For the Levi coordinate t=i−Bκ, the same calculation gives ηi+1−t, greater by Bκ. Hence the trace shift contributes δκ−Bκ=cκ−n+nκ to the original residue: (cκ+qj−n)−(qj−nκ)=cκ−n+nκ. This computes the parameter dictionary and the block projections of step 15.1; no integer residue is silently equated with its complex original. It does not replace a proof of the full affine-Hecke natural-transformation presentation. Together with steps 4.1 and 15.1 this proves the claimed normalized compatibility, and steps 7.1, 12.1–13.1 and 14.1 prove the typed category equivalence with all stated labels and hypotheses.

Adoption boundary

The sixteen-step proof supplies the local category equivalence using the proved local HC comparison in [F1] and the stated category-O suppliers. The fixed bounded-below integral component model is invoked only for the admitted-ground subcategories; the genuine full category equivalence and trace-character dictionary retain their full scope. This draft does not supply the Fock canonical-basis identification, the affine-Hecke presentation, or Whittaker simple-image assertions.

Depends on

Used by

Dependency tree · two levels

70 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