Exists Spcc Value One
ProvedMIPStarRE.QPBT.exists_spcc_value_oneThe honest strategy is consistent on its maximally entangled state.
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_QPBT_QPBT_Algebra_FieldBasis import Definitions.Def_QPBT_QPBT_Algebra_LowDegreeCode import Definitions.Def_QPBT_QPBT_Algebra_Pauli import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Games_StrategyClasses import Definitions.Def_QPBT_QPBT_Test_Completeness import Definitions.Def_QPBT_QPBT_Test_Completeness_HonestStrategy_MeasurementFamily import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest import Mathlib namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace MIPStarRE.QPBT end MIPStarRE.QPBT /-! # Completeness of the Pauli basis test The Pauli basis test admits a symmetric presentation and a value-one SPCC strategy. ## References The source statement is blueprint `lem:pauli-completeness`, from `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1229-1421`. -/ open scoped BigOperators open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT /-! ### Auxiliary facts about the Pauli question sampler The two lemmas of this section are formalization-only. They record that the uniform law on the Pauli edge type, and the typed bind seeded by it, do not depend on the finiteness and decidability data used to form them. The general identities about finite weighted distributions that this file uses are stated in `MIPStarRE/QPBT/Games/DistributionAux.lean`. -/ /-! ### The Pauli question sampler as a typed conditionally linear distribution -/ /-! ### Symmetry of the Pauli basis test -/
theorem MIPStarRE.QPBT.exists_spcc_value_one (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
∃ S : _root_.MIPStarRE.QPBT.SymmetricStrategy (_root_.MIPStarRE.QPBT.pauliBasisTestSymm P),
S.IsSPCC ∧ S.toStrategy.value = 1 := by sorry