Direct Coordinate Failure Le Three Mul Rejection
ProvedMIPStarRE.QPBT.directCoordinate_failure_le_three_mul_rejectionThe uniformly weighted rejection is one ninth of the sum over the nine ordered type pairs.
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_StrategyBiProj_Measurements import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Game import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_GameValue import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Correspondence import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Strategy import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Games_StrategyClasses import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame import Mathlib namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace LIDT.MIPStarRE.Quantum end LIDT.MIPStarRE.Quantum namespace MIPStarRE.QPBT end MIPStarRE.QPBT /-! # Pass conversion for the directly indexed low-degree game This module converts a value bound for a projective strategy of the directly indexed low-degree game into the hypothesis of the low individual degree theorem for each coordinate strategy `directCoordinateProjStrat`. The LDT failure probability gives weight `1/3` to point agreement and `1/6` to each of the four oriented line-versus-point checks. The branch comparisons of `Transport.BranchComparison` and `Transport.DiagonalRecursion` bound the point and axis-line branches by the corresponding direct branch rejections and each diagonal branch by twice its direct branch rejection. The factor-three rejection calculus of `GameValue` gives the line branches half the weight of the point branch, so the factor two is absorbed: a direct strategy of value at least `1 - ε` has coordinate strategies of LDT failure at most `3 * ε`, which is exactly `PassesLowIndividualDegreeTest (3 * ε)`. ## References - `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:214-458` - `references/ldt-paper/test_definition.tex:130-151` - Blueprint `def:ld-question-distribution`, `lem:ld-aline-level`, `lem:ld-dline-level`, `lem:ld-question-typed-cl`, `lem:alnf`, `lem:dlnf`, `def:ld-win-predicate`, `rem:ld-win-zero-direction`, and `def:ld-meas` - `MIPStarRE/LDT/Test/StrategyFailures.lean:18-130` - `MIPStarRE/LDT/Test/MainTheorem/MainFormal.lean:300-311` - `docs/paper-gaps/qpbt_ld-dimension-divisibility.tex` -/ open scoped BigOperators MatrixOrder Matrix ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT open LIDT.MIPStarRE.Quantum /-! ## The failure comparison and the pass hypothesis -/
theorem MIPStarRE.QPBT.directCoordinate_failure_le_three_mul_rejection
(D : _root_.MIPStarRE.QPBT.DirectLdParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D))
(hS : S.IsProjective) (r : Fin D.k) :
letI := D.toLDTFieldModel
(_root_.MIPStarRE.QPBT.directCoordinateProjStrat D S hS r).lowIndividualDegreeFailureProbability ≤
3 * _root_.MIPStarRE.QPBT.directLdRejectionProbability D S := by sorry