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.

Indecomposable projectives correspond to indecomposable Soergel modules

Statement

Assume the Axiom of Choice and work in a regular integral type-A block over C. With the page's right wall-crossing convention and left C-module values of V, there is an equivalence V ⁣:Proj⁡(Oλ)→∼{ungraded Soergel modules B⊗SC},P(w⋅λ)⟼Bˉw−1. The target is the additive category of direct summands of the right reductions of polynomial Bott-Samelson bimodules, or equivalently of iterated C⊗Cs(−) applied to the trivial module C, not to the regular module C. For a reduced word w=s1⋯sk, the projective is the unique new top-label summand of θsk⋯θs1Δ(λ); applying V gives the new summand of Bsk⋯Bs1‾, thus the inverse label. These normalized indecomposable polynomial lifts supply self-dual auxiliary gradings; in rank one the centered degrees are −1,1, with degrees 0,2 after an uncentered shift. Forgetting grading recovers the projective dictionary. More generally the ungraded equivalence with Weyl-group Soergel modules holds for every complex semisimple regular integral block; the type-A diagrammatic label comparison applies only in type A.

Facts & Assumptions

Given: The Axiom of Choice (The Axiom of Choice), the regular integral block with C=End⁡(P(w0⋅λ)) and V=Hom⁡(P(w0⋅λ),−), the deformed family with R=S(h)(0), and the type-A polynomial data of the suppliers below.

[F1]

