Theorem Cyclicity of the right action and reduced-word independence
✓ theorem proved

Cyclicity of the right action and reduced-word independence

In either Hecke convention, a reduced word \(\omega\) with product \(w\) satisfies \[ L_\omega e_1=e_w,\qquad D_\omega e_1=e_{w^{-1}}. \] If two linear operators commute with every right simple operator and agree on \(e_1\), they agree everywhere. Consequently two reduced words for the same \(w\) define the same left operator.

Relation to the OpenAI notes

Algebraic construction behind the polynomial conventions.

OpenAI notes: The conventions specify the ordinary R descent recurrence. The reflection-order path theorem introduces the normalized family through path counting and states its square-parameter relation to ordinary R. sec:introduction, bg:paths.

Lean (primary): The regular operators are built from Coxeter length. Left/right commutation and the cyclic identity vector prove reduced-word independence. Inverse operators define R-values; their recurrence proves polynomiality, and a second matching-recurrence argument proves signed parameter reciprocity. Hecke:705, Hecke:1000, OrdinaryR:31, Dihedral:440.

Role in the proof: The KB develops these algebraic constructions before the geometric path formula. The recurrence and inverse-parameter coefficient identities used by the character argument follow from the constructed operators.

Proof

Step 1. Evaluate a reduced left word

Induct on the number of letters. The empty word acts as the identity and has product \(1\).

Write a nonempty reduced word as \(s\omega\), with tail product \(u\). The tail is reduced, and reducedness of the whole word gives \(\ell(su)=\ell(u)+1\). By induction, \(L_\omega e_1=e_u\). The ascent branch in either convention gives \[ L_{s\omega}e_1=L_s e_u=e_{su}. \]

Step 2. Evaluate the right word

Use the same induction. The tail gives \(D_\omega e_1=e_{u^{-1}}\). Inversion preserves length, so \[ \ell(u^{-1}s)=\ell(su)=\ell(u)+1=\ell(u^{-1})+1. \] The right operation is therefore an ascent: \[ D_{s\omega}e_1=D_s e_{u^{-1}}=e_{u^{-1}s}=e_{(su)^{-1}}. \]

Every \(w\) is reached from \(e_1\) by choosing a reduced word for \(w^{-1}\) and applying its right word. This is the cyclicity of the right action: the orbit operations applied to one vector span the module.

Step 3. Determine commuting maps from the cyclic vector

Let \(F,G\) commute with all \(D_t\), and suppose \(F(e_1)=G(e_1)\). Commuting past each letter makes them commute with every \(D_\omega\).

For a reduced word \(\omega\) of \(w^{-1}\), Step 2 gives \[ F(e_w)=F(D_\omega e_1) =D_\omega F(e_1) =D_\omega G(e_1) =G(D_\omega e_1)=G(e_w). \] Thus the maps agree on the basis, hence everywhere.

Step 4. Compare reduced left words

Every \(L_s\) commutes with every \(D_t\). Moving \(D_t\) past a product one factor at a time shows that each \(L_\omega\) also commutes with it.

If \(\omega,\eta\) are reduced with the same product \(w\), Step 1 gives \(L_\omega e_1=e_w=L_\eta e_1\). Step 3 now yields \(L_\omega=L_\eta\). Since both are units in the inverse-operator setting, their inverses agree as well.

Step 5. Recover the standard ascent identities

When \(\ell(sw)=\ell(w)+1\), prepend \(s\) to any reduced word for \(w\). The resulting word is reduced for \(sw\), so word independence gives \(U_{sw}=L_sU_w\).

Appending \(s\) in a right ascent gives \(U_{ws}=U_wL_s\). The empty word gives \(U_1=I\), and Step 1 gives \(U_we_1=e_w\).

In a rank-two system, alternating reduced expressions of a common element therefore yield equal alternating operator products. This is the braid relation as a consequence of the regular action construction.

References

The local source declarations below give the construction and proof.

Lean formalization

OAI.KLInvariance.Hecke.leftWord_one: Hecke.lean:139.

OAI.KLInvariance.Hecke.rightWord_one: Hecke.lean:161.

OAI.KLInvariance.Hecke.commuting_ext: Hecke.lean:191.

OAI.KLInvariance.Hecke.leftWord_independent: Hecke.lean:218.

OAI.KLInvariance.Hecke.standardUnit_word: Hecke.lean:256.

OAI.KLInvariance.Hecke.standardUnit_simple_mul: Hecke.lean:272.

OAI.KLInvariance.Hecke.standardUnit_mul_simple: Hecke.lean:286.

OAI.KLInvariance.HeckeQ.leftWord_one: Hecke.lean:626.

OAI.KLInvariance.HeckeQ.rightWord_one: Hecke.lean:648.

OAI.KLInvariance.HeckeQ.commuting_ext: Hecke.lean:678.

OAI.KLInvariance.HeckeQ.leftWord_independent: Hecke.lean:705.

OAI.KLInvariance.HeckeQ.standardUnit_word: Hecke.lean:743.

OAI.KLInvariance.HeckeQ.standardUnit_simple_mul: Hecke.lean:759.

OAI.KLInvariance.HeckeQ.standardUnit_mul_simple: Hecke.lean:773.

Used by