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.

Invariant forms on an indecomposable Soergel bimodule are unique up to scalar, non-degenerate, and agree with the restricted Bott-Samelson form

Facts & Assumptions

Given: The real type-A Soergel category with indecomposables BxR, the invariant intersection form constructed on Bott-Samelson bimodules and its restriction to summands, and a strictly dominant ρ with operator L0=ρ⋅(−) (The trace, the invariant intersection form on Bott-Samelson bimodules and its reduction, The reduced Soergel module and the dominant Lefschetz operator).

[F1]

An invariant form on a bimodule B is the same as a degree-zero bimodule map B→DB; it is non-degenerate exactly when this map is an isomorphism, and for finite right-free B this is equivalent to non-degeneracy of the reduced form (The trace, the invariant intersection form on Bott-Samelson bimodules and its reduction, clauses (2) and (5)).

[F2]

Under S(x), the comparison lemma gives End⁡0(BxR)=R, self-duality BxR≅D BxR, and the graded character ch⁡(BxR)=H‾x, so that Hom⁡0(BxR,D BxR)=Hom⁡0(BxR,BxR)=R (Indecomposable labels, characters and filtration ranks agree after real scalar extension).

[F3]

The reduced-word factorization is ρ=∑iγiχiφi, with every γi>0 and χi inserting csi (The Lefschetz operator factors through deleted Bott-Samelson subwords, with positive rescalings). A normalized summand Bz(d) has its reduced degree span at most 2ℓ(z), independently of its shift; the normalized extremal degrees are one-dimensional (Normalized type-A Soergel bimodules are self-dual and have length degree bounds).

[F4]

The dictionary of hypotheses HR(x) and HRbar(x) uses the positively normalized intrinsic form on the one hand and the restricted reduced-word intersection forms on the other; HR is definiteness of the primitive Lefschetz forms with the standard sign (Primitive subspaces, hard Lefschetz and the Hodge-Riemann signs: the dictionary of hypotheses S, hL and HR).

[F5]

Statement

Assume S(x), i.e. ch⁡(BxR)=H‾x. Then:

  1. the space of invariant forms on BxR is one dimensional over R, and every non-zero invariant form is non-degenerate;
  2. if BxR is embedded as a direct summand of a Bott-Samelson bimodule BS(x‾) for a reduced expression of x, the restriction of the intersection form is a positive multiple of the intersection form on BxR;
  3. consequently HR(x) holds for the intrinsic intersection form if and only if HRbar(x) holds for every (equivalently: some) embedding, and the two normalizations differ by a positive scalar, so no sign changes;
  4. if B=⨁zBzR,mz with S(z) for all z, then non-degenerate symmetric invariant forms on B are direct sums of the forms on the isotypic components tensored with nonsingular real symmetric multiplicity-space pairings, and an orthogonal decomposition into isotypic components can always be chosen.

Proof

1.1F1F2F3algebra

First prove the missing reduced-word bottom positivity. For a reduced word of length m, the bottom line is its 1-tensor and the top line its all-cs tensor. Induct on m, with value 1 for the empty word. The factorization in [F3] gives ρcbot=∑iγiχi(cbot) after reduction. If the deleted word is reduced, applying ρm−1 and induction gives a positive multiple Nictop. If it is not reduced, every indecomposable in its finite decomposition has label of length less than m−1, by the subexpression support and classification. On every shift of such a summand, ρm−1 vanishes by the degree span in [F3], so this deletion contributes zero. At least the last deletion is reduced. Thus ρmcbot=(∑i reduced deletionγiNi)ctop with positive coefficient. The trace of ctop is one, proving the positive bottom Lefschetz value without assuming hard Lefschetz.

2.1F1F2F3step 1.1

Under S(x) the unshifted duality and degree-zero endomorphism computation of [F2] give a one-dimensional space Hom⁡0(Bx,DBx) which contains an isomorphism. Every nonzero map in this space is consequently an isomorphism, proving (1) directly. For an arbitrary embedding into a reduced word, the normalized bottom line of Bx maps isomorphically to the word's bottom line by the degree bounds. Step 1.1 therefore makes the restricted invariant symmetric form nonzero; by this one-dimensional argument it is perfect. Normalize one such form to bottom value one. Every embedding's restriction is then a positive scalar multiple, proving (2) without inferring perfection merely from an ambient perfect form.

3.1F4step 2.1

Positive scalar multiples have the same primitive spaces, because the operator is unchanged, and their Lefschetz forms have the same definiteness signs. Hence the intrinsic standard-sign HR condition under S(x) is equivalent to the restricted-form condition for every embedding, and already to that for any one embedding. This proves (3), with the conditional intrinsic form and unconditional embedded-form convention of [F4].

3.2F1F2F5step 2.1algebra

For labels y≠z with S(y),S(z), the actual graded Hom formula and the standard KL trace pairing give Hom⁡0(By,DBz)=0: its free Hom rank lies in vZ[v], and the polynomial ring has no negative degrees. This is a degree-zero Hom calculation, rather than an inference from the locality of their endomorphism rings. Thus every invariant form on ⨁zBzmz pairs different isotypic components orthogonally. On one component, each matrix entry is a scalar multiple of the fixed perfect normalized Bz form by (1), giving exactly a multiplicity-space matrix Qz. Symmetry of the full form is symmetry of Qz, and perfection is nonsingularity of every Qz. Orthogonal diagonalization of each finite real symmetric matrix, or the elimination proof of [F5], supplies the claimed orthogonal copies and proves (4). No assertion that different multiplicity matrices are scalar multiples is made.

4.1step 1.1step 2.1step 3.1step 3.2∎

Step 2.1 proves uniqueness, perfection and positive comparison, step 3.1 the HR equivalence, and step 3.2 the complete isotypic multiplicity description. The bottom calculation was proved first in step 1.1 from normalized degree bounds and positive factorization, and no character theorem for the next label or Hodge conclusion was assumed.

Depends on

Used by

Cited to discharge well-definedness by Primitive subspaces, hard Lefschetz and the Hodge-Riemann signs: the dictionary of hypotheses S, hL and HR.

Dependency tree · two levels

46 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