Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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.

Frobenius biadjunction for the type-A Soergel generators

Statement

Let s=si be a simple reflection, Rs its invariant ring, α=αi, δ=α/2, and Bs=R⊗RsR(1) with its two generators u=1⊗1 of degree −1 and w0=1⊗δ of degree 1. Write ∂s(f):=(f−s(f))/α for the Demazure operator and ⟨f,g⟩s:=∂s(fg) for the induced Rs-bilinear form on R.

  1. ∂s is Rs-linear, ker⁡∂s=Rs, ∂s(αg)=g+s(g), and ⟨⋅,⋅⟩s has Gram matrix (0110) in the Rs-basis (1,δ); thus (1,δ) and (δ,1) are mutually dual bases of the free rank-two Rs-module R.
  2. Currying the form gives a natural R-linear isomorphism ΦM:R{−2}⊗RsM⟶Hom⁡Rs(R,M),ΦM(f⊗m)(g)=∂s(fg) m, of graded R-modules, homogeneous of degree zero, for every graded Rs-module M.
  3. Consequently, for graded (R,R)-bimodules M,N there are natural degree-zero bijections Hom⁡R-R(Bs⊗RM,N)≅Hom⁡R-R(M,Bs⊗RN),Hom⁡R-R(M⊗RBs,N)≅Hom⁡R-R(M,N⊗RBs), and the unit and counit of the resulting adjunction are built from the dual bases of part 1; the same holds with Bs tensored on the right, because f⊗g↦g⊗f is an isomorphism Bs→Bsop of graded bimodules.

Facts & Assumptions

Given: A simple reflection s=si, the polynomial ring R with its grading deg⁡xj=2 and invariant ring Rs, the element δ=α/2, and the rank-one bimodule Bs=R⊗RsR(1) with basis u,w0.

[F1]

R=Rs⊕δRs with δ2∈Rs, and the Demazure operator ∂s(f)=(f−s(f))/α satisfies ∂s(αf)=2f for f∈Rs; 2 is invertible in k=Q (The standard type-A reflection realization and its polynomial ring).

[F2]

Bs is a graded (R,R)-bimodule, free of rank two as a left and as a right R-module, with left basis u=1⊗1 of degree −1, w0=1⊗δ of degree 1, and right action u⋅g=g+u+g−w0, w0⋅g=δ2g−u+g+w0 for the decomposition g=g++δg− with g±∈Rs (The Soergel bimodule Bi of a simple reflection, Soergel generators and Bott–Samelson products are finite free on both sides).

[F3]

A bimodule map R⊗RsX→Y, with X a graded (Rs,R)-bimodule and Y a graded (R,R)-bimodule, is the same as an Rs-R-bilinear map X→Y, and shifts may be moved across a balanced tensor product: (X{r})⊗RY≅X⊗R(Y{r}) (The Bott–Samelson bimodule of a word).

Proof

1.1

Since α is s-anti-invariant, ∂s is Rs-linear and ∂s(h)=0 for h∈Rs, while ∂s(δ)=12∂s(α)=1 by [F1]; and δ2=α2/4∈Rs lies in the kernel, so in the basis (1,δ) the form ⟨f,g⟩s=∂s(fg) has ⟨1,1⟩s=0, ⟨1,δ⟩s=1, ⟨δ,δ⟩s=0, that is Gram matrix (0110), whence (1,δ) and (δ,1) are mutually dual bases.

F1
1.2

The assignment ΦM(f⊗m)(g):=∂s(fg)m is well defined on the balanced tensor product, since ∂s(hfg)m=∂s(fg) hm for h∈Rs, and its values are Rs-linear in g. For the left R-action (r⋅ψ)(g)=ψ(rg) on Hom⁡Rs(R,M), one has ΦM(rf⊗m)(g)=ΦM(f⊗m)(rg), so ΦM is R-linear. On the unshifted tensor product its formula lowers degree by two because ∂s has degree −2; hence the domain shift R{−2} makes ΦM homogeneous of degree zero.

