QPBT definitions: Combining / DirectLowDegree / Transport / BranchComparison
DefinitionQPBT_QPBT_Combining_DirectLowDegree_Transport_BranchComparisonqpbt
This bundle defines the rejected Born mass and sample coordinates for a direct low-degree branch. It packages the rejected answer-pair mass at fixed direct questions and the point-index and direction components of a direct sample.
Principal definitions:
MIPStarRE.QPBT.directRejectedMass: defines the Born mass of rejected answer pairs at a fixed pair of direct questions.MIPStarRE.QPBT.directLdSpaceSplitEquiv: defines a direct sample as its point-index pair together with its direction.
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.
Definition code
-- Generated from QPBT/Combining/DirectLowDegree/Transport/BranchComparison.lean by skeleton subtraction.
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_Combining_DirectLowDegree_Game
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry
import Definitions.Def_QPBT_QPBT_Games_Defs
import Mathlib
namespace LIDT.MIPStarRE.LDT
end LIDT.MIPStarRE.LDT
namespace LIDT.MIPStarRE.Quantum
end LIDT.MIPStarRE.Quantum
namespace MIPStarRE.QPBT
end MIPStarRE.QPBT
/-!
# Branch comparison for the coordinate strategies of the direct low-degree game
Every branch of the low individual degree failure probability of a coordinate
strategy `directCoordinateProjStrat` is compared with the ordered type-pair
branch of the direct game asking the same questions. An accepted direct
answer pair reads out to equal LDT answers: the line answer, rebased to the
LDT line and evaluated at the LDT base point, is the point answer, and the
zero-direction convention reads the constant value at the base point. Hence
the LDT inconsistency mass at a question pair is at most the rejected direct
Born mass there. The point-agreement and axis-line branches then compare
exactly after the coordinate reindexing of `directPointEquiv`; the diagonal
branches are treated in `Transport.DiagonalRecursion`.
## 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`
- `docs/paper-gaps/qpbt_ld-dimension-divisibility.tex`
-/
@[expose] public section
open scoped BigOperators MatrixOrder Matrix ComplexOrder
namespace MIPStarRE.QPBT
open LIDT.MIPStarRE.LDT
open LIDT.MIPStarRE.Quantum
noncomputable section
/-! ## Rejected Born mass at a fixed question pair -/
/-- The Born mass of the rejected answer pairs at a fixed pair of direct
questions. Its uniform average over the common direct sample of an ordered
type pair is `directLdBranchRejectionProbability`. -/
def directRejectedMass (D : _root_.MIPStarRE.QPBT.DirectLdParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D))
(x y : _root_.MIPStarRE.QPBT.DirectLdQuestion D) : ℝ :=
∑ a : _root_.MIPStarRE.QPBT.DirectLdAnswer D, ∑ b : _root_.MIPStarRE.QPBT.DirectLdAnswer D,
if _root_.MIPStarRE.QPBT.directLdWinPredicate D x y a b then 0 else _root_.MIPStarRE.QPBT.outcomeWeight S x y a b
/-! ## Accepted answer pairs read out consistently
An accepted answer pair of the direct game consists of well-formed answers
satisfying the line-versus-point clause or the consistency clause of
`def:ld-win-predicate`. The readouts of `Transport.Questions` evaluate the
rebased line polynomial at the LDT base point, which is the direct point
at the canonical rebase parameter; the accepted clause forces this value to
be the point answer. Zero directions use the constant readout at the base
point, where the universal clause of `rem:ld-win-zero-direction` gives the
value at parameter zero. -/
/-! ## Direct samples as products -/
/-- A direct sample as its point-index pair together with its direction.
Formalization-only reindexing of the direct sample space. -/
def directLdSpaceSplitEquiv (D : _root_.MIPStarRE.QPBT.DirectLdParams) :
_root_.MIPStarRE.QPBT.DirectLdSpace D ≃
((Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) × Fin D.m) × (Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) where
toFun s := ((s.point, s.index), s.direction)
invFun x := ⟨x.1.1, x.1.2, x.2⟩
left_inv s := by cases s; rfl
right_inv x := rfl
/-! ## The point-agreement and axis-line branches -/
end
end MIPStarRE.QPBT
Source