Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Palomar / ExtractionBridge

Definition
QPBT_QPBT_Palomar_ExtractionBridge

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

qpbt

This bundle converts registered Pauli and qubit soundness witnesses into compact Palomar extraction data. It specializes qudit and qubit operator errors, transports the ideal state, and identifies compact state errors with the registered quantities.

Principal definitions:

  • MIPStarRE.QPBT.PauliSoundnessWitness.toPalomar: converts a qudit soundness witness to compact extraction data.
  • MIPStarRE.QPBT.QubitSoundnessWitness.toPalomar: converts a qubit soundness witness to compact extraction data.
  • MIPStarRE.QPBT.Palomar.pauliAliceOperatorError: compact Alice qudit operator error.
  • MIPStarRE.QPBT.Palomar.pauliBobOperatorError: compact Bob qudit operator error.
  • MIPStarRE.QPBT.Palomar.qubitAliceOperatorError: compact Alice qubit error over original field outcomes.
  • MIPStarRE.QPBT.Palomar.qubitBobOperatorError: compact Bob qubit error over original field outcomes.
  • MIPStarRE.QPBT.PauliSoundnessWitness.idealExtractionState_toPalomar: identifies the compact ideal state.
  • MIPStarRE.QPBT.PauliSoundnessWitness.stateError_toPalomar: identifies the compact unsquared state error.

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/Palomar/ExtractionBridge.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_LIDT_MIPStarRE_Quantum_Measurement
import Definitions.Def_QPBT_QPBT_Algebra_FieldBasis
import Definitions.Def_QPBT_QPBT_Algebra_LowDegreeCode
import Definitions.Def_QPBT_QPBT_Algebra_Pauli
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Palomar_Bridge
import Definitions.Def_QPBT_QPBT_Palomar_Definitions
import Definitions.Def_QPBT_QPBT_State
import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest
import Definitions.Def_QPBT_QPBT_Test_QubitForm
import Definitions.Def_QPBT_QPBT_Test_SoundnessDefs
import Mathlib
import Mathlib.Algebra.MvPolynomial.Equiv
import Mathlib.Analysis.MeanInequalitiesPow
import Mathlib.Analysis.SpecialFunctions.Pow.Continuity
import Mathlib.Analysis.SpecificLimits.Basic

namespace LIDT.MIPStarRE.Quantum
end LIDT.MIPStarRE.Quantum
namespace MIPStarRE.QPBT
end MIPStarRE.QPBT
namespace MIPStarRE.QPBT.Palomar
end MIPStarRE.QPBT.Palomar
namespace MIPStarRE.QPBT.PauliSoundnessWitness
end MIPStarRE.QPBT.PauliSoundnessWitness
namespace MIPStarRE.QPBT.QubitSoundnessWitness
end MIPStarRE.QPBT.QubitSoundnessWitness

/-!
# Exact bridges for compact extraction errors

This module converts the existing qudit and qubit soundness witnesses to the
compact extraction witness.  It specializes the generic errors to the raw
prescribed-answer effects and proves exact equality with the established
soundness quantities.  No soundness existence or numerical estimate is added.

The legacy import form is required because the existing soundness modules have
not yet been converted to Lean's module system.

## References

`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1431-1491`;
`references/qpbt-paper/04_preliminaries.tex:1180-1228`.
-/

@[expose] public section

open scoped BigOperators Matrix

namespace MIPStarRE.QPBT

open LIDT.MIPStarRE.Quantum

noncomputable section

namespace PauliSoundnessWitness

/-- Convert a qudit soundness witness to the compact extraction witness. -/
def toPalomar {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P)}
    (w : _root_.MIPStarRE.QPBT.PauliSoundnessWitness P S) :
    _root_.MIPStarRE.QPBT.Palomar.ExtractionWitness (R := _root_.MIPStarRE.QPBT.PauliRegister P) (_root_.MIPStarRE.QPBT.Palomar.Strategy.ofStrategy S) where
  ιA' := w.ιA'
  ιB' := w.ιB'
  φA := w.φA
  φB := w.φB
  aux := w.aux
  aux_norm := w.aux_norm

/-- The compact ideal state is exactly the existing qudit ideal state. -/
@[simp] theorem idealExtractionState_toPalomar
    (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.PauliSoundnessWitness P S) :
    _root_.MIPStarRE.QPBT.Palomar.idealExtractionState w.toPalomar = _root_.MIPStarRE.QPBT.idealState P w.aux := rfl

/-- The compact unsquared state error is exactly the existing qudit state error. -/
@[simp] theorem stateError_toPalomar
    (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.PauliSoundnessWitness P S) :
    _root_.MIPStarRE.QPBT.Palomar.stateError w.toPalomar =
      ‖_root_.MIPStarRE.QPBT.isometryTensor w.φA w.φB S.ψ - _root_.MIPStarRE.QPBT.idealState P w.aux‖ := rfl

end PauliSoundnessWitness

namespace QubitSoundnessWitness

/-- Convert a qubit soundness witness to the compact extraction witness. -/
def toPalomar {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P)}
    (w : _root_.MIPStarRE.QPBT.QubitSoundnessWitness P S) :
    _root_.MIPStarRE.QPBT.Palomar.ExtractionWitness (R := _root_.MIPStarRE.QPBT.QubitRegister P) (_root_.MIPStarRE.QPBT.Palomar.Strategy.ofStrategy S) where
  ιA' := w.ιA'
  ιB' := w.ιB'
  φA := w.φA
  φB := w.φB
  aux := w.aux
  aux_norm := w.aux_norm