F1F3
1.3

Hom-tensor adjunction over Rs as in [F3] turns Bs⊗RM=R⊗Rs(R{−1}⊗RM) into the hom space Hom⁡Rs-R(R{−1}⊗RM,N), and a second adjunction identifies the latter with Hom⁡R-R(M,Hom⁡Rs(R{−1},N)).

F3
2.1

Put b1=1, b2=δ and b1=δ, b2=1. The Gram matrix of step 1.1 gives the two dual-basis identities r=∑ibi∂s(bir)=∑i∂s(rbi)bi for every r∈R. For any graded Rs-module M define ΨM(ψ):=1⊗ψ(δ)+δ⊗ψ(1) in R{−2}⊗RsM for ψ∈Hom⁡Rs(R,M). The first identity and Rs-linearity of ψ give ΦMΨM(ψ)(r)=ψ(r). Conversely, writing f=h0+δh1 with h0,h1∈Rs, we have ∂s(fδ)=h0 and ∂s(f)=h1, so ΨMΦM(f⊗m)=1⊗h0m+δ⊗h1m=f⊗m. If ψ has degree d, then 1⊗ψ(δ) has degree −2+(d+2)=d and δ⊗ψ(1) has degree 0+d=d; thus ΨM is degree zero. Both formulas commute with every graded Rs-linear map M→M′, so ΦM is a natural degree-zero R-linear isomorphism for every graded M, without a freeness assumption.

F1step 1.1step 1.2
3.1

Applying step 2.1 to the graded Rs-module N{1} gives Hom⁡Rs(R{−1},N)≅Hom⁡Rs(R,N{1})≅R{−2}⊗RsN{1}≅R{−1}⊗RsN. The last object is Bs⊗RN: by the balanced tensor relation, (R⊗RsR{−1})⊗RN≅R⊗RsN{−1}≅R{−1}⊗RsN, with no extra R factor. These are degree-zero (R,R)-bimodule identifications by the shift convention; composing them with the two Hom-tensor adjunctions of step 1.3 gives the first displayed natural bijection.

F3step 2.1step 1.3
4.1

The flip f⊗g↦g⊗f on R⊗RsR{−1} is well defined because R is commutative and Rs is central, is homogeneous because the factor degrees add, and is its own inverse. It intertwines the left and right R-actions, so it is a graded bimodule isomorphism Bs→Bsop. In particular it fixes u=1⊗1 and sends w0=1⊗δ to δ⊗1, both with their original degrees; it does not swap u and w0. Applying the first adjunction of step 3.1 to opposite bimodules yields the second displayed natural degree-zero bijection Hom⁡R-R(M⊗RBs,N)≅Hom⁡R-R(M,N⊗RBs).

F2step 3.1
5.1

For completeness, the two triangle maps can be checked directly. Under Bs⊗RBs≅R⊗RsR⊗RsR{−2}, evaluation is the degree-zero bimodule map ε((a⊗b)⊗(c⊗d))=a∂s(bc)d, and coevaluation is the degree-zero bimodule map sending 1∈R to E:=∑i(bi⊗1)⊗(1⊗bi), with the dual bases of step 2.1. The underlying degree of E is two and the total shift is −2; E is central for the outer R-actions, as is checked on the generators Rs and δ using δ2∈Rs. For z=a⊗b∈Bs, the composite (id⁡Bs⊗ε)(E⊗z) equals ∑ibi⊗∂s(bia)b=a⊗b, while (ε⊗id⁡Bs)(z⊗E) equals ∑ia∂s(bbi)⊗bi=a⊗b, by the two dual-basis identities of step 2.1. Tensoring these maps with any graded bimodule gives the unit and counit triangle identities for both adjunctions; all maps are natural and degree zero. ∎

step 1.1step 2.1step 3.1step 4.1

Depends on

Used by

Dependency tree · two levels

8 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