Preliminary comparison theorems: bipartite self-consistency (core) #
Core building blocks for bipartite self-consistency: reflexivity of the
question-level state-dependent distance qSDD and its lift to the family-level
sddError.
References #
references/ldt-paper/preliminaries.texblueprint/src/chapter/ch03_preliminaries.tex
The self-distance sddError ψ 𝒟 A A is zero.
On a permutation-invariant bipartite state, the qSDDCore distance between
right-tensor placements of two local operator families equals the corresponding
left-tensor distance.
This is a shared tensor-placement helper for Bob/right-register variants of
≈_δ arguments. The proof expands each squared-difference term and applies
PermInvState.swap_ev to (A_a-B_a)^†(A_a-B_a).
prop:two-notions-of-self-consistency.
If the indexed sub-measurement A is bipartite-strongly-self-consistent
on the permutation-invariant state ψ (i.e., BipartiteSSCRel ψ 𝒟 A δ,
meaning ∑ₐ ev ψ (Aₐ ⊗ I) − ∑ₐ ev ψ (Aₐ ⊗ Aₐ) ≤ δ), then the left
and right lifts are close: SDDRel ψ 𝒟 (liftLeft A) (liftRight A) (2 * δ).
Paper proof sketch:
- Expand
∑ₐ ev ψ ((Aₐ⊗I − I⊗Aₐ)² ). - Using Kronecker mixed-product rule and PermInvState.swap_ev, this
equals
2 · (∑ₐ ev ψ (Aₐ²⊗I) − ∑ₐ ev ψ (Aₐ⊗Aₐ)). - Since
Aₐ² ≤ Aₐ(sub-measurement bound), we get≤ 2 · (∑ₐ ev ψ (Aₐ⊗I) − ∑ₐ ev ψ (Aₐ⊗Aₐ)) = 2 · bipartiteSSCDefect. - Average over 𝒟 and apply the BipartiteSSCRel hypothesis.