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.
Reversal anti-involution commutes with the Hecke bar
Facts & Assumptions
Given: The presented normalized Hecke algebra and its bar involution from The normalized type-A Hecke algebra and its bar involution and The Hecke bar involution is well defined.
The algebra is presented by the quadratic, adjacent braid, and distant commutation relations, with standard basis defined from reduced expressions (The normalized type-A Hecke algebra and its bar involution).
The bar is a semilinear ring involution with and (The Hecke bar involution is well defined).
Statement
The presented normalized Hecke algebra has an involutive -linear anti-automorphism defined by . It satisfies for every and commutes with the bar involution: .
Proof
The reversal map descends. On the free associative -algebra, fix every coefficient and generator and reverse each word; this defines an -linear anti-homomorphism. It sends each quadratic relator to itself, each adjacent braid relator to itself because both sides are palindromes, and each distant commutation relator to its negative. Hence it preserves the defining ideal and descends to an -linear anti-homomorphism of .
It is an involution with the required formula. Reversing twice fixes every word, so and is an anti-automorphism. If is reduced, then is reduced and . The empty word gives .
It commutes with bar. Put . On coefficients, . On a generator, . Both composites of and bar are semilinear anti-homomorphisms, so agreement on coefficients and generators from the presentation proves that and bar commute on all of . No choice principle is used.
Depends on
Used by
Dependency tree · two levels
6 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.