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

Signed KLR algebra is the equivariant Ext algebra of quiver-flag complexes

Statement

Assume the Axiom of Choice as inherited. Let Γ, β and k be as in Quiver full-flag incidence varieties and signed geometric KLR generators. There is a unique graded k-algebra isomorphism SΓ(β)→ ∼ Ext⁡G∙(⨁νπν!k[dν],⨁νπν!k[dν]) sending eν, xr, τr to the diagonal, Chern and normalized elementary classes of Quiver full-flag incidence varieties and signed geometric KLR generators, where the Ext algebra carries the shifted multiplication a∗b=b[n]∘a for homogeneous a of degree n. On the (η,ν) component, Ext degree n corresponds to BM degree dη+dν−n. No semisimplicity, purity or decomposition theorem is used, and finite-dimensionality of the total Ext algebra is not assumed.

Facts & Assumptions

Given: the Axiom of Choice; a characteristic-zero field k; a finite loopless quiver Γ, a dimension vector β and a word ν as in Quiver full-flag incidence varieties and signed geometric KLR generators; the objects Lν=πν!k[dν] on E, the incidence varieties Zη,ν, and the intrinsic signed presentation SΓ(β) with its generators eν,xr,τr.

[F1]

Assume AC. Quiver full-flag incidence varieties and signed geometric KLR generators fixes the corner identification eηAeν=Ext⁡G(Lη,Lν) with the opposite-composition product a∗b=b[n]∘a, the degree dictionary Ext degree n ↔ BM degree dη+dν−n, and the geometric generators and presentation relations.

[F2]

Assume AC. Quiver-flag convolution generators satisfy the signed KLR relations shows that the assignment eν↦eν, xr↦xr, τr↦τr respects every defining relation of SΓ(β) and defines a graded k-algebra homomorphism SΓ(β)→A.

[F3]

Assume AC. Relative-position incidence strata give a faithful geometric PBW basis exhibits the elements x1c1⋯xmcmτweν, for one fixed reduced expression of every w∈Sm, as a k-basis of A, and shows that the word idempotents, dots and elementary crossings generate A.

[F4]

Assume AC. Proper-pushforward Ext is equivariant Borel–Moore homology of the fiber product supplies, for proper equivariant maps between the stated finite-type complex varieties with smooth pure-dimensional sources, the natural cornerwise isomorphisms Φijr:Hom⁡(Li,Lj[r])→Hdi+dj−rBM,G(Zij;k), compatible with Borel approximation.

[F5]

Assume AC. Verdier-duality identification intertwines Yoneda product and oriented convolution identifies the shifted composition product with the convolution product: Φikr+s(β[r]∘α)=Φijr(α)∗Φjks(β), with the right-hand product the external-product, refined middle-diagonal Thom intersection and proper pushforward of Equivariant Borel–Moore homology and oriented correspondence convolution, not a product transported by definition from Ext.

[A1]

The Axiom of Choice is consumed exactly through [F1]–[F5], whose constructions declare it for injective resolutions, equivariant descent and duality; the finite symmetric-group sorting and reduction arguments below are choice-free (The Axiom of Choice).

Proof

technique · direct
1.1F1F2given

By [F2] the assignment on generators respects every defining relation of the presentation of [F1], hence induces a graded k-algebra homomorphism Φ:SΓ(β)→A. The generators generate SΓ(β) by definition of a free presentation, so any two graded algebra homomorphisms agreeing on eν,xr,τr agree everywhere; this is the asserted uniqueness.

1.2givenalgebraconstruct

We establish the needed adjacent-transposition word reduction explicitly. Put tj=sm−1⋯sj for 1≤j<m, and tm=1. Every permutation has a unique canonical expression qtj, where q fixes m and j is the position sent to m. Inductively choose the same expression for q in Sm−1. Right multiplication by si is absorbed using tjsi=sitj if i<j−1, tjsj−1=tj−1, tjsj=tj+1, and tjsi=si−1tj if i>j. The first formula commutes disjoint letters; the second appends one letter; the third cancels the final equal pair; the fourth follows by commuting si left until a single braid move changes sisi−1si to si−1sisi−1, then commuting si−1 past higher-index letters. For tm=1 the generator lies in Sm−1 or equals tm−1. Recursively absorbing the resulting left generator into q converts any word into its canonical expression using only braid moves and adjacent-pair removals, never increasing length. The canonical length is the inversion number: tj contributes the m−j inversions involving m, and q contributes exactly the inversions on the remaining entries. Every word has at least that length because a swap changes inversion number by one. Therefore reduced words normalize using braid moves alone and any nonreduced word exposes a removable equal pair during normalization. Two reduced words for the same permutation are braid-connected through their common canonical word. The cases m=0,1 have only the empty expression.

2.1F3step 1.1

By [F3] the elements x1c1⋯xmcmτweν form a k-basis of A, and each of them is the image under Φ of the corresponding product of generators and dots in SΓ(β); hence Φ is surjective.

3.1F1F3step 2.1step 1.2algebra

Filter the presentation by crossing number. Move dots left using its mixed and slide relations, inducting first on crossing number and then on dot/crossing inversions; correction terms have fewer crossings. For a nonreduced crossing word the normalization in step 1.2 exposes an adjacent repeated reflection, whose square relation removes two crossings. For a reduced word the same step connects it to the chosen reduced expression. Lift each braid move to the signed presentation: its additional polynomial correction has fewer crossings and is handled by induction. Hence the presentation is spanned by xcτweν, with finitely many crossing words and arbitrary nonnegative dot powers. Their images under Φ are linearly independent by [F3], so any finite linear combination in the kernel has zero coefficients. This proves injectivity.

4.1F1F4F5step 3.1

By [F4] the corner Ext⁡Gn(Lη,Lν) is naturally identified with the Borel–Moore group Hdη+dν−nBM,G(Zη,ν;k); by [F5] this identification carries the shifted composition product a∗b=b[n]∘a to the geometric convolution product of [F1], and the direct sum of the corner identifications is an isomorphism of unital graded algebras, the diagonal class corresponding to id⁡Lν and nonmatching corners multiplying to zero. In particular all computations of [F3], which were performed with the convolution product, are statements about the shifted Ext algebra, so the isomorphism produced in steps 1.1–3.1 is an isomorphism of graded algebras. No semismallness, purity or decomposition theorem is used, and finite-dimensionality of the total Ext algebra is not assumed: [F4] and [F5] apply to the given proper maps with smooth sources without requiring smooth fiber products.

5.1A1step 1.1step 4.1∎

Combining steps 1.1–4.1, the map Φ is a bijective graded k-algebra homomorphism from SΓ(β) to Ext⁡G∙(⨁νLν,⨁νLν) with the shifted product, sending the intrinsic generators to the diagonal, Chern and normalized elementary classes, and it is unique with this property by step 1.1. The Axiom of Choice entered only through [A1].

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