Documentation

MIPRE.Background.LIDT.Co.Pasting.ComparisonLemmas.CommuteGHalfSandwich.MoveChain.Chain

Section 12 pasting: half-sandwich move chain #

The recursive sequence of operator families which moves a completed-slice factor through the half-product, and its adjacent edges, each supplied by the self-consistency estimate for the completed-slice family: the counterpart of the vendored file of the same path under MIPRE/Background/LIDT/MIPStarRE/LDT/ in the port of planning/c6b-plan.md (milestone M11, section "Port conventions").

The chain family takes the symmetric model S : SymModel 𝔓 K as its first explicit argument, as the placed families of Setup/Definitions and MoveChain/Lifting do: commuteGHalfSandwich_moveChainFamily S params family r i. The lemmas take S second, after params: commuteGHalfSandwich_moveChainFamily_zero params S family, commuteGHalfSandwich_moveChainFamily_last params S family, whose vendored versions have no state, gain it there, and commuteGHalfSandwich_moveChain_step params S family zeta hsc takes it where the vendored ψbi was. No vendored lemma here has a swap, density or normalization hypothesis.

The recursion unfolds by dite_eq_left and dite_eq_right, and the outcome identities hold by S.leftTensor_mul_leftTensor and association up to definitional equality, where the vendored proofs unfold by simp.

Not ported #

Every declaration of the vendored file has a counterpart here.

References #

In LionSR/MIPStarRE at commit 507e8122, not in this repository:

Move chain: recursive family, step lemma #

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

Equations
Instances For

    The first family of the move chain is the move source.

    The last family of the move chain is the move family.