Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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 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.

Depends on

Used by

Nothing in the library uses this result yet.

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.