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: Examples and Counterexamples

1 · Prerequisites

2 · Summary

These calculations use the A-page type-A1 normalization and test its parameter boundary.

Worked computations

The B items are checks of the A-page formulas; they do not supply general DAHA or Macdonald results.

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

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

The first symmetric A1 Macdonald eigenfunctions

Example

Let m0=1 and m1=z+z−1. The first two monic symmetric rank-one Macdonald eigenfunctions are

P0(z)=1,P1(z)=z+z−1

with eigenvalues t+t−1 and tq+t−1q−1, respectively.

Facts & Assumptions

Given: q∈K× is not a root of unity, t∈K×, t2≠q−N for every positive integer N, and D is the rank-one symmetric Macdonald operator.

[F1]

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

[F2]

The symmetric rank-one Macdonald polynomials are DAHA eigenfunctions: the monic symmetric eigenfunction with leading orbit sum mn is unique when q is not a root of unity and t2≠q−N for every positive integer N.

Verification

1.1F1F2givenalgebra

For f=1, [F1] gives D1=(A+B)1=(t+t−1)1. Since there is no lower orbit sum below m0=1, uniqueness in [F2] yields P0=1.

2.1F1F2algebra∎

Applying [F1] to m1 and collecting over the denominator z2−1 gives Dm1=(tz2−t−1)(qz+q−1z−1)+(t−1z2−t)(q−1z+qz−1)z2−1=(tq+t−1q−1)(z+z−1). The numerator equality follows by expansion: the z terms cancel and the remaining numerator is (tq+t−1q−1)(z3−z−1). Thus m1 is the monic eigenfunction with leading orbit sum m1, and [F2] gives P1=m1.

CounterexampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

At q=1 the rank-one Macdonald eigenvalues are not distinct

Statement refuted

For every pair of nonzero complex parameters q,t, the scalars λn=tqn+t−1q−n are pairwise distinct as n ranges over the nonnegative integers.

Facts & Assumptions

Given: The displayed scalar sequence and the type-A1 difference operator D.

[F1]

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

Counterexample

Take q=1 and any t∈C×. Then both shifts in [F1] are the identity and the two coefficients sum to t+t−1. Given: q=1, t≠0, and m0=1, m1=z+z−1.

1.1F1givenalgebra

The coefficient sum is tz2−t−1+t−1z2−tz2−1=t+t−1, so D=(t+t−1) id on symmetric Laurent polynomials.

2.1step 1.1algebra∎

The distinct polynomials m0,m1 are both eigenvectors with eigenvalue t+t−1; correspondingly λ0=λ1=t+t−1. Thus the claimed pairwise distinction for all nonzero q,t fails at q=1.