Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Stable range and block idempotent corner for higher-level Schur-Weyl duality

Definition

Assume the Axiom of Choice. Keep a nonempty pyramid λ=(0≤p1≤⋯≤pn) with l=pn>0 columns of heights q1≥⋯≥ql, the origin c, and Ud=Vc⊗d of The deformed tensor space for the type-A finite W-algebra. The stable range is ql≥d: there are at least d rows of maximum length l. Put aj=cj+qj−n, Ad=im⁡(W(λ)→End⁡Ud) and Bd=im⁡(Hd(a)→End⁡Udop).

For every complex origin the finite image algebras are mutual centralizers, and the raw Hecke action is faithful in the stable range. For an admissible origin, meaning cj−ck∈Z implies cj=ck, the following construction defines the central support outside that range. Append t full ground rows of length l until ql+t≥d, keeping l and c fixed. Then n and every qj increase by t, so every aj stays fixed. In the enlarged tensor space Udbig, let e be the projection onto tensors using only retained rows, equivalently having zero occupancy in every deleted row. A large tableau is contractible if every deleted-row entry is the ground entry cj+1−r in row r and column j. The supporting central idempotent f acts as one on precisely the contractible standard-labelled simples and as zero on the others. Through the faithful enlarged Hecke action it is a central idempotent of Hd(a), and Bd≅fHd(a)f,ker⁡ψd=(1−f)Hd(a).

This f is a sum of entire supporting central blocks. Individual residue idempotents e(i) need not be central; they do not individually define this two-sided corner. The unrestricted tensor model does not by itself supply the admissible central-support conclusion.

For the empty pyramid l=N=0, the convention is separate: in degree zero the tensor and image algebras are C with the identity corner f=1; in positive degree the tensor, image algebras and their module categories are zero and f=0. No ql or nonempty stable-range condition is used in that case.

Facts & Assumptions

Given: The actual tensor actions, the small and enlarged pyramids, and their finite image algebras.

[F1]

The actual right tensor matrices, independent filtered double centralizer, stable injectivity and admissible finite-image projectivity are supplied by The deformed tensor space for the type-A finite W-algebra, The finite W and degenerate cyclotomic Hecke actions satisfy a double centralizer and Vust's graded double centralizer for the type-A nilpotent centralizer.

[F2]

The genuine original-head standard/simple comparison identifies V(A) as the head-normalized inducing Levi module, with scalar central character given by the content θ(A); a standard-labelled V(A) has unique simple quotient LW(A) by the essential-projective-head and genuine finite-W Morita argument in step 9.1 of The Whittaker functor is exact and fully faithful on the required projectives, and these are the distinct exhaustive finite-image simples. Its original path and Gauss generators are those of The Whittaker functor from the relevant parabolic category-O summand and The shifted Yangian and the pyramid generators of the type-A finite W-algebra.

Proof

technique · direct

Given: Ubig, U, the retained-box embedding i↦i^, and admissible c for the central-support claims.

1.1F1constructalgebra

The retained projection is an actual left-image idempotent. The matrix e=∑i∈IdEi^,i^ commutes with the right xk and sk: left-neighbour moves, place swaps and scalar terms preserve the row multiset, so none changes zero deleted-row occupancy. Thus e∈Adbig by the independent first centralizer. Every term of the right tensor formula restricts identically under vi↦vi^, because row and column positions and left neighbours agree and cj+(qj+t)−(n+t)=aj. This proves the actual right-bimodule identification eUbig=U and a surjective restriction map ρ:Bdbig→Bd. Extending a commuting operator on eUbig by zero on (1−e)Ubig shows Ad=eAdbige. No Morita conclusion is used.

2.1F1F2step 1.1constructalgebra

The standard contraction has the same corner action. In column j the finite Levi module is Ccj⊗Sμ(j)(Cqj+t), with μ(j) the partition of the ground differences. The zero-occupancy part is Ccj⊗Sμ(j)(Cqj), by the tensor Young-symmetrizer realization; it is zero precisely when a removed-row partition entry is nonzero. For the original Tij;0(r) path sum, every summand is a product of matrix units with strictly increasing join columns. Levi projection kills strict off-column matrix factors, leaving at most one factor in each column. A deleted intermediate row causes an off-diagonal crossing in a column whose removed-coordinate occupancy then cannot be restored by another factor, so zero-occupancy compression kills it. Every surviving path has only retained rows and is exactly a small path. The head shift changes by −(j−1)t in column j, while a retained box's ordinary source reading position changes by +(j−1)t. Its source highest weight Abox+k−1 therefore cancels that shift: the normalized weight is Abox+row⁡(box)−1 in both diagrams. Hence the complete retained matrix action, and then formal Gauss elimination, gives eV(A)=V(Aˉ) for contractible A, and zero otherwise, with the corner identification of step 1.1.

