Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Standard bases, right actions and bar involutions on the parabolic Hecke modules

Statement

Retain the notation of The parabolic Hecke module and the antispherical standard basis and put mx:=1⊗Hx, nx:=1⊗Hx for x∈JW, and Cs:=H‾s=Hs+v for s∈S. Then:

(1) (Bases.) The sets {mx:x∈JW} and {nx:x∈JW} are A-bases of MJ and NJ respectively. Indeed every w∈Sn factors uniquely as w=ly with l∈WJ, y∈JW, length-additively, and φ+(Hl)=v−ℓ(l) and φ−(Hl)=(−v)ℓ(l) are units of A, so 1⊗Hw=φ±(Hl) (1⊗Hy) in both modules.

(2) (Right action.) For s∈S and x∈JW, mxCs={mxs+v mx,xs∈JW, xs>x,mxs+v−1mx,xs∈JW, xs<x,(v+v−1)mx,xs∉JW,nxCs={nxs+v nx,xs∈JW, xs>x,nxs+v−1nx,xs∈JW, xs<x,0,xs∉JW.

(3) (Bar.) The assignment a⊗h↦aˉ⊗hˉ (bar on A and the bar involution of Hv(n)) descends to A-antilinear involutions of MJ and NJ that satisfy X⋅h‾=X‾⋅hˉ and mx‾=mx+∑y<xay,xmy,nx‾=nx+∑y<xby,xny with ay,x,by,x∈A and top coefficient ax,x=bx,x=1.

(4) (Parabolic property.) If x∈JW and s∈S with xs∉JW, then xs=rx for a unique simple r∈J and xs>x.

Facts & Assumptions

Given: The data of The parabolic Hecke module and the antispherical standard basis: J⊆S={s1,…,sn−1}, WJ, JW, the modules MJ,NJ with φ+(Hs)=v−1, φ−(Hs)=−v, the standard basis {Hw} and the elements Cs=Hs+v; Sn=Sym⁡({1,…,n}), si=(i i+1), and ℓ is inversion length.

[F1]

Parabolic factorization: every w∈Sn is uniquely w=ly with l∈WJ, y∈JW, and ℓ(w)=ℓ(l)+ℓ(y); consequently ℓ(uy)=ℓ(u)+ℓ(y) for u∈WJ, y∈JW (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3), Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (3), Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2)). For a reduced expression w=si1⋯sik one has Hw=Hsi1⋯Hsik, and if ℓ(w)=ℓ(u)+ℓ(y) then Hw=HuHy (The normalized type-A Hecke algebra and its bar involution, The standard basis of the generic type-A Hecke algebra).

[F2]

Right multiplication by a generator (The normalized type-A Hecke algebra and its bar involution): HwHs=Hws if ℓ(ws)=ℓ(w)+1, and HwHs=Hws+(v−1−v)Hw if ℓ(ws)=ℓ(w)−1.

[F3]

Bar (The Hecke bar involution is well defined): bar is a multiplicative A-semilinear involution with Hs‾=Hs−1=Hs−(v−1−v), Hw‾=Hw−1−1, and φ±(Hs‾)=φ±(Hs)‾, the conjugate under v↦v−1.

[F4]

Bruhat order (Basic properties of the Bruhat order on Sn (a)-(c)): length-increasing simple multiplication is a Bruhat cover; y≤w implies ℓ(y)≤ℓ(w) with equality only for y=w; a reduced subword of a reduced expression for w represents an element ≤w. An arbitrary subword need not be reduced. Deletion of pairs of letters reduces any word to a reduced word for the same permutation (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)).

[F5]

Length and left descents (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4), Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations): ℓ(x)=inv⁡(x), and for a simple reflection si the left multiple six swaps the values i and i+1 in the one-line notation; the total inversion contribution from pairs involving any third value is unchanged, while the contribution of {i,i+1} changes by one, so ℓ(six)<ℓ(x) if and only if i+1 occurs to the left of i in x, equivalently ℓ(six)>ℓ(x) if and only if i occurs to the left of i+1.

[F6]

Blocks (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2), Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (1)): if J decomposes into maximal runs of consecutive indices, then WJ is the direct product of the symmetric groups on the corresponding consecutive value blocks, and by [F5] an element x lies in JW if and only if inside every such block the values occur in increasing order in the one-line notation of x.

Proof

technique · direct: exhibit the free left $H_J$-basis, compute the right action from the standard multiplication rules, prove the parabolic property from the type-$A$ block criterion, and expand bar along subwords
1.1F1F2givenalgebra

The bases. The A-span of {Hu:u∈WJ} is exactly HJ: it contains the generators and is closed under their left and right multiplication by the quadratic multiplication rule, while every Hu is a reduced product of generators in J. By [F1], the standard basis partitions as {HuHy:u∈WJ, y∈JW}. Hence multiplication is an isomorphism of left HJ-modules ⨁y∈JWHJ→Hv(n), (hy)y↦∑yhyHy: expanding each hy in the independent Hu proves injectivity and the unique factorization proves surjectivity. Tensoring this isomorphism with either character module A gives A⊗HJHv(n)≅⨁y∈JWA. The images of the coordinate generators are my, respectively ny, proving both bases.

