Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 local intersection form on Hom(B_y, B_x B_s)

Definition

The setting. Fix x∈Sn, a simple reflection s with xs>x, and y<xs in the Bruhat order; assume S(z) for all z<xs. Choose reduced-word embeddings ByR⊆ ⁣ ⁣⨁BS(y‾) and BxR⊆ ⁣ ⁣⨁BS(x‾), and equip ByR, BxR with the positively normalized non-degenerate invariant forms obtained by restriction, so that the bottom Lefschetz values are +1; equip M:=BxRBsR with the induced invariant form of The trace, the invariant intersection form on Bott-Samelson bimodules and its reduction. Under S(y) and S(x) these forms exist and are unique up to positive scalars, and the choices enter only through positive factors (Invariant forms on an indecomposable Soergel bimodule are unique up to scalar, non-degenerate, and agree with the restricted Bott-Samelson form).

The local intersection form. Let Ey:=Hom⁡0(ByR,M) be the finite-dimensional real space of degree-zero bimodule maps. For f,g∈Ey define the local intersection form (f,g)yx,s:=g∗∘f ∈ End⁡0(ByR)=R, where g∗:M→ByR is the adjoint of g with respect to the two non-degenerate forms, uniquely characterized by ⟨g(b),m⟩M=⟨b,g∗(m)⟩By for all b∈ByR, m∈M. Here the dual is the graded right S-module dual DB:=Hom⁡−S∙(B,S), with (rφ)(b)=φ(rb) and (φr)(b)=φ(b)r. If ΦB:B→DB is the perfect-form isomorphism ΦB(b)(b′)=⟨b,b′⟩B, then g∗=ΦBy−1∘Dg∘ΦM, where Dg:DM→DBy is precomposition by g. Right bilinearity and left invariance make ΦB and Dg degree-zero bimodule maps, so this formula proves the existence, uniqueness and degree of the adjoint. The adjoint construction identifies Hom⁡0(ByR,M) with Hom⁡0(M,ByR).

Basic properties. The form (−,−)yx,s is symmetric: the adjoint of g∗f is f∗g, and a scalar endomorphism of ByR is self-adjoint for its invariant form. It is R-bilinear, and it changes only by a positive scalar when the chosen normalized forms or reduced-word embeddings are varied: scaling the form on M by a>0 and the form on ByR by b>0 scales (−,−)yx,s by a/b, and the invariant-form uniqueness lemma shows that any two choices compare by positive scalars. Define S±(y,x,s) to mean that (−,−)yx,s is definite of sign (−1)(ℓ(x)+1−ℓ(y))/2, respectively its negative, with the parity convention of Primitive subspaces, hard Lefschetz and the Hodge-Riemann signs: the dictionary of hypotheses S, hL and HR: when the numerator is odd the corresponding primitive space is zero and the sign condition is not used.

Status. The definition uses degree-zero Hom throughout; no statement identifies the rank of the full graded Hom module with a Kazhdan-Lusztig multiplication coefficient. The dimension of Ey in terms of the multiplication formula, and the equivalence of non-degeneracy of these forms with the actual summand multiplicities of M, are proved in the detection theorem later on this page; they are not part of this definition.

Remark

  • The adjoint g∗ exists and is unique because the forms involved are non-degenerate and invariant: an invariant form on a finite right-free bimodule is the same as an isomorphism to the dual bimodule, and composing g with the two form-isomorphisms gives a degree-zero bimodule map M→ByR.
  • The normalizations are chosen so that the bottom Lefschetz value is +1; by the uniqueness lemma the comparison between any two such normalizations is by a positive scalar, so the sign of the local intersection form, hence the statement S±(y,x,s), is well defined independently of the choices.

Depends on

Used by

Dependency tree · two levels

23 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