3.1F2F3step 2.1constructalgebra

The simple contraction and central saturation. The same projector acts on all standards: let Hr=Trr;0(1) be the row Cartan and κr=∑j:row r reaches column jcj. Its head-normalized action on a degree-d Levi standard has Hr−κr equal to polynomial row occupancy with eigenvalues 0,…,d. Hence e=∏r deleted∏h=1d(1−(Hr−κr)/h) is exactly zero removed-row occupancy on every standard and equals step 1.1's image idempotent; for d=0 the inner product is one. Exactness of e(−) and step 2.1 therefore kill every noncontractible simple. For a surviving big simple L, each nonzero v∈eL generates eL=eAdbigev, so eL is simple. Conversely for a corner simple S, every proper submodule of Adbige⊗eAdbigeS is killed by e: one with image S generates that whole induced module. The sum of proper submodules is thus proper and is its unique maximal submodule. Its simple quotient has e-image S. This proves a bijection between corner simples and surviving big simples without a Morita assumption. Every small standard tableau extends uniquely by full ground rows to a contractible large standard tableau. The complete Std simple lists in F2 and the corner of step 1.1 show that the survivor subset has the same finite cardinality as all contractible Std labels, so every contractible simple survives. Its simple image is a quotient of eV(A)=V(Aˉ), whose already proved unique head gives eLW(A)=LW(Aˉ). If θ(B)=θ(A) and A is contractible, separate the charge cosets. Admissibility makes all charges in one coset equal. The minimal bottom entry cj+1−(n+t) occurs once in every column of that coset; strictness and nonnegative ground differences force these occurrences into the same bottom row of B. Remove that row and repeat for all deleted rows. Then B is contractible. Scalar central characters therefore separate contractible from noncontractible simples, so generalized central-character decomposition gives a central idempotent f∈Adbig with exactly that support. Since e kills all complementary simples, e(1−f)=0: a nonzero idempotent acts nontrivially on some simple of a finite algebra. Hence e=ef=fe.

4.1F3step 3.1constructalgebra

Fullness and the supported module equivalence. Set Af=fAdbigf. Every simple Af-module survives e. If AfeAf were proper, the nonzero finite quotient Af/AfeAf would have a simple killed by e, a contradiction. Thus write f=∑kakebk. Multiplication Afe⊗eAfeeM→M has inverse m↦∑kake⊗ebkm; the fullness identity and tensor balancing verify both composites. Also e(Afe⊗N)→N is the canonical isomorphism. These actual maps give inverse equivalences on all supported-block modules. In particular the functor e(−) is faithful on that summand, and its kernel on all large finite-image modules is exactly the complementary summand.

5.1F1step 1.1step 4.1constructalgebra

The simultaneous central corner and both kernels. The operator f commutes with Adbig, hence belongs to Bdbig by the second centralizer. It is central there because every right operator commutes with every left operator. The equivalence of step 4.1 identifies End⁡Af(fUbig)op with End⁡eAfe(eUbig)op, so the restriction of ρ is an isomorphism fBdbigf→Bd. Its kernel on Bdbig is (1−f)Bdbig. The enlarged stable action is faithful by F1, giving Bd=fHd(a)f and ker⁡ψd=(1−f)Hd(a). On the left, fUbig has annihilator (1−f)Adbig, and eUbig is faithful for its corner eAdbige; the latter need not be a module for all of Adbig. Infinite-W kernels are the inverse images of these finite-image kernels.

6.1F1step 3.1step 5.1algebra∎

The parameter boundary. Stable faithfulness and the matrix restriction of step 1.1 hold for every complex origin. Central saturation in step 3.1 used admissibility, so the supporting-block and faithful-equivalence assertions are made only there. The supporting idempotent is a sum of whole central blocks; individual residue idempotents are not thereby made central. All row additions keep l fixed and add full rows, preserving cj+qj−n exactly.

Remarks

The equivalence above is between the supported finite-image summand and the retained finite-image corner. If the enlarged tensor module is a progenerator, this explicit equivalence transports its supported part to the small tensor progenerator. Ground and ordinary-dual adjunction proofs establish that hypothesis in the admissible double-centralizer supplier; the corner proof does not assume its own Morita conclusion.

Depends on

Used by

Dependency tree · two levels

73 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