Direct Combined Recovery Relation Two
ProvedMIPStarRE.QPBT.directCombinedRecovery_relation_twoA uniform consistency defect is invariant under a bijective relabeling of its question type.
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_Preliminaries_Polynomials import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_AvgCongr import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic import Definitions.Def_LIDT_MIPStarRE_Quantum_Measurement 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_Combining_Parameters import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Polynomial import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Recovery import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_RecoveryTransport import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Strategy import Definitions.Def_QPBT_QPBT_Games_Consistency import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Test_LowDegreeGameMeasurements 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 namespace MIPStarRE.QPBT.DistanceCalculus end MIPStarRE.QPBT.DistanceCalculus /-! # The recovery of the polynomial-tuple measurements `lem:ld-combining-recovery` turns the three conclusions of `lem:ld-soundness` for the combined strategy at the combined parameters into the three conclusions for the original strategy at the original parameters, by post-processing the measurements of the combined game with the recovery map of `def:ld-combining-map`. The two point relations follow from the consistency-defect transport inequality. At a point `(u, α)` of the combined space the point measurement of the combined strategy is the point measurement of the original strategy at `u` post-processed by the combination with coefficients `α`, and the polynomial measurement of the combined game read at that point is the same measurement read through the recovery map and then combined with the same coefficients; the two families therefore differ only on the recovery discrepancy event, whose average is `(m + k) d / q`. The uniform law on the combined space is the product of the uniform laws on the point part and on the combining part, which is the reindexing along `directCombinedPointEquiv`. The polynomial relation is data processing: the recovered measurements are post-processings of the measurements of the combined game. ## Main statements * `directCombinedPointEquiv` — the point of the combined space with given point and combining parts, as an identification. * `directCombinedRecovery_relation_one` — the first conclusion. * `directCombinedRecovery_relation_two` — the second conclusion. * `directCombinedRecovery_relation_three` — the third conclusion. ## References * `references/neexp-paper/05_quantum_preliminaries.tex:1440-1503` * `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:413-458` * `blueprint/src/chapter/ch13_qpbt_test.tex:617-680` -/ open scoped BigOperators MatrixOrder Matrix ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open LIDT.MIPStarRE.LDT.Preliminaries open LIDT.MIPStarRE.Quantum open MIPStarRE.QPBT.DistanceCalculus /-! ## The two blocks of a point of the combined space -/ /-! ## The point measurement of the combined strategy -/ /-! ## The discrepancy estimate in the shape of the transport -/ /-! ## The two point relations -/
set_option maxHeartbeats 1600000 in
theorem MIPStarRE.QPBT.directCombinedRecovery_relation_two (D : _root_.MIPStarRE.QPBT.DirectLdParams)
(S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D))
(GA : _root_.MIPStarRE.QPBT.DirectPolyMeasTuple D.combined S.ιA) :
_root_.MIPStarRE.QPBT.consistencyDefect (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D))
(fun u outcome => _root_.MIPStarRE.QPBT.heteroKron
(((GA.postprocess (_root_.MIPStarRE.QPBT.directTupleOfCombinedTuple D)).postprocess
(_root_.MIPStarRE.QPBT.evalDirectPolyTupleAt u)).effect outcome) 1)
(fun u outcome => _root_.MIPStarRE.QPBT.heteroKron 1
(((S.B (_root_.MIPStarRE.QPBT.directLdPointQuestionOf D u)).postprocess
(_root_.MIPStarRE.QPBT.directLdPointValuesOrZero D)).effect outcome))
S.ψ ≤
_root_.MIPStarRE.QPBT.consistencyDefect
(_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin D.combined.m → _root_.MIPStarRE.QPBT.DirectScalarQ D))
(fun z outcome => _root_.MIPStarRE.QPBT.heteroKron
((GA.postprocess (_root_.MIPStarRE.QPBT.evalDirectPolyTupleAt (D := D.combined) z)).effect
outcome) 1)
(fun z outcome => _root_.MIPStarRE.QPBT.heteroKron 1
((((_root_.MIPStarRE.QPBT.directCombinedStrategy D S).B
(_root_.MIPStarRE.QPBT.directLdPointQuestionOf D.combined z)).postprocess
(_root_.MIPStarRE.QPBT.directLdPointValuesOrZero D.combined)).effect outcome))
S.ψ +
((D.combined.m * D.d : ℕ) : ℝ) / D.q := by sorry