Alphabeta Math
Pipeline-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.

Double-Affine Hecke Algebras and Macdonald Theory

1 · Prerequisites

2 · Summary

This draft proves the double-affine presentation and polynomial representation for the selected root system A1, including generic faithfulness and the symmetric Macdonald eigenbasis. It fixes the independent translation and Hecke parameters and records the specialization boundary.

Selected root system and conventions

The local construction uses the reduced root system A1, with weight lattice P=Zρ, root α=2ρ, and independent parameters q,t. The Hecke generators satisfy (Ti−t)(Ti+t−1)=0; q controls the double-affine translations. This symmetric normalization is stated explicitly at every operator formula.

Locally proved construction

Boundaries and open interfaces

The representation and eigenbasis claims use the parameter ranges stated in their items. At roots of unity the q-affine substitutions can coincide; at t2=q−N eigenvalue separation can fail. At q=1 the rank-one Macdonald eigenvalues are not distinct gives the explicit q=1 boundary.

The A-page prerequisite affine-hecke-algebras-beyond-type-a is a reading route. Its current draft proves general-root-datum affine Bernstein PBW under its stated positive-parameter hypotheses. The published Bernstein PBW basis for the affine Hecke algebra of type A remains type A affine only. Neither affine result supplies DAHA generators, a DAHA PBW theorem, or a Macdonald eigenfunction proof; this batch proves its selected A1 results locally and uses neither affine theorem as a logical premise.

Skein and physical knot interfaces require separate DAHA maps preserves the skein/DAHA and physical-knot interface claims. A specific skein algebra map, knot parameter correspondence, or physical operator model remains a separate proof obligation.

Companion: double-affine-hecke-algebras-and-macdonald-theory-examples.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The rank-one root datum and parameter conventions for DAHA

Definition

Work over the rational function field K=Q(q,t), where q and t are algebraically independent indeterminates. The rank-one reduced root system is Φ={±α} with α=2ρ, weight lattice P=Zρ, coroot lattice Q∨=Zα∨, and pairing ⟨ρ,α∨⟩=1. Put z=Xρ, so the lattice algebra is K[z,z−1]; the finite Weyl reflection is s1(z)=z−1.

Let δ be the affine degree with zδ=q−2, and set α0=−2ρ+δ. The affine reflections and the length-zero symmetry act on Laurent functions by

s0f(z)=f(q−2z−1),s1f(z)=f(z−1),πf(z)=f(q−1z−1).

Thus s02=s12=π2=1, πs0π=s1, and the affine denominators are u0=z−α0=q2z2 and u1=z−α1=z−2. The affine Coxeter group generated by s0,s1 is infinite dihedral, with no finite braid relation between these reflections. The extended affine group is Waff⋊Ω, where Ω={1,π} acts by swapping s0,s1; every element has a unique form wπϵ with w an alternating reduced word in s0,s1 and ϵ∈{0,1}.

For m∈Z, define the Laurent polynomials B1,m,B0,m by

B1,0=B0,0=0,B1,m=∑j=0m−1zm−2j (m>0),B1,−m=−B1,m (m>0), B0,m=−∑j=0m−1q−2j−2zm−2−2j (m>0),B0,−m=∑j=0m−1q2jz−m+2j (m>0).

They are the finite Laurent-polynomial versions of the Bernstein quotients with s1(zm)=z−m and s0(zm)=q−2mz−m. The symmetric Hecke normalization uses the same nonzero parameter t at both affine simple roots: (Ti−t)(Ti+t−1)=0. The DAHA parameter q is the lattice-translation parameter; it is distinct from the finite Hecke parameter t and from the multiplicative type-A normalization Q.

Remarks

This item selects type A1 for the original design's “selected root system” scope. No specialization of q or t is part of this definition.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The rank-one DAHA Bernstein quotients are Laurent polynomials

Statement

With the root data and Bi,m from The rank-one root datum and parameter conventions for DAHA, for every integer m,

B1,m=zm−z−m1−z−2,B0,m=zm−q−2mz−m1−q2z2

as elements of K[z,z−1]. In particular, the rank-one Bernstein cross-relations use actual Laurent polynomials and require no localization of the coefficient algebra.

Facts & Assumptions

Given: The field K=Q(q,t), the Laurent variable z, the actions s0(zm)=q−2mz−m and s1(zm)=z−m, and the finite sums defining Bi,m.

[F1]

The rank-one root datum and parameter conventions for DAHA: for m>0, B1,m=∑j=0m−1zm−2j and B0,m=−∑j=0m−1q−2j−2zm−2−2j; negative indices are defined by the corresponding finite sums there.

