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 quantum and Hecke tensor actions commute
Statement
For every and , each adjacent Hecke operator on commutes with the iterated-coproduct action of every from The type-A quantum algebra and its tensor-action formulas. Thus the image of the normalized Hecke algebra is contained in the commutant of the quantum image .
Facts & Assumptions
Given: , the ordered-basis operator , the quantum generator matrices, and the coproduct of The type-A quantum algebra and its tensor-action formulas.
On a pair of labels, fixes a repeated label with coefficient , flips an increasing pair, and sends a decreasing pair to , where (The ordered-basis Hecke operator and its normalization).
Put . On two tensor positions the coproduct operators are and ; their actions are and (The type-A quantum algebra and its tensor-action formulas, The type-A quantum presentation descends to its coproduct tensor action).
The pair operator preserves the multiset of labels, and is the diagonal combination (The ordered-basis Hecke operator and its normalization, The type-A quantum algebra and its tensor-action formulas).
Proof
Given: The data in [F1]–[F3].
For each , acts on by the scalar . Every term in has the same multiset of labels as , so it has the same scalar. Hence ; the inverse commutes as well.
Fix and write for . If the pair contains no , both and vanish by [F2]–[F3]. For the remaining labels, the complete cases are: on both composites give ; on both give ; on both give ; for , the inputs and give respectively and under either composite; for , those same two orientations give respectively and . These cases exhaust every pair containing , including both orientations of each outside label, so . The only coefficient simplification used in the repeated-label case is .
If a pair contains no , both composites with vanish. The remaining complete cases are: on both give ; on both give ; on both give ; for , the inputs and give respectively and under either composite; for , they give respectively and . Thus every pair containing is covered and . The repeated-label coefficients use and .
Coassociativity and the coproduct formulas in [F2] give on positions , , and . For positions , the two summands at those positions restrict there to , and the two summands restrict to ; every earlier summand restricts to or , and every later summand to the identity. Step 1.1 handles these Cartan factors and steps 1.2–1.3 handle the two-site sums; therefore commutes with each iterated quantum generator. Commuting with the generators implies commuting with their products and linear combinations, which proves .
Depends on
Used by
Dependency tree · two levels
12 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
- Richard Dipper, Stephen Doty and Friederike Stoll, Quantized mixed tensor space and Schur–Weyl duality (standard reference, not scraped)