Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Palomar / PauliExtractionBridge

Definition
QPBT_QPBT_Palomar_PauliExtractionBridge

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

qpbt

This bundle bridges compact Palomar extraction witnesses with the registered Pauli test domain. It converts numerical parameters and qudit or qubit witnesses, proves the round-trip parameter identities, and identifies the compact error functions with their library counterparts.

Principal definitions:

  • The admissible-parameter conversion maps compact numerical data into the registered Pauli parameter record.
  • The qudit and qubit witness conversions produce compact extraction strategies from their respective soundness witnesses.
  • The registered admissibility predicate is exposed for the compact size assumptions.
  • The two parameter conversions satisfy the expected round-trip identities.
  • The compact and registered error quantities agree, including the qudit state-error specialization.

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/PauliExtractionBridge.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_LowDegreeCode
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Palomar_Definitions
import Definitions.Def_QPBT_QPBT_Palomar_PauliGameBridge
import Definitions.Def_QPBT_QPBT_Palomar_PauliGameStrategyBridge
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 MIPStarRE.QPBT.Palomar
end MIPStarRE.QPBT.Palomar

/-!
# Exact bridges for compact Pauli extraction quantities

This module identifies the compact Pauli parameter record, prescribed-answer
effects, ideal projectors, witnesses, and extraction errors with the registered
QPBT definitions.  Every comparison is an equality; no quantitative estimate
or soundness assumption is introduced here.

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

## References

`references/qpbt-paper/04_preliminaries.tex:1052-1208`;
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1229-1491`.
-/

@[expose] public section

namespace MIPStarRE.QPBT.Palomar

noncomputable section

attribute [local instance] _root_.MIPStarRE.QPBT.Palomar.compactPauliQuestionDecidableEq

/-- The compact admissibility witness has the registered named proposition. -/
theorem PauliParams.is_admissible_size (P : _root_.MIPStarRE.QPBT.Palomar.PauliParams) :
    _root_.MIPStarRE.QPBT.IsAdmissibleSize P.q :=
  P.hq

/-- Copy compact numerical parameters into the registered Pauli-test domain. -/
def PauliParams.toAdmissibleParams (P : _root_.MIPStarRE.QPBT.Palomar.PauliParams) :
    _root_.MIPStarRE.QPBT.AdmissibleParams where
  q := P.q
  m := P.m
  d := P.d
  hd := P.hd
  hq := P.is_admissible_size
  hdvd := P.hdvd

/-- Compact parameters are recovered exactly after conversion to the library record. -/
@[simp] theorem PauliParams.ofAdmissibleParams_toAdmissibleParams (P : _root_.MIPStarRE.QPBT.Palomar.PauliParams) :
    _root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P.toAdmissibleParams = P := by
  cases P
  rfl

/-- Registered parameters are recovered exactly after conversion to the compact record. -/
@[simp] theorem PauliParams.toAdmissibleParams_ofAdmissibleParams
    (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
    (_root_.MIPStarRE.QPBT.Palomar.PauliParams.ofAdmissibleParams P).toAdmissibleParams = P := by
  cases P
  rfl

/-- The compact error function is definitionally the registered `deltaQld`. -/
@[simp] theorem deltaQld_eq_library (a b epsilon : ℝ) (m d q : ℕ) :
    _root_.MIPStarRE.QPBT.Palomar.deltaQld a b epsilon m d q = _root_.MIPStarRE.QPBT.deltaQld a b epsilon m d q :=
  rfl











/-- Convert a registered qudit soundness witness to the compact strategy. -/
def ExtractionWitness.ofPauliSoundnessWitness {P : _root_.MIPStarRE.QPBT.Palomar.PauliParams}
    {S : _root_.MIPStarRE.QPBT.Palomar.PauliStrategy P
      (_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size).K}
    (w : _root_.MIPStarRE.QPBT.PauliSoundnessWitness P.toAdmissibleParams
      (_root_.MIPStarRE.QPBT.Palomar.pauliStrategyToLibrary P.toAdmissibleParams S)) :
    _root_.MIPStarRE.QPBT.Palomar.ExtractionWitness (R := _root_.MIPStarRE.QPBT.Palomar.PauliRegister P
      (_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size).K) S where
  ιA' := w.ιA'
  ιB' := w.ιB'
  φA := w.φA
  φB := w.φB
  aux := w.aux
  aux_norm := w.aux_norm

/-- Convert a registered qubit soundness witness to the compact strategy. -/
def ExtractionWitness.ofQubitSoundnessWitness {P : _root_.MIPStarRE.QPBT.Palomar.PauliParams}
    {S : _root_.MIPStarRE.QPBT.Palomar.PauliStrategy P
      (_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size).K}
    (w : _root_.MIPStarRE.QPBT.QubitSoundnessWitness P.toAdmissibleParams
      (_root_.MIPStarRE.QPBT.Palomar.pauliStrategyToLibrary P.toAdmissibleParams S)) :
    _root_.MIPStarRE.QPBT.Palomar.ExtractionWitness (R := _root_.MIPStarRE.QPBT.Palomar.QubitRegister P
      (_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size).basisDim) S where
  ιA' := w.ιA'
  ιB' := w.ιB'
  φA := w.φA
  φB := w.φB
  aux := w.aux
  aux_norm := w.aux_norm

/-- The compact qudit state error is exactly the registered unsquared state error. -/
@[simp] theorem stateError_ofPauliSoundnessWitness {P : _root_.MIPStarRE.QPBT.Palomar.PauliParams}
    {S : _root_.MIPStarRE.QPBT.Palomar.PauliStrategy P
      (_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size).K}
    (w : _root_.MIPStarRE.QPBT.PauliSoundnessWitness P.toAdmissibleParams
      (_root_.MIPStarRE.QPBT.Palomar.pauliStrategyToLibrary P.toAdmissibleParams S)) :
    _root_.MIPStarRE.QPBT.Palomar.stateError (_root_.MIPStarRE.QPBT.Palomar.ExtractionWitness.ofPauliSoundnessWitness w) =
      ‖_root_.MIPStarRE.QPBT.isometryTensor w.φA w.φB
          (_root_.MIPStarRE.QPBT.Palomar.pauliStrategyToLibrary P.toAdmissibleParams S).ψ -
        _root_.MIPStarRE.QPBT.idealState P.toAdmissibleParams w.aux‖ :=
  rfl

/-- The compact qubit state error is exactly the registered unsquared state error. -/
@[simp] theorem stateError_ofQubitSoundnessWitness {P : _root_.MIPStarRE.QPBT.Palomar.PauliParams}
    {S : _root_.MIPStarRE.QPBT.Palomar.PauliStrategy P
      (_root_.MIPStarRE.QPBT.fixedFieldModel P.q P.is_admissible_size).K}
    (w : _root_.MIPStarRE.QPBT.QubitSoundnessWitness P.toAdmissibleParams
      (_root_.MIPStarRE.QPBT.Palomar.pauliStrategyToLibrary P.toAdmissibleParams S)) :
    _root_.MIPStarRE.QPBT.Palomar.stateError (_root_.MIPStarRE.QPBT.Palomar.ExtractionWitness.ofQubitSoundnessWitness w) =
      ‖_root_.MIPStarRE.QPBT.isometryTensor w.φA w.φB
          (_root_.MIPStarRE.QPBT.Palomar.pauliStrategyToLibrary P.toAdmissibleParams S).ψ -
        _root_.MIPStarRE.QPBT.idealQubitState P.toAdmissibleParams w.aux‖ :=
  rfl









end

end MIPStarRE.QPBT.Palomar
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Palomar/PauliExtractionBridge.lean#L32-L182

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