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

The A1 Macdonald operator is triangular on Weyl orbit sums

Statement

Let m0=1 and mn=zn+z−n for n≥1 be the A1 Weyl orbit sums. The degree of a nonzero Laurent polynomial ∑kakzk is max⁡{∣k∣:ak≠0}. For every n≥0, the operator D of The symmetric Macdonald difference operator of type A1 sends mn to

Dmn=λnmn+∑0≤j<ndn,jmj,λn=tqn+t−1q−n,

with coefficients dn,j∈K. In particular, D preserves the symmetric Laurent-polynomial space.

Facts & Assumptions

Given: The operator D on V and the rank-one Laurent variable z.

[F1]

The symmetric Macdonald difference operator of type A1: Df=A(z)f(qz)+B(z)f(q−1z), with A(z)=(tz2−t−1)/(z2−1) and B(z)=(t−1z2−t)/(z2−1).

Proof

1.1F1givenalgebra

The coefficient identity A+B=t+t−1 rewrites the formula as (Df)(z)=(t+t−1)f(q−1z)+A(z)(f(qz)−f(q−1z)). For f(z)=f(z−1), the Laurent polynomial h(z)=f(qz)−f(q−1z) vanishes at z=1 and z=−1, since f(q)=f(q−1) and f(−q)=f(−q−1). Multiplying h by a power of z gives an ordinary polynomial still vanishing at both distinct roots 1,−1, so z2−1 divides h; hence A(z)h(z) is Laurent. Thus Df is a Laurent polynomial.

2.1F1step 1.1algebra

One has A(z−1)=B(z) and B(z−1)=A(z). For symmetric f, f(qz−1)=f(q−1z) and f(q−1z−1)=f(qz). Substituting z−1 in [F1] therefore gives (Df)(z−1)=(Df)(z), so the result is Weyl-invariant.

3.1F1step 2.1algebra∎

The coefficients A,B have finite limits t,t−1 at z=∞, so Dmn has no exponent above n. Its coefficient of zn is tqn+t−1q−n, obtained from the leading terms of mn(qz) and mn(q−1z). Weyl invariance from step 2.1 gives the same coefficient at z−n. Subtracting λnmn leaves a symmetric Laurent polynomial g with no exponent of absolute value n or greater. Write g=∑k=−rrbkzk; symmetry gives bk=b−k, so g=b0m0+∑k=1rbkmk. Thus g is a linear combination of m0,…,mn−1. When n=0, A+B=t+t−1 gives the formula directly.

Depends on

Used by

Cited to discharge well-definedness by The symmetric Macdonald difference operator of type A1.

Dependency tree · two levels

3 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