Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Test / Completeness

Definition
QPBT_QPBT_Test_Completeness

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

qpbt

This bundle defines the symmetric Pauli basis test and its honest strategy. It packages the maximally entangled Pauli and Magic Square state, identifies the typed question sampler, and records symmetry of both the question distribution and decision predicate.

Principal definitions:

  • MIPStarRE.QPBT.pauliBasisTestSymm: the symmetric presentation of the Pauli basis test.
  • MIPStarRE.QPBT.honestStrategy: the honest completeness strategy.
  • MIPStarRE.QPBT.map_uniformDistribution_congr: congruence of uniform push-forwards.
  • MIPStarRE.QPBT.bind_map_uniformDistribution_congr: congruence for uniformly seeded typed binds.
  • MIPStarRE.QPBT.pauliQuestionDistribution_eq_typedCL: identifies the Pauli sampler with the typed conditional-linear distribution.
  • MIPStarRE.QPBT.pauliQuestionDistribution_symm: symmetry of the Pauli question distribution.
  • MIPStarRE.QPBT.pauliWinPredicate_symm: symmetry of the Pauli decision predicate.

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/Test/Completeness.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_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_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_Algebra_Pauli
import Definitions.Def_QPBT_QPBT_Games_CondLinear
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Games_DistributionAux
import Definitions.Def_QPBT_QPBT_Games_StrategyClasses
import Definitions.Def_QPBT_QPBT_Games_TypedCondLinear
import Definitions.Def_QPBT_QPBT_Observables_WinImplications_Setup
import Definitions.Def_QPBT_QPBT_State
import Definitions.Def_QPBT_QPBT_Test_Completeness_HonestStrategy_MeasurementFamily
import Definitions.Def_QPBT_QPBT_Test_MagicSquare
import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_PerfectStrategy_Observables
import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest
import Mathlib

namespace LIDT.MIPStarRE.LDT
end LIDT.MIPStarRE.LDT
namespace MIPStarRE.QPBT
end MIPStarRE.QPBT

/-!
# Completeness of the Pauli basis test

The Pauli basis test admits a symmetric presentation and a value-one SPCC
strategy.

## References