Proof

1.1F1givenalgebra

For m>0, multiplying ∑j=0m−1zm−2j by 1−z−2 cancels all intermediate terms and leaves zm−z−m. The negative-index formula is its negative, so it gives (z−m−zm)/(1−z−2); the case m=0 has zero numerator. Hence the first quotient equals B1,m for every integer m.

2.1F1givenalgebra∎

For m>0, the geometric identity z2m−q−2m=(z2−q−2)∑j=0m−1z2(m−1−j)q−2j and 1−q2z2=−q2(z2−q−2) give zm−q−2mz−m1−q2z2=−∑j=0m−1q−2j−2zm−2−2j=B0,m. For m=−r<0, z−r−q2rzr=z−r(1−(q2z2)r), so division by 1−q2z2 gives ∑j=0r−1q2jz−r+2j=B0,−r. The zero case is again zero. Thus the second quotient is Laurent for every integer m.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Distinct rank-one q-affine substitutions are linearly independent

Statement

Let G be the group of substitutions of K[z,z−1] generated by s0,s1,π from The rank-one root datum and parameter conventions for DAHA. If g1,…,gN∈G are distinct and f1,…,fN∈K(z) satisfy

∑j=1Nfj(z) gj(h)(z)=0for every h∈K[z,z−1],

then every fj is zero. This holds over K=Q(q,t) because q is indeterminate; it is not asserted when distinct translations collapse at a root of unity.

Facts & Assumptions

Given: The field K=Q(q,t), the Laurent variable z, and the substitutions s0(z)=q−2z−1, s1(z)=z−1, and π(z)=q−1z−1.

[F1]

The rank-one root datum and parameter conventions for DAHA: the extended affine substitutions act by z↦qrz or z↦qrz−1 for integers r, and q is an indeterminate.

Proof

1.1F1givenalgebra

Write γj=gj(z)∈K(z). Distinct elements of G give distinct γj: if the signs differ, one is a nonzero scalar multiple of z and the other of z−1; if the signs agree, equality would give qr=qs, hence r=s because q is indeterminate. Thus all differences γj−γi for i≠j are nonzero in K(z).

2.1step 1.1algebra∎

Apply the assumed operator relation to h=1,z,…,zN−1. The resulting linear system for (fj) has matrix (γjk)0≤k<N,1≤j≤N, whose determinant is the Vandermonde product ∏i<j(γj−γi)≠0 by step 1.1. The matrix is invertible over K(z), so every fj=0.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The equal-parameter double-affine Hecke algebra of type A1

Definition

Use the rank-one root datum, affine actions, field K, and Laurent polynomials Bi,m from The rank-one root datum and parameter conventions for DAHA and The rank-one DAHA Bernstein quotients are Laurent polynomials. Let F be the free associative unital K-algebra on Z,Z−1,T0,T1,π. Define the equal-parameter double-affine Hecke algebra

Hq,t(A1)=F/I

where I is the two-sided ideal generated by the following relations:

  1. ZZ−1=Z−1Z=1.
  2. π2=1 and πT0π=T1 (hence also πT1π=T0).
  3. (Ti−t)(Ti+t−1)=0 for i=0,1.
  4. For every m∈Z and i∈{0,1},
TiZm−si(Zm)Ti=(t−t−1)Bi,m(Z),

where s1(Zm)=Z−m and s0(Zm)=q−2mZ−m. 5. πZπ=q−1Z−1.

This is the rank-one root-datum DAHA presentation: T0,T1 are the affine Hecke generators, Z is the weight-lattice generator, and π is the length-zero symmetry. There is no finite braid relation between T0 and T1 because the affine A1 Coxeter label is infinite. The scalar normalization is (Ti−t)(Ti+t−1)=0; q controls translations and is independent of t. The quotient is a definition, not a claim about a PBW basis or a faithful polynomial representation.

The fundamental translation is y=πs1, acting by the q-shift z↦qz; its DAHA lift is Y=πT1. The quadratic relation makes T1 invertible, with T1−1=T1−(t−t−1).

Remarks

The existence of the free algebra quotient uses the standard universal property of generators and two-sided relations in The free associative R-algebra on a set and descent of relations. The local proof of polynomial representation faithfulness is separate.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Rank-one DAHA affine normal words span

Statement

In the algebra of The equal-parameter double-affine Hecke algebra of type A1, every element is a finite K-linear combination of words

ZmTi1⋯Tirπϵ,

