Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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 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.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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