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

The type-A Soergel Hom formula

Statement

Let M,N be objects of the type-A Soergel category SBimn, that is, graded direct summands of finite direct sums of shifts of Bott–Samelson bimodules Bi1⊗R⋯⊗RBir (the idempotent completion of the Bott–Samelson category of The type-A Soergel category SBimn). Then Hom⁡R-R(M,N) is a graded free R-module of graded rank rk⁡Hom⁡R-R(M,N)=∑x,d,e(M:Δx(d)) (N:∇x(e)) vd−e, which under the Hecke normalization Tx↦ the standard basis of The type-A Hecke algebra in Soergel normalization is the standard pairing ⟨hΔ(M),h∇(N)⟩ of the two characters with ⟨T~x,T~y⟩=δxy. In particular Hom⁡(M,M) is free of the same rank, and End⁡R-R(R)=R is generated in degree 0.

Facts & Assumptions

Given: Objects M,N of SBimn, graded direct summands of Bott–Samelson bimodules, and the characters hΔ,h∇ of Standard graph bimodules, support filtrations and characters.

[F1]

Special Hom formula: for M′∈FΔ and B a Bott–Samelson bimodule, Hom⁡R-R(M′,B) is graded free of rank ∑(M′:Δx(d))(B:∇x(e))vd−e, and dually for a Bott–Samelson source and a ∇-flagged target (Special Bott–Samelson Hom formula before reflection localization).

[F2]

For every Soergel summand N, evaluation at the graph generator and the two image equalities identify the Hom from a standard graph with its single-graph support module, and give the corresponding multiplicity rank. The four support layers are free on either side, the image equalities commute with summand idempotents, and canonical flag layers of a summand are summands of the word's layers (Type-A top support layers are controlled by reflection localization).

[F3]

SBimn is the idempotent completion of the category of Bott–Samelson bimodules; every object is a direct summand of a finite direct sum of shifts of Bott–Samelson bimodules and hence lies in add⁡B, with finite support, in FΔ∩F∇, and with intrinsic multiplicities, and finite freeness on both sides is inherited by summands (The type-A Soergel category SBimn, The type-A support filtration multiplicities are intrinsic, Bott–Samelson bimodules carry delta and nabla support filtrations, Type-A top support layers are controlled by reflection localization).

[F4]

The character sums are hΔ(M)=∑x,d(M:Δx(d))vdT~x and h∇(N)=∑x,e(N:∇x(e))v−eT~x with T~x=vℓ(x)Tx, and ⟨T~x,T~y⟩=δxy defines the standard pairing of the Hecke algebra, bilinear over Z[v,v−1] (Standard graph bimodules, support filtrations and characters, The type-A Hecke algebra in Soergel normalization).

Proof

1.1F2F4

We first prove the stronger flagged-source form with M∈FΔ and N a Soergel summand. For M=Δy(d), evaluation at its generator identifies Hom⁡(M,N) with a shift of ΓyN. By [F2] this is free, and the lower-layer image theorem gives rank ∑e(N:∇y(e))vd−e. Thus the claimed formula holds for a single standard source, including arbitrary shifts and finite sums.

1.2F1F3algebra

Let 0→M1→M→M2→0 be a short exact sequence from the canonical flag, with all three sources Δ-flagged and with their multiplicities additive. For a word sum B, the sequence 0→Hom⁡(M2,B)→Hom⁡(M,B)→Hom⁡(M1,B) is always left exact. The special Hom formula [F1] computes all three modules as free, with graded rank polynomials satisfying the same additive identity. Hence their Hilbert series also satisfy that identity, and left exactness forces surjectivity in each degree: the kernel has the known dimension and the source then has precisely enough remaining dimension to fill the last term. Thus the sequence is short exact. If N is a summand of B with projection idempotent e, this sequence splits into its e and 1−e parts by postcomposition. Exactness therefore holds with N in place of B, including its final surjectivity; no Hom-exactness for arbitrary flagged targets has been assumed.

2.1step 1.1step 1.2algebra

Induct on the finite length of the Δ flag of M. Peel off the maximal-support first layer M1, a finite sum of shifted standards; the quotient M2 has a shorter flag. Step 1.1 proves the formula for M1, and induction proves it for M2. The short exact Hom sequence of step 1.2 splits as graded right modules, because its last term is free: lift homogeneous basis elements to obtain a homogeneous right-linear section. Thus Hom⁡(M,N) is free and its rank is the sum of the two multiplicity formulas, giving exactly the displayed expression. This proves the flagged-source form for every summand target.

3.1F1F2F3step 1.2step 2.1

The dual flagged-target form is proved with the same argument: for a single ∇ target use the second image equality of [F2] and the free quotient ΓyM; for a flag extension use the dual special Hom formula [F1] to prove surjectivity for word sources degree by degree, then pass to a source summand by precomposition with its idempotent. Induction on the target flag and a homogeneous splitting of the resulting free Hom sequence give freeness and the same rank sum. In particular [F3] makes step 2.1 applicable to every pair of Soergel objects in the Statement.

4.1F4step 2.1step 3.1∎

Expanding the characters of [F4] in their orthonormal standard basis gives ⟨hΔ(M),h∇(N)⟩=∑x,d,e(M:Δx(d))(N:∇x(e))vd−e by bilinearity, which is the established graded rank. For the unit the single graph layer has d=e=0; a bimodule endomorphism of R is multiplication by its image of 1, so End⁡R-R∙(R)=R, freely generated by the identity in degree zero. This proves all assertions.

Depends on

Used by

Dependency tree · two levels

20 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