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

The higher-level Schur-Weyl endomorphism isomorphism

Statement

Assume the Axiom of Choice. Let λ be a pyramid with columns q1≥⋯≥ql, let c be an admissible origin, let Pc be the ground simple projective-injective of the relevant summand of the parabolic category O of The integral parabolic category-O blocks for higher-level Schur-Weyl duality, and let T=Pc⊗V⊗d with V=CN. Write Bd=ψd(Hd(Λ)) for the image of the right cyclotomic Hecke action of The degenerate cyclotomic Hecke algebra and Bα for its central components. Then the right Hecke action gives an algebra isomorphism End⁡g(T)op=Bd, and on each central component, cut by the central idempotents fα of Bd acting on T=⨁αTα, End⁡g(Tα)op=Bα=fαHα(a)fα, where Hα(a) is the corresponding block of the cyclotomic Hecke algebra. For a nonempty pyramid, in the stable range ql≥d the image is the full cyclotomic algebra, Bd=Hd(a) and Bα=Hα(a); a single component is not identified with the entire degree-d algebra. Outside the stable range the central-corner identification uses the admissible-origin corner of Stable range and block idempotent corner for higher-level Schur-Weyl duality. The maps Hd(a)↠Bd are surjective in all cases, and the full action Hd(a)→End⁡(Vc⊗d) is injective precisely when ql≥d for a nonempty pyramid. For the empty pyramid l=N=0, the degree-zero objects and algebras are T0=U0=H0=C, and for d>0 they are Td=Ud=Hd=0. All endomorphism identities hold there, and the raw action is faithful in every degree, including the zero-algebra action; ql is not defined in this branch.

Facts & Assumptions

Given: The pyramid λ, an admissible origin c, the ground object Pc, the tensor object T=Pc⊗V⊗d with its central decomposition, and the Hecke image Bd.

[F1]

The right Hecke action on T exists and its generators xj,si are natural endomorphisms of the tensor functor, commuting with g; the image is Bd=ψd(Hd(Λ)), and the Whittaker functor sends T to Vc⊗d (Arakawa-Suzuki Casimir operators on tensor functors, The degenerate cyclotomic Hecke algebra, The higher-level Schur-Weyl projective generator and Schur functor).

[F2]

The Whittaker functor is exact on Ocd, its kernel is the Serre subcategory generated by the off-standard simples, T is a self-dual prinjective detector whose simple socle constituents are standard-labelled and whose indecomposable summands are precisely the standard-labelled projective-injective covers, each occurring with positive multiplicity, and V(T)=Vc⊗d (The Whittaker functor is exact and fully faithful on the required projectives, The higher-level Schur-Weyl projective generator and Schur functor).

[F3]

The filtered double centralizer identifies the two image algebras on Vc⊗d for every complex origin: Wd and Bd are mutual centralizers, and in particular End⁡Wd(Vc⊗d)op=Bd; for a nonempty pyramid, if ql≥d the full action of Hd(a) is faithful (The finite W and degenerate cyclotomic Hecke actions satisfy a double centralizer).

[F4]

Outside the stable range the image of the Hecke action is a central block corner fHd(a)f for admissible origins, and in the stable range Bd=Hd(a) (Stable range and block idempotent corner for higher-level Schur-Weyl duality).

Proof

technique · direct

Given: The objects Pc, T, the Hecke image Bd⊆End⁡C(T)op, and the admissible-origin hypotheses.

1.1F1algebra

The Hecke action lies in the g-endomorphisms. For the empty pyramid, the empty tensor in degree zero and its ground object give T0=U0=H0=C. In positive degree V=0 gives Td=Ud=0, and the level-zero cyclotomic relation is the empty product 1, so Hd=0. The stated endomorphism identities and faithfulness follow directly, with the unique zero-algebra map injective; the remaining argument assumes a nonempty pyramid. Each generator xj of the truncated tensor action is built from the trace Casimir and place permutations and commutes with the diagonal g-action; the place permutations are natural in the module variable, so the resulting right Hd(a)-action on T consists of g-endomorphisms, and its image is Bd by definition. Hence there is a surjection Hd(a)↠Bd and an inclusion Bd⊆End⁡g(T)op, with the opposite convention fixed by the right action.

1.2F2algebra

The Whittaker comparison is injective. Let φ:T→T be nonzero and put X=im⁡φ, a nonzero submodule of the finite-length object T. Choose a simple submodule L(A)⊆X; because soc⁡X⊆soc⁡T, [F2] gives A∈Std. Exactness gives an injection V(L(A))↪V(X), and the first module is nonzero, so V(X)≠0. Exactness also identifies V(X) with the image of V(φ), hence V(φ)≠0. This proves injectivity of End⁡g(T)op→End⁡Wd(Vc⊗d)op. No restriction on all composition factors of T is used.

2.1F1F3step 1.2algebra

The image of the comparison. On V(T)=Vc⊗d the induced map lands in the centralizer of the finite-W action, End⁡Wd(Vc⊗d)op; by the filtered double centralizer [F3] this centralizer equals Bd; and the induced map contains Bd because every Hecke generator on Vc⊗d arises from the corresponding endomorphism of T by [F1]. Since Bd is the whole target, the injective map of step 1.2 is also surjective, so End⁡g(T)op=Bd.

2.2F3F4step 1.1algebra

Stable range. For a nonempty pyramid, if ql≥d then the action of Hd(a) is faithful by [F3] and the image is the full algebra Bd=Hd(a); a single central component is correspondingly a block Hα(a), not the whole algebra. Outside the stable range the corner identification of [F4] applies for admissible origins, while the map Hd(a)↠Bd remains surjective by step 1.1.

3.1F4step 2.1algebra

Central components. The central idempotents fα of the finite-dimensional algebra Bd decompose T=⨁αTα and Bd=⨁αBα; applying the isomorphism of step 2.1 componentwise gives End⁡g(Tα)op=fαBdfα=Bα. The component Bα sits inside the cyclotomic block as the corner fαHα(a)fα by [F4]; it is not the entire degree-d algebra.

4.1F2F4step 2.2constructalgebra∎

Failure of raw faithfulness below the stable range. For a nonempty pyramid, suppose d>ql and use an enlargement by full ground rows with smallest height at least d. In its last column, raise the first ql+1 entries above their ground values by 1; raise its top entry further by d−ql−1, and leave every other entry ground. This is column strict, has total degree d, and is standard: for columns with the same charge, the changed rightmost entry is at least every unchanged entry to its left in that row; different charge cosets are incomparable. The first ql rows of this column are retained, but its next row is deleted, so this standard label is noncontractible. Its nonzero large finite-W simple belongs to a complementary central block. Hence the supporting idempotent f of [F4] is proper; the faithful large tensor progenerator makes 1−f nonzero also in the large Hecke algebra. The small raw action has the nonzero kernel (1−f)Hd(a) and is not faithful. Together with step 2.2 this proves the asserted precise stable-range criterion.

Remarks

  • The key point is that the Whittaker functor is faithful on endomorphisms of T although it is not faithful on the whole category: every nonzero image has a standard composition factor, and the kernel consists precisely of the off-standard simples.

  • The opposite algebra convention in End⁡g(T)op is the one fixed in The higher-level Schur-Weyl projective generator and Schur functor: the right Hecke action composed left-to-right matches the left action of Bα on the modules of the Schur functor.

Depends on

Used by

Dependency tree · two levels

64 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