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 and for be the A1 Weyl orbit sums. The degree of a nonzero Laurent polynomial is . For every , the operator of The symmetric Macdonald difference operator of type A1 sends to
with coefficients . In particular, preserves the symmetric Laurent-polynomial space.
Facts & Assumptions
Given: The operator on and the rank-one Laurent variable .
The symmetric Macdonald difference operator of type A1: , with and .
Proof
The coefficient identity rewrites the formula as . For , the Laurent polynomial vanishes at and , since and . Multiplying by a power of gives an ordinary polynomial still vanishing at both distinct roots , so divides ; hence is Laurent. Thus is a Laurent polynomial.
One has and . For symmetric , and . Substituting in [F1] therefore gives , so the result is Weyl-invariant.
The coefficients have finite limits at , so has no exponent above . Its coefficient of is , obtained from the leading terms of and . Weyl invariance from step 2.1 gives the same coefficient at . Subtracting leaves a symmetric Laurent polynomial with no exponent of absolute value or greater. Write ; symmetry gives , so . Thus is a linear combination of . When , gives the formula directly.
Depends on
Used by
- The symmetric DAHA translation restricts to the A1 Macdonald operator Lemma
- The symmetric rank-one Macdonald polynomials are DAHA eigenfunctions Theorem
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
- 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)