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

Cherednik category O has a standard-filtered projective generator

Statement

For every finite complex reflection group and every parameter, rational Cherednik category Oc has a finite projective generator which is a direct summand of a generalized standard Gn,c=H1,c⊗S(h)⋊CW(CW⊗S(h)/S(h)>n) for sufficiently large n. It is equivalent to finite-dimensional modules over a finite-dimensional algebra. Every indecomposable projective cover P(E) of the simple head L(E) has a standard filtration and an exact sequence 0→K(E)→P(E)→Δ(E)→0, where the standard labels F in K(E) satisfy aE−aF∈Z>0. The standard labels give a finite highest-weight structure for E<F when aE−aF∈Z>0.

Facts & Assumptions

Given: A finite complex reflection group W on h and an arbitrary conjugacy-invariant parameter c, with the current minus-sign Cherednik normalization.

[F1]

PBW and standards give the triangular decomposition and induced modules; the Euler/finite-length proof gives the commutators, generalized eigenspaces, and unique simple heads for standards indexed by irreducible W-modules (The PBW theorem for rational Cherednik algebras, Standard modules for rational Cherednik category O, Every rational Cherednik category-O object has finite length).

[F2]

Every finite-dimensional module over a finite-dimensional algebra has a projective cover, unique up to isomorphism (Every finite-dimensional module has a projective cover, unique up to isomorphism over the target). This is used only after the finite-algebra model is constructed.

Proof

1.1F1F2algebra

Write H=H1,c, X=S(h∗), Y=S(h), and B=Y⋊CW. Let aE be the scalar of z=dim⁡(h)/2−∑scss on E, and put Σ={aE:E∈Irr⁡W}. The Euler element is eu=∑ixiyi+z. The Euler and finite-length argument in [F1] gives locally finite Euler action, finite generalized eigenspaces, and spectra contained in Σ+Z≥0: the spectral assertion holds on standards and their simple quotients, then on every finite composition series. Fixed generalized eigenspaces are exact, since one can decompose a preimage into its finitely many generalized eigencomponents and retain the desired component. Put b=min⁡ERe⁡(aE) and choose n such that Re⁡(β)−(n+1)<b for every β∈Σ. Every degree-(n+1) monomial in Y sends M[β] to M[β−(n+1)]=0, for every object M. Higher monomials also vanish by factoring them. Thus Y>nM[β]=0 uniformly over all objects and all β∈Σ.

2.1F1F2step 1.1algebra

Let En=CW⊗(Y/Y>n), with diagonal W-action and Y multiplying the second factor, and put Gn=H⊗BEn. Filtering the truncated Y-factor by descending degree gives a finite standard filtration: PBW makes induction exact, and each layer Sd(h)⊗CW is a finite semisimple W-module, since averaging a projection over W splits each submodule. Hence Gn∈Oc. PBW identifies its vector space with X⊗CW⊗(Y/Y>n). Give x degree 1, y degree −1, and W degree 0. Each total-degree space is finite-dimensional because the Y-degree is at most n. The operator Z=eu−degree commutes with every homogeneous generator, since both commutators equal its degree times that generator. It preserves total degree. The finite degree-zero space contains the finite generating set CW⊗1, so Z is locally finite with a finite set of generalized eigenvalues on all of Gn. Therefore the generalized Z-eigenspaces Gnβ are genuine H-direct summands.

3.1F1F2step 2.1algebrastep 1.1

Induction adjunction is explicit: an H-map Gn→M is determined by m=f(1⊗1⊗1), and this may be any vector killed by Y>n. The value on w⊗p(y) is p(y)wm. This is Y-linear, and its W-linearity follows from the diagonal action; equivalently, w⊗p corresponds to pw in the regular B-quotient. On the degree-zero generator, evaluation intertwines precomposition by Z with euM, because f(Zv)=euMf(v). Consequently Hom⁡H(Gnβ,M)=M[β]∩Ann⁡M(Y>n). For β∈Σ, step 1.1 makes this exactly M[β]. Thus Pβ=Gnβ represents an exact functor and is projective. The finite direct sum PΣ=⨁β∈ΣPβ detects every nonzero object: a nonzero vector has a finite Y-orbit, whose commuting nilpotent operators have a nonzero common kernel; that singular space contains an irreducible W-module, on which eu acts by one of the scalars in Σ.

4.1F1F2step 3.1algebra

Hom spaces are finite-dimensional: choose finitely many generators of the source decomposed into generalized Euler eigenvectors; their images lie in finitely many finite-dimensional target eigenspaces. The evaluation map PΣ⊗Hom⁡(PΣ,M)→M is therefore a map from a finite direct sum. If its cokernel were nonzero, a nonzero map from PΣ to that cokernel would lift by projectivity and contradict the definition of the evaluation image. Thus evaluation is surjective. Its kernel belongs to Oc, so each object has a presentation PΣb→PΣa→M→0. Put Γ=End⁡(PΣ)op, a finite-dimensional algebra. Applying Hom⁡(PΣ,−) to these presentations proves equivalence with finite-dimensional Γ-modules: a presentation by finite free Γ-modules lifts to a map between finite sums of PΣ, and its cokernel is the inverse construction; the same presentations identify morphisms. This argument requires only finite presentations, not cocompleteness of Oc.

