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
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Tensor Coherence and Algebraic Descent
- Tensor Products of Modules
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
This draft proves the double-affine presentation and polynomial representation for the selected root system , 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 , with weight lattice , root , and independent parameters . The Hecke generators satisfy ; controls the double-affine translations. This symmetric normalization is stated explicitly at every operator formula.
Locally proved construction
- The rank-one root datum and parameter conventions for DAHA fixes the lattice, affine reflections, length-zero symmetry, and finite Laurent forms of the Bernstein quotients.
- The equal-parameter double-affine Hecke algebra of type A1 gives the root-datum DAHA quotient presentation. The rank-one DAHA Bernstein quotients are Laurent polynomials verifies the cross-relation quotients, and Rank-one DAHA affine normal words span proves spanning without asserting independence.
- The rank-one DAHA difference-reflection operators satisfy the presentation checks every quadratic, affine, and lattice relation on . The generic rank-one DAHA polynomial representation is faithful proves faithfulness over with algebraically independent by a local leading-substitution argument; it makes no coefficient-specialization claim.
- The symmetric Macdonald difference operator of type A1 defines the rank-one symmetric difference operator. The A1 Macdonald operator is triangular on Weyl orbit sums proves its triangular action; The symmetric DAHA translation restricts to the A1 Macdonald operator derives it from the DAHA translations and proves the commuting family statement; The symmetric rank-one Macdonald polynomials are DAHA eigenfunctions constructs and uniquely identifies the monic eigenbasis under the exact nonsingularity condition.
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 eigenvalue separation can fail. At q=1 the rank-one Macdonald eigenvalues are not distinct gives the explicit 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
The rank-one root datum and parameter conventions for DAHA
Definition
Work over the rational function field , where and are algebraically independent indeterminates. The rank-one reduced root system is with , weight lattice , coroot lattice , and pairing . Put , so the lattice algebra is ; the finite Weyl reflection is .
Let be the affine degree with , and set . The affine reflections and the length-zero symmetry act on Laurent functions by
Thus , , and the affine denominators are and . The affine Coxeter group generated by is infinite dihedral, with no finite braid relation between these reflections. The extended affine group is , where acts by swapping ; every element has a unique form with an alternating reduced word in and .
For , define the Laurent polynomials by
They are the finite Laurent-polynomial versions of the Bernstein quotients with and . The symmetric Hecke normalization uses the same nonzero parameter at both affine simple roots: . The DAHA parameter is the lattice-translation parameter; it is distinct from the finite Hecke parameter and from the multiplicative type-A normalization .
Remarks
This item selects type for the original design's “selected root system” scope. No specialization of or is part of this definition.
The rank-one DAHA Bernstein quotients are Laurent polynomials
Statement
With the root data and from The rank-one root datum and parameter conventions for DAHA, for every integer ,
as elements of . 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 , the Laurent variable , the actions and , and the finite sums defining .
The rank-one root datum and parameter conventions for DAHA: for , and ; negative indices are defined by the corresponding finite sums there.
Proof
For , multiplying by cancels all intermediate terms and leaves . The negative-index formula is its negative, so it gives ; the case has zero numerator. Hence the first quotient equals for every integer .
For , the geometric identity and give . For , , so division by gives . The zero case is again zero. Thus the second quotient is Laurent for every integer .
Distinct rank-one q-affine substitutions are linearly independent
Statement
Let be the group of substitutions of generated by from The rank-one root datum and parameter conventions for DAHA. If are distinct and satisfy
then every is zero. This holds over because is indeterminate; it is not asserted when distinct translations collapse at a root of unity.
Facts & Assumptions
Given: The field , the Laurent variable , and the substitutions , , and .
The rank-one root datum and parameter conventions for DAHA: the extended affine substitutions act by or for integers , and is an indeterminate.
Proof
Write . Distinct elements of give distinct : if the signs differ, one is a nonzero scalar multiple of and the other of ; if the signs agree, equality would give , hence because is indeterminate. Thus all differences for are nonzero in .
Apply the assumed operator relation to . The resulting linear system for has matrix , whose determinant is the Vandermonde product by step 1.1. The matrix is invertible over , so every .
The equal-parameter double-affine Hecke algebra of type A1
Definition
Use the rank-one root datum, affine actions, field , and Laurent polynomials from The rank-one root datum and parameter conventions for DAHA and The rank-one DAHA Bernstein quotients are Laurent polynomials. Let be the free associative unital -algebra on . Define the equal-parameter double-affine Hecke algebra
where is the two-sided ideal generated by the following relations:
- .
- and (hence also ).
- for .
- For every and ,
where and . 5. .
This is the rank-one root-datum DAHA presentation: are the affine Hecke generators, is the weight-lattice generator, and is the length-zero symmetry. There is no finite braid relation between and because the affine Coxeter label is infinite. The scalar normalization is ; controls translations and is independent of . The quotient is a definition, not a claim about a PBW basis or a faithful polynomial representation.
The fundamental translation is , acting by the -shift ; its DAHA lift is . The quadratic relation makes invertible, with .
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.
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 -linear combination of words
where , , , and adjacent indices in the string are distinct. This is a spanning statement only; no linear independence is asserted here.
Facts & Assumptions
Given: The generator-and-relation algebra , its Bernstein relations, and its length-zero involution.
The equal-parameter double-affine Hecke algebra of type A1: , , , , and for all integers .
Proof
From and one obtains and . Repeatedly use these identities to move every occurrence of in an affine word to the right, and then use to leave at most one . The quadratic relation gives , so induction on affine-word length reduces any word in to a finite linear combination of alternating strings. This proves the asserted form for words containing no letters.
From and , conjugation gives for every integer , hence . In a generator word, move each lattice letter left across by this identity and across by . Use lexicographic induction on (the number of 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 , and ; 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.
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 .
The rank-one DAHA polynomial representation
Definition
The polynomial representation is the action of on specified by sending to multiplication by , to multiplication by , to , and to
with , , , and . 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 ↗.
The generic rank-one DAHA polynomial representation is faithful
Statement
Let with 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 .
Facts & Assumptions
Given: The rank-one DAHA, its polynomial representation, the spanning normal words, and the q-affine substitutions acting on Laurent polynomials.
The rank-one DAHA polynomial representation: act by one affine substitution plus a Laurent-rational multiplication term, and the coefficient of the substitution part is .
Rank-one DAHA affine normal words span: every DAHA element is a finite linear combination of with alternating indices and .
Distinct rank-one q-affine substitutions are linearly independent: distinct affine substitutions are linearly independent as operators on with coefficients in .
The rank-one root datum and parameter conventions for DAHA: the extended affine group is , and each element has a unique form with an alternating reduced word in and .
Proof
Write each as in [F1], with . The rational function is nonzero: its numerator is nonzero because is a nonconstant monomial and . In the expansion of an alternating word , choosing the substitution term from every gives the affine substitution with a nonzero rational coefficient , a product of transforms of the nonzero . Every other term omits at least one reflection and therefore has affine Coxeter length strictly less than . The semidirect-product normal form in [F4] makes the top substitutions for distinct alternating words and distinct.
Suppose a finite linear combination of the spanning words in [F2] acts as zero, and choose the largest affine length among words with a nonzero coefficient. For any fixed top substitution of length , step 1.1 shows that its coefficient in the crossed-product expansion is exactly : shorter words and all lower terms have smaller length. By [F3], the coefficient of each substitution must vanish. Since , the Laurent polynomial is zero, so all its coefficients vanish. Repeating for the finitely many top substitutions of length and then descending in length shows that every coefficient in the original relation is zero.
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.
The symmetric Macdonald difference operator of type A1
Definition
Let be the Weyl-invariant Laurent polynomials. Define the type-A1 symmetric Macdonald difference operator on by
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 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.
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.
The A1 Macdonald operator is triangular on Weyl orbit sums
Statement
Let and for be the A1 Weyl orbit sums. The degree of a nonzero Laurent polynomial is . For every , the operator of The symmetric Macdonald difference operator of type A1 sends to
with coefficients . In particular, preserves the symmetric Laurent-polynomial space.
Facts & Assumptions
Given: The operator on and the rank-one Laurent variable .
The symmetric Macdonald difference operator of type A1: , with and .
Proof
The coefficient identity rewrites the formula as . For , the Laurent polynomial vanishes at and , since and . Multiplying by a power of gives an ordinary polynomial still vanishing at both distinct roots , so divides ; hence is Laurent. Thus is a Laurent polynomial.
One has and . For symmetric , and . Substituting in [F1] therefore gives , so the result is Weyl-invariant.
The coefficients have finite limits at , so has no exponent above . Its coefficient of is , obtained from the leading terms of and . Weyl invariance from step 2.1 gives the same coefficient at . Subtracting leaves a symmetric Laurent polynomial with no exponent of absolute value or greater. Write ; symmetry gives , so . Thus is a linear combination of . When , gives the formula directly.
The symmetric DAHA translation restricts to the A1 Macdonald operator
Statement
Let be the fundamental coweight translation in the polynomial representation of The rank-one DAHA polynomial representation. On the symmetric Laurent polynomials , the restriction of is the operator of The symmetric Macdonald difference operator of type A1. Here Weyl-invariant means fixed by the involution induced by the rank-one finite reflection. Every such Laurent polynomial in restricts to a polynomial in . Thus the symmetric rank-one DAHA translations give a commuting family of difference operators on .
Facts & Assumptions
Given: The rank-one DAHA polynomial representation, the symmetric subspace , and the operator .
The rank-one DAHA polynomial representation: on , , , and .
The equal-parameter double-affine Hecke algebra of type A1: satisfies , and is the lift of the fundamental translation.
The rank-one root datum and parameter conventions for DAHA: , and the finite Weyl reflection sends to , so it negates the rank-one exponent.
Proof
Let . Since , the divided-difference term in [F1] vanishes and . Since is symmetric, . Hence .
Write and , where and . By [F4], , so . For , and , giving . Adding the formula from step 1.1 yields exactly [F2], so .
The -Laurent algebra is commutative because it is generated by the single invertible element . By [F5], the finite reflection negates the rank-one translation exponent, so the involution in the Statement replaces by ; this is an action on translation exponents, not conjugation by . If is invariant, then, since has characteristic zero, . This identity needs no linear independence of the powers of . The elements satisfy , , and by multiplication; induction therefore expresses each as a polynomial in . By [F3] and step 2.1, preserves and restricts to . Thus every invariant restricts to a polynomial in , and these restrictions commute.
The symmetric rank-one Macdonald polynomials are DAHA eigenfunctions
Statement
Assume is not a root of unity, , and for every positive integer . Let and for . The Laurent degree of a nonzero is ; the coefficient of is the monic normalization. For each there is a unique symmetric Laurent polynomial
such that
The polynomials form a -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.
The symmetric Macdonald difference operator of type A1: is the operator with coefficients and acting by - and -shifts.
The symmetric DAHA translation restricts to the A1 Macdonald operator: every symmetric Laurent polynomial in the DAHA translation restricts to the corresponding polynomial in on the symmetric Laurent-polynomial space.
Proof
For distinct , . If , the first factor is nonzero because is not a root of unity. Also , and the second factor is nonzero because . Thus all eigenvalues are pairwise distinct.
Write . Comparing coefficients in gives , so ; uniqueness follows from the linear independence of Laurent monomials. Thus form a basis of the symmetric Laurent polynomials of degree at most . Construct the by induction: set , an eigenvector by [F2], and suppose form a basis of the degree-at-most- subspace. By [F2], write . Set . The coefficient of each in is , so is an eigenvector with leading term .
If another monic eigenvector with leading term existed, write . Then . The are linearly independent by their triangular leading terms, and every is nonzero by step 1.1, so each and . Since is a basis and the change to is triangular with diagonal entries , the form a basis. Finally [F3] makes each symmetric DAHA translation polynomial act as a polynomial in ; for every polynomial , . Thus each is a simultaneous eigenfunction of the full symmetric translation family.
5 · Examples, counterexamples and false statements
None yet.