The source statement is blueprint
`lem:pauli-completeness`, from
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1229-1421`.
-/

@[expose] public section

open scoped BigOperators

namespace MIPStarRE.QPBT

open LIDT.MIPStarRE.LDT

noncomputable section

/-! ### Auxiliary facts about the Pauli question sampler

The two lemmas of this section are formalization-only.  They record that the
uniform law on the Pauli edge type, and the typed bind seeded by it, do not
depend on the finiteness and decidability data used to form them.  The general
identities about finite weighted distributions that this file uses are stated
in `MIPStarRE/QPBT/Games/DistributionAux.lean`.
-/

/-- Formalization-only auxiliary: the push-forward of a uniform distribution
does not depend on the finiteness and decidability data used to form it. -/
theorem map_uniformDistribution_congr {α γ : Type*}
    (i₁ i₂ : Fintype α) (j₁ j₂ : DecidableEq α) (k₁ k₂ : Nonempty α)
    (d₁ d₂ : DecidableEq γ) (e : α → γ) :
    @_root_.LIDT.MIPStarRE.LDT.Distribution.map α γ d₁ (@_root_.LIDT.MIPStarRE.LDT.uniformDistribution α i₁ j₁ k₁) e =
      @_root_.LIDT.MIPStarRE.LDT.Distribution.map α γ d₂ (@_root_.LIDT.MIPStarRE.LDT.uniformDistribution α i₂ j₂ k₂) e := by
  have hi : i₁ = i₂ := Subsingleton.elim _ _
  have hj : j₁ = j₂ := funext fun _ => funext fun _ => Subsingleton.elim _ _
  have hd : d₁ = d₂ := funext fun _ => funext fun _ => Subsingleton.elim _ _
  subst hi
  subst hj
  subst hd
  rfl

/-- Formalization-only auxiliary: a uniformly seeded typed bind does not depend
on the finiteness and decidability data used to form it. -/
theorem bind_map_uniformDistribution_congr {α β γ : Type*}
    (i₁ i₂ : Fintype β) (j₁ j₂ : DecidableEq β) (k₁ k₂ : Nonempty β)
    (d₁ d₂ : DecidableEq γ) (μ : _root_.LIDT.MIPStarRE.LDT.Distribution α) (g : α → β → γ) :
    @_root_.MIPStarRE.QPBT.Distribution.bind α γ d₁ μ
        (fun a => @_root_.LIDT.MIPStarRE.LDT.Distribution.map β γ d₁ (@_root_.LIDT.MIPStarRE.LDT.uniformDistribution β i₁ j₁ k₁) (g a)) =
      @_root_.MIPStarRE.QPBT.Distribution.bind α γ d₂ μ
        (fun a => @_root_.LIDT.MIPStarRE.LDT.Distribution.map β γ d₂ (@_root_.LIDT.MIPStarRE.LDT.uniformDistribution β i₂ j₂ k₂) (g a)) := by
  have hi : i₁ = i₂ := Subsingleton.elim _ _
  have hj : j₁ = j₂ := funext fun _ => funext fun _ => Subsingleton.elim _ _
  have hd : d₁ = d₂ := funext fun _ => funext fun _ => Subsingleton.elim _ _
  subst hi
  subst hj
  subst hd
  rfl

/-! ### The Pauli question sampler as a typed conditionally linear distribution -/

/-- `lem:pauli-question-typed-equality`: the Pauli question sampler equals the
distribution that `def:typed-cl-distributions` (`ch12_qpbt_games.tex`) produces
from the family `pauliCL` on the Pauli type graph. Both laws draw an ordered
pair of types whose unordered pair is an edge of the Pauli type graph, draw one
uniform seed in the Pauli seed space, and return the two types together with the
images of that common seed under the two selected maps. The common-level family
assertion is stated separately as `isTypedCondLinearFamily_pauliCL`. Blueprint
`ch13_qpbt_test.tex`, paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1115-1120`
and `references/qpbt-paper/07_types.tex:84-93`. -/
theorem pauliQuestionDistribution_eq_typedCL (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
    _root_.MIPStarRE.QPBT.pauliQuestionDistribution P =
      _root_.MIPStarRE.QPBT.typedCLDistribution _root_.MIPStarRE.QPBT.pauliEdges (by
        refine ⟨Sym2.mk (.point .X) (.point .X), ?_⟩
        simp [_root_.MIPStarRE.QPBT.pauliEdges]) (_root_.MIPStarRE.QPBT.pauliCL P) (_root_.MIPStarRE.QPBT.pauliCL P) := by
  classical
  letI : Nonempty _root_.MIPStarRE.QPBT.PauliEdge := _root_.MIPStarRE.QPBT.pauliEdge_nonempty
  have himage : (Finset.univ : Finset _root_.MIPStarRE.QPBT.PauliEdge).image
      (Subtype.val : _root_.MIPStarRE.QPBT.PauliEdge → _root_.MIPStarRE.QPBT.PauliType × _root_.MIPStarRE.QPBT.PauliType) =
      (Finset.univ : Finset (_root_.MIPStarRE.QPBT.PauliType × _root_.MIPStarRE.QPBT.PauliType)).filter
        (fun ab => Sym2.mk ab.1 ab.2 ∈ _root_.MIPStarRE.QPBT.pauliEdges) := by
    ext ab
    constructor
    · intro hab
      obtain ⟨e, -, rfl⟩ := Finset.mem_image.mp hab
      exact Finset.mem_filter.mpr ⟨Finset.mem_univ _, e.2⟩
    · intro hab
      exact Finset.mem_image.mpr
        ⟨⟨ab, (Finset.mem_filter.mp hab).2⟩, Finset.mem_univ _, rfl⟩
  have hmine : _root_.MIPStarRE.QPBT.Distribution.bind
      (_root_.LIDT.MIPStarRE.LDT.Distribution.uniformOnFinset ((Finset.univ : Finset (_root_.MIPStarRE.QPBT.PauliType × _root_.MIPStarRE.QPBT.PauliType)).filter
        (fun ab => Sym2.mk ab.1 ab.2 ∈ _root_.MIPStarRE.QPBT.pauliEdges)))
      (fun uv => (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (_root_.MIPStarRE.QPBT.PauliSpace P)).map fun z =>
        ((uv.1, _root_.MIPStarRE.QPBT.pauliCL P uv.1 z), (uv.2, _root_.MIPStarRE.QPBT.pauliCL P uv.2 z))) =
      _root_.MIPStarRE.QPBT.pauliQuestionDistribution P := by
    rw [_root_.MIPStarRE.QPBT.bind_uniformOnFinset_map _ (Subtype.val : _root_.MIPStarRE.QPBT.PauliEdge → _root_.MIPStarRE.QPBT.PauliType × _root_.MIPStarRE.QPBT.PauliType)
      Subtype.val_injective himage
      (fun uv z => ((uv.1, _root_.MIPStarRE.QPBT.pauliCL P uv.1 z), (uv.2, _root_.MIPStarRE.QPBT.pauliCL P uv.2 z)))]
    unfold _root_.MIPStarRE.QPBT.pauliQuestionDistribution
    exact _root_.MIPStarRE.QPBT.map_uniformDistribution_congr _ _ _ _ _ _ _ _ _
  rw [← hmine]
  simp only [_root_.MIPStarRE.QPBT.typedCLDistribution, _root_.MIPStarRE.QPBT.graphDistribution, _root_.MIPStarRE.QPBT.clDistribution,
    _root_.MIPStarRE.QPBT.Distribution.map_map]
  exact _root_.MIPStarRE.QPBT.bind_map_uniformDistribution_congr _ _ _ _ _ _ _ _ _ _



/-! ### Symmetry of the Pauli basis test -/

/-- Symmetry of the Pauli question distribution in the symmetric game appearing
in `lem:pauli-completeness`. It follows from the identification of the sampler
with the typed conditionally linear distribution of a single family, whose edge
law is a law on unordered pairs and is therefore symmetric. -/
theorem pauliQuestionDistribution_symm (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (x y : _root_.MIPStarRE.QPBT.PauliQuestion P) :
    (_root_.MIPStarRE.QPBT.pauliQuestionDistribution P).weight (x, y) =
      (_root_.MIPStarRE.QPBT.pauliQuestionDistribution P).weight (y, x) := by
  rw [_root_.MIPStarRE.QPBT.pauliQuestionDistribution_eq_typedCL P]
  exact _root_.MIPStarRE.QPBT.typedCLDistribution_symm _ _ _ (x, y)

/-- Symmetry of the Pauli decision predicate in the symmetric game appearing in
`lem:pauli-completeness`. -/
theorem pauliWinPredicate_symm (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (x y : _root_.MIPStarRE.QPBT.PauliQuestion P) (a b : _root_.MIPStarRE.QPBT.PauliAnswer P) :
    _root_.MIPStarRE.QPBT.pauliWinPredicate P x y a b = _root_.MIPStarRE.QPBT.pauliWinPredicate P y x b a := by
  obtain ⟨tA, xA⟩ := x
  obtain ⟨tB, xB⟩ := y
  -- Definitional reduction avoids module-private matcher equations from `simp`.
  dsimp only [_root_.MIPStarRE.QPBT.pauliWinPredicate]
  by_cases hT : tA = tB
  · subst hT
    rw [if_pos (rfl : tA = tA), if_pos (rfl : tA = tA)]
    rw [Bool.and_comm (_root_.MIPStarRE.QPBT.validPauliAnswer tA b) (_root_.MIPStarRE.QPBT.validPauliAnswer tA a)]
    exact congrArg (fun c => if _root_.MIPStarRE.QPBT.validPauliAnswer tA a && _root_.MIPStarRE.QPBT.validPauliAnswer tA b then c
      else false) (decide_eq_decide.mpr eq_comm)
  · cases hvA : _root_.MIPStarRE.QPBT.validPauliAnswer tA a
    · cases _root_.MIPStarRE.QPBT.validPauliAnswer tB b <;> rfl
    · cases hvB : _root_.MIPStarRE.QPBT.validPauliAnswer tB b
      · rfl
      · rw [Bool.true_and, if_pos (rfl : true = true),
          if_pos (rfl : true = true), if_neg hT, if_neg (Ne.symm hT)]
        rcases tA with (_|_)|(_|_)|(_|_)|(_|_)|(_|_)|_|(iA|jA) <;>
          rcases a with uA|fA|gA|bitsA|bitA|trA|hhA <;>
          (try exact Bool.noConfusion hvA) <;>
          rcases tB with (_|_)|(_|_)|(_|_)|(_|_)|(_|_)|_|(iB|jB) <;>
          rcases b with uB|fB|gB|bitsB|bitB|trB|hhB <;>
          (try exact Bool.noConfusion hvB) <;>
          rfl

/-- The symmetric presentation of the Pauli basis test. The field and basis
are those fixed by `P.model`; no additional model is quantified. -/
noncomputable def pauliBasisTestSymm (P : _root_.MIPStarRE.QPBT.AdmissibleParams) : _root_.MIPStarRE.QPBT.SymmetricGame where
  Question := _root_.MIPStarRE.QPBT.PauliQuestion P
  Answer := _root_.MIPStarRE.QPBT.PauliAnswer P
  μ := _root_.MIPStarRE.QPBT.pauliQuestionDistribution P
  μ_prob := (_root_.MIPStarRE.QPBT.pauliBasisTest P).μ_prob
  μ_symm := _root_.MIPStarRE.QPBT.pauliQuestionDistribution_symm P
  decide := _root_.MIPStarRE.QPBT.pauliWinPredicate P
  decide_symm := _root_.MIPStarRE.QPBT.pauliWinPredicate_symm P



/-- The honest strategy of `lem:pauli-completeness`: the total honest
measurement family of `MIPStarRE.QPBT.Test.Completeness.HonestStrategy.MeasurementFamily`
on the maximally entangled state of the Pauli register tensored with the Magic
Square qubit.  Blueprint `lem:pauli-completeness`, paper
`08_classical_and_quantum_low_degree_tests.tex:1237-1360`. -/
noncomputable def honestStrategy (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
    _root_.MIPStarRE.QPBT.SymmetricStrategy (_root_.MIPStarRE.QPBT.pauliBasisTestSymm P) where
  ι := _root_.MIPStarRE.QPBT.HonestIndex P
  ψ := _root_.MIPStarRE.QPBT.eprState (_root_.MIPStarRE.QPBT.HonestIndex P)
  ψ_norm := _root_.MIPStarRE.QPBT.eprState_norm (_root_.MIPStarRE.QPBT.HonestIndex P)
  ψ_swap := _root_.MIPStarRE.QPBT.reindexState_prodComm_eprState (_root_.MIPStarRE.QPBT.HonestIndex P)
  M := fun q => _root_.MIPStarRE.QPBT.honestMeasurement P q.1 q.2











end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Test/Completeness.lean#L45-L209

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