5.1F1F2step 4.1algebrastep 2.1

The standard filtration of Gn in step 2.1 is graded. A section Δ(F) arising from Y-degree d has its generating copy of F in total degree −d. On that entire section, Z acts by the scalar aF+d, since eu increases by one with each multiplication by x and the grading does the same. Applying the exact generalized Z-projection to the filtration keeps a whole standard section if aF+d=β and kills it otherwise. Hence Pβ and PΣ have finite standard flags. Since the β are distinct, their sum is itself a direct summand of the single Gn.

6.1F1F2step 5.1algebra

If Ext⁡O1(Δ(E),Δ(F))≠0, then aE−aF∈Z>0. Indeed, in an extension lift the generating E into its generalized Euler space of eigenvalue aE and split the resulting W-surjection by averaging. Each y sends this lift into Δ(F)[aE−1]. Unless aE−aF is a positive integer, that space is zero. The lift is then singular and induction adjunction gives a splitting from Δ(E). This includes the case aE=aF. Also End⁡(Δ(E))=C, because an endomorphism is determined on the irreducible generating copy of E. A map Δ(E)→Δ(F) vanishes when Re⁡(aE)<Re⁡(aF), or when those real parts agree and E≠F: the target either has no space of weight aE or has only its degree-zero F there.

7.1F1F2step 6.1algebra

Let B be the subobject formed by the factors of minimal real part in a standard filtration of M. By step 6.1, adjacent inversions split, so the filtration can be sorted by increasing Re⁡(a); extensions among equal-real-part factors split as well. Hence B is a direct sum of standards and M/B has only larger-real-part factors. Every map Δ(E)→M from a minimal label factors through B, since its map to M/B vanishes on each higher-real-part standard section by step 6.1 and induction along that filtration. Conversely, the summand inclusions in B are such maps, so their images sum to B. For minimal labels, step 6.1 gives Hom⁡(Δ(E),Δ(F))=0 when E≠F and End⁡(Δ(E))=C. Thus dim⁡Hom⁡(Δ(E),M) is the multiplicity of Δ(E) in B. The evaluation map from ⨁EΔ(E)dim⁡Hom⁡(Δ(E),M) onto B is therefore surjective between finite-length modules of equal length, so it is an isomorphism. This identifies B canonically as the sum of all images from minimal standards. Every idempotent e:M→M preserves B; on B, it is a block matrix over End⁡(Δ(E))=C with no maps between distinct labels, so eB is a direct sum of standards. By induction on the number of real-part levels, the image of the induced idempotent on M/B is standard-filtered. Since eM∩B=eB, the sequence 0→eB→eM→e(M/B)→0 is exact. Concatenating the flags of its standard-filtered ends gives a standard filtration of eM.

8.1F1F2step 7.1algebrastep 4.1

The finite-algebra model from step 4.1 has projective covers by [F2]. Transporting them back gives P(E)↠L(E) with simple head L(E) once. Each is a summand of a finite sum of PΣ, hence is standard-filtered by step 7.1. Sort its flag as there. Its top real-part group is a quotient which is a direct sum of standards, so its simple heads are quotients of P(E). The simple head condition forces this group to be exactly one Δ(E). Thus 0→K(E)→P(E)→Δ(E)→0, where all standard labels F in K(E) have Re⁡(aF)<Re⁡(aE). Euler spectra split every object into congruence classes modulo Z, because generators shift Euler eigenvalues by integers. The indecomposable P(E) lies in its head's class, so every such F also has aE−aF∈Z and hence aE−aF∈Z>0. Other composition factors of Δ(E) have aF−aE∈Z>0, since a proper submodule misses degree zero. These are precisely the standard-support and projective-kernel conditions for the stated finite highest-weight order.

9.1F1F2step 8.1algebra∎

The simple labels are distinct and have scalar endomorphisms. If L(E)≅L(F), the two lower Euler bounds force both aE−aF and aF−aE to be nonnegative integers, so they are zero; the common lowest W-space then identifies E=F. An endomorphism of L(E) is determined on its irreducible generating lowest space and is scalar. Every nonzero map from a projective cover P(E) to a simple has its unique maximal kernel, so Hom⁡(P(E),L(F))=δEFC. Exactness of Hom⁡(P(E),−) along composition series gives dim⁡Hom⁡(P(E),M)=[M:L(E)]. This proves the projective-generator and highest-weight assertions with the multiplicity formula used below.

Depends on

Used by

Dependency tree · two levels

14 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