Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

The Soergel functor on the small regular sl_2 block

Example

Assume the Axiom of Choice inherited from the category-O suppliers. Work in the dominant regular integral sl2 block at λ=0, with ρ=1, W={e,s} and s⋅0=−2 (The regular integral block and its antidominant weight). Set k=C. Put Δe=M(0), Δs=M(−2)=L(−2), Pe=P(0)=Δe and Ps=P(−2); the block is described by the nonsplit sequences 0→L(−2)→Δe→L(0)→0,0→Δe→Ps→Δs→0, the second being the one-letter case of Wall-crossing acts on standard modules by a two-step extension and Wall-crossing compositions produce the projective with the top standard label, and Pe=Δe being the dominant Verma (BGG reciprocity, Verma modules).

The values of V. Let C=k[x]/(x2) with deg⁡x=2 be the coinvariant algebra and V=Hom⁡(Ps,−) (The antidominant projective and the Soergel functor), so that End⁡(Ps)≅C by The endomorphisms of the antidominant projective form the coinvariant algebra. Since Ps has indecomposable head L(−2) and L(−2)=M(−2) is simple, the left C-module values are V(Pe)=k=C/(x),V(Ps)=C,V(Δe)=V(Δs)=k,V(L(0))=0,V(L(−2))=k. Indeed V(Δe) and V(Δs) are one-dimensional by exactness applied to the first sequence and V(L(−2))=k from the head quotient, while V(L(0))=0 because L(0) is not a quotient of Ps; the unique one-dimensional C-module is k with x acting by zero.

The projective Hom table. With rows indexed by the source and columns by the target, the four Hom spaces in the ordered bases (Pe,Ps) are (Hom⁡(Pe,Pe)Hom⁡(Pe,Ps)Hom⁡(Ps,Pe)Hom⁡(Ps,Ps))=(kkkC),dimensions (1112). Choose the nonzero maps i ⁣:Pe→Ps and p ⁣:Ps→Pe; under the Struktursatz Soergel's Struktursatz: the functor V is fully faithful on projectives their images in Hom⁡C(k,C)=k i0 and Hom⁡C(C,k)=k p0 are the generators i0(1)=x and p0(a+bx)=a, and the compositions compute p0i0=0 on k while i0p0=mx, multiplication by x on C (equivalently pi=0 and ip is a nonzero square-zero endomorphism; rank one refers to its image under V on C). In particular End⁡(Ps)≅C is recovered as the full two-dimensional endomorphism algebra, and the full-faithfulness comparison is computed on the four projective Hom spaces rather than claimed for the whole block.

Polynomial lifts and standard ranks. For S=k[a] with s(a)=−a, the empty-word lift is Be=S and the rank-one lift is Bs=S⊗k[a2]S(1) (The Soergel bimodule Bi of a simple reflection); their right origin reductions are k and C(1), whose centered auxiliary degrees are −1,1, and the labels e−1=e, s−1=s agree with the dictionary of Indecomposable projectives correspond to indecomposable Soergel modules. Before reduction the standard graph ranks, in the order (e,s), are (1,0) for Be and (1,1) for Bs: in the two-variable model Bs=k[l,r]/(l2−r2)(1) the submodule generated by l−r is free of rank one on the graph l=−r with annihilator (l+r), and the quotient is free of rank one on the graph l=r, with annihilator (l−r) (Standard graph bimodules, support filtrations and characters). These ranks agree with the Verma-flag multiplicities (1,0) of Pe and (1,1) of Ps at v=1, as predicted by Verma-flag multiplicities are standard-filtration ranks under V; they are taken before the graph supports coalesce at the origin, and no grading on arbitrary category-O objects or intrinsic separated-support filtration on V(P) is asserted.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

89 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