Reflection traces, word objects and section duality

A simple reflection acts on the coefficient algebra and determines its invariant subalgebra. The reflection trace and its normalization provide Frobenius data: a trace pairing together with the duality maps that make the extension usable in tensor constructions. The actual simple-reflection data are constructed from the extended realization.

Word objects are built by successive tensor induction through these reflection extensions. Their pairing arguments track integral images, support conditions and degree shifts through the word. For reduced words, this produces perfect graded pairings on the corresponding section modules.

The boundary-sheaf pairing is obtained through the word construction and its decomposition data. It then relates full outgoing kernels to dual stalk modules and yields character reciprocity. Those identities supply the endpoints of the Hilbert comparison. The route below follows the trace definition into tensor induction and then into the duality result used by the main proof.

Reading sequence

  1. The fixed subalgebra and reflection data — Define the fixed coefficient subalgebra.
  2. The reflection trace and its normalization — Fix the trace normalization.
  3. Frobenius traces and trace duality — Read the trace-duality interface.
  4. Frobenius data for the simple reflections of the extended realization — Construct the actual reflection data.
  5. Word objects and Bott–Samelson tensor induction — Build the word objects by tensor induction.
  6. Perfect graded pairings on reduced-word sections — Obtain reduced-word section pairings.
  7. Symmetric perfect pairings on the actual boundary sheaf — Transfer the pairing to the boundary sheaf.

Entries for this keyword