Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 labels, characters and filtration ranks agree after real scalar extension

Facts & Assumptions

Given: The rational and real bimodule Soergel categories, scalar extension MR=M⊗QR, normalized top-support labels Bx, and the convention M(d)i=Mi+d.

[F1]

Bimodule classification, finite Krull-Schmidt decompositions and the local degree-zero endomorphism algebra with residue field the base field are proved intrinsically from top-support Hom lifting, independently of any diagrammatic equivalence (Indecomposable type-A Soergel bimodules are classified by their normalized top support).

[F2]

Normalized Bx is self-dual, with one-dimensional bottom and top reductions in degrees −ℓ(x),ℓ(x); words have perfect invariant trace forms (Normalized type-A Soergel bimodules are self-dual and have length degree bounds). Canonical support layers and their image equalities and right splittings are proved locally (Type-A top support layers are controlled by reflection localization, The type-A support filtration multiplicities are intrinsic).

[F3]

The graded Hom formula is locally proved for flagged carriers and arbitrary Soergel summands (The type-A Soergel Hom formula). In the Hodge convention a generator of degree a contributes va to this Hom rank, so a polynomial in nonnegative powers entails no negative-degree maps.

[F4]

The generator recursion hΔ(MBs)=hΔ(M)H‾s and its ∇ version follow from the independently proved support flags (The type-A character recursion under simple Soergel tensoring, Bott–Samelson bimodules carry delta and nabla support filtrations). The standard trace basis is orthonormal; (H‾y,H‾z) has no negative powers and constant term δyz (The Hecke trace form, its values on the Kazhdan-Lusztig basis, and the standard pairing).

[F5]

Kazhdan-Lusztig triangularity gives coefficients py,x∈vZ[v] for y<x, and the simple-reflection multiplication formula gives the ascent and descent character products (The type-A Kazhdan–Lusztig basis has elementary triangular bar properties, Multiplication by a generator in the Kazhdan–Lusztig basis).

Statement

Let Bw be the rational indecomposable type-A Soergel bimodule and let BwR be its real scalar extension. (1) BwR is indecomposable; its finite-dimensional degree-zero endomorphism algebra is local with residue field R. If S(w) holds, its degree-zero endomorphism algebra is R, but no rank-one assertion for the full graded endomorphism module is made. (2) Real extension preserves the labels and shifts of all finite Krull-Schmidt decompositions of rational Soergel bimodules, and every real indecomposable is a unique BwR(d). (3) Δ/∇ support-filtration multiplicities, characters, reduction by positive-degree right polynomials, and Hom spaces commute with scalar extension; thus character identities over R descend to Q. (4) If xs>x and S(y) holds for all y<xs, then BxBs=Bxs⊕⨁y<xsByay with ay nonnegative integers and no grading shifts; the top summand occurs once. If xs<x and S(x) holds, then BxBs=Bx(1)⊕Bx(−1). All assertions concern the normalized self-dual indecomposables.

Proof

1.1givenF2F3algebra

For finite right-free rational M,N, a homogeneous bimodule map is determined by the images of a finite right basis. In a fixed degree the finitely many left-generator commutation relations are finite linear equations with rational coefficients. Their kernel commutes with the flat field extension to R. Thus every homogeneous Hom space, and its composition, commutes with extension. The support cut on a specified graph union is the common kernel of its finitely generated graph ideal acting on the carrier: the carrier is right-free and generically a sum of reduced graph modules, so the relations hold before localization by torsion-freeness. These kernels commute with flat extension as well. Therefore the canonical support submodules, quotients, graph generator degrees and multiplicities commute with extension. Right reduction commutes with it by tensor associativity and the augmentation map.

2.1F1step 1.1algebra

Let A=End⁡0(Bx) over Q. By [F1] it is finite-dimensional local with residue Q, and its maximal ideal J is nilpotent by the finite-algebra proof there. Step 1.1 gives End⁡0(BxR)=A⊗QR. The ideal J⊗R is nilpotent and its quotient is R; an element with nonzero residue is invertible by a finite geometric series after subtracting its scalar part. Hence this algebra is local with residue R, and BxR is indecomposable. Its top support layer is unchanged by step 1.1, so the real classification [F1] identifies it with the same normalized real label. Every real word is the extension of its rational word and its rational finite decomposition; the real classification and uniqueness imply that all real indecomposables and all real decompositions are the corresponding labels and shifts.

