Section 11 commutativity: pointwise scalar approximation #
Pointwise overlap terms ⟨ψ, (I - G^x) ⊗ G^x ψ⟩ controlling both sides of
the G-stability estimate, used as the base for the averaged scalar bound.
References #
references/ldt-paper/commutativity-G.texblueprint/src/chapter/ch08_commutativity.tex
The common overlap term ⟨ψ, (I - G^x) ⊗ G^x ψ⟩ controlling both
stability estimates.
Equations
- MIPStarRE.LDT.Commutativity.gCommOverlapTerm params strategy G x = MIPStarRE.LDT.ev strategy.state (MIPStarRE.LDT.leftTensor (1 - (G x).total) * MIPStarRE.LDT.rightTensor (G x).total)
Instances For
The slice self-consistency defect of G is at most zeta / 2.
Slice strong self-consistency transfers to the evaluated point family.
The paper invokes the slice self-consistency item after postprocessing a slice
measurement by the predicate g(truncatePoint u) = a. This lemma makes that
implicit data-processing step explicit: projectivity converts the left/right SDD
hypothesis into bipartite strong self-consistency with loss 1/2,
question-dependent postprocessing converts it back to left/right SDD with the
compensating factor 2, and uniform reindexing
Point params.next ≃ Point params × Fq params averages the height coordinate.
A sandwiched product of two submeasurements is controlled by the overlap of the right-hand total with its complement.
The full stability-one defect is bounded by the overlap term for the
target slice measurement G^y.
The overlap term at x is bounded by the bipartite SSC defect of G x.