/-- The compact ideal state is exactly the existing qubit ideal state. -/
@[simp] theorem idealExtractionState_toPalomar
    (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.QubitSoundnessWitness P S) :
    _root_.MIPStarRE.QPBT.Palomar.idealExtractionState w.toPalomar = _root_.MIPStarRE.QPBT.idealQubitState P w.aux := rfl

/-- The compact unsquared state error is exactly the existing qubit state error. -/
@[simp] theorem stateError_toPalomar
    (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.QubitSoundnessWitness P S) :
    _root_.MIPStarRE.QPBT.Palomar.stateError w.toPalomar =
      ‖_root_.MIPStarRE.QPBT.isometryTensor w.φA w.φB S.ψ - _root_.MIPStarRE.QPBT.idealQubitState P w.aux‖ := rfl

end QubitSoundnessWitness

namespace Palomar

/-- Alice's compact qudit error specialized to raw prescribed-answer effects. -/
def pauliAliceOperatorError (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.PauliSoundnessWitness P S) (W : _root_.MIPStarRE.QPBT.PauliKind) : ℝ :=
  _root_.MIPStarRE.QPBT.Palomar.aliceOperatorError w.toPalomar
    (fun u => _root_.MIPStarRE.QPBT.liftedAEffect S w.φA
      ((S.A (_root_.MIPStarRE.QPBT.pauliQuestion P W)).effect (.pauliOutcome u)))
    (fun u => _root_.MIPStarRE.QPBT.pauliProjOnA'' P W u)

/-- Bob's compact qudit error specialized to raw prescribed-answer effects. -/
def pauliBobOperatorError (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.PauliSoundnessWitness P S) (W : _root_.MIPStarRE.QPBT.PauliKind) : ℝ :=
  _root_.MIPStarRE.QPBT.Palomar.bobOperatorError w.toPalomar
    (fun u => _root_.MIPStarRE.QPBT.liftedBEffect S w.φB
      ((S.B (_root_.MIPStarRE.QPBT.pauliQuestion P W)).effect (.pauliOutcome u)))
    (fun u => _root_.MIPStarRE.QPBT.pauliProjOnB'' P W u)

/-- Alice's compact qubit error, still summed over the original field outcomes. -/
def qubitAliceOperatorError (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.QubitSoundnessWitness P S) (W : _root_.MIPStarRE.QPBT.PauliKind) : ℝ :=
  _root_.MIPStarRE.QPBT.Palomar.aliceOperatorError w.toPalomar
    (fun u => _root_.MIPStarRE.QPBT.liftedQubitAEffect S w.φA
      ((S.A (_root_.MIPStarRE.QPBT.pauliQuestion P W)).effect (.pauliOutcome u)))
    (fun u => _root_.MIPStarRE.QPBT.qubitProjOnA'' P W u)

/-- Bob's compact qubit error, still summed over the original field outcomes. -/
def qubitBobOperatorError (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.QubitSoundnessWitness P S) (W : _root_.MIPStarRE.QPBT.PauliKind) : ℝ :=
  _root_.MIPStarRE.QPBT.Palomar.bobOperatorError w.toPalomar
    (fun u => _root_.MIPStarRE.QPBT.liftedQubitBEffect S w.φB
      ((S.B (_root_.MIPStarRE.QPBT.pauliQuestion P W)).effect (.pauliOutcome u)))
    (fun u => _root_.MIPStarRE.QPBT.qubitProjOnB'' P W u)

/-- The compact Alice qudit sum equals the source-facing raw Pauli distance. -/
@[simp] theorem pauliAliceOperatorError_eq
    (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.PauliSoundnessWitness P S) (W : _root_.MIPStarRE.QPBT.PauliKind) :
    _root_.MIPStarRE.QPBT.Palomar.pauliAliceOperatorError P S w W = _root_.MIPStarRE.QPBT.rawPauliOperatorDistanceA P S w W := rfl

/-- The compact Bob qudit sum equals the source-facing raw Pauli distance. -/
@[simp] theorem pauliBobOperatorError_eq
    (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.PauliSoundnessWitness P S) (W : _root_.MIPStarRE.QPBT.PauliKind) :
    _root_.MIPStarRE.QPBT.Palomar.pauliBobOperatorError P S w W = _root_.MIPStarRE.QPBT.rawPauliOperatorDistanceB P S w W := rfl

/-- The compact Alice qubit sum equals the established qubit distance. -/
@[simp] theorem qubitAliceOperatorError_eq
    (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.QubitSoundnessWitness P S) (W : _root_.MIPStarRE.QPBT.PauliKind) :
    _root_.MIPStarRE.QPBT.Palomar.qubitAliceOperatorError P S w W = _root_.MIPStarRE.QPBT.qubitOperatorDistanceA P S w W := rfl

/-- The compact Bob qubit sum equals the established qubit distance. -/
@[simp] theorem qubitBobOperatorError_eq
    (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.pauliBasisTest P))
    (w : _root_.MIPStarRE.QPBT.QubitSoundnessWitness P S) (W : _root_.MIPStarRE.QPBT.PauliKind) :
    _root_.MIPStarRE.QPBT.Palomar.qubitBobOperatorError P S w W = _root_.MIPStarRE.QPBT.qubitOperatorDistanceB P S w W := rfl







end Palomar

end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Palomar/ExtractionBridge.lean#L36-L150

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