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 is not a root of unity, , and for every positive integer . Let and for . The Laurent degree of a nonzero is ; the coefficient of is the monic normalization. For each there is a unique symmetric Laurent polynomial
such that
The polynomials form a -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.
The symmetric Macdonald difference operator of type A1: is the operator with coefficients and acting by - and -shifts.
The symmetric DAHA translation restricts to the A1 Macdonald operator: every symmetric Laurent polynomial in the DAHA translation restricts to the corresponding polynomial in on the symmetric Laurent-polynomial space.
Proof
For distinct , . If , the first factor is nonzero because is not a root of unity. Also , and the second factor is nonzero because . Thus all eigenvalues are pairwise distinct.
Write . Comparing coefficients in gives , so ; uniqueness follows from the linear independence of Laurent monomials. Thus form a basis of the symmetric Laurent polynomials of degree at most . Construct the by induction: set , an eigenvector by [F2], and suppose form a basis of the degree-at-most- subspace. By [F2], write . Set . The coefficient of each in is , so is an eigenvector with leading term .
If another monic eigenvector with leading term existed, write . Then . The are linearly independent by their triangular leading terms, and every is nonzero by step 1.1, so each and . Since is a basis and the change to is triangular with diagonal entries , the form a basis. Finally [F3] makes each symmetric DAHA translation polynomial act as a polynomial in ; for every polynomial , . Thus each 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
- Alexander A. Kirillov Jr., Lectures on the affine Hecke algebras and Macdonald conjectures (standard reference, not scraped)
- I. G. Macdonald, Affine Hecke algebras and orthogonal polynomials (standard reference, not scraped)
- Pavel Etingof and Xiaoguang Ma, Lecture Notes on Cherednik Algebras (standard reference, not scraped)