Ms Game Support Incidence
ProvedMIPStarRE.QPBT.msGame_support_incidenceFormalization-only auxiliary for the perfect Magic Square strategy and the proof of lem:pauli-completeness: every supported Magic Square question pair is an incident constraint-variable pair in one of its two orders.
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_QPBT_QPBT_Games_StrategyClasses import Definitions.Def_QPBT_QPBT_Test_MagicSquare import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_Basic namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace LIDT.MIPStarRE.Quantum end LIDT.MIPStarRE.Quantum namespace MIPStarRE.QPBT end MIPStarRE.QPBT /-! # Perfect strategies for the Magic Square game This file completes the construction of `thm:ms-from-ac`. It identifies the question pairs in the support of the Magic Square distribution, shows that the measurement family commutes there and annihilates rejected answer pairs on the EPR state, evaluates the Born weights of the accepted answers, and assembles a symmetric SPCC strategy of value one from an anticommuting consistent pair of binary measurements. ## References The source statement is blueprint `thm:ms-from-ac`, from `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:654-722`. -/ open scoped BigOperators Matrix MatrixOrder ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open LIDT.MIPStarRE.Quantum
theorem MIPStarRE.QPBT.msGame_support_incidence (x y : _root_.MIPStarRE.QPBT.MsType)
(hxy : (x, y) ∈ _root_.MIPStarRE.QPBT.msGameSymm.μ.support) :
(∃ i : Fin 6, ∃ k : Fin 3,
x = .constraint i ∧ y = .var (_root_.MIPStarRE.QPBT.msConstraintVars i k)) ∨
∃ i : Fin 6, ∃ k : Fin 3,
x = .var (_root_.MIPStarRE.QPBT.msConstraintVars i k) ∧ y = .constraint i := by sorry