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.

The symmetric rank-one Macdonald polynomials are DAHA eigenfunctions

Statement

Assume q∈K× is not a root of unity, t∈K×, and t2≠q−N for every positive integer N. Let m0=1 and mn=zn+z−n for n≥1. The Laurent degree of a nonzero ∑kakzk is max⁡{∣k∣:ak≠0}; the coefficient of mn is the monic normalization. For each n≥0 there is a unique symmetric Laurent polynomial

Pn=mn+∑0≤j<ncn,jmj

such that

DPn=λnPn,λn=tqn+t−1q−n.

The polynomials Pn form a K-basis of the symmetric Laurent polynomials and are simultaneous eigenfunctions of every symmetric rank-one DAHA translation operator. This is the monic type-A1 symmetric Macdonald eigenfunction normalization; no inner-product norm formula or general-root-system extension is asserted here.

Facts & Assumptions

Given: The type-A1 symmetric DAHA difference operator, its triangular action on the orbit sums, and its realization as the restriction of the symmetric DAHA translation algebra.

[F1]

The symmetric Macdonald difference operator of type A1: D is the operator with coefficients (tz2−t−1)/(z2−1) and (t−1z2−t)/(z2−1) acting by q- and q−1-shifts.

[F2]

The A1 Macdonald operator is triangular on Weyl orbit sums: Dmn=λnmn+∑j<ndn,jmj with λn=tqn+t−1q−n.

[F3]

The symmetric DAHA translation restricts to the A1 Macdonald operator: every symmetric Laurent polynomial in the DAHA translation Y restricts to the corresponding polynomial in D on the symmetric Laurent-polynomial space.

Proof

1.1givenalgebra

For distinct n,m≥0, λn−λm=(qn−qm)(t−t−1q−(n+m)). If n≠m, the first factor is nonzero because q is not a root of unity. Also n+m≥1, and the second factor is nonzero because t2≠q−(n+m). Thus all eigenvalues λn are pairwise distinct.

2.1F1F2step 1.1algebraconstruct

Write f=∑k=−rrakzk∈V. Comparing coefficients in f(z)=f(z−1) gives ak=a−k, so f=a0m0+∑k=1rakmk; uniqueness follows from the linear independence of Laurent monomials. Thus m0,…,mr form a basis of the symmetric Laurent polynomials of degree at most r. Construct the Pn by induction: set P0=m0, an eigenvector by [F2], and suppose P0,…,Pn−1 form a basis of the degree-at-most-n−1 subspace. By [F2], write (D−λn)mn=∑j<nrn,jPj. Set Pn=mn+∑j<nrn,jλn−λjPj. The coefficient of each Pj in (D−λn)Pn is rn,j+(λj−λn)rn,j/(λn−λj)=0, so Pn is an eigenvector with leading term mn.

3.1F2F3step 1.1step 2.1algebra∎

If another monic eigenvector Q with leading term mn existed, write Q−Pn=∑j<najPj. Then 0=(D−λn)(Q−Pn)=∑j<naj(λj−λn)Pj. The Pj are linearly independent by their triangular leading terms, and every λj−λn is nonzero by step 1.1, so each aj=0 and Q=Pn. Since (mn) is a basis and the change to (Pn) is triangular with diagonal entries 1, the Pn form a basis. Finally [F3] makes each symmetric DAHA translation polynomial act as a polynomial in D; for every polynomial r, r(D)Pn=r(λn)Pn. Thus each Pn is a simultaneous eigenfunction of the full symmetric translation family.

Depends on

Used by

Dependency tree · two levels

6 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