where m∈Z, ϵ∈{0,1}, r≥0, and adjacent indices in the string i1,…,ir∈{0,1} are distinct. This is a spanning statement only; no linear independence is asserted here.

Facts & Assumptions

Given: The generator-and-relation algebra Hq,t(A1), its Bernstein relations, and its length-zero involution.

[F1]

The equal-parameter double-affine Hecke algebra of type A1: π2=1, πT0π=T1, (Ti−t)(Ti+t−1)=0, πZπ=q−1Z−1, and TiZm−si(Zm)Ti=(t−t−1)Bi,m(Z) for all integers m.

Proof

1.1F1givenalgebra

From π2=1 and πT0π=T1 one obtains πT0=T1π and πT1=T0π. Repeatedly use these identities to move every occurrence of π in an affine word to the right, and then use π2=1 to leave at most one π. The quadratic relation gives Ti2=(t−t−1)Ti+1, so induction on affine-word length reduces any word in T0,T1 to a finite linear combination of alternating strings. This proves the asserted form for words containing no Z letters.

2.1F1step 1.1algebra∎

From π2=1 and πZπ=q−1Z−1, conjugation gives πZmπ=q−mZ−m for every integer m, hence πZm=q−mZ−mπ. In a generator word, move each lattice letter left across π by this identity and across Ti by TiZm=si(Zm)Ti+(t−t−1)Bi,m(Z). Use lexicographic induction on (the number of T0,T1 letters, the number of out-of-order lattice/reflection pairs): a main term decreases the second coordinate, while a correction term is a finite Laurent sum with one fewer Hecke letter and decreases the first. After all lattice letters are on the left, move every π right using πT0=T1π, πT1=T0π and π2=1; each move decreases the number of π-before-Hecke pairs. Finally apply step 1.1 to reduce the remaining Hecke words to alternating strings. The process terminates and gives the asserted spanning form.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The rank-one DAHA difference-reflection operators satisfy the presentation

Statement

Let P=K[z,z−1]. Define operators on P by

(Πf)(z)=f(q−1z−1),(σ1f)(z)=f(z−1),(σ0f)(z)=f(q−2z−1), (Tif)(z)=t(σif)(z)+(t−t−1)(σif)(z)−f(z)ui(z)−1,u1(z)=z−2,u0(z)=q2z2.

Then Z↦Mz, Z−1↦Mz−1, π↦Π, and Ti↦Ti satisfy every defining relation of The equal-parameter double-affine Hecke algebra of type A1. Consequently they define a unital representation of Hq,t(A1) on P.

Facts & Assumptions

Given: K=Q(q,t), the rank-one substitutions and Bernstein polynomials, and the DAHA quotient presentation.

[F1]

The rank-one root datum and parameter conventions for DAHA: s1(zm)=z−m, s0(zm)=q−2mz−m, π(zm)=q−mz−m, and u1=z−2, u0=q2z2.

[F2]

The equal-parameter double-affine Hecke algebra of type A1: the required relations are the Laurent inverse, the π-relations, the quadratic relations, and the Bernstein cross-relations for all m∈Z.

[F3]

The rank-one DAHA Bernstein quotients are Laurent polynomials: (zm−si(zm))/(1−ui(z))=Bi,m(z)∈K[z,z−1] for both affine simple roots and every integer m.

[F4]

The free associative R-algebra on a set and descent of relations: an assignment of the free generators to an associative K-algebra that kills all defining relators descends uniquely to a homomorphism from the presented quotient.

[F5]

The rank-one DAHA polynomial representation: the candidate generator assignment sends Z to Mz, Z−1 to Mz−1, π to the stated substitution, and Ti to the displayed difference-reflection operators; the relation checks below establish that it is an algebra action.

Proof

1.1F1F2givenalgebra

Multiplication by z and z−1 are inverse operators, so the Laurent-inverse relator holds. Direct substitution gives Π2=1 and ΠMzΠ=Mq−1z−1, which is the πZπ relation. It also gives Πσ0Π=σ1 and ΠMu0Π=Mu1; since both Hecke formulas use the same t, conjugating the formula for T0 yields ΠT0Π=T1.

1.2F1F2algebra

Put c=t−t−1, ai=(tui−t−1)/(ui−1), and bi=−c/(ui−1). Since σi(ui)=ui−1, one has Ti=aiσi+bi, σi(ai)=(t−1ui−t)/(ui−1), and σi(bi)=cui/(ui−1). Multiplication in the crossed-product operator algebra gives aiσi(bi)+biai=cai and aiσi(ai)+bi2=1+cbi, so Ti2=cTi+1, equivalent to (Ti−t)(Ti+t−1)=0.

