Section 12 pasting: line one-point transport — core theorems #
The assembly of lem:ld-sandwich-line-one-point: the counterpart of
MIPRE/Background/LIDT/MIPStarRE/LDT/Pasting/ComparisonLemmas/LdSandwichLineOnePoint/Core.lean
in the port of planning/c6b-plan.md (milestone M11, section "Port conventions").
A strategy is a SymStrat params.next 𝔓 K and the slice family an IdxPolyFamily params 𝔓;
the consistency statements are ConsRels on strategy.state. The linear-defect bound of
Co/.../LdSandwichLineOnePoint/CauchySchwarz.lean reinstates the max 0 of the bipartite
consistency error (ldSandwichLineOnePoint_prefix_cauchySchwarz_transport), the moved endpoint
of PrefixMoved.lean closes the nonzero-coordinate branch, and the endpoint of Endpoint.lean
the zero-coordinate branch. The vendored proofs bound the two failure probabilities by 1
through strategy.isNormalized; here S.bipartiteConsError_uniform_le_one and
Pasting.bipartiteSSCError_uniform_le_one take no normalization argument. No statement carries
a swap or normalization hypothesis, the vendored statements having none.
Not ported #
Nothing: every vendored declaration has a counterpart of the same name.
References #
In LionSR/MIPStarRE at commit 507e8122, not in this repository:
references/ldt-paper/ld-pasting.texblueprint/src/chapter/ch09_pasting.tex
The post-deletion analytic transport in lem:ld-sandwich-line-one-point.
The substantive paper gap is now the averaged linear defect bound
ldSandwichLineOnePoint_prefix_linearDefect_average_cauchySchwarz_bound; this
lemma is only the proved reduction that reinstates the max 0 bipartite
consistency error using the measurement-valued right family.
Scalar residual for the nonzero-coordinate branch of
lem:ld-sandwich-line-one-point.
This is the match-mass lower-bound step after unfolding ConsRel: it bounds the
averaged off-diagonal defect for the prefix-marginalized one-point family. The
helper consumes only the adjoint raw-core bound; endpoint identifications,
raw-family reindexing, exact tail deletion, and match-mass expansion are
proved directly in the local lemmas that use them.
Turn the scalar match-mass lower bound into the ConsRel needed by the
public line-one-point statement.
Cauchy-Schwarz sandwich elimination for one-point consistency.
Given the half-sandwich commutation bound from commuteGHalfSandwich, performs
the Cauchy-Schwarz + measurement-completeness argument that converts the
sandwiched operator distance into a one-point consistency bound.
Paper reference: lem:ld-sandwich-line-one-point proof in
ld-pasting.tex lines 931-1036.
Steps:
- Simplify by summing out indices
> iusing measurement completeness - Apply Cauchy-Schwarz with
commuteGHalfSandwichto moveGhat_1left - Apply Cauchy-Schwarz again to move
Ghat_1right - Eliminate
Ghat_<iproduct using measurement completeness - Reduce to the single-slice bound
eq:ld-gbcon
Internal form of lem:ld-sandwich-line-one-point after applying
cor:G-hat-facts.
Source: The proof in references/ldt-paper/ld-pasting.tex:956-1074 uses
the half-sandwich commutation estimates obtained from cor:G-hat-facts. The
paper-facing theorem ldSandwichLineOnePoint below derives those estimates
from the source hypotheses.
Internal form of lem:ld-sandwich-line-one-point after applying
cor:G-hat-facts.
This source-facing statement retains the usual good-strategy hypothesis.
lem:ld-sandwich-line-one-point, source-facing form.