Avg Over Direct Combined Measured Rejected Mass Coefficient Var
ProvedMIPStarRE.QPBT.avgOver_directCombinedMeasuredRejectedMass_coefficientVarThe branch rejection probability of an ordered type pair is the uniform average of the rejected Born mass at the canonical questions of the common direct sample.
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_Algebra_FieldBasis 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_BranchComparison import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_GameValue import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Polynomial import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Strategy import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Value import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame import Mathlib namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace LIDT.MIPStarRE.LDT.Preliminaries end LIDT.MIPStarRE.LDT.Preliminaries namespace LIDT.MIPStarRE.Quantum end LIDT.MIPStarRE.Quantum namespace MIPStarRE.QPBT end MIPStarRE.QPBT /-! # The value of the combined strategy `lem:ld-combined-value` transports the value of a projective strategy along `def:ld-combined-strategy`. Both games weight their nine ordered type pairs uniformly, so it suffices to bound the rejection probability of each branch of the combined game by a bounded number of branch rejection probabilities of the original game. Splitting a branch according to the event of `lem:ld-combined-question-law`, the branch conditioned on a point coordinate index is the branch of the original game at the same ordered type pair, and the branch conditioned on a combining coordinate index is the point-versus-point branch of the original game; on each of the two events the relabelling of `def:ld-combined-strategy` carries acceptance to acceptance, which is `directCombinedWinTransport_all`. Each branch of the combined game is therefore rejected with probability at most the sum of two branch rejection probabilities of the original game, and summing over the nine branches multiplies the rejection probability by at most ten. ## References * `references/neexp-paper/05_quantum_preliminaries.tex:1409-1503` * `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:413-458` * `blueprint/src/chapter/ch13_qpbt_test.tex:526-568` -/ open scoped BigOperators MatrixOrder Matrix ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT open LIDT.MIPStarRE.LDT.Preliminaries open LIDT.MIPStarRE.Quantum
theorem MIPStarRE.QPBT.avgOver_directCombinedMeasuredRejectedMass_coefficientVar
(D : _root_.MIPStarRE.QPBT.DirectLdParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D))
(types : _root_.MIPStarRE.QPBT.LdType × _root_.MIPStarRE.QPBT.LdType) (r : Fin D.k) :
_root_.LIDT.MIPStarRE.LDT.avgOver (_root_.LIDT.MIPStarRE.LDT.uniformDistribution
((Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) × (Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D)))
(_root_.MIPStarRE.QPBT.directCombinedMeasuredRejectedMass D S types
(_root_.MIPStarRE.QPBT.combinedCoefficientVar D.m D.k r)) =
_root_.MIPStarRE.QPBT.directLdBranchRejectionProbability D S (.point, .point) := by sorry