Documentation

LeanPool.RegtsSevenster.RS.Classical.Deligne.ModIns

Insertion and contraction on the multi-tensor #

The two workhorses of the Key Lemma's pairing calculus: inserting a copairing's image at a boundary of the multi-tensor, and contracting a pairing across one. Insertion needs no descent — it lands in the larger multi-tensor through the concatenation; contraction descends through the coequalizer using the pairing's linearity.

The pairing evaluated on the two-element fold.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    theorem RS.append_pair_slot_cases {D : Type u} [CategoryTheory.Category.{v, u} D] [CategoryTheory.MonoidalCategory D] (A : D) [CategoryTheory.MonObj A] {Xs pre post : List (CategoryTheory.Mod D A)} {M M' P Q : CategoryTheory.Mod D A} (hd : Xs ++ [M', M] = pre ++ P :: Q :: post) :
    (∃ (post' : List (CategoryTheory.Mod D A)), post = post' ++ [M', M] ∧ Xs = pre ++ P :: Q :: post') ∨ post = [M] ∧ Q = M' ∧ Xs = pre ++ [P] ∨ post = [] ∧ P = M' ∧ Q = M ∧ Xs = pre

    Case analysis for decompositions of Xs ++ [M', M]: a slot lies inside Xs, at the boundary, or inside the pair.

    The fold-level three-window contraction: pair off the trailing window, act on the head with the resulting scalar.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      The window morphism of the trailing pair passes to the pairing through the projection.