Ms Cell Obs A Single Close
ProvedMIPStarRE.QPBT.MagicSquareRigidity.msCellObsA_single_closeEach permuted row or column product of Alice's cell reflections is close, on the dilated state, to the sign prescribed by the corresponding linear equation.
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_Combining_Linearity_Defs import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Test_MagicSquare import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_Rigidity_CellRelations import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_Rigidity_Dilation import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_Rigidity_Reflections import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_Rigidity_Relations namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace LIDT.MIPStarRE.Quantum end LIDT.MIPStarRE.Quantum namespace MIPStarRE.QPBT.MagicSquareRigidity end MIPStarRE.QPBT.MagicSquareRigidity /-! # Approximate anticommutation in the Magic Square game The Magic Square is the smallest linear constraint system whose solution group forces two of its generators to anticommute. This file carries out that computation on the projective dilation of an arbitrary strategy, in the state-dependent norm and with explicit constants. The computation proceeds in three identical steps. Each step takes two constraints sharing exactly one cell and rewrites a product of two cell reflections, one from each constraint, as the signed product of the two reflections at the remaining cells. Iterating the step around the grid returns to the pair one started from, in the opposite order and with the sign reversed by the exceptional parity of the third column; this yields the approximate anticommutation of the two reflections at the cells labelled by the paper's first and fifth variables. The final squared-distance corollaries measure the anticommutation defects of the dilated strategy on its own state, in the `opDistSq` convention of `def:povm-distance`, at the scale `624 ^ 2 * sqrt ε`. These are pre-isometry estimates. The post-isometry estimates on the ideal EPR-pair-plus-auxiliary state in `thm:ms-rigidity` are obtained from them through `ms_anticommutator_transfer_A` and `ms_anticommutator_transfer_B` in the swap-isometry packet, issue Dengnifer/MIPStarRE-QPBT-bak#104. ## References The statement supported here is `thm:ms-rigidity` in `blueprint/src/chapter/ch13_qpbt_test.tex:224-253`, from `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:612-652`, proved in Coladangelo--Stark, arXiv:1709.09267v2, Theorem 6.9; the argument below is the Magic Square instance of the solution-group computation used there (their Figure describing the generators of the solution group). The variable and constraint indices are zero-based, so the paper's first and fifth variables are the cells `0` and `4`. -/ open scoped BigOperators Matrix MatrixOrder ComplexOrder open MIPStarRE.QPBT.MagicSquareRigidity open LIDT.MIPStarRE.LDT LIDT.MIPStarRE.Quantum /-! ## Placement of an operator on one player's tensor factor -/ /-! ## Isometry bookkeeping -/ /-! ## One step of the solution-group computation -/ /-! ## Negation and the sign of a constraint -/ /-! ## The Magic Square instance of one step -/ /-! ## Approximate anticommutation of the two logical Pauli pairs -/ /-! ## The computation on Alice's cell reflections -/
theorem MIPStarRE.QPBT.MagicSquareRigidity.msCellObsA_single_close (S : _root_.MIPStarRE.QPBT.Strategy _root_.MIPStarRE.QPBT.msGame) (ε : ℝ) (hwin : 1 - ε ≤ S.value)
(i : Fin 6) (k₀ k₁ k₂ : Fin 3)
(hsum : ∀ a, _root_.MIPStarRE.QPBT.MagicSquareRigidity.constraintBitOrZero k₀ a + _root_.MIPStarRE.QPBT.MagicSquareRigidity.constraintBitOrZero k₁ a +
_root_.MIPStarRE.QPBT.MagicSquareRigidity.constraintBitOrZero k₂ a = _root_.MIPStarRE.QPBT.MagicSquareRigidity.constraintBitSum a) :
_root_.MIPStarRE.QPBT.MagicSquareRigidity.NormCloseOn (_root_.MIPStarRE.QPBT.MagicSquareRigidity.msDilatedStrategy S).ψ (12 * Real.sqrt ε) (_root_.MIPStarRE.QPBT.MagicSquareRigidity.msCellObsA S i k₁)
(((_root_.MIPStarRE.QPBT.MagicSquareRigidity.bitSign (_root_.MIPStarRE.QPBT.msParity i) : ℝ) : ℂ) •
(_root_.MIPStarRE.QPBT.MagicSquareRigidity.msCellObsA S i k₀ * _root_.MIPStarRE.QPBT.MagicSquareRigidity.msCellObsA S i k₂)) := by sorry