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
- 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
- Double-Affine Hecke Algebras and Macdonald Theory
- 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
These calculations use the A-page type- normalization and test its parameter boundary.
Worked computations
- The first symmetric A1 Macdonald eigenfunctions verifies and directly from the difference operator and its eigenvalue theorem.
- At q=1 the rank-one Macdonald eigenvalues are not distinct shows that collapses the operator to a scalar and destroys pairwise eigenvalue separation.
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
The first symmetric A1 Macdonald eigenfunctions
Example
Let and . The first two monic symmetric rank-one Macdonald eigenfunctions are
with eigenvalues and , respectively.
Facts & Assumptions
Given: is not a root of unity, , for every positive integer , and is the rank-one symmetric Macdonald operator.
The symmetric rank-one Macdonald polynomials are DAHA eigenfunctions: the monic symmetric eigenfunction with leading orbit sum is unique when is not a root of unity and for every positive integer .
Verification
For , [F1] gives . Since there is no lower orbit sum below , uniqueness in [F2] yields .
Applying [F1] to and collecting over the denominator gives . The numerator equality follows by expansion: the terms cancel and the remaining numerator is . Thus is the monic eigenfunction with leading orbit sum , and [F2] gives .
At q=1 the rank-one Macdonald eigenvalues are not distinct
Statement refuted
For every pair of nonzero complex parameters , the scalars are pairwise distinct as ranges over the nonnegative integers.
Facts & Assumptions
Given: The displayed scalar sequence and the type-A1 difference operator .
Counterexample
Take and any . Then both shifts in [F1] are the identity and the two coefficients sum to . Given: , , and , .
The coefficient sum is , so on symmetric Laurent polynomials.
The distinct polynomials are both eigenvectors with eigenvalue ; correspondingly . Thus the claimed pairwise distinction for all nonzero fails at .