Direct Ld Indexed Branch Rejection Probability Point Point
ProvedMIPStarRE.QPBT.directLdIndexedBranchRejectionProbability_point_pointBoth questions of a point-versus-point branch are the point question at the sampled point, so the index-conditioned rejection probability of that branch is the average over the sampled point alone, for every stored coordinate index.
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_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_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 /-! # Index-conditioned rejection probabilities of the directly indexed game `lem:ld-combined-value` transports the value of a strategy along `def:ld-combined-strategy` by splitting each branch of the combined game according to the event of `lem:ld-combined-question-law`, that is according to whether the stored coordinate index of the common sample is a point coordinate or a combining coordinate. This module provides the corresponding refinement of the branch rejection probability: the uniform average over the common sample is the uniform average over the stored coordinate index of the average over the sampled point and the sampled direction alone. The point-versus-point branch is recorded separately, because it is the branch that the combining coordinates of the combined game reduce to: both of its questions are the point question at the sampled point, so its rejected mass depends on neither the stored coordinate index nor the sampled direction. All declarations below are formalization-only support derived from the game value; none is a paper-labelled result. ## 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:517-568` -/ open scoped BigOperators MatrixOrder Matrix ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT open LIDT.MIPStarRE.LDT.Preliminaries open LIDT.MIPStarRE.Quantum /-! ## The index-conditioned branch rejection probability -/ /-! ## The point-versus-point branch -/
theorem MIPStarRE.QPBT.directLdIndexedBranchRejectionProbability_point_point
(D : _root_.MIPStarRE.QPBT.DirectLdParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D)) (i : Fin D.m) :
_root_.MIPStarRE.QPBT.directLdIndexedBranchRejectionProbability D S (.point, .point) i =
_root_.LIDT.MIPStarRE.LDT.avgOver (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D)) fun u =>
_root_.MIPStarRE.QPBT.directRejectedMass D S (_root_.MIPStarRE.QPBT.directLdPointQuestionOf D u)
(_root_.MIPStarRE.QPBT.directLdPointQuestionOf D u) := by sorry