Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

General Bernstein PBW and the Iwahori–Matsumoto comparison

Statement

Let R=(X,Φ,Y,Φ∨,Δ) be any reduced based root datum, and give its canonical extended affine Weyl group arbitrary positive affine Hecke parameters invariant under extended conjugation (The Iwahori–Matsumoto affine Hecke algebra of a based root datum). Write vα for the parameter of the finite simple reflection sα. In the formal Bernstein algebra of The formal Bernstein presentation for a reduced based root datum, attach its exceptional parameters to this affine system by requiring vα′=v(Hα,1) for α∈Δ∩2X, where v(H) is the parameter of reflection in the wall H.

For y∈Y, write y=λ−μ with λ,μ dominant lattice elements. The element Θy:=NtλNtμ−1 is independent of these choices and satisfies ΘyΘz=Θy+z. Its values are linearly independent, and both {ΘyNw:y∈Y, w∈W0},{NwΘy:y∈Y, w∈W0} are complex vector-space bases of the Iwahori–Matsumoto algebra. The assignment θy↦Θy, Ns↦Ns gives an isomorphism from the attached formal Bernstein algebra to the Iwahori–Matsumoto algebra. In particular both ordered families θyNw and Nwθy are bases of the former. No restriction to an irreducible or semisimple datum, to equal parameters, or to parameters greater than one is imposed.

Facts & Assumptions

Given: The root datum and attached positive parameter system above.

[F1]

The canonical root-datum affine geometry has hyperplanes Hα,k={x:⟨α,x⟩=k}, reflection rα,k=tkα∨sα, dominant base alcove A, and extended group Y⋊W0. The parameter of a wall is well defined. With cα=vα−vα−1 and cα′=vα′−(vα′)−1, its difference parameter c(α,k)=v(Hα,k)−v(Hα,k)−1 equals cα for every k if α∉2X; otherwise it equals cα for even k and cα′ for odd k (Canonical affine geometry and wall parameters of a root datum).

[F2]

For a chamber D at infinity, signed gallery products ED(g) depend only on the framed endpoint g, including for nonminimal galleries and galleries starting elsewhere; the elements ED(g) form a basis (Signed alcove products and the oriented affine Hecke basis).

[F3]

The finite Weyl group and its bases, positive roots, chambers and length are those of Combinatorics of a reduced root datum. The reflection action is sα(y)=y−⟨α,y⟩α∨, and the root/coroot pairing is perfect and integral (Abstract root data and their Weyl groups).

[F4]

The formal algebra has the group-algebra, finite Hecke and the two stated Bernstein cross-relations; each quotient appearing there is a finite Laurent polynomial (The formal Bernstein presentation for a reduced based root datum, The Bernstein cross-relation quotients are Laurent polynomials).

Proof

Given: The data above. Take D to be the dominant chamber at infinity and temporarily define Θy=ED(ty).

1.1F1F2F3givenalgebra

Translation by y∈Y preserves crossing directions, while its possible permutation of facet types is accounted for by the crossed product. Explicitly write ty=wyωy with wy∈Waff, ωy∈Ω. If a gallery for tz has affine types s1,…,sr and terminal frame ωz, then after translation and removal of the initial affine transport wy its types are ωysiωy−1, with the same signs. The relation UωyNs±1Uωy−1=Nωysωy−1±1 shows that multiplying its signed product after the product for ty gives exactly this translated gallery, with terminal frame ωyωz. Concatenation and [F2] therefore give ΘyΘz=Θy+z. The empty gallery gives Θ0=1, so Θy−1=Θ−y. If y is dominant, each separating wall is crossed toward D on a minimal gallery to tyA: for every positive root β, its coordinate changes from ⟨β,A⟩⊂(0,1) to that interval translated by the nonnegative integer ⟨β,y⟩. Thus all signs are positive and Θy=Nty.

2.1F3step 1.1algebra

Let h be the sum of the positive coroots. A simple reflection permutes all positive coroots except its own, which it negates: in simple-coroot coordinates, reflection in a simple root changes only the coefficient of that simple coroot, so any other positive coroot retains a positive coefficient elsewhere and hence cannot become negative by [F3]. Therefore sα(h)=h−2α∨; comparing with the reflection formula gives ⟨α,h⟩=2 for each simple α. For any y, sufficiently large integer M≥0 makes μ=Mh and λ=y+Mh dominant. If there are no roots use μ=0, λ=y. Step 1.1 now yields Θy=ΘλΘμ−1=NtλNtμ−1, proving the asserted formula and its independence of the dominant decomposition. Central lattice directions cause no difficulty because no root inequality involves them.

3.1F1F2F3step 1.1algebrastep 2.1

For w∈W0, a reduced finite gallery from A to wA crosses each of its separating root hyperplanes from its positive side to its negative side. Hence ED(w)=Nw−1−1. Translate this gallery by y and concatenate it after a gallery for ty, transporting its types through ωy by the crossed-product identity proved in step 1.1. By [F2], ED(tyw)=ΘyNw−1−1. The elements Nw−1−1 form a basis of the finite Hecke algebra: expansion of each inverse Ns−1=Ns−cs gives Nw plus strictly shorter terms, and induction on finite Weyl length proves both spanning and independence. Every element of Y⋊W0 has a unique expression tyw, so the oriented basis [F2], followed by this finite change of basis separately for each y, proves that {ΘyNw} is a basis of the full algebra. In particular y↦Θy embeds C[Y].

4.1F1F2F3step 2.1algebrastep 3.1

