Documentation

LeanPool.RegtsSevenster.RS.Classical.Deligne.PowPairing

The power pairing #

For a Mod-internal duality datum on a pair of modules, the nested pairing of equal tensor powers: peel the innermost pair — the last factor of the M'-power against the first factor of the M-power — evaluate the datum, braid the scalar out, and multiply onto the pairing of the remaining powers. The pairing is defined at the raw tensor-power level by recursion on the arity; the descent obligations through the module-power and module-tensor coequalizers reduce, by the same recursion, to the datum's linearity and the commutativity of the monoid.

The datum's pairing at the raw tensor level #

The nested power pairing #

The nested power pairing at the raw tensor level, by recursion on the arity: at n + 1, peel the first factor of the M-power, pair it with the exposed last factor of the M'-power, braid the resulting scalar past the remaining M-power, and multiply it onto the pairing of the remaining powers.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    theorem RS.rawPair_succ {D : Type u} [CategoryTheory.Category.{v, u} D] [CategoryTheory.MonoidalCategory D] [CategoryTheory.BraidedCategory D] [CategoryTheory.Limits.HasCoequalizers D] [∀ (Z : D), CategoryTheory.Limits.PreservesColimitsOfShape CategoryTheory.Limits.WalkingParallelPair (CategoryTheory.MonoidalCategory.tensorLeft Z)] (A : D) [CategoryTheory.MonObj A] [CategoryTheory.IsCommMonObj A] (M M' : CategoryTheory.Mod D A) (d : ModDualityDatum A M M') (n : ℕ) :

    The recursion of the power pairing.

    The generic pairing step #

    The recursion step of the power pairing, over an arbitrary continuation pairing: pair the exposed last M'-factor against the exposed head M-factor, braid the scalar past the remaining block, and fold it onto the continuation by multiplication. All extraction and naturality laws are proved at this generality, so that the inductions over the arity reduce to threading through the step.

    Scalar extraction over a symmetric base #

    The descent obligations move an acted scalar across whole tensor blocks in both directions; the two routes agree only when the braiding is symmetric. The pairing calculus therefore runs over a symmetric base from here on — which is the generality of the Key Lemma itself. The section is fresh, so that the symmetric structure's braiding is the only braiding in scope.

    Concatenation against the head peel: concatenating onto a power with an exposed head factor and peeling the head of the result equals peeling the first block and concatenating the rest under the exposed factor.

    theorem RS.rawPair_actRight_last {D : Type u} [CategoryTheory.Category.{v, u} D] [CategoryTheory.MonoidalCategory D] [CategoryTheory.SymmetricCategory D] [CategoryTheory.Limits.HasCoequalizers D] [∀ (Z : D), CategoryTheory.Limits.PreservesColimitsOfShape CategoryTheory.Limits.WalkingParallelPair (CategoryTheory.MonoidalCategory.tensorLeft Z)] (A : D) [CategoryTheory.MonObj A] [CategoryTheory.IsCommMonObj A] (M M' : CategoryTheory.Mod D A) (d : ModDualityDatum A M M') (n : ℕ) :

    Scalar extraction at the last M'-factor: acting on the right of the exposed last factor of the M'-power equals braiding the scalar past the whole M-power and multiplying the pairing from the right.

    theorem RS.pairStep_actRight {D : Type u} [CategoryTheory.Category.{v, u} D] [CategoryTheory.MonoidalCategory D] [CategoryTheory.SymmetricCategory D] [CategoryTheory.Limits.HasCoequalizers D] [∀ (Z : D), CategoryTheory.Limits.PreservesColimitsOfShape CategoryTheory.Limits.WalkingParallelPair (CategoryTheory.MonoidalCategory.tensorLeft Z)] (A : D) [CategoryTheory.MonObj A] [CategoryTheory.IsCommMonObj A] (M M' : CategoryTheory.Mod D A) (d : ModDualityDatum A M M') {Q R : D} (r : CategoryTheory.MonoidalCategoryStruct.tensorObj Q R ⟶ A) :

    Generic scalar extraction at the M'-slot of the step: acting through the braided right action on the exposed M'-factor equals braiding the scalar past the peeled block and multiplying the step from the right.

    Generic scalar extraction at the M-slot of the step: acting on the exposed head M-factor equals braiding the scalar past the peeled block and multiplying the step from the right.

    Over a symmetric base the left action is the braided right action after one crossing.

    theorem RS.pairStep_actLeft_pair {D : Type u} [CategoryTheory.Category.{v, u} D] [CategoryTheory.MonoidalCategory D] [CategoryTheory.SymmetricCategory D] [CategoryTheory.Limits.HasCoequalizers D] [∀ (Z : D), CategoryTheory.Limits.PreservesColimitsOfShape CategoryTheory.Limits.WalkingParallelPair (CategoryTheory.MonoidalCategory.tensorLeft Z)] (A : D) [CategoryTheory.MonObj A] [CategoryTheory.IsCommMonObj A] (M M' : CategoryTheory.Mod D A) (d : ModDualityDatum A M M') {Q R : D} (r : CategoryTheory.MonoidalCategoryStruct.tensorObj Q R ⟶ A) :

    Generic scalar extraction at the M'-slot, for a scalar arriving from the left of the consumed factor.

    theorem RS.pairStep_slide {D : Type u} [CategoryTheory.Category.{v, u} D] [CategoryTheory.MonoidalCategory D] [CategoryTheory.SymmetricCategory D] [CategoryTheory.Limits.HasCoequalizers D] [∀ (Z : D), CategoryTheory.Limits.PreservesColimitsOfShape CategoryTheory.Limits.WalkingParallelPair (CategoryTheory.MonoidalCategory.tensorLeft Z)] (A : D) [CategoryTheory.MonObj A] [CategoryTheory.IsCommMonObj A] (M M' : CategoryTheory.Mod D A) (d : ModDualityDatum A M M') {Q R : D} (r : CategoryTheory.MonoidalCategoryStruct.tensorObj (CategoryTheory.MonoidalCategoryStruct.tensorObj Q M'.X) R ⟶ A) (hr : CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerRight (CategoryTheory.MonoidalCategoryStruct.whiskerLeft Q (actRight A M'.X)) R) r = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerRight (CategoryTheory.MonoidalCategoryStruct.associator Q M'.X A).inv R) (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.associator (CategoryTheory.MonoidalCategoryStruct.tensorObj Q M'.X) A R).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerLeft (CategoryTheory.MonoidalCategoryStruct.tensorObj Q M'.X) (β_ A R).hom) (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.associator (CategoryTheory.MonoidalCategoryStruct.tensorObj Q M'.X) R A).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerRight r A) CategoryTheory.MonObj.mul))))) :

    The top-slot slide law: for a continuation pairing that absorbs the braided right action on its last block factor — the extraction property of the power pairing — the two legs of the top slot window agree after the generic step.

    The head-slot slide law: the two legs of a slot window on the first two M-factors agree after the doubled generic step. The statement is closed — the continuation is arbitrary.

    theorem RS.pairStep_ext {D : Type u} [CategoryTheory.Category.{v, u} D] [CategoryTheory.MonoidalCategory D] [CategoryTheory.SymmetricCategory D] [CategoryTheory.Limits.HasCoequalizers D] [∀ (Z : D), CategoryTheory.Limits.PreservesColimitsOfShape CategoryTheory.Limits.WalkingParallelPair (CategoryTheory.MonoidalCategory.tensorLeft Z)] (A : D) [CategoryTheory.MonObj A] [CategoryTheory.IsCommMonObj A] (M M' : CategoryTheory.Mod D A) (d : ModDualityDatum A M M') {Q R : D} (r : CategoryTheory.MonoidalCategoryStruct.tensorObj Q R ⟶ A) :

    Extraction propagates through the step: the step over an extracted continuation is the extraction of the step, with the scalar crossing the continuation block.

    The descended pairing #

    The two-stage descent of the raw pairing through the module-power coequalizers, mirroring the descent of the raw multiplication: the slot relations assemble over the biproduct legs, the first stage descends the M'-power against the ambient M-power, and the second stage descends the M-power.