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.

Special Bott–Samelson Hom formula before reflection localization

Statement

Suppose either that M∈FΔ is a graded R-bimodule with a Δ-flag and N is a Bott–Samelson bimodule Bi‾=Bi1⊗R⋯⊗RBir (or a finite direct sum of shifts of such), or that M is such a Bott–Samelson bimodule and N∈F∇. In either case Hom⁡R-R(M,N) is a graded free R-module of graded rank rk⁡Hom⁡R-R(M,N)=∑x∈Sn∑d,e∈Z(M:Δx(d)) (N:∇x(e)) vd−e, with the multiplicities and characters of Standard graph bimodules, support filtrations and characters, which by The type-A support filtration multiplicities are intrinsic depend only on M and N. This is Soergel's Theorem 5.15 restricted to Bott–Samelson targets and sources; it precedes the reflection-localization statement for arbitrary direct summands.

Facts & Assumptions

Given: A graded R-bimodule M with a Δ-flag (or a Bott–Samelson bimodule), a Bott–Samelson bimodule N, simple reflections s, and the characters hΔ,h∇ of Standard graph bimodules, support filtrations and characters.

[F1]

Hom⁡R-R(Bs⊗RM,N)≅Hom⁡R-R(M,Bs⊗RN) and Hom⁡R-R(M⊗RBs,N)≅Hom⁡R-R(M,N⊗RBs) as graded R-modules, naturally in M,N (Frobenius biadjunction for the type-A Soergel generators).

[F2]

Separately on the two flag categories, Soergel Propositions 5.7(2) and 5.9(2) give hΔ(Bs⊗RM)=HshΔ(M) for M∈FΔ and h∇(Bs⊗RN)=Hsh∇(N) for N∈F∇, with Hs=T~s+v. These follow by summing the two respective locally proved multiplicity recursions of Bott–Samelson bimodules carry delta and nabla support filtrations against vdT~x and v−dT~x. The Hecke identity is HsT~y=T~sy+vT~y for sy>y and T~sy+v−1T~y for sy<y, using The standard basis of the type-A Hecke algebra and its multiplication rule. Shifting a layer reindexes d and gives hΔ(M{k})=v−khΔ(M) and h∇(N{k})=vkh∇(N) on their respective domains. Intrinsicness on each category separately follows directly from the graph components of the canonical length layers; no simultaneous pair of flags is required.

[F3]

The multiplicity pairing ⟨,⟩ on the Hecke algebra with ⟨T~x,T~y⟩=δxy is symmetric and Hs is self-adjoint for it: ⟨HsF,G⟩=⟨F,HsG⟩, because the standard pairing is the coefficient of T~e in i(F)G for the anti-involution i(v)=v, i(T~x)=T~x−1, and i(Hs)=Hs (Soergel, proof of Theorem 5.15) (The standard basis of the type-A Hecke algebra and its multiplication rule).

[F4]

Hom⁡R-R(Rv(a),Rw(b))≅R(b−a) for v=w and 0 for v≠w, where R(b−a) denotes the free module generated in degree a−b (Standard graph bimodules, support filtrations and characters).

[F5]

Bott–Samelson bimodules lie in FΔ∩F∇ and the functors Bs⊗R− and −⊗RBs preserve both flag categories and preserve finite freeness (Bott–Samelson bimodules carry delta and nabla support filtrations).

[F6]

Every flag layer is free on either side, so a finite flag and each of its support-cut quotients are free on either side: successively split the short exact sequences as right modules (or as left modules). A bimodule map from a union of graphs not containing e to Re is zero: on each graph a linear graph equation restricts to a nonzero polynomial on Gr(e), and multiplying these finitely many equations annihilates that union while acting injectively on Re. The same support test shows that a map Re→N has image in ΓeN (Standard graph bimodules, support filtrations and characters).

Proof

1.1F1F2F3

Reduction step: by [F1] the two hom spaces Hom⁡(Bs⊗RM,N) and Hom⁡(M,Bs⊗RN) are isomorphic as graded R-modules, hence have the same graded rank; by [F2] the right hand sides of the claimed formula for the two pairs differ by the factor Hs on the two sides and agree by the self-adjointness of [F3], so the formula holds for the pair (Bs⊗RM,N) if and only if it holds for (M,Bs⊗RN).

1.2F2

Shift step: the same argument with M replaced by M{k} uses Hom⁡(M{k},N)≅Hom⁡(M,N{−k}) and the shift rules of [F2] to show that the formula for (M{k},N) is equivalent to the formula for (M,N{−k}).

1.3F4F6

Base case for a Bott–Samelson target: if M∈FΔ, the submodule Γℓ≥1M is supported off Gr(e), so [F6] shows every map M→R kills it. The remaining quotient is the length-zero layer ⨁dΔe(d)(M:Δe(d)). Hence Hom⁡(M,R) is its Hom module into R, free of rank ∑d(M:Δe(d))vd by [F4]. This argument proves the required exactness directly; it does not apply Hom to an arbitrary nonsplit flag and assume surjectivity.

1.4F1F2F3F5

Induction on the word: write a nonempty Bott–Samelson target as N=Bs⊗RN′ by peeling its leftmost letter. The first biadjunction of [F1] gives Hom⁡(M,Bs⊗RN′)≅Hom⁡(Bs⊗RM,N′). By [F5], Bs⊗RM∈FΔ, so the induction hypothesis computes the rank of the latter Hom module as ⟨hΔ(Bs⊗RM),h∇(N′)⟩. The left recursion of [F2] and self-adjointness in [F3] turn this into ⟨HshΔ(M),h∇(N′)⟩=⟨hΔ(M),Hsh∇(N′)⟩=⟨hΔ(M),h∇(Bs⊗RN′)⟩, the claimed rank for (M,N).

1.5F1F2F3F4F5F6

Base case and induction for a Bott–Samelson source: if N∈F∇, evaluation at 1 identifies Hom⁡(R,N) with ΓeN, since a bimodule image of 1 is annihilated by the identity graph ideal. For a flagged module no thickened graph occurs: its localization on any single graph is a direct sum of rank-one graph modules, and right torsion-freeness makes the graph relations hold already before localization. Thus ΓeN is exactly its length-zero ∇ layer ⨁e∇e(e)(N:∇e(e)), giving free rank ∑e(N:∇e(e))v−e. For a nonempty Bott–Samelson source BsM′, biadjunction moves the first letter to the target, producing Hom⁡(M′,BsN). The separately proved ∇ closure and recursion in [F2],[F5] and self-adjointness [F3] apply, and induction on the source word proves the dual formula and freeness.

2.1step 1.1step 1.2step 1.3step 1.4step 1.5∎

Conclusion: finite direct sums of shifts of words are handled by additivity of Hom and of the canonical support layers, with the shift rule of step 1.2. Thus for every pair (M,N) covered by the statement the graded rank of Hom⁡R-R(M,N) is the displayed multiplicity sum, and by the first-case induction and the dual induction the hom space is a free graded R-module; the shift and simple-reflection moves of steps 1.1 to 1.5 generate every Bott–Samelson word, so no further hypothesis on N is used and the reflection-localization statement for arbitrary direct summands is not invoked.

Depends on

Used by

Dependency tree · two levels

17 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