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 difference-reflection operators satisfy the presentation
Statement
Let . Define operators on by
Then , , , and satisfy every defining relation of The equal-parameter double-affine Hecke algebra of type A1. Consequently they define a unital representation of on .
Facts & Assumptions
Given: , the rank-one substitutions and Bernstein polynomials, and the DAHA quotient presentation.
The rank-one root datum and parameter conventions for DAHA: , , , and , .
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 .
The rank-one DAHA Bernstein quotients are Laurent polynomials: for both affine simple roots and every integer .
The free associative R-algebra on a set and descent of relations: an assignment of the free generators to an associative -algebra that kills all defining relators descends uniquely to a homomorphism from the presented quotient.
The rank-one DAHA polynomial representation: the candidate generator assignment sends to , to , to the stated substitution, and to the displayed difference-reflection operators; the relation checks below establish that it is an algebra action.
Proof
Multiplication by and are inverse operators, so the Laurent-inverse relator holds. Direct substitution gives and , which is the relation. It also gives and ; since both Hecke formulas use the same , conjugating the formula for yields .
Put , , and . Since , one has , , and . Multiplication in the crossed-product operator algebra gives and , so , equivalent to .
For multiplication by a Laurent polynomial, direct expansion of gives multiplication by . With , [F3] identifies this Laurent polynomial with , which is exactly each Bernstein relation in [F2]. The finite-sum formulas in [F3] also show that preserves .
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 -algebra homomorphism .
Depends on
Used by
Nothing in the library uses this result yet.
Cited to discharge well-definedness by The rank-one DAHA polynomial representation.
Dependency tree · two levels
27 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)
- Pavel Etingof and Xiaoguang Ma, Lecture Notes on Cherednik Algebras (standard reference, not scraped)