1.3F2F3algebra

For multiplication Mf by a Laurent polynomial, direct expansion of TiMf−Msi(f)Ti gives multiplication by c(f−si(f))/(1−ui). With f=zm, [F3] identifies this Laurent polynomial with cBi,m, which is exactly each Bernstein relation in [F2]. The finite-sum formulas in [F3] also show that Ti preserves P.

2.1step 1.1step 1.2step 1.3F2F4F5algebra∎

The assignments in [F5], checked in steps 1.1, 1.2, and 1.3, satisfy all relators of the free-algebra quotient. By [F4] they descend to a unital K-algebra homomorphism Hq,t(A1)→End⁡K(P).

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The rank-one DAHA polynomial representation

Definition

The polynomial representation is the action of Hq,t(A1) on P=K[z,z−1] specified by sending Z to multiplication by z, Z−1 to multiplication by z−1, π to f(z)↦f(q−1z−1), and Ti to

(Tif)(z)=tf(siz)+(t−t−1)f(siz)−f(z)z−αi−1,i=0,1,

with s1z=z−1, s0z=q−2z−1, z−α1=z−2, and z−α0=q2z2. The quotient is interpreted by the finite Laurent sums in The rank-one DAHA Bernstein quotients are Laurent polynomials. Well-definedness as an algebra action is proved in The rank-one DAHA difference-reflection operators satisfy the presentation ↗.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The generic rank-one DAHA polynomial representation is faithful

Statement

Let K=Q(q,t) with q,t algebraically independent. The polynomial representation of The equal-parameter double-affine Hecke algebra of type A1 from The rank-one DAHA polynomial representation is faithful over this formal parameter field. This item makes no coefficient-specialization claim; in particular, it does not claim faithfulness at root-of-unity q.

Facts & Assumptions

Given: The rank-one DAHA, its polynomial representation, the spanning normal words, and the q-affine substitutions acting on Laurent polynomials.

[F1]

The rank-one DAHA polynomial representation: π,T0,T1 act by one affine substitution plus a Laurent-rational multiplication term, and the coefficient of the substitution part is ai(z)=(tui(z)−t−1)/(ui(z)−1).

[F2]

Rank-one DAHA affine normal words span: every DAHA element is a finite linear combination of ZmTi1⋯Tirπϵ with alternating indices and ϵ∈{0,1}.

[F3]

Distinct rank-one q-affine substitutions are linearly independent: distinct affine substitutions z↦qaz±1 are linearly independent as operators on K[z,z−1] with coefficients in K(z).

[F4]

The rank-one root datum and parameter conventions for DAHA: the extended affine group is Waff⋊Ω, and each element has a unique form wπϵ with w an alternating reduced word in s0,s1 and ϵ∈{0,1}.

Proof

1.1F1F2F4givenalgebra

Write each Ti=aiσi+bi as in [F1], with bi(z)∈K(z). The rational function ai(z) is nonzero: its numerator tui(z)−t−1 is nonzero because ui is a nonconstant monomial and t≠0. In the expansion of an alternating word Ti1⋯Tirπϵ, choosing the substitution term aijσij from every Tij gives the affine substitution g=si1⋯sirπϵ with a nonzero rational coefficient γg(z), a product of transforms of the nonzero aij. Every other term omits at least one reflection and therefore has affine Coxeter length strictly less than r. The semidirect-product normal form in [F4] makes the top substitutions for distinct alternating words and πϵ distinct.

2.1F2F3step 1.1algebra

Suppose a finite linear combination of the spanning words in [F2] acts as zero, and choose the largest affine length r among words with a nonzero coefficient. For any fixed top substitution g of length r, step 1.1 shows that its coefficient in the crossed-product expansion is exactly γg(z)∑mcmzm: shorter words and all lower terms have smaller length. By [F3], the coefficient of each substitution must vanish. Since γg≠0, the Laurent polynomial ∑mcmzm is zero, so all its coefficients vanish. Repeating for the finitely many top substitutions of length r and then descending in length shows that every coefficient in the original relation is zero.

3.1F2step 2.1algebra∎

The spanning family in [F2] has linearly independent images by step 2.1. Every element of the representation kernel is a finite linear combination of that spanning family, so it is zero. Thus the representation is injective and hence faithful.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The symmetric Macdonald difference operator of type A1

Definition