2.1F2F4step 1.1algebra

The two minimal branches. Let x∈JW, s∈S and suppose xs∈JW. Since xs=(xsx−1)x is the left translate of x by a transposition and ℓ(xs)=ℓ(x)±1, [F4] shows that xs>x holds exactly when ℓ(xs)=ℓ(x)+1, and xs<x exactly when ℓ(xs)=ℓ(x)−1. If xs>x then [F2] gives HxHs=Hxs, so by step 1.1 and the module structure mxCs=1⊗(Hxs+vHx)=mxs+v mx, and likewise nxCs=nxs+v nx. If xs<x then HxHs=Hxs+(v−1−v)Hx, so mxCs=mxs+(v−1−v)mx+v mx=mxs+v−1mx, and likewise nxCs=nxs+v−1nx.

2.2F1F2F4F5F6step 1.1algebra

The parabolic property. Let x∈JW and s=sj, and suppose xs∉JW; by [F5] xs has a left descent in J: some r∈J has r+1 to the left of r in xs. Since x∈JW has no such descent, while xs differs from x only by the swap of the entries at positions j and j+1, the only changed relative order is that of the values a:=x(j), b:=x(j+1), so {r,r+1}={a,b}. The order a=r+1, b=r is excluded because it would already be a left descent of x. Hence a=r and b=r+1 with r∈J; the two permutations xs and srx coincide because both are obtained from x by interchanging the values r and r+1. Moreover ℓ(srx)>ℓ(x) because r∈J and x∈JW, so ℓ(xs)=ℓ(x)+1 and xs>x by F4,(b); thus HxHs=Hxs=Hsrx=HrHx by [F1] and [F2]. Therefore mxCs=1⊗(Hxs+vHx)=φ+(Hr)mx+v mx=(v−1+v)mx and nxCs=φ−(Hr)nx+v nx=(−v+v)nx=0. Uniqueness of r holds because r is the value whose swap produces xs; this proves (4) and the third branch of (2).

2.3F3step 1.1algebra

The bar descent. The map β(a⊗h):=aˉ⊗hˉ is well defined on A⊗HJHv(n): it suffices to check aφ±(t)‾⊗hˉ=aˉ⊗th‾ for t=Hs, s∈J, where the left side is aˉ φ±(Hs)‾⊗hˉ and the right side is aˉ⊗Hs‾hˉ=aˉ⊗(Hs−(v−1−v))hˉ=aˉ φ±(Hs−(v−1−v))⊗hˉ, and φ+(Hs−(v−1−v))=v−1+(v−v−1)=v=v−1‾, φ−(Hs−(v−1−v))=−v+(v−v−1)=−v−1=−v‾ by [F3]; multiplicativity extends this to all t. The map is A-antilinear, involutive (β2=id because bar is an involution on A and on Hv(n)), and satisfies β(X⋅h′)=β(X)⋅h′‾ because (a⊗h)⋅h′=a⊗hh′ maps to aˉ⊗hh′‾=aˉ⊗hˉhˉ′=(aˉ⊗hˉ)⋅hˉ′.

3.1F1F2F3F4step 1.1step 2.3algebra

Triangular expansion and top coefficient. For x=si1⋯sik reduced, [F3] gives Hx‾=∏m=1k(Hsim−(v−1−v)). The term choosing every generator is Hx. Every other term is a scalar times a product of fewer than k generators selected from this word. Successive use of [F2] expands such a product into Hz whose group labels are products of subwords of the selected word: each multiplication retains the old label or appends the current generator. Deletion of pairs in [F4] reduces each such group word to a reduced subword of the original reduced expression for x. Thus z≤x, and ℓ(z)<k because at most k−1 letters were retained, so z<x. Consequently Hx‾=Hx+∑z<xczHz. For each z<x factor z=uy length-additively with u∈WJ, y∈JW. A reduced expression of z contains a reduced suffix for y, so y≤z<x. In either module 1⊗Hz=φ±(Hu)(1⊗Hy). Applying the bar from step 2.3 therefore gives exactly the triangular expansions in (3), with top coefficient one and all lower coefficients in A.

4.1step 1.1step 2.1step 2.2step 2.3step 3.1∎

Parts (1), (2), (3) and (4) are proved in steps 1.1, 2.1 together with 2.2, 2.3 together with 3.1, and 2.2 respectively.

Remarks

The independence of {mx} uses the free left HJ-basis {Hy} of Hv(n) and not merely the spanning property; a unit coefficient alone would not prove independence. The top coefficient one in (3) is the coefficient of Hx in the expansion of the inverse generators; it is not a claim that all lower coefficients lie in vZ[v]. The bar is multiplicative; the balancing check in step 2.3 is exactly where the multiplicative convention (rather than an anti-automorphism convention) is used.

Depends on

Used by

Cited to discharge well-definedness by The parabolic Hecke module and the antispherical standard basis.

Dependency tree · two levels

45 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