V is exact, VP≅C, V is fully faithful on projectives and induces an equivalence of the quotient by ker⁡V with finite C-modules (The endomorphisms of the antidominant projective form the coinvariant algebra, Soergel's Struktursatz: the functor V is fully faithful on projectives, The antidominant projective and the Soergel functor).

[F2]

Wall crossing under V: Vθs≅C⊗CsV; for a reduced word w=s1⋯sk the object θsk⋯θs1Δ(λ) has P(w⋅λ) as its unique new top-label summand, and every projective is a summand of such a word applied to Δ(λ) (Wall-crossing under the Soergel functor is tensoring with the coinvariant bimodule, Wall-crossing compositions produce the projective with the top standard label, Indecomposable projective functors are indexed by the Weyl group).

[F3]

Deformed local data: Hom base change for lifted projectives, the weightwise Nakayama criterion, the central orders End⁡(PRλ)≅R⊗RWR and End⁡(PRν)≅RH⊗RWR, and exactness/biadjointness of the translations (Lifting of indecomposable projectives to the deformed family, The central action on the deformed antidominant projective, Translation functors are exact and biadjoint).

[F4]

Type-A polynomial data: the graded (S,S)-bimodule Bi=S⊗SsiS(1) and its tensor words, the right origin reduction Mˉ=M⊗SC, and the standard graph support layers (The Soergel bimodule Bi of a simple reflection, The type-A Soergel category SBimn, Standard graph bimodules, support filtrations and characters, The reduced Soergel module and the dominant Lefschetz operator). Intrinsic bimodule classification gives the unique normalized top-support Bw, its local degree-zero endomorphism algebra with base-field residue, and all finite decompositions; normalized self-duality is supplied independently of character induction (Indecomposable type-A Soergel bimodules are classified by their normalized top support, Normalized type-A Soergel bimodules are self-dual and have length degree bounds). Rational/real extension commutes with homogeneous Hom equations, support layers and reductions, and preserves labels (Indecomposable labels, characters and filtration ranks agree after real scalar extension).

[F5]

The polynomial rank-one generators are quadratic Frobenius extensions, and their tensor products carry the trace pairing described in The trace, the invariant intersection form on Bott-Samelson bimodules and its reduction, clauses (1)--(4). Their nondegeneracy is also checked directly in step 6.1. Normalized indecomposable self-duality will be deduced there from the unique top summand; it is not assumed from clauses (5)--(6) of that Definition.

[F6]

Wedderburn-Artin: a finite-dimensional semisimple complex algebra is a product of matrix algebras (Wedderburn–Artin theorem for semisimple rings). The graded-algebra facts needed here are proved in step 5.1.

Proof

technique · direct
1.1F1F3algebra

At a height-one root prime p with T=Rp, a two-label component has the upper projective Pa=ΔT(a) and the pair projective Pb; Hom⁡(Pa,Pb) and Hom⁡(Pb,Pa) are free of rank one, the canonical inclusion i generates the first, and choosing j in the second lifting its nonzero residual map gives a nonzero nilpotent ij on the residue while ji=h vanishes modulo p by the nonsplitness of the residual standard extension; 1 and ij are residually independent and form a T-basis of the order End⁡(Pb)=Z={(ua,ub):ua≡ub mod τ(α∨)} of [F3], in generic tuple coordinates ij=(h,0) and the order has basis (1,1),(α,0) with α=τ(α∨), so h is a unit times α and rescaling j makes ji=α; then VT=Hom⁡(Pb,−) sends Pb to Z and Pa to the rank-one upper branch T, with Hom⁡Z(Z,Z)=Z, Hom⁡Z(T,T)=T, Hom⁡Z(Z,T)=T generated by the projection and Hom⁡Z(T,Z)=T(α,0), and V(j),V(i) are these generators.

1.2F1F2F3algebra

Here is the actual deformed wall map missing from the ordinary formula [F2]. Write A=R⊗RWR and As=Rs⊗RWR, with the common right parameter. For the wall target, adjunction and ToutPRν=PRλ give VRνTon≅Res⁡AsAVRλ, including the As action by the central inclusion in [F3]. The closed fiber of TonPRλ is two copies of the singular antidominant projective: its projective-injective summands have antidominant socle, and its Verma flag has every singular standard twice. Lifting both maps of this decomposition by [F3] gives TonPRλ∈add⁡(PRν). Its canonical evaluation by VRν equals A as an (As,A)-bimodule, by adjunction with Tout; thus TonPRλ=PRν⊗AsA by the evaluation isomorphism on add⁡(PRν). The opposite adjunction now gives VRλToutN≅Hom⁡As(A,VRνN). Choose a root coordinate α with sα=−α. Since R=Rs⊕αRs, the coefficient-of-α map ℓ:R→Rs has pairing matrix (0110) on 1,α, hence identifies R with its Rs-dual. Extending the right parameter identifies Hom⁡As(A,−) with A⊗As−, including the left A action. Consequently VRθs≅A⊗AsVR≅R⊗RsVR by actual action-compatible maps. This argument uses adjunction and relative Frobenius duality, not an isomorphism of residues.

2.1F2F3F4step 1.2algebra

For a polynomial Bott-Samelson bimodule B, M=B⊗SR is finite free over the right R. A left denominator nonzero at the origin acts invertibly: modulo the right maximal ideal its constant plus positive-degree part is invertible, since positive left invariants annihilate the finite-dimensional coinvariant reduction and positive-degree operators there are nilpotent; Nakayama makes its matrix invertible over R. Both left and right actions therefore extend to R. Weyl invariants balance across every tensor factor, so these actions factor through A. Iterating the map in step 1.2 identifies the localized polynomial tensor word with VR of the deformed wall word, with empty word the identity graph R=VRΔR(λ). All identifications preserve the generic tuple branches and the right parameter. The fixed average coordinate in the type-A permutation model is split off before this construction.

3.1F3step 1.1step 2.1algebra

Let Q,Q′ be deformed block projectives. Their canonical comparison under VR is an isomorphism at every height-one prime. At nonroot primes, the distinct simple Verma components give one-label Morita equivalences; at root primes, each projective decomposes into the two elementary projectives of step 1.1 by lifting its actual residue decomposition with the projective Hom base-change maps in [F3], so that step verifies every pair of summands. The source Hom module is finite free over R by [F3]. The target Hom⁡A(VRQ,VRQ′) need not be assumed free in advance: it is the submodule of finite free Hom⁡R(VRQ,VRQ′) satisfying the finitely many linear commutation equations for a finite R-basis of A. Inside the generic Hom space it is the intersection of its height-one localizations, since a rational matrix belongs to the free ambient matrix lattice precisely when all its height-one localizations do, and the A-linearity equations already hold generically. The coefficientwise UFD intersection argument of the central-action lemma gives the same intersection property for the source Hom lattice. Their height-one equalities therefore prove the comparison is an isomorphism over R; in particular the target is now free. This is full faithfulness on deformed projectives.

4.1F1F3step 2.1step 3.1

For polynomial Bott-Samelson modules M,M′ the module Hom⁡A(M,M′) is the localization of the polynomial Hom module, and the composite Hom⁡A(M,M′)⊗RC≅Hom⁡OR(QR,QR′)⊗RC≅Hom⁡O(Q,Q′)≅Hom⁡C(VQ,VQ′) is the natural reduction map by step 3.1, projective Hom base change and the ordinary Struktursatz, all maps being the canonical composition maps; hence reduction-of-Hom holds for Bott-Samelson modules and, by taking summands, for all polynomial Soergel bimodules, the degree components giving the graded statement.

5.1F4F6step 4.1algebra

Absolute complex extension follows by the actual same equations as real extension, not by a real-only assertion. For the rational Bw, write EQ0 for its finite-dimensional local degree-zero endomorphism algebra and JQ for its nilpotent radical; [F4] gives EQ0/JQ=Q. Fixed-degree maps are kernels of finite rational linear commutation equations on homogeneous generator images. Tensoring these equations with the flat field C identifies EC0=EQ0⊗QC. Its ideal JQ⊗C is nilpotent and its quotient is C, so every element with nonzero scalar residue is invertible by a finite geometric series; hence this is a local algebra with residue C. The same flat equations preserve its top graph and degree. Extending each rational word decomposition gives a complex decomposition into these absolutely indecomposable labels; finite Krull--Schmidt uniqueness then classifies every summand of every complex word. Thus the normalized polynomial Bw has the required local degree-zero algebra over C. Step 4.1 makes the degree-zero algebra of Bˉw its quotient, hence local. Here is the needed passage to ungraded endomorphisms. For the finite-dimensional graded algebra E=End⁡(Bˉw), grading scalings preserve its Jacobson radical J; interpolation in finitely many distinct scaling parameters extracts every homogeneous component, so J is graded. The semisimple quotient E/J is a product of matrix algebras by [F6]. Its grading derivation preserves each factor, since a derivation kills central idempotents. Every derivation D of Mat⁡n(C) is inner: with matrix units, H=∑iD(ei1)e1i satisfies D(a)=Ha−aH, by applying the product rule to eijek1 and summing in k. The grading derivation is diagonalizable; writing H=Hs+Hn shows ad⁡Hn=0, because it is the commuting nilpotent part of ad⁡H. A scalar nilpotent matrix is zero, so H is semisimple up to an irrelevant scalar. Its degree-zero centralizer is consequently a product of matrix algebras on its eigenspaces. Thus (E/J)0 is semisimple. It is a quotient of the local E0, so it equals C; a product of such centralizers can have dimension one only if there is a single matrix factor of size one. Hence E/J=C, and E is local. This proves that Bˉw remains indecomposable after forgetting grading; it supplies the graded-algebra argument rather than attributing innerness to Wedderburn-Artin.

6.1F4F5step 5.1algebra

The normalized top summand is self-dual without assuming an unproved indecomposable-form assertion. In the unshifted tensor ring of a length-k word, each added reflection factor is a quadratic finite free extension with basis 1,αs and relation αs2∈Ss. The coefficient-of-αs functional has perfect pairing matrix (0110); composing these functionals along the tensor tower gives a perfect right-S pairing on its rank-2k basis. It is left-invariant by commutativity of the tensor ring. The total trace has degree −2k, so shifting the word by (k) gives a degree-zero isomorphism from the Bott-Samelson bimodule to its invariant right dual DB=Hom⁡S(B,S). For a reduced word of w, Bw is the unique summand with nonzero top graph w, of generic right rank one there; all other summands have strictly lower graph support by [F4]. Duality preserves generic graph branches: a left scalar on a rank-one branch acts by the same scalar on its right dual. Therefore DBw is an indecomposable summand of the very same self-dual word, has its w branch, and must be the identical unique top summand, with no shift. Thus Bw≅DBw. Finite right projectivity makes duality commute with right origin reduction, so Bˉw has a graded self-duality centered at zero. Any two finite graded lifts with the same indecomposable underlying C-module differ by a shift: homogeneous components of an ungraded isomorphism and its inverse give 1=∑dg−dfd in the local degree-zero endomorphism algebra; one summand is a unit, so fd is an isomorphism after a shift (its source and target have the same finite dimension). A nonzero shift cannot preserve centered self-duality, by symmetry of the extreme degrees. This proves unique centered normalization; rank one has degrees −1,1, and an uncentered shift gives 0,2.

6.2F2step 3.1step 5.1

Induction on Bruhat length gives the label dictionary: for a reduced word w=s1⋯sk, P(w⋅λ) is the unique new top-label summand of θsk⋯θs1Δ(λ) by [F2], and applying V and the iterated wall-crossing formula gives the new summand of the reduced left tensor word Bsk⋯Bs1‾, whose top graph label is the inverse w−1, while every proper subexpression contributes already-matched smaller labels; full faithfulness of step 3.1 for the deformed side and the indecomposability of step 5.1 match the two new summands uniquely, so VP(w⋅λ)≅Bˉw−1, and distinct labels remain non-isomorphic because V is fully faithful on projectives.

7.1F1F2F4step 4.1step 6.1step 6.2algebra∎

The type-A equivalence and normalized dictionary follow from steps 4.1 through 6.2. For a semisimple product of type-A factors, reflection words reorder into the independent factor words and their reductions are tensor products of the factor reductions. Their endomorphism algebra is the tensor product of the finite factor endomorphism algebras: in finite bases, the commutation equations for the two independent coefficient algebras give this tensor-Hom identity. Each factor algebra is local with residue C by step 5.1; the sum of its tensor-extended radicals is nilpotent and its quotient is C, so the product reduction is indecomposable. The labels, inverse convention and centered self-duality therefore combine factorwise; a rank-zero factor contributes the unit. The ungraded equivalence for every complex semisimple type needs no unprovided diagrammatic classification: define its Weyl-group Soergel-module category as the additive category of summands of polynomial Bott-Samelson right reductions. For every reflection realization, S=Ss⊕αsSs, and Weyl invariants balance across the tensor factors; the elementary quotient computation gives Bs⊗SC=(C⊗CsC)(1) exactly as in the wall-crossing theorem. Thus forgetting shifts identifies all right-reduced words with the ordinary V-images of wall words starting at VΔ(λ)=C. Ordinary full faithfulness [F1] lifts every idempotent between these images uniquely to an idempotent of their projective words. Since all projectives occur as summands of such words by [F2], this is a fully faithful and essentially surjective equivalence in every type. Its indecomposable labels can be read from the unique new projective summands themselves. The additional type-A polynomial/diagrammatic label and centered self-dual normalization are exactly those established in steps 5.1 through 6.2; no type-A classification is substituted for a general-type classification.

Depends on

Used by

Dependency tree · two levels

112 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