Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

The standard type-A reflection realization and its polynomial ring

Definition

The ring and its grading. Fix k=Q and n≥2, and let R=Q[x1,…,xn] be the polynomial ring in n commuting indeterminates (Polynomial rings in finitely many commuting indeterminates by iteration). Grade it by deg⁡xi=2: Rd is the Q-span of the monomials of total degree d/2 when d is even, and Rd=0 when d is odd. Thus R is a nonnegatively graded commutative Q-algebra with R0=Q, and every element of R is a finite sum of homogeneous elements.

The reflection representation. Put h:=R2=⨁i=1nQxi, so dim⁡Qh=n, and let Sn act on h by place permutations, w⋅xi:=xw(i), extended to a Q-algebra automorphism of R; on polynomial functions this is the substitution (w⋅f)(x1,…,xn)=f(xw(1),…,xw(n)). This is a left action: v⋅(w⋅xi)=v⋅xw(i)=xv(w(i))=x(vw)(i), and the substitution formula is the same statement read on functions, since xi↦xw(i) for all i is the substitution by the tuple (xw(1),…,xw(n)); the linear extension of xi↦xw(i) to R is an automorphism because it merely permutes indeterminates. By Reduced adjacent-transposition words have well-defined positive lifts, Sn is generated by the adjacent transpositions si=(i i+1).

Two normalizations of the simple roots. Equip h with the symmetric bilinear form (xa,xb)=δab and use it to identify h∗ with h.

(a) Coordinate roots. For 1≤i≤n−1 put βi:=xi−xi+1∈h∗ and βi∨:=βi∈h, with ⟨βi∨,βj⟩:=(βi,βj)=2δij−δ∣i−j∣,1. Then si(v):=v−⟨v,βi⟩βi∨ is the place permutation of xi and xi+1 on the basis: si(xa)=xa−(δai−δa,i+1)(xi−xi+1) exchanges xi and xi+1 and fixes the remaining xa. We write Φ for the root system {±(xa−xb):a≠b}, Φ+ for the roots βab:=xa−xb with a<b, and Φst+:=Φ+∩(Qβs+Qβt) for the positive roots of the rank-two parabolic subsystem generated by s,t. With this choice the published length criterion of Finite Weyl strong exchange and deletion applies verbatim: ℓ(xsi)=ℓ(x)−1 if and only if xβi<0 in the positive system Φ+. We call (h,{βi∨},{βi}) the length normalization of the realization.

(b) Balanced roots. Put εi:=(−1)i−1 for 1≤i≤n−1 and αi:=εiβi∈h∗,αi∨:=εiβi∨∈h, so that the Cartan matrix of the realization is ⟨αi∨,αj⟩=εiεj(βi,βj)=2δij+δ∣i−j∣,1: adjacent pairings are +1 and distant pairings are 0. Because εi2=1, the reflection si(v)=v−⟨v,αi⟩αi∨=v−⟨v,βi⟩βi∨ coincides with the transposition computed in (a); hence the two choices of simple roots define the same reflection representation, the same reflecting hyperplanes, the same invariant rings Rsi and the same root system Φ as a set of elements of h∗. We call (h,{αi∨},{αi}) the balanced normalization; it is the one attached to the diagrammatic calculus of The type-A diagrammatic Soergel category and its candidate bimodule functor. The two normalizations are related by the dictionary αi=εiβi,αi∨=εiβi∨,∂i=εi ∂iβ,∂iβ:=f−si(f)βi,∂i:=f−si(f)αi, and every identity below is read in the normalization displayed in it; in particular the descent criterion in the balanced labeling reads ℓ(xsi)=ℓ(x)−1 if and only if εi xαi<0.

Invariants and the Demazure operator. Let Rsi denote the subring of si-invariants and, in the balanced normalization, define ∂i(f):=f−si(f)αi(f∈R), so that ∂i=εi∂iβ with ∂iβ(f)=(f−si(f))/βi; the kernel and the surjectivity below are the same for both operators, and the algebraic items of this page may use either. This is well defined and lands in Rsi: R is free over Rsi with basis {1,αi}, because 2 is invertible in Q and every polynomial can be written uniquely as f=g+αih with g=12(f+si(f)) and h=12∂i(f); the two summands are independent over Rsi since αi is not a zero divisor. Hence si(αih)=−αisi(h) forces the αi-part of f−si(f) to be 2αih, so ∂i(g)=0 for g∈Rsi and ∂i(αih)=2h(h∈Rsi). The factor 2 is the one displayed: applying ∂i to δih with δi:=αi/2 returns h, so ∂i is Rsi-linear and surjective onto Rsi (and the same operator annihilates Rsi, so its kernel is exactly Rsi).

The stated properties of the realization. For this data:

  1. it is faithful: if w∈Sn fixes every element of h then xw(i)=w⋅xi=xi for all i, so w(i)=i for all i and w=e;
  2. it is reflection faithful: every reflection of Sn is a transposition (a b), and its fixed space on h is the hyperplane xa−xb=0; distinct transpositions have distinct fixed hyperplanes, since the hyperplane determines the unordered pair {a,b};
  3. it satisfies Demazure surjectivity (Elias–Williamson, Assumption 3.7): αs∈h∗ is a nonzero functional on h, hence surjective onto Q, evaluation at αs∨≠0 is surjective on h∗, and ∂s is surjective onto Rss because ∂s(δsh)=h for h∈Rss with δs=αs/2;
  4. it is balanced in the sense of Elias–Williamson, Definition 3.6. Recall from Definition 3.5 that the two-colored quantum numbers are determined by [0]x=[0]y=0, [1]x=[1]y=1, [2]x=x, [2]y=y together with the recursions [2]x[k]y=[k+1]x+[k−1]x and [2]y[k]x=[k+1]y+[k−1]y. Fix s≠t and put x:=⟨αs∨,αt⟩, y:=⟨αt∨,αs⟩. If ∣s−t∣>1 then mst=2 and x=y=0, so the technical condition (3.3) reads [mst]x=[mst]y=[2]0=0 and [mst−1]x=[mst−1]y=[1]=1. If ∣s−t∣=1 then mst=3 and x=y=1; the recursion at k=2 gives [3]x=x[2]y−[1]x=1⋅1−1=0 and likewise [3]y=0, so (3.3) holds, while [mst−1]x=[2]1=1=[mst−1]y. Thus [mst−1]x=[mst−1]y=1 for every pair s,t, which is balancedness, and the technical condition (3.3) also holds throughout. This is the hypothesis under which Elias–Williamson §§5.1–5.3 present the diagrammatic category with the simple relation families used on this page, and it is why the balanced normalization (b), rather than the coordinate roots of (a), carries the diagrammatic data. Every finite dihedral integer 2mst is 4 or 6 here, hence invertible in Q, and so is 2.

Remark on the length normalization. In the coordinate-root normalization (a) the same realization has adjacent Cartan entries ⟨βs∨,βt⟩=−1, so [mst−1]x=[2]−1=−1≠1 for adjacent s,t: that normalization is odd-unbalanced, and Elias–Williamson's balanced presentation does not apply to it as written. Since the reflections, the invariant rings, the root hyperplanes and the bimodules Bi of this page depend only on the reflection representation and not on which linear forms represent the simple roots, the page uses the coordinate roots (a) for the length-theoretic and rank-two algebraic statements, where the published length criterion is stated in that notation, and the balanced roots (b) for the diagrammatic statements of Elias–Williamson §§5–7.

Small n. For n=0 or n=1, take R=Q[x1,…,xn] (with R=Q when n=0). The group Sn is trivial and there are no simple reflections. The empty-word bimodule is R; the additive graded Bott–Samelson category consists of finite direct sums of shifts of R, with degree-zero bimodule maps. Its Soergel category is its idempotent completion. In particular it contains the zero object, all shifts and all scalar maps; End⁡0(R)=Q. Statements involving a simple reflection have no instances in these cases.

Shift dictionary. Following Elias–Williamson we write M(1) for the graded shift with M(1)d=Md+1. In the library convention for graded modules and their internal shifts, in which the shift {r} has (M{r})d=Md−r, this is the internal shift M{−1}, and M(r)d=Md+r=M{−r}d for all r∈Z. This dictionary is used without further comment in every shifted formula on this page.

Depends on

Used by

Dependency tree · two levels

10 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