Let V={f∈K[z,z−1]:f(z)=f(z−1)} be the Weyl-invariant Laurent polynomials. Define the type-A1 symmetric Macdonald difference operator on V by

(Df)(z)=tz2−t−1z2−1f(qz)+t−1z2−tz2−1f(q−1z).

The formula is interpreted as the sum of the two rational terms; The A1 Macdonald operator is triangular on Weyl orbit sums ↗ proves that for every f∈V the sum is a Weyl-invariant Laurent polynomial.

Remarks

The symmetric DAHA translation restricts to the A1 Macdonald operator identifies this operator as the restriction of the symmetric DAHA translation operator.

RemarkRemark: Literature-sourcedProof: Not applicableOpen item page →

Skein and physical knot interfaces require separate DAHA maps

Remark

This page proves the type-A1 DAHA presentation and its polynomial representation, but it proves no homomorphism from a specified skein algebra into DAHA, no knot invariant parameter map, and no physical knot-model operator theorem. A future interface claim must name the source algebra, coefficient and parameter map, generator images, representation space or completion, and verify every defining relation. A physical application also needs its state space, operators, boundary conditions, and model hypotheses. The type-A affine Bernstein PBW theorem and this polynomial representation do not supply those data.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The symmetric DAHA translation restricts to the A1 Macdonald operator

Statement

Let Y=πT1 be the fundamental coweight translation in the polynomial representation of The rank-one DAHA polynomial representation. On the symmetric Laurent polynomials V, the restriction of Y+Y−1 is the operator D of The symmetric Macdonald difference operator of type A1. Here Weyl-invariant means fixed by the involution Y↦Y−1 induced by the rank-one finite reflection. Every such Laurent polynomial in Y restricts to a polynomial in D. Thus the symmetric rank-one DAHA translations give a commuting family of difference operators on V.

Facts & Assumptions

Given: The rank-one DAHA polynomial representation, the symmetric subspace V, and the operator D.

[F1]

The rank-one DAHA polynomial representation: on P=K[z,z−1], Y=πT1, πf(z)=f(q−1z−1), and T1=tσ1+(t−t−1)(σ1−1)/(z−2−1).

[F2]

The symmetric Macdonald difference operator of type A1: Df=(tz2−t−1)(z2−1)−1f(qz)+(t−1z2−t)(z2−1)−1f(q−1z) on V.

[F4]

The equal-parameter double-affine Hecke algebra of type A1: T1 satisfies (T1−t)(T1+t−1)=0, and Y=πT1 is the lift of the fundamental translation.

[F5]

The rank-one root datum and parameter conventions for DAHA: z=Xρ, and the finite Weyl reflection sends z to z−1, so it negates the rank-one exponent.

Proof

1.1F1givenalgebra

Let f∈V. Since σ1f=f, the divided-difference term in [F1] vanishes and T1f=tf. Since f is symmetric, (πf)(z)=f(q−1z−1)=f(qz). Hence (Yf)(z)=tf(qz).

2.1F1F2F4step 1.1algebra

Write c=t−t−1 and T1=a(z)σ1+b(z), where a(z)=(t−1z2−t)/(z2−1) and b(z)=cz2/(z2−1). By [F4], T1−1=T1−c, so Y−1=T1−1π. For f∈V, σ1πf(z)=f(q−1z) and πf(z)=f(qz), giving (Y−1f)(z)=t−1z2−tz2−1f(q−1z)+cz2−1f(qz). Adding the formula from step 1.1 yields exactly [F2], so (Y+Y−1)∣V=D.

3.1F1F3F4F5step 2.1algebra∎

The Y-Laurent algebra is commutative because it is generated by the single invertible element Y. By [F5], the finite reflection negates the rank-one translation exponent, so the involution in the Statement replaces Y by Y−1; this is an action on translation exponents, not conjugation by T1. If p(Y)=∑k=−NNakYk is invariant, then, since K has characteristic zero, p(Y)=12(p(Y)+p(Y−1))=a0+∑k=1Nak+a−k2(Yk+Y−k). This identity needs no linear independence of the powers of Y. The elements Sn=Yn+Y−n satisfy S0=2, S1=Y+Y−1, and Sn+1=(Y+Y−1)Sn−Sn−1 by multiplication; induction therefore expresses each Sn as a polynomial in Y+Y−1. By [F3] and step 2.1, Y+Y−1 preserves V and restricts to D. Thus every invariant p(Y) restricts to a polynomial in D, and these restrictions commute.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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.

5 · Examples, counterexamples and false statements

None yet.

Sources