Documentation

MIPRE.Background.LIDT.MIPStarRE.LDT.Pasting.ComparisonLemmas.CommuteGHalfSandwich.MoveChain.Chain

Section 12 pasting: half-sandwich move chain #

This module defines the recursive sequence of operator families which moves a completed-slice factor through the half-product. The adjacent edges in this sequence are supplied by the self-consistency estimate for the completed-slice family.

References #

Move chain: recursive family, step lemma, and aggregate #

The recursive moveChainFamily indexed over Fin (r+1), with the step lemma moveChain_step and the aggregate lemma move_chain that composes the r self-consistency edges.

noncomputable def MIPStarRE.LDT.Pasting.commuteGHalfSandwich_moveChainFamily {ι : Type u_1} [Fintype ι] [DecidableEq ι] (params : Parameters) [FieldModel params.q] (family : IdxPolyFamily params ι) (r : ) :
Fin (r + 1)IdxOpFamily (MoveQ params r) (MoveO params r) (ι × ι)

The finite sequence of operator families which moves the distinguished completed-slice factor across an r-tuple tail.

Equations
Instances For
    theorem MIPStarRE.LDT.Pasting.commuteGHalfSandwich_moveChainFamily_zero {ι : Type u_1} [Fintype ι] [DecidableEq ι] (params : Parameters) [FieldModel params.q] (family : IdxPolyFamily params ι) (r : ) (q : MoveQ params r) (ogs : MoveO params r) :
    theorem MIPStarRE.LDT.Pasting.commuteGHalfSandwich_moveChainFamily_last {ι : Type u_1} [Fintype ι] [DecidableEq ι] (params : Parameters) [FieldModel params.q] (family : IdxPolyFamily params ι) (r : ) (q : MoveQ params r) (ogs : MoveO params r) :