Consistency Defect Reindex Eq
ProvedMIPStarRE.QPBT.ProjectiveSetting.consistencyDefect_reindex_eqReindexing an operator along an equivalence is multiplicative. Formalization-only support for the interchanged conclusions of lem:qld-win-implications, blueprint ch14_qpbt_observables.tex:701-703.
All objects, parameters, typeclass assumptions, and hypotheses are quantified in the accompanying formal statement; each symbol denotes the object of the displayed Lean type with that name. The conclusion is the proposition
This result is an importable reduction step in the formal dependency graph for the quantum Pauli basis test completeness or soundness argument.
Formalization Credit. This Lean declaration is part of the Quantum Pauli basis test formalization by Ruixuan Deng. The source code was generated by AI agents; Ruixuan Deng is the responsible maintainer.
Mathematical Source. The mathematical source is Ji, Natarajan, Vidick, Wright, and Yuen, MIP*=RE, arXiv:2001.04383v3.
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_AxisParallelLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DiagonalLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_Distribution
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LinePolynomials
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LowDegreePolynomial
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OpFamily
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersBase
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersFiniteAnswers
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_QuantumState
import Definitions.Def_LIDT_MIPStarRE_LDT_CommutativityPoints_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_Defs_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Defs_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Families
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Interpolation
import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_AvgCongr
import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic
import Definitions.Def_LIDT_MIPStarRE_Quantum_Measurement
import Definitions.Def_QPBT_QPBT_Algebra_FieldBasis
import Definitions.Def_QPBT_QPBT_Algebra_LowDegreeCode
import Definitions.Def_QPBT_QPBT_Games_Consistency
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_Support
import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_TensorSupport
import Definitions.Def_QPBT_QPBT_Observables_Defs
import Definitions.Def_QPBT_QPBT_Observables_ExpandedDefs
import Definitions.Def_QPBT_QPBT_State
import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest
import Mathlib
namespace LIDT.MIPStarRE.LDT
end LIDT.MIPStarRE.LDT
namespace LIDT.MIPStarRE.Quantum
end LIDT.MIPStarRE.Quantum
namespace MIPStarRE.QPBT
end MIPStarRE.QPBT
namespace MIPStarRE.QPBT.DistanceCalculus
end MIPStarRE.QPBT.DistanceCalculus
namespace MIPStarRE.QPBT.ProjectiveSetting
end MIPStarRE.QPBT.ProjectiveSetting
/-!
# Orthonormalization of the sandwich POVM
For each fixed point pair `(x, z)`, the sandwich POVM `R^{x,z}` on one
register placement is consistent with the sandwich POVM on the opposite
placement, with the consistency defect bounded by
`ProjectiveSetting.sandwichDefectBound`. The orthonormalization lemma
`lem:ortho`, in its explicit-constant form
`projective_rounding_with_explicit_constant`, therefore produces a projective
measurement `Q^{x,z}` on the original local space, within `220 · c^{1/4}` of
`R^{x,z}` on the expanded state, where `c` is that bound. Choosing such a
measurement for every pair and averaging, the concavity of `t ↦ t^{1/4}`
turns the average of the fiberwise errors into the same function of the
average defect.
The orthonormalization lemma is stated for a bipartite state whose first
tensor factor carries the POVM to be rounded. The two bipartitions used are
`AA' | BA''(B'B'')`, for Alice's measurements, and `BA'' | AA'(B'B'')`, for
Bob's; the second is introduced here.
## Main results
* `baAaBipartition` with its two placement lemmas.
* `avgOver_rpow_quarter_le`: Jensen's inequality for the fourth root.
* `ProjectiveSetting.exists_projective_close_sandwich`: the fiberwise
orthonormalization, for any bipartition exhibiting the two placements as
the two tensor factors.
## References
Paper `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:786-790`
(the application of the orthonormalization lemma), blueprint
`blueprint/src/chapter/ch15_qpbt_combining.tex:870-878` (`lem:qld-4-10`), and
`blueprint/src/chapter/ch14_qpbt_observables.tex:395-464` (`lem:ortho`); the
route is explained in `docs/paper-gaps/qpbt_combined-points-field-valued.tex`.
-/
open scoped BigOperators Matrix MatrixOrder ComplexOrder
open MIPStarRE.QPBT
open LIDT.MIPStarRE.LDT hiding Measurement
open LIDT.MIPStarRE.Quantum MIPStarRE.QPBT.DistanceCalculus
/-! ## Jensen's inequality for the fourth root -/
/-! ## The bipartition with Bob's registers first -/
open MIPStarRE.QPBT.ProjectiveSetting
variable {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {ε : ℝ}
/-! ## Transport along a bipartition -/
variable (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε) (p₁ p₂ : _root_.MIPStarRE.QPBT.Placement)set_option synthInstance.maxSize 400 in
theorem MIPStarRE.QPBT.ProjectiveSetting.consistencyDefect_reindex_eq {α : Type*} [Fintype α] [DecidableEq α]
(e : _root_.MIPStarRE.QPBT.SixReg P S.toStrategy.ιA S.toStrategy.ιB ≃
S.ExpandedLocalSpace p₁.side ×
(S.ExpandedLocalSpace p₂.side × (_root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P)))
(he₁ : ∀ O : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace p₁.side),
_root_.MIPStarRE.QPBT.reindexOp e (_root_.MIPStarRE.QPBT.heteroKron O
(1 : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace p₂.side ×
(_root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P)))) = S.place p₁ O)
(he₂ : ∀ O : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace p₂.side),
_root_.MIPStarRE.QPBT.reindexOp e (_root_.MIPStarRE.QPBT.heteroKron (1 : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace p₁.side))
(_root_.MIPStarRE.QPBT.heteroKron O (1 : _root_.LIDT.MIPStarRE.Quantum.Op (_root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P)))) =
S.place p₂ O)
(Q : _root_.LIDT.MIPStarRE.Quantum.Measurement α (S.ExpandedLocalSpace p₁.side))
(R : _root_.LIDT.MIPStarRE.Quantum.Measurement α (S.ExpandedLocalSpace p₂.side)) :
_root_.MIPStarRE.QPBT.consistencyDefect (_root_.LIDT.MIPStarRE.LDT.uniformDistribution Unit)
(fun _ a => _root_.MIPStarRE.QPBT.heteroKron (Q.effect a) 1)
(fun _ a => _root_.MIPStarRE.QPBT.heteroKron 1
((_root_.MIPStarRE.QPBT.DistanceCalculus.leftPlacedMeasurement (ιB := _root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P) R).effect a))
(_root_.MIPStarRE.QPBT.reindexState e S.psiHat) =
∑ a : α, ∑ b : α, if a = b then 0 else
_root_.MIPStarRE.QPBT.DistanceCalculus.stateQForm S.psiHat (S.place p₁ (Q.effect a) * S.place p₂ (R.effect b)) := by sorry