Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Combining / DirectLowDegree / Transport / Combining / RecoveryTransport

Definition
QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_RecoveryTransport

by Dengnifer · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

qpbt

This bundle defines the coordinate recovery maps for the combined space. It identifies a combined point with its point and combining parts and gives the direct equivalence that concatenates those coordinate vectors.

Principal definitions:

  • MIPStarRE.QPBT.directCombinedPointEquiv: identifies a combined-space point with the pair formed by its point part and combining part.
  • MIPStarRE.QPBT.directCombinedPointEquiv_apply: defines the direct combined-point equivalence that concatenates the point and coefficient-coordinate vectors.

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/RecoveryTransport.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_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 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`
-/

@[expose] public section

open scoped BigOperators MatrixOrder Matrix ComplexOrder

namespace MIPStarRE.QPBT

open LIDT.MIPStarRE.LDT hiding Measurement
open LIDT.MIPStarRE.LDT.Preliminaries
open LIDT.MIPStarRE.Quantum
open DistanceCalculus

noncomputable section

/-! ## The two blocks of a point of the combined space -/

/-- The identification of a point of the combined space with the pair formed by
its point part and its combining part. -/
def directCombinedPointEquiv (D : _root_.MIPStarRE.QPBT.DirectLdParams) :
    ((Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) × (Fin D.k → _root_.MIPStarRE.QPBT.DirectScalarQ D)) ≃
      (Fin D.combined.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) where
  toFun z := _root_.MIPStarRE.QPBT.combinedPoint z.1 z.2
  invFun z := (_root_.MIPStarRE.QPBT.directCombinedPointPart D z, _root_.MIPStarRE.QPBT.directCombinedCoefficientPart D z)
  left_inv z := by
    have h1 : _root_.MIPStarRE.QPBT.directCombinedPointPart D (_root_.MIPStarRE.QPBT.combinedPoint z.1 z.2) = z.1 :=
      _root_.MIPStarRE.QPBT.directCombinedPointPart_combinedPoint D z.1 z.2
    have h2 : _root_.MIPStarRE.QPBT.directCombinedCoefficientPart D (_root_.MIPStarRE.QPBT.combinedPoint z.1 z.2) = z.2 :=
      _root_.MIPStarRE.QPBT.directCombinedCoefficientPart_combinedPoint D z.1 z.2
    show (_root_.MIPStarRE.QPBT.directCombinedPointPart D (_root_.MIPStarRE.QPBT.combinedPoint z.1 z.2),
      _root_.MIPStarRE.QPBT.directCombinedCoefficientPart D (_root_.MIPStarRE.QPBT.combinedPoint z.1 z.2)) = z
    rw [h1, h2]
  right_inv z := by
    funext i
    show Sum.elim (fun j => z (finSumFinEquiv (Sum.inl j)))
      (fun r => z (finSumFinEquiv (Sum.inr r))) (finSumFinEquiv.symm i) = z i
    rcases hi : finSumFinEquiv.symm i with j | r
    · simp only [Sum.elim_inl]
      rw [← hi, Equiv.apply_symm_apply]
    · simp only [Sum.elim_inr]
      rw [← hi, Equiv.apply_symm_apply]

@[simp] theorem directCombinedPointEquiv_apply (D : _root_.MIPStarRE.QPBT.DirectLdParams)
    (z : (Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) × (Fin D.k → _root_.MIPStarRE.QPBT.DirectScalarQ D)) :
    _root_.MIPStarRE.QPBT.directCombinedPointEquiv D z = _root_.MIPStarRE.QPBT.combinedPoint z.1 z.2 := rfl

/-! ## The point measurement of the combined strategy -/





/-! ## The discrepancy estimate in the shape of the transport -/





/-! ## The two point relations -/





/-! ## The polynomial relation -/



end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/DirectLowDegree/Transport/Combining/RecoveryTransport.lean#L61-L88

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me