QPBT definitions: Combining / DirectLowDegree / Transport / Combining / WinPredicate
DefinitionQPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_WinPredicateqpbt
This bundle packages the acceptance predicate used to transport a win in the direct combined low-degree game. It also records that a point-coordinate direction has no component in the scalar combining coordinates.
Principal definitions:
MIPStarRE.QPBT.DirectCombinedWinTransport: the direct-game acceptance transport relation.MIPStarRE.QPBT.directCombinedCoefficientPart_coordinateDirection_pointVar: the combining-variable part of a coordinate direction for a point variable is zero.
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/Combining/WinPredicate.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_Algebra_FieldBasis
import Definitions.Def_QPBT_QPBT_Algebra_Lines
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Game
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Parameters
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_Test_LowDegreeGame
import Mathlib
namespace LIDT.MIPStarRE.LDT
end LIDT.MIPStarRE.LDT
namespace LIDT.MIPStarRE.LDT.Preliminaries
end LIDT.MIPStarRE.LDT.Preliminaries
namespace MIPStarRE.QPBT
end MIPStarRE.QPBT
/-!
# Branch-wise acceptance transport for the combined strategy
By `directRejectedMass_directCombinedStrategy_le`, the branch-wise estimates of
`lem:ld-combined-value` reduce to the following statement: the relabelling of
`def:ld-combined-strategy` sends an answer pair accepted by the win predicate
of the original game at the measured questions to an answer pair accepted by
the win predicate of the combined game. This module proves that statement for
each of the nine ordered type pairs of the combined game.
Three of the nine branches are deterministic. The two questions of a branch
whose type pair is diagonal are equal, so the acceptance clause of the original
game forces the two measured outcomes to be equal, and the relabelling, being a
function, sends them to equal combined outcomes. The two branches pairing an
axis-parallel line with a diagonal line impose no condition in either game.
The six remaining branches pair a line with a point, and split according to
whether the stored coordinate index of the common sample is a point coordinate
or a combining coordinate. On a point coordinate the acceptance clause of the
combined game is obtained from the acceptance clause of the original game by
the affine change of parameter `directCombinedRebaseParameter`: the parameter
presenting the sampled point on the sampled line of the combined space presents
the point part of the sampled point on the image line, after the shift. On a
combining coordinate the sampled line lies in a fiber of the projection to the
point coordinates, the combining part of the sampled point is the affine
function `α₀ + t w` of the parameter, and the acceptance clause of the combined
game is the identity `∑ r (α₀ + t w)_r b_r = ∑ r α_r b_r`.
All declarations below are formalization-only support for
`lem:ld-combined-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:526-568`
-/
@[expose] public section
open scoped BigOperators
namespace MIPStarRE.QPBT
open LIDT.MIPStarRE.LDT
open LIDT.MIPStarRE.LDT.Preliminaries
noncomputable section
/-! ## The two parts of a point along a line -/
/-- The coordinate direction of a point coordinate of the combined dimension
has vanishing combining part. -/
@[simp] theorem directCombinedCoefficientPart_coordinateDirection_pointVar
(D : _root_.MIPStarRE.QPBT.DirectLdParams) (j : Fin D.m) :
_root_.MIPStarRE.QPBT.directCombinedCoefficientPart D
(_root_.MIPStarRE.QPBT.coordinateDirection (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j)) = 0 := by
funext r
show (_root_.MIPStarRE.QPBT.coordinateDirection (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j) :
Fin (D.m + D.k) → _root_.MIPStarRE.QPBT.DirectScalarQ D) (_root_.MIPStarRE.QPBT.combinedCoefficientVar D.m D.k r) = 0
rw [_root_.MIPStarRE.QPBT.coordinateDirection,
Pi.single_eq_of_ne (_root_.MIPStarRE.QPBT.combinedCoefficientVar_ne_combinedPointVar D.m D.k r j)]
/-! ## Degree bounds at the combined parameters -/
/-! ## Evaluation of the combined answers -/
/-! ## Structural clauses of the win predicate -/
/-! ## The acceptance clause on a point coordinate -/
/-! ## The branch-wise acceptance transport -/
/-- The acceptance transport of `lem:ld-combined-value` on one ordered type
pair: the relabelling of `def:ld-combined-strategy` sends an answer pair
accepted by the win predicate of the original game at the measured questions to
an answer pair accepted by the win predicate of the combined game. -/
def DirectCombinedWinTransport (D : _root_.MIPStarRE.QPBT.DirectLdParams) (t₁ t₂ : _root_.MIPStarRE.QPBT.LdType)
(sample : _root_.MIPStarRE.QPBT.DirectLdSpace D.combined) : Prop :=
∀ a b : _root_.MIPStarRE.QPBT.DirectLdAnswer D,
_root_.MIPStarRE.QPBT.directLdWinPredicate D
(_root_.MIPStarRE.QPBT.directCombinedMeasuredQuestion D (t₁, _root_.MIPStarRE.QPBT.directLdMap D.combined t₁ sample))
(_root_.MIPStarRE.QPBT.directCombinedMeasuredQuestion D (t₂, _root_.MIPStarRE.QPBT.directLdMap D.combined t₂ sample))
a b = true →
_root_.MIPStarRE.QPBT.directLdWinPredicate D.combined
(t₁, _root_.MIPStarRE.QPBT.directLdMap D.combined t₁ sample) (t₂, _root_.MIPStarRE.QPBT.directLdMap D.combined t₂ sample)
(_root_.MIPStarRE.QPBT.directCombinedAnswerMap D (t₁, _root_.MIPStarRE.QPBT.directLdMap D.combined t₁ sample) a)
(_root_.MIPStarRE.QPBT.directCombinedAnswerMap D (t₂, _root_.MIPStarRE.QPBT.directLdMap D.combined t₂ sample) b) = true
end
end MIPStarRE.QPBT
Source