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.

Normalized type-A Soergel bimodules are self-dual and have length degree bounds

Statement

Over k=Q or R, let Bx be the normalized indecomposable bimodule classified by its top support. With right dual DM=Hom⁡−R∙(M,R), one has DBx≅Bx. Its right reduction has degrees only in [−ℓ(x),ℓ(x)], all congruent to ℓ(x) modulo two, and the two extremal dimensions are one. Hence its reduced graded dimensions are symmetric. Every Bott-Samelson word has a graded perfect symmetric invariant trace form. These assertions assume neither the Kazhdan-Lusztig character conjecture nor hard Lefschetz.

Facts & Assumptions

Given: The coordinate type-A realization, the normalized indecomposables Bx and shifts as in Indecomposable type-A Soergel bimodules are classified by their normalized top support, and finite right-free bimodules over R=k[x1,…,xn].

[F1]

The normalized Bx is the unique indecomposable summand with the x graph of a reduced word, independent of the word. Its top quotient ΓxBx is rank one with generator degree −ℓ(x), by the image equality and its top Δx layer (Indecomposable type-A Soergel bimodules are classified by their normalized top support, Type-A top support layers are controlled by reflection localization).

[F2]

In Bs, the right basis cid=1⊗1, cs=(αs⊗1+1⊗αs)/2 has degrees −1,1, and satisfies rcs=csr and rcid=cids(r)+cs∂s(r); the generator is finite free on either side (The real type-A Soergel category by scalar extension, Soergel generators and Bott–Samelson products are finite free on both sides).

Proof

1.1givenF2algebra

The unit has the perfect multiplication form. If a right-free bimodule M has an invariant form, put a(b)=bcid and b(b′)=b′cs in MBs and define the induced form by ⟨a(u),a(v)⟩=∂s⟨u,v⟩, ⟨a(u),b(v)⟩=⟨b(u),a(v)⟩=⟨u,v⟩, and ⟨b(u),b(v)⟩=⟨u,v⟩αs. Extend on a right basis by right bilinearity. The relation of [F2] and the identity ∂s(fr)=∂s(f)r+s(f)∂s(r) verify that these formulas agree for arbitrary u,v, and that left multiplication is self-adjoint. Symmetry follows from symmetry of the preceding form. If ei,ei∗ are dual right bases for that form, the pairing between bases (a(ei),b(ei)) and (b(ei∗),a(ei∗)) has matrix (I0αsII), using ∂s(1)=0, and has determinant one. Thus perfection is preserved. Iteration yields a perfect symmetric invariant form on every word, exactly its successive rank-one trace multiplication form.

2.1F1step 1.1algebra

For finite right-free modules the graded double-dual evaluation is an isomorphism, so D is an involutive contravariant equivalence and takes indecomposables to indecomposables. The invariant perfect word form of step 1.1 identifies a word with its right dual. Generic graph support is unchanged by this duality: in a right basis left multiplication matrices transpose under D, so their simultaneous eigencharacters, and hence the graph labels after passing to the polynomial fraction field, are unchanged. A right-free summand has precisely the support closure of those graph labels. Therefore DBx is an indecomposable summand with the x graph of the same reduced word. Uniqueness in [F1] identifies it with Bx with no shift.

3.1F1F2step 2.1algebra

A word of length m has a homogeneous right basis given by tensor products of the two basis elements in [F2]; its generator degrees lie between −m and m and have parity m. Right reduction preserves a split direct-sum decomposition. Since Bx is an unshifted summand of its reduced word of length m=ℓ(x), its reduction has these same bounds and parity. The word's bottom degree is the single 1-tensor. The balanced evaluation of that word on its top graph, obtained by successively twisting the tensor-slot polynomials by the successive prefix permutations, sends this 1-tensor to 1. It factors through the rank-one top quotient, and is an isomorphism onto Rx(m) because both generators have degree −m. All other summands have no x support; consequently the projection of the bottom tensor into Bx is nonzero. Its bottom dimension is therefore one.

4.1step 1.1step 2.1step 3.1∎

Right duality reverses the degrees of the finite homogeneous basis after reduction. The unshifted duality DBx≅Bx from step 2.1 therefore makes the reduced dimensions symmetric and gives top dimension one from the bottom dimension in step 3.1. The perfect trace forms, duality, degree bounds, parity and extremal dimensions have now all been established locally.

Depends on

Used by

Dependency tree · two levels

16 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