Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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 Hv(n) and its bar involution ι from The normalized type-A Hecke algebra and its bar involution and The Hecke bar involution is well defined.

[F1]

The algebra is presented by the quadratic, adjacent braid, and distant commutation relations, with standard basis Hw defined from reduced expressions (The normalized type-A Hecke algebra and its bar involution).

[F2]

The bar is a semilinear ring involution with v‾=v−1 and Hsi‾=Hsi−1=Hsi−(v−1−v) (The Hecke bar involution is well defined).

Statement

The presented normalized Hecke algebra Hv(n) has an involutive A-linear anti-automorphism ♭ defined by ♭(Hsi)=Hsi. It satisfies ♭(Hw)=Hw−1 for every w∈Sn and commutes with the bar involution: ♭∘ι=ι∘♭.

Proof

technique · define reversal on the presentation and compare the two compositions on generators
1.1F1algebra

The reversal map descends. On the free associative A-algebra, fix every coefficient and generator and reverse each word; this defines an A-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 A-linear anti-homomorphism ♭ of Hv(n).

2.1F1step 1.1algebra

It is an involution with the required formula. Reversing twice fixes every word, so ♭2=id and ♭ is an anti-automorphism. If w=si1⋯sik is reduced, then w−1=sik⋯si1 is reduced and ♭(Hw)=Hsik⋯Hsi1=Hw−1. The empty word gives ♭(Hid)=Hid.

3.1F1F2step 1.1step 2.1algebra∎

It commutes with bar. Put λ=v−1−v. On coefficients, ♭(v‾)=♭(v−1)=v−1=♭(v)‾. On a generator, ♭(Hsi‾)=♭(Hsi−λ)=Hsi−λ=Hsi−1=♭(Hsi)‾. 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 Hv(n). 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.

Sources