3.1F2F3F4step 2.1

Duality exchanges the Δ and ∇ flags: dualize their right-split canonical layer sequences, which reverses order and the homogeneous degrees of their graph generators. A Δy(d) layer dualizes to ∇y(−d). Therefore normalized self-duality gives hΔ(By)=h∇(By) by the weight conventions. The same is true for BxBs: an invariant isomorphism Bx→DBx can be extended by the induced rank-one form construction in [F2], whose mixed-basis matrix has determinant one and yields an invariant isomorphism BxBs→D(BxBs). If S(y) holds, both characters of By are consequently H‾y. By [F3],[F4], its endomorphism Hom rank has no negative powers and constant term one. Since the polynomial ring has degree-zero part R and no negative degrees, its degree-zero endomorphism algebra is then exactly R.

3.2step 1.1step 2.1

Step 1.1 proves the support multiplicity, character, Hom and reduction identities in (3). These characters have integer Laurent coefficients recording finite homogeneous graph bases; equality over the real category therefore gives the same integer coefficient equality over the rational category. No injectivity assertion about an unrelated extension of the coefficient ring is needed.

3.3F1F2F4step 2.1

For xs>x, assume S(y) for every y<xs, including x. The tensor M=BxBs is a summand of the reduced word for xs. Its top layer is the word's unique Δxs, because the reduced word for x decomposes as Bx and lower-support summands, whose tensor with Bs cannot reach length ℓ(xs). By [F1] its unique top summand is therefore Bxs unshifted and once; the other summands are By(d) with y<xs. This top-layer argument makes no substitution of the unknown character of Bxs.

4.1F3F4F5step 3.1step 3.3

The character of M is H‾xH‾s, and its standard expansion lies in Z[v]: the only v−1 in simple multiplication multiplies a strictly lower coefficient already divisible by v, while the top coefficient is on an ascent. For every lower y, the two Hom ranks Hom⁡(By,M) and Hom⁡(M,By) are the standard pairings of this polynomial character with H‾y, using self-duality from step 3.1. Hence they have no negative powers, and both Hom spaces have no negative-degree maps. A summand By(d) with d>0 gives a negative-degree inclusion from unshifted By, and one with d<0 gives a negative-degree projection to it, by the convention M(d)i=Mi+d. Both are impossible. Thus every lower summand is unshifted, proving the ascent statement with its actual nonnegative multiplicities ay. The character of the top summand is not yet required to equal H‾xs, and no equality ay=μ(y,x) is inferred.

4.2F1F4F5step 3.1

For xs<x and S(x), the support of M=BxBs stays at most x: take a reduced word for x ending in s; toggling its last letter shows that the graphs y,ys for y≤x stay in this Bruhat interval. Its character is (v+v−1)H‾x by [F4],[F5], so its top x layer has the two shifts Δx(1),Δx(−1). The maximal-layer splitting proof of [F1] splits off exactly Bx(1) and Bx(−1). Under S(x) their characters already sum to the whole character of M. Any remaining nonzero summand would have a nonzero graph layer with a positive integral multiplicity, contradicting its zero character. Thus M=Bx(1)⊕Bx(−1) with no other summands, without assuming S for any other label.

5.1F2step 2.1step 3.1step 3.2step 4.1step 4.2∎

The local algebra and real indecomposability are step 2.1, and the degree-zero scalar assertion under S(x) is step 3.1. Step 2.1 proves classification after extension, step 3.2 proves all base-change identities, and steps 3.3–4.2 prove the two decompositions with their exact stated hypotheses. Normalization and self-duality come from [F2], proved before the character comparisons.

Remarks

The ascent multiplicities are the actual summand counts. Their later identification with Kazhdan-Lusztig multiplication coefficients requires the next character theorem; it is not part of this pre-induction comparison proof.

Depends on

Used by

Dependency tree · two levels

34 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