Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 ordered-basis operator is a Hecke symmetry

Statement

For every N≥1, the operator T of The ordered-basis Hecke operator and its normalization is invertible, satisfies (T−qI)(T+q−1I)=0, and satisfies the adjacent braid identity T1T2T1=T2T1T2 on VN⊗3. Its inverse is T−1=T−cI, where c=q−q−1. If S=qT and Q=q2, then (S−QI)(S+I)=0 and S1S2S1=S2S1S2. At q=1, T specializes to the ordinary flip; at q=−1 its quadratic relation specializes to T2=I, but the operator itself is not the ordinary flip.

Facts & Assumptions

Given: F=Q(q), the ordered basis e1<⋯<eN, the operator T and c=q−q−1 from The ordered-basis Hecke operator and its normalization.

[F1]

The formula for T on each ordered basis pair is the three-case formula in The ordered-basis Hecke operator and its normalization.

[F2]

The elementary tensors ea⊗eb and ea⊗eb⊗ed form bases of the corresponding finite tensor powers, so equality on these vectors proves equality of linear maps (Scalars, tensor powers, the empty tensor, opposite algebras and finite sums, The elementary tensors of two bases form the product basis of the tensor product).

Proof

Given: The data in [F1]–[F2].

1.1givenF1F2algebra

For a<b, the span of ea⊗eb,eb⊗ea is T-invariant and, in that ordered basis, T has matrix (011c); hence T2=cT+I there. On ea⊗ea one has T=qI and q2=cq+1. These subspaces partition the basis of VN⊗VN, so T2−cT−I=0 on the whole space. Since T(T−cI)=(T−cI)T=I, it is invertible with inverse T−cI, and T2−cT−I=(T−qI)(T+q−1I) by expansion.

1.2givenF1F2algebra

Write abc for ea⊗eb⊗ec. For distinct letters assume a<b<c, and for two letters assume a<b. Applying the three-case rule [F1] gives the same value for T1T2T1 and T2T1T2 in all thirteen weak-order patterns: aaa↦q3aaa; aab↦qbaa; aba↦qaba+qc baa; baa↦qaab+qc aba+q2c baa; abb↦qbba; bab↦qbab+qc bba; bba↦qabb+qc bab+q2c bba; abc↦cba; acb↦bca+c cba; bac↦cab+c cba; bca↦acb+c bca+c cab+c2cba; cab↦bac+c bca+c cab+c2cba; and cba↦abc+c acb+c bac+c2bca+c2cab+(c+c3)cba. The first seven entries cover one or two distinct labels, and the last six cover all orders of three distinct labels. Thus the two braid composites agree on the tensor basis [F2] and hence on the whole tensor cube.

2.1step 1.1step 1.2algebra∎

The normalized quadratic relation in step 1.1 gives (qT−q2I)(qT+I)=q2(T−qI)(T+q−1I)=0; multiplying the braid identity of step 1.2 by q3 on both sides gives the braid identity for S=qT. At q=1, c=0 and each branch of the formula is the flip, including the equal-label branch. At q=−1, c=0 and the quadratic relation is T2=I, while T(ea⊗ea)=−ea⊗ea, so it is not the ordinary flip.

Depends on

Used by

Cited to discharge well-definedness by The ordered-basis Hecke operator and its normalization.

Dependency tree · two levels

15 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