Norm Product Transfer Le
ProvedMIPStarRE.QPBT.WinImplications.norm_product_transfer_leTransferring a product across the tensor factors costs the two individual distances: if A on the first factor is close to B on the second and C on the first is close to D on the second, then A * C on the first factor is close to D * B on the second. The second factor's product is read in the reversed order because the correspondence between the two factors determined by the state is an antihomomorphism, so it carries a product of first-factor operators to the product of their partners taken in the opposite order.
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_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_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_Rigidity_GroundSlice import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_Rigidity_Reflections 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.WinImplications end MIPStarRE.QPBT.WinImplications /-! # Approximate anticommutation of the point observables on anticommuting tuples This module carries out the anticommuting half of the proof of Equation `eq:pts-obs-commutation` in `lem:qld-win-implications-obs`. The Magic Square approximate anticommutation of the variable observables is read back from the projective dilation on which it is proved, and transported to Alice's point observables through item 7 of `lem:qld-win-implications`. ## References The declarations support `lem:qld-win-implications-obs` in `blueprint/src/chapter/ch14_qpbt_observables.tex:761-794`, whose paper source is `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:342-362`. -/ open scoped BigOperators Matrix MatrixOrder ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open LIDT.MIPStarRE.Quantum open MIPStarRE.QPBT.WinImplications /-! ## Reading the dilation back on the original space -/ /-! ## The Magic Square anticommutation on the undilated strategy -/ /-! ## Reflections and the product transfer -/
theorem MIPStarRE.QPBT.WinImplications.norm_product_transfer_le {ιA ιB : Type} [Fintype ιA] [DecidableEq ιA]
[Fintype ιB] [DecidableEq ιB] (A C : _root_.LIDT.MIPStarRE.Quantum.Op ιA) (B D : _root_.LIDT.MIPStarRE.Quantum.Op ιB)
(ψ : EuclideanSpace ℂ (ιA × ιB))
(hA : (_root_.MIPStarRE.QPBT.heteroKron A (1 : _root_.LIDT.MIPStarRE.Quantum.Op ιB))ᴴ * _root_.MIPStarRE.QPBT.heteroKron A 1 = 1)
(hD : (_root_.MIPStarRE.QPBT.heteroKron (1 : _root_.LIDT.MIPStarRE.Quantum.Op ιA) D)ᴴ * _root_.MIPStarRE.QPBT.heteroKron 1 D = 1) :
‖_root_.MIPStarRE.QPBT.applyOperatorToState
(_root_.MIPStarRE.QPBT.heteroKron (A * C) (1 : _root_.LIDT.MIPStarRE.Quantum.Op ιB) - _root_.MIPStarRE.QPBT.heteroKron 1 (D * B)) ψ‖ ≤
‖_root_.MIPStarRE.QPBT.applyOperatorToState
(_root_.MIPStarRE.QPBT.heteroKron C (1 : _root_.LIDT.MIPStarRE.Quantum.Op ιB) - _root_.MIPStarRE.QPBT.heteroKron 1 D) ψ‖ +
‖_root_.MIPStarRE.QPBT.applyOperatorToState
(_root_.MIPStarRE.QPBT.heteroKron A (1 : _root_.LIDT.MIPStarRE.Quantum.Op ιB) - _root_.MIPStarRE.QPBT.heteroKron 1 B) ψ‖ := by sorry