Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Existence and uniqueness of the ordered-group unequal-parameter Kazhdan–Lusztig basis

Statement

Let S be any set with Coxeter group W, let L:W→Γ be any weight function into a totally ordered abelian group, let A=Z[Γ], and let HA(W,L) and its bar involution be as above. For each w∈W, there is a unique element Cw∈HA(W,L) such that

Cw‾=Cw,Cw=Tw+∑y<wpy,wTy,py,w∈A<0.

The family {Cw:w∈W} is an A-basis. For a simple generator s the normalization is Cs={Ts+v−L(s),L(s)>0,Ts,L(s)=0,Ts−vL(s),L(s)<0.

Facts & Assumptions

Given: An arbitrary-rank Coxeter system, a weight function L, its ordered group algebra A, the Hecke algebra HA(W,L), and its bar involution.

[F1]

Weight functions and ordered group-algebra coefficients: A=Z[Γ], the bar sends vγ to v−γ, and A<0 is the subgroup spanned by monomials vγ with γ<0.

[F2]

The arbitrary-rank weighted Hecke basis and Bruhat-triangular bar: {Tw} is an A-basis, bar is a semilinear involution, and Tw‾−Tw is supported on Ty with y<w.

[F3]

Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank: every lower Bruhat interval is finite, y<w implies ℓ(y)<ℓ(w), and the Bruhat order is described by reduced subwords.

Proof

Given: The data in the Statement.

1.1F2F3induction

Fix w∈W. By [F3], its strict lower interval {y:y<w} is finite and consists only of shorter elements, so construct Cy for those y by induction on length. Their triangular expansions show that the Cy form an A-basis of V<w:=span⁡A{Ty:y<w}: the transition matrix is finite, unitriangular, and ordered by length.

2.1F2step 1.1algebra

Set Dw=Tw‾−Tw. By [F2], there are unique coefficients ay∈A with Dw=∑y<wayCy. Since bar is an involution and each Cy is bar invariant by induction, Dw‾=−Dw implies ∑y<way‾Cy=−∑y<wayCy. The basis property in step 1.1 gives ay‾=−ay for each y<w.

3.1F1step 2.1algebra

Write ay=∑γnγvγ with finite support. The equality ay‾=−ay forces n0=0 and n−γ=−nγ. Let py=∑γ<0nγvγ∈A<0; then py−py‾=ay. Define Cw=Tw+∑y<wpyCy. Applying bar and using Dw=∑ayCy gives Cw‾=Tw+∑y<w(ay+py‾)Cy=Cw. Expanding the Cy in the standard basis shows that all coefficients below Tw remain in A<0, because a sum of two negative exponents is negative. This constructs a normalized bar-invariant Cw.

4.1F1F2F3step 3.1

Suppose Cw′ is another element with the stated properties. Then h=Cw′−Cw=∑y<wbyTy is bar invariant with each by∈A<0. Choose a nonzero by with ℓ(y) maximal. In h‾, the coefficient of Ty is by‾: every other term of maximal length has a distinct leading basis vector, while all lower bar terms have strictly smaller length by [F2, F3]. Bar invariance gives by=by‾, but A<0∩A<0‾={0}, a contradiction. Hence Cw′=Cw.

4.2F2F3step 3.1algebra

The family Cw is linearly independent: in any finite relation, choose a term of maximal length; its coefficient at the corresponding Tw is unchanged by the unitriangular expansions and must vanish. It spans by induction on ℓ(w), because Tw=Cw−∑y<wpy,wTy and all terms on the right other than Cw have smaller length. Thus it is an A-basis.

5.1F1F2step 3.1∎

For a simple generator s, write Cs=Ts+p with p∈A<0. The bar formula in [F2] gives Ts‾=Ts−vL(s)+v−L(s). Bar invariance is therefore equivalent to p−p‾=v−L(s)−vL(s). Splitting into negative and positive exponents gives p=v−L(s) if L(s)>0, p=0 if L(s)=0, and p=−vL(s) if L(s)<0, proving the displayed normalization by uniqueness.

Depends on

Used by

Dependency tree · two levels

24 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