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

Indecomposable type-A Soergel bimodules are classified by their normalized top support

Statement

Over k=Q or k=R, the bimodule Soergel category has unique finite Krull-Schmidt decompositions. For every x∈Sn there is a unique normalized indecomposable Bx supported on {y:y≤x} with top Δ layer exactly Δx=Rx(−ℓ(x)). It is the unique summand with the x graph of any reduced Bott-Samelson word for x. Every indecomposable is exactly one Bx(d). Its finite-dimensional degree-zero endomorphism algebra is local, with residue field k under restriction to its rank-one top layer. No Kazhdan-Lusztig character identity is assumed.

Facts & Assumptions

Given: The idempotent-complete finite additive tensor category of type-A Bott-Samelson bimodules, over either field, with shifts M(d)i=Mi+d (The real type-A Soergel category by scalar extension).

[F1]

Words are finite free on either side, and their summands are graded free; all fixed-degree Hom spaces are finite-dimensional, because morphisms are determined by finitely many homogeneous generator images in finite-dimensional homogeneous pieces (Soergel generators and Bott–Samelson products are finite free on both sides, The type-A Soergel Hom formula).

[F2]

Both flags and their canonical Bruhat layers are intrinsic and pass to summands. If x is maximal in the support of M, its x graph is the top layer in a compatible enumeration; its inclusion and quotient satisfy ΓxM≅ΓxM px. Both graph modules are free, and the same identification holds for a summand of a reduced word (The type-A support filtration multiplicities are intrinsic, Type-A top support layers are controlled by reflection localization).

[F3]

The flagged Hom formula is proved for a flagged source and a Soergel target, and for a Soergel source and a flagged target. For a canonical flag extension its Hom sequence is short exact: prove this degree by degree for word carriers from the three graded Hom rank formulas, and then project to the carrier idempotent (The type-A Soergel Hom formula).

[F4]

The flag recursion gives support of a word among its subexpressions. A reduced word of length m for x has its x layer exactly Δx, since the only subexpression of product x has all m letters, with generator degree m (Bott–Samelson bimodules carry delta and nabla support filtrations).

Proof

1.1F1algebra

A finite-dimensional endomorphism algebra and the absence of nontrivial idempotents imply locality. Indeed for an endomorphism f its polynomial minimal relation splits into a power of T and a factor coprime to T. The polynomial Chinese remainder identity produces an idempotent separating the nilpotent and invertible parts; indecomposability forces one part to vanish. Thus every f is invertible or nilpotent, and a nonunit f has 1−f invertible. Nonunits form a two-sided ideal: multiplication cannot make a nonunit invertible in a finite-dimensional algebra; if two nonunits summed to a unit, dividing their sum would express 1 as two nonunits, contradicting the invertibility of 1−f. This is the unique maximal ideal. Its powers eventually vanish: if a power stabilizes, take a minimal finite generating list for that stable ideal and express its last generator using coefficients in the maximal ideal; the invertibility of 1−a for such a coefficient eliminates that generator, a contradiction.

2.1F1step 1.1algebra

Split idempotents until indecomposable summands remain. Each split reduces the positive right rank of its summand, so there are only finitely many splits. The resulting summands have local endomorphism rings by step 1.1. Decompositions are unique: in two finite decompositions, express the identity of one indecomposable as the sum of its composites through the summands of the other. The local maximal ideal cannot contain every composite; an invertible composite gives a split inclusion into one indecomposable summand, hence an isomorphism to it. Remove the common summand and repeat. This proves finite Krull-Schmidt existence and uniqueness.

3.1F2F4step 2.1

Decompose a reduced word for x. Its top layer is a single Δx by [F4], and the top-layer functor is additive by [F2]. Exactly one indecomposable summand therefore has this graph, with precisely this normalized layer; call it Bx. All other summands have support strictly below x. This constructs a normalized candidate without any character conjecture.

4.1F2step 3.1choose

Let M be any nonzero Soergel object and choose a maximal support label x. The two graph layers ΓxM and ΓxM are identified by multiplication by px as in [F2]. Choose one homogeneous basis element m of the latter, and let d make its degree equal to the generator degree of ΓxBx(d). Choose graph maps f0:ΓxBx(d)→ΓxM taking that generator to m, and g0:ΓxM→ΓxBx(d) which takes the corresponding element pxm to the generator pxb and kills the other basis elements. These maps are homogeneous of degree zero and satisfy the identity on the rank-one x layer.

5.1F2F3step 1.1step 4.1

Lift these maps to bimodule maps f:Bx(d)→M and g:M→Bx(d). The quotient map M→ΓxM is the last step of a ∇ flag with x last; its kernel is flagged, so [F3] lifts the map Bx(d)→ΓxM. The inclusion ΓxM→M is the first step of a Δ flag with x first; its quotient is flagged, so [F3] lifts g0 followed by ΓxBx(d)→Bx(d). The first lifted map on the quotient and the second on the submodule agree with the prescribed graph maps. The image identity ΓxM=ΓxMpx makes their composite gf act as the identity on ΓxBx(d). Thus gf is not nilpotent, and is invertible by step 1.1. Rescale g by its inverse to exhibit Bx(d) as a summand of M.

6.1step 3.1step 5.1

If M is indecomposable, step 5.1 gives M≅Bx(d). If two normalized candidates were obtained from different reduced expressions for x, applying that same splitting argument to either candidate makes them isomorphic, because their normalized rank-one top degrees force d=0. Distinct labels cannot be isomorphic, by their maximal support; distinct shifts at a fixed label cannot be isomorphic, by their top generator degrees. This proves classification and reduced-word independence.

7.1step 1.1step 2.1step 6.1∎

Restriction of degree-zero endomorphisms of Bx to its rank-one top layer is a unital homomorphism onto k, since homogeneous scalars act there and its endomorphism ring in degree zero is k. Its kernel is a maximal ideal. Locality in step 1.1 makes this the unique maximal ideal, so the residue field is k. All selections were from finite supports and finite homogeneous bases, and no choice axiom beyond finite choice is used. The statement follows from steps 2.1, 3.1, 6.1 and this residue calculation.

Depends on

Used by

Dependency tree · two levels

18 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