Fix α∈Δ, put s=sα, a=α∨, n=⟨α,y⟩, and let D′=sD. The orientations toward D and D′ differ only on the walls parallel to α, since a simple reflection permutes the other positive roots by the simple-coordinate argument in step 2.1. Suppose n≥0 and choose a minimal gallery from A to tyA. Its relevant walls are exactly Hα,k for 1≤k≤n, each crossed once toward D and in increasing order of k. On these crossings the signed factors for D,D′ are respectively Ni,Ni−1, whose difference is c(α,k); on the other crossings the factors agree.

5.1F1F2step 4.1algebra

Expand ED(ty)−ED′(ty) by telescoping over its relevant crossings, using the D factors before a deleted factor and the D′ factors after it. In the term belonging to Hα,k replace Ni−Ni−1 by c(α,k) and multiply on the right by Ns. The remaining signed word represents a gallery obtained by deleting that crossing and reflecting the whole subsequent tail across Hα,k. Its signs are exactly the D signs: the prefix already has them, while the reflection has linear part s and therefore takes the D′ orientation of the suffix to D. Before reflecting, the added final crossing from tyA to tysA moves toward D′, so its factor is indeed Ns. Deleting the crossing keeps the prefix unchanged and reflects the suffix's initial alcove back to that prefix's endpoint; hence this is a genuine gallery, even if it is not minimal. Its framed endpoint is rα,ktys=tkastys=tsy+ka=ty−(n−k)a. Thus [F2] identifies this term with c(α,k)Θy−(n−k)a. This explicitly accounts for every other wall crossing carried along in the tail.

6.1F1F2step 4.1step 5.1algebra

Starting with the positive D′ crossing from A to sA, then reflecting a D gallery for tsy, and finishing with the negative D′ crossing from tysA to tyA, proves ED′(ty)=NsΘsyNs−1 by [F2]. Therefore steps 4.1–5.1 give ΘyNs−NsΘsy=∑k=1nc(α,k)Θy−(n−k)a. For n=0 the products have identical signs, and the same conclusion holds with an empty sum. This derivation uses only the parameter of the deleted wall, so applies to arbitrary positive affine parameter values.

7.1F1F3F4step 6.1algebra

If α∉2X, [F1] makes all coefficients in step 6.1 equal to cα. Setting j=n−k and summing the geometric progression gives ΘyNs−NsΘsy=cαΘy−Θsy1−Θ−a. If α∈2X, perfect integral duality gives n=2m for an integer m≥0. Then j=n−k has the same parity as k. The coefficients for even j are cα and those for odd j are cα′. Pairing consecutive terms gives ΘyNs−NsΘsy=(cα+Θ−acα′)Θy−Θsy1−Θ−2a. Both expressions mean the finite Laurent polynomials of [F4], with value zero when n=0.

8.1F4step 1.1step 3.1step 7.1algebra

For all y,z the expression D(y)=ΘyNs−NsΘsy satisfies D(y+z)=ΘyD(z)+D(y)Θsz by direct multiplication and step 1.1. Since D(0)=0, substituting z=−y yields D(y)=−ΘyD(−y)Θsy. If n<0, apply the proved nonnegative-pairing relation to −y. In either root case write its common rational coefficient as C, namely cα/(1−Θ−a) or (cα+Θ−acα′)/(1−Θ−2a). Then −ΘyC(Θ−y−Θ−sy)Θsy=C(Θy−Θsy). This calculation is valid in the fraction field of the embedded Laurent algebra from step 3.1; both final sides are the finite Laurent polynomials of [F4]. Thus the two Bernstein cross-relations hold for negative n as well.

9.1F4step 1.1step 7.1step 8.1construct

By steps 1.1 and 7.1–8.1, the elements Θy,Ns satisfy all defining relations of the attached formal Bernstein quotient B. The finite Hecke relations already hold in the Iwahori–Matsumoto algebra. The universal property of the quotient therefore gives a homomorphism F:B→HIM sending its stated generators to those elements.

10.1F4step 3.1step 9.1algebra

In B, every word lies in the span of θyNw. Indeed move lattice factors to the left through finite generators, using the rearranged Bernstein relation Nsθy=θsyNs+Ry, where Ry is its Laurent-polynomial error term; this is the defining relation applied to sy with its sign reversed. Induct lexicographically on the number of finite generators and the number of finite-generator/lattice-factor inversions. The leading reordered term reduces the inversion number, and each error term loses one finite generator. Combine adjacent lattice factors and reduce the remaining finite Hecke word by its quadratic and braid relations. These reductions give finite sums, so the induction terminates. Under F the resulting spanning family maps to the basis in step 3.1. A finite kernel relation would therefore have zero coefficients in that basis; and every element of the target has a preimage by that basis. Thus F is an isomorphism and {θyNw} is a basis of B.

11.1F4step 10.1algebra∎

Reversal of words fixing every θy and every finite Ns induces an involutive antiautomorphism of B. The lattice relations are stable under reversal, as are the quadratic relations and the alternating braid relations. For the cross-relation, its right side has the form Ry=C(θ)(θy−θsy) and satisfies Rsy=−Ry. The defining relation at sy, multiplied by −1, is Nsθy−θsyNs=Ry, precisely the reversed defining relation at y; Laurent factors commute on the right side. Hence every defining relation is preserved. This involution sends the basis θyNw to Nw−1θy. Inversion permutes W0, so {Nwθy} is a second basis. Transporting it by F proves the second ordered basis in HIM. Every selection, expansion and induction used in the proof is finite; no choice principle is needed.

Depends on

Used by

Dependency tree · two levels

22 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