Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Test / Completeness / HonestStrategy

Definition
QPBT_QPBT_Test_Completeness_HonestStrategy

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

qpbt

This bundle defines the honest generalized-Pauli strategy for completeness of the Pauli basis test. It coarse-grains the Pauli basis measurement into trace, point, axis-line, diagonal-line, and Magic Square measurements and provides the relevant polynomial restriction operations.

Principal definitions:

  • MIPStarRE.QPBT.pauliBasisMeasurement: the generalized Pauli basis measurement.
  • MIPStarRE.QPBT.pauliTraceBit: the binary trace bit reported by the honest Pair/W measurement.
  • MIPStarRE.QPBT.pauliTraceMeasurement: the trace-bit coarse-graining.
  • MIPStarRE.QPBT.pauliPointMeasurement: the point-value coarse-graining.
  • MIPStarRE.QPBT.restrictToAxisLine: restricts a multivariate polynomial to an axis-parallel line.
  • MIPStarRE.QPBT.pauliALineMeasurement: the honest axis-line coarse-graining.
  • MIPStarRE.QPBT.pauliDLineMeasurement: the honest diagonal-line coarse-graining.
  • MIPStarRE.QPBT.pauliMagicCellMeasurement: the nine Magic Square cell measurements.

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/HonestStrategy.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_FiniteMatrix_Basic
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_NormalizedTrace
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_Algebra_PauliTheorems
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Games_Sandwich_Support
import Definitions.Def_QPBT_QPBT_Observables_ExpandedCommutation
import Definitions.Def_QPBT_QPBT_Observables_LineDefs
import Definitions.Def_QPBT_QPBT_Observables_LineMeasurement_Restriction
import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame
import Definitions.Def_QPBT_QPBT_Test_MagicSquare
import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_Basic
import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_PerfectStrategy
import Definitions.Def_QPBT_QPBT_Test_MagicSquareTheorems_PerfectStrategy_Measurements
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 LIDT.MIPStarRE.Quantum
end LIDT.MIPStarRE.Quantum
namespace MIPStarRE.QPBT
end MIPStarRE.QPBT

/-!
# The honest Pauli basis measurements of the completeness proof

This module builds the measurements used by the honest strategy of
`lem:pauli-completeness`: the generalized Pauli basis measurement in a fixed
basis `W`, and its coarse-graining by the binary trace
`h ↦ tr(g_h(u_W) r_W)` which the source calls `A` (for `W = X`) and `B`
(for `W = Z`).  The main results are the observable identity

  `A_0 - A_1 = τ^W(ind_m(u_W) r_W)`

of `eq:finally-got-an-observable`, and the resulting commutation law

  `𝒪_A 𝒪_B = (-1)^γ 𝒪_B 𝒪_A`

with `γ` the phase bit `eq:gamma-value`.  When `γ ≠ 0` the two observables
anticommute, so `thm:ms-from-ac` produces the Magic Square part of the honest
strategy.

## References

The construction is the strategy displayed in the proof of
`lem:pauli-completeness`,
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1237-1360`;
blueprint `lem:pauli-completeness`.
-/

@[expose] public section

open scoped BigOperators Matrix MatrixOrder ComplexOrder

namespace MIPStarRE.QPBT

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

noncomputable section

variable {K ι : Type*} [Field K] [Fintype K] [DecidableEq K] [Algebra (ZMod 2) K]
  [Fintype ι] [DecidableEq ι]

/-! ### The generalized Pauli basis measurement -/

/-- Every generalized Pauli projector is a nonnegative operator.  The
positive semidefiniteness it repackages is `posSemidef_pauliProj`, blueprint
`def:generalized-pauli`, paper origin
`references/qpbt-paper/04_preliminaries.tex:1101-1122`. -/
theorem pauliProj_nonneg (W : _root_.MIPStarRE.QPBT.PauliKind) (e : ι → K) : 0 ≤ _root_.MIPStarRE.QPBT.pauliProj W e :=
  Matrix.nonneg_iff_posSemidef.mpr (_root_.MIPStarRE.QPBT.posSemidef_pauliProj W e)

/-- Every generalized Pauli projector is Hermitian. -/
theorem pauliProj_conjTranspose (W : _root_.MIPStarRE.QPBT.PauliKind) (e : ι → K) :
    (_root_.MIPStarRE.QPBT.pauliProj W e)ᴴ = _root_.MIPStarRE.QPBT.pauliProj W e :=
  (_root_.MIPStarRE.QPBT.posSemidef_pauliProj W e).isHermitian.eq

/-- The generalized Pauli basis measurement in basis `W`: the projective
measurement whose outcomes are the labels of blueprint `def:generalized-pauli`, paper origin
`references/qpbt-paper/04_preliminaries.tex:1101-1122`. -/
noncomputable def pauliBasisMeasurement (W : _root_.MIPStarRE.QPBT.PauliKind) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (ι → K) (ι → K) :=
  _root_.LIDT.MIPStarRE.Quantum.Measurement.ofSumEqOne (_root_.MIPStarRE.QPBT.pauliProj W) (_root_.MIPStarRE.QPBT.pauliProj_nonneg W) (_root_.MIPStarRE.QPBT.sum_pauliProj_eq_one W)

/-- The effect of the generalized Pauli basis measurement at outcome `e` is the
projector `τ^W_e` onto the corresponding generalized Pauli eigenspace. -/
@[simp] theorem pauliBasisMeasurement_effect (W : _root_.MIPStarRE.QPBT.PauliKind) (e : ι → K) :
    (_root_.MIPStarRE.QPBT.pauliBasisMeasurement W).effect e = _root_.MIPStarRE.QPBT.pauliProj W e := rfl

/-! ### Symmetry and Hermiticity of the generalized Pauli observables -/

omit [Fintype K] in
/-- Generalized Pauli observables are symmetric matrices in the computational
basis.  Symmetry is what makes the honest measurements consistent on the EPR
state used by `lem:pauli-completeness`, paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1237-1360`. -/
theorem tauObservable_transpose (W : _root_.MIPStarRE.QPBT.PauliKind) (a : ι → K) :
    (_root_.MIPStarRE.QPBT.tauObservable W a)ᵀ = _root_.MIPStarRE.QPBT.tauObservable W a := by
  haveI : CharP K 2 := (Algebra.charP_iff (ZMod 2) K 2).mp (ZMod.charP 2)
  have hswap : ∀ x y c : K, (x = y + c) ↔ (y = x + c) := by
    intro x y c
    constructor
    · rintro rfl
      rw [add_assoc, CharTwo.add_self_eq_zero, add_zero]
    · rintro rfl
      rw [add_assoc, CharTwo.add_self_eq_zero, add_zero]
  ext x y
  rw [Matrix.transpose_apply]
  cases W with
  | X =>
      refine Finset.prod_congr rfl fun i _ => ?_
      change (if y i = x i + a i then (1 : ℂ) else 0) = if x i = y i + a i then 1 else 0
      by_cases h : x i = y i + a i
      · rw [if_pos h, if_pos ((hswap _ _ _).mp h)]
      · rw [if_neg h, if_neg (fun hc => h ((hswap _ _ _).mp hc))]
  | Z =>
      refine Finset.prod_congr rfl fun i _ => ?_
      change (if y i = x i then _root_.MIPStarRE.QPBT.phaseSign (_root_.MIPStarRE.QPBT.binTrace K (a i * x i)) else 0) =
        if x i = y i then _root_.MIPStarRE.QPBT.phaseSign (_root_.MIPStarRE.QPBT.binTrace K (a i * y i)) else 0
      by_cases h : x i = y i
      · rw [h]
      · rw [if_neg h, if_neg (fun hc => h hc.symm)]

/-! ### Orthogonality of the generalized Pauli projectors

The generalized Pauli projectors in a fixed basis are pairwise orthogonal, so
every coarse-graining of a Pauli basis measurement is again projective.  This is
the projectivity used throughout the honest strategy of `lem:pauli-completeness`,
paper `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1364-1370`.
-/


/-- Every generalized Pauli projector is a projector. -/
theorem pauliProj_isProj (W : _root_.MIPStarRE.QPBT.PauliKind) (e : ι → K) : _root_.LIDT.MIPStarRE.Quantum.IsProj (_root_.MIPStarRE.QPBT.pauliProj W e) := by
  refine isStarProjection_iff'.2 ⟨?_, ?_⟩
  · simpa using _root_.MIPStarRE.QPBT.pauliProj_mul_pauliProj W e e
  · rw [Matrix.star_eq_conjTranspose, _root_.MIPStarRE.QPBT.pauliProj_conjTranspose]

/-- Every coarse-graining of a generalized Pauli basis measurement is
projective.  This is the projectivity of the honest Point, Line and Pauli
measurements in the proof of `lem:pauli-completeness`, paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1364-1370`. -/
theorem pauliBasisMeasurement_postprocess_projective {β : Type*} [Fintype β]
    [DecidableEq β] (W : _root_.MIPStarRE.QPBT.PauliKind) (g : (ι → K) → β) :
    _root_.MIPStarRE.QPBT.Measurement.IsProjective ((_root_.MIPStarRE.QPBT.pauliBasisMeasurement W).postprocess g) :=
  _root_.MIPStarRE.QPBT.SandwichProduct.postprocess_isProjective (_root_.MIPStarRE.QPBT.pauliBasisMeasurement W)
    (fun e => _root_.MIPStarRE.QPBT.pauliProj_isProj W e) g



/-! ### The honest Pair/W measurements

For an ambient question `ω = (u_X, u_Z, r_X, r_Z)` the honest player measures
the Pauli register in basis `W` and reports the binary trace
`tr(g_h(u_W) r_W)` of the resulting label.  These are the measurements `A` and
`B` of the proof of `lem:pauli-completeness`,
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1277-1286`.
-/

/-- The binary trace bit `tr(g_h(u) r)` reported by the honest Pair/W
measurement on the Pauli label `h`.  Paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1277-1286`. -/
noncomputable def pauliTraceBit (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) (r : _root_.MIPStarRE.QPBT.PauliScalar P) (h : _root_.MIPStarRE.QPBT.PauliRegister P) : ZMod 2 :=
  _root_.MIPStarRE.QPBT.fixedBinTrace P.model (_root_.MIPStarRE.QPBT.lowDegreeEnc h u * r)

/-- The honest Pair/W measurement `τ^W_{[tr(g_·(u) r) = β]}` of the proof of
`lem:pauli-completeness`: the generalized Pauli basis measurement coarse-grained
by the trace bit.  Paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1277-1286`,
blueprint `lem:pauli-completeness`. -/
noncomputable def pauliTraceMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
    (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) (r : _root_.MIPStarRE.QPBT.PauliScalar P) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (ZMod 2) (_root_.MIPStarRE.QPBT.PauliRegister P) :=
  (_root_.MIPStarRE.QPBT.pauliBasisMeasurement W).postprocess (_root_.MIPStarRE.QPBT.pauliTraceBit P u r)

/-- The effect of the honest Pair/`W` measurement at the bit `β` is the sum of
the generalized Pauli projectors over the labels whose trace bit equals `β`,
which is the coarse-grained projector `τ^W_{[tr(g_·(u) r) = β]}` of the paper. -/
theorem pauliTraceMeasurement_effect (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
    (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) (r : _root_.MIPStarRE.QPBT.PauliScalar P) (b : ZMod 2) :
    (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P W u r).effect b =
      ∑ h ∈ Finset.univ.filter (fun h : _root_.MIPStarRE.QPBT.PauliRegister P => _root_.MIPStarRE.QPBT.pauliTraceBit P u r h = b),
        _root_.MIPStarRE.QPBT.pauliProj W h := rfl

/-- Equation `eq:finally-got-an-observable`: the observable of the honest
Pair/W measurement is the generalized Pauli observable at the label
`ind_m(u) r`.  Paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1300-1315`. -/
theorem obsOf_pauliTraceMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
    (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) (r : _root_.MIPStarRE.QPBT.PauliScalar P) :
    _root_.MIPStarRE.QPBT.obsOf (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P W u r) =
      _root_.MIPStarRE.QPBT.tauObservable W (r • _root_.MIPStarRE.QPBT.indicatorVec u) := by
  classical
  have hdot : ∀ e : _root_.MIPStarRE.QPBT.PauliRegister P,
      dotProduct (r • _root_.MIPStarRE.QPBT.indicatorVec u) e = _root_.MIPStarRE.QPBT.lowDegreeEnc e u * r := by
    intro e
    rw [_root_.MIPStarRE.QPBT.lowDegreeEnc_eq_dotProduct]
    simp only [dotProduct, Finset.sum_mul, Pi.smul_apply, smul_eq_mul]
    exact Finset.sum_congr rfl fun y _ => by ring
  have hp : ∀ e : _root_.MIPStarRE.QPBT.PauliRegister P,
      _root_.MIPStarRE.QPBT.phaseSign (_root_.MIPStarRE.QPBT.binTrace (_root_.MIPStarRE.QPBT.PauliScalar P) (dotProduct (r • _root_.MIPStarRE.QPBT.indicatorVec u) e)) =
        _root_.MIPStarRE.QPBT.phaseSign (_root_.MIPStarRE.QPBT.pauliTraceBit P u r e) := by
    intro e
    rw [hdot e]
    rfl
  rw [_root_.MIPStarRE.QPBT.tauObservable_eq_sum_pauliProj,
    Finset.sum_congr rfl (fun e (_ : e ∈ Finset.univ) => by rw [hp e]),
    ← Finset.sum_filter_add_sum_filter_not (Finset.univ : Finset (_root_.MIPStarRE.QPBT.PauliRegister P))
      (fun e => _root_.MIPStarRE.QPBT.pauliTraceBit P u r e = 0)]
  have hfilter :
      (Finset.univ.filter fun e : _root_.MIPStarRE.QPBT.PauliRegister P => ¬ _root_.MIPStarRE.QPBT.pauliTraceBit P u r e = 0) =
        Finset.univ.filter fun e : _root_.MIPStarRE.QPBT.PauliRegister P => _root_.MIPStarRE.QPBT.pauliTraceBit P u r e = 1 := by
    ext e
    simp only [Finset.mem_filter, Finset.mem_univ, true_and]
    rcases _root_.MIPStarRE.QPBT.zmod_two_eq_zero_or_one (_root_.MIPStarRE.QPBT.pauliTraceBit P u r e) with h | h <;> simp [h]
  have h0 : ∑ e ∈ Finset.univ.filter (fun e : _root_.MIPStarRE.QPBT.PauliRegister P => _root_.MIPStarRE.QPBT.pauliTraceBit P u r e = 0),
      _root_.MIPStarRE.QPBT.phaseSign (_root_.MIPStarRE.QPBT.pauliTraceBit P u r e) • _root_.MIPStarRE.QPBT.pauliProj W e =
      (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P W u r).effect 0 := by
    rw [_root_.MIPStarRE.QPBT.pauliTraceMeasurement_effect]
    refine Finset.sum_congr rfl fun e he => ?_
    rw [(Finset.mem_filter.mp he).2]
    simp [_root_.MIPStarRE.QPBT.phaseSign]
  have h1 : ∑ e ∈ Finset.univ.filter (fun e : _root_.MIPStarRE.QPBT.PauliRegister P => ¬ _root_.MIPStarRE.QPBT.pauliTraceBit P u r e = 0),
      _root_.MIPStarRE.QPBT.phaseSign (_root_.MIPStarRE.QPBT.pauliTraceBit P u r e) • _root_.MIPStarRE.QPBT.pauliProj W e =
      -(_root_.MIPStarRE.QPBT.pauliTraceMeasurement P W u r).effect 1 := by
    rw [hfilter, _root_.MIPStarRE.QPBT.pauliTraceMeasurement_effect]
    calc ∑ e ∈ Finset.univ.filter (fun e : _root_.MIPStarRE.QPBT.PauliRegister P => _root_.MIPStarRE.QPBT.pauliTraceBit P u r e = 1),
          _root_.MIPStarRE.QPBT.phaseSign (_root_.MIPStarRE.QPBT.pauliTraceBit P u r e) • _root_.MIPStarRE.QPBT.pauliProj W e
        = ∑ e ∈ Finset.univ.filter (fun e : _root_.MIPStarRE.QPBT.PauliRegister P => _root_.MIPStarRE.QPBT.pauliTraceBit P u r e = 1),
            (-1 : ℂ) • _root_.MIPStarRE.QPBT.pauliProj W e :=
          Finset.sum_congr rfl fun e he => by
            rw [(Finset.mem_filter.mp he).2]
            norm_num [_root_.MIPStarRE.QPBT.phaseSign]
      _ = (-1 : ℂ) • ∑ e ∈ Finset.univ.filter
            (fun e : _root_.MIPStarRE.QPBT.PauliRegister P => _root_.MIPStarRE.QPBT.pauliTraceBit P u r e = 1), _root_.MIPStarRE.QPBT.pauliProj W e :=
          Finset.smul_sum.symm
      _ = _ := neg_one_smul ℂ _
  rw [h0, h1, ← sub_eq_add_neg]
  rfl

/-- Each effect of the honest Pair/W measurement is the spectral projector of
its observable, so the measurement is projective; part of the projectivity
assertion of the honest strategy in the proof of `lem:pauli-completeness`,
paper `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1364-1370`. -/
theorem pauliTraceMeasurement_effect_eq_reflectionEffect (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (W : _root_.MIPStarRE.QPBT.PauliKind) (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) (r : _root_.MIPStarRE.QPBT.PauliScalar P) (b : ZMod 2) :
    (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P W u r).effect b =
      _root_.MIPStarRE.QPBT.reflectionEffect (_root_.MIPStarRE.QPBT.tauObservable W (r • _root_.MIPStarRE.QPBT.indicatorVec u)) b := by
  rw [← _root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement, _root_.MIPStarRE.QPBT.reflectionEffect_obsOf_measurement]

/-- The honest Pair/W measurement is projective, as asserted for the honest
strategy in the proof of `lem:pauli-completeness`, paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1364-1370`. -/
theorem pauliTraceMeasurement_projective (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
    (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) (r : _root_.MIPStarRE.QPBT.PauliScalar P) :
    _root_.MIPStarRE.QPBT.Measurement.IsProjective (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P W u r) := by
  intro b
  rw [_root_.MIPStarRE.QPBT.pauliTraceMeasurement_effect_eq_reflectionEffect]
  exact _root_.MIPStarRE.QPBT.reflectionMeasurement_projective (_root_.MIPStarRE.QPBT.tauObservable W (r • _root_.MIPStarRE.QPBT.indicatorVec u))
    (_root_.MIPStarRE.QPBT.tauObservable_conjTranspose W _) (_root_.MIPStarRE.QPBT.tauObservable_sq W _) b

/-- The effects of the honest Pair/W measurement are symmetric matrices. -/
theorem pauliTraceMeasurement_effect_transpose (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
    (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) (r : _root_.MIPStarRE.QPBT.PauliScalar P) (b : ZMod 2) :
    ((_root_.MIPStarRE.QPBT.pauliTraceMeasurement P W u r).effect b)ᵀ =
      (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P W u r).effect b := by
  rw [_root_.MIPStarRE.QPBT.pauliTraceMeasurement_effect_eq_reflectionEffect]
  rcases _root_.MIPStarRE.QPBT.zmod_two_eq_zero_or_one b with rfl | rfl
  · simp only [_root_.MIPStarRE.QPBT.reflectionEffect, if_pos]
    rw [Matrix.transpose_smul, Matrix.transpose_add, Matrix.transpose_one,
      _root_.MIPStarRE.QPBT.tauObservable_transpose]
  · simp only [_root_.MIPStarRE.QPBT.reflectionEffect, if_neg one_ne_zero]
    rw [Matrix.transpose_smul, Matrix.transpose_sub, Matrix.transpose_one,
      _root_.MIPStarRE.QPBT.tauObservable_transpose]



/-! ### The honest Point/W measurements -/

/-- The honest Point/W measurement: the generalized Pauli basis measurement
coarse-grained by the value `g_h(u)` of the low-degree encoding at the point
`u`.  Paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1248-1261`. -/
noncomputable def pauliPointMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
    (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) : _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliScalar P) (_root_.MIPStarRE.QPBT.PauliRegister P) :=
  (_root_.MIPStarRE.QPBT.pauliBasisMeasurement W).postprocess (fun h => _root_.MIPStarRE.QPBT.lowDegreeEnc h u)

/-- The honest Point/W measurement is projective. -/
theorem pauliPointMeasurement_projective (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
    (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) :
    _root_.MIPStarRE.QPBT.Measurement.IsProjective (_root_.MIPStarRE.QPBT.pauliPointMeasurement P W u) :=
  _root_.MIPStarRE.QPBT.pauliBasisMeasurement_postprocess_projective W _



/-! ### Honest line measurements -/

/-- Restrict a multivariate polynomial to an axis-parallel line, retaining the
coefficients through degree `d`.  This is the degree-`d` answer used for the
axis-line clause of `lem:pauli-completeness`, paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1263-1273`. -/
noncomputable def restrictToAxisLine (L : _root_.MIPStarRE.QPBT.LdParams) (line : _root_.MIPStarRE.QPBT.LineDesc L)
    (g : MvPolynomial (Fin L.m) (_root_.MIPStarRE.QPBT.ScalarQ L)) : _root_.MIPStarRE.QPBT.DegPoly L L.d :=
  fun i => (_root_.MIPStarRE.QPBT.polynomialOnLine L line g).coeff i.val



/-- The honest axis-line measurement is the generalized Pauli basis
measurement coarse-grained by the degree-`d` restriction of `g_h` to the
canonical line carried by the question. -/
noncomputable def pauliALineMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (Fin (P.d + 1) → _root_.MIPStarRE.QPBT.PauliScalar P) (_root_.MIPStarRE.QPBT.PauliRegister P) :=
    (_root_.MIPStarRE.QPBT.pauliBasisMeasurement W).postprocess fun h =>
    _root_.MIPStarRE.QPBT.restrictToAxisLine P.toLdParams
      (_root_.MIPStarRE.QPBT.aLineDescOf P.toLdParams
        (_root_.MIPStarRE.QPBT.ldALineCL P.toLdParams (_root_.MIPStarRE.QPBT.pauliToLd P W z))) (_root_.MIPStarRE.QPBT.lowDegreeEncoding h)

/-- The honest axis-line measurement is projective. -/
theorem pauliALineMeasurement_projective (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) :
    _root_.MIPStarRE.QPBT.Measurement.IsProjective (_root_.MIPStarRE.QPBT.pauliALineMeasurement P W z) :=
  _root_.MIPStarRE.QPBT.pauliBasisMeasurement_postprocess_projective W _



/-- The honest diagonal-line measurement is the generalized Pauli basis
measurement coarse-grained by the degree-`m d` restriction of `g_h` to the
canonical line carried by the question. -/
noncomputable def pauliDLineMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (Fin (P.m * P.d + 1) → _root_.MIPStarRE.QPBT.PauliScalar P) (_root_.MIPStarRE.QPBT.PauliRegister P) :=
    (_root_.MIPStarRE.QPBT.pauliBasisMeasurement W).postprocess fun h =>
    _root_.MIPStarRE.QPBT.restrictToLine P.toLdParams
      (_root_.MIPStarRE.QPBT.dLineDescOf P.toLdParams
        (_root_.MIPStarRE.QPBT.ldDLineCL P.toLdParams (_root_.MIPStarRE.QPBT.pauliToLd P W z))) (_root_.MIPStarRE.QPBT.lowDegreeEncoding h)

/-- The honest diagonal-line measurement is projective. -/
theorem pauliDLineMeasurement_projective (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) :
    _root_.MIPStarRE.QPBT.Measurement.IsProjective (_root_.MIPStarRE.QPBT.pauliDLineMeasurement P W z) :=
  _root_.MIPStarRE.QPBT.pauliBasisMeasurement_postprocess_projective W _





/-! ### The commutation law of the honest pair -/

/-- The commutation law `𝒪_A 𝒪_B = (-1)^γ 𝒪_B 𝒪_A` of the proof of
`lem:pauli-completeness`, with `γ` the phase bit `eq:gamma-value`.  Paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1316-1330`. -/
theorem obsOf_pauliTraceMeasurement_mul_comm (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (z : _root_.MIPStarRE.QPBT.PauliSpace P) :
    _root_.MIPStarRE.QPBT.obsOf (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z)) *
        _root_.MIPStarRE.QPBT.obsOf (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z)) =
      _root_.MIPStarRE.QPBT.phaseSign (_root_.MIPStarRE.QPBT.pauliPairGamma P z) •
        (_root_.MIPStarRE.QPBT.obsOf (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z)) *
          _root_.MIPStarRE.QPBT.obsOf (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z))) := by
  rw [_root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement, _root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement, _root_.MIPStarRE.QPBT.tauObservable_X_mul_Z]
  rfl

/-- If the phase bit `γ` of `eq:gamma-value` is nonzero, the two honest Pair/W
observables anticommute.  Paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1316-1330`. -/
theorem obsOf_pauliTraceMeasurement_anticommute (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z ≠ 0) :
    _root_.MIPStarRE.QPBT.obsOf (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z)) *
        _root_.MIPStarRE.QPBT.obsOf (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z)) =
      -(_root_.MIPStarRE.QPBT.obsOf (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z)) *
        _root_.MIPStarRE.QPBT.obsOf (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z))) := by
  rw [_root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement_mul_comm]
  rcases _root_.MIPStarRE.QPBT.zmod_two_eq_zero_or_one (_root_.MIPStarRE.QPBT.pauliPairGamma P z) with h | h
  · exact absurd h hgamma
  · rw [h]
    simp [_root_.MIPStarRE.QPBT.phaseSign]



/-! ### The pointwise Magic Square measurement -/

/-- The nine cell measurements obtained from the anticommuting Pair/X and
Pair/Z observables at a question with nonzero phase bit. -/
noncomputable def pauliMagicCellMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z ≠ 0) :
    Fin 9 → _root_.LIDT.MIPStarRE.Quantum.Measurement (ZMod 2) (_root_.MIPStarRE.QPBT.PauliRegister P × ZMod 2) :=
  let A := _root_.MIPStarRE.QPBT.pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z)
  let B := _root_.MIPStarRE.QPBT.pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z)
  _root_.MIPStarRE.QPBT.msCellMeasurement (_root_.MIPStarRE.QPBT.obsOf A) (_root_.MIPStarRE.QPBT.obsOf B)
    (_root_.MIPStarRE.QPBT.obsOf_conjTranspose A (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .X _ _))
    (_root_.MIPStarRE.QPBT.obsOf_conjTranspose B (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .Z _ _))
    (_root_.MIPStarRE.QPBT.obsOf_sq A (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .X _ _))
    (_root_.MIPStarRE.QPBT.obsOf_sq B (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .Z _ _))
    (_root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement_anticommute P z hgamma)

/-- Every Pauli-induced Magic Square cell measurement is projective. -/
theorem pauliMagicCellMeasurement_projective (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z ≠ 0) (j : Fin 9) :
    _root_.MIPStarRE.QPBT.Measurement.IsProjective
      (_root_.MIPStarRE.QPBT.pauliMagicCellMeasurement P z hgamma j) := by
  simp only [_root_.MIPStarRE.QPBT.pauliMagicCellMeasurement]
  exact _root_.MIPStarRE.QPBT.msCellMeasurement_projective _ _
    (_root_.MIPStarRE.QPBT.obsOf_conjTranspose _ (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .X _ _))
    (_root_.MIPStarRE.QPBT.obsOf_conjTranspose _ (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .Z _ _))
    (_root_.MIPStarRE.QPBT.obsOf_sq _ (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .X _ _))
    (_root_.MIPStarRE.QPBT.obsOf_sq _ (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .Z _ _))
    (_root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement_anticommute P z hgamma) j

/-- Cell effects belonging to one Magic Square constraint commute. -/
theorem pauliMagicCellMeasurement_commute (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z ≠ 0)
    (i : Fin 6) (k l : Fin 3) (a b : ZMod 2) :
    Commute
      ((_root_.MIPStarRE.QPBT.pauliMagicCellMeasurement P z hgamma (_root_.MIPStarRE.QPBT.msConstraintVars i k)).effect a)
      ((_root_.MIPStarRE.QPBT.pauliMagicCellMeasurement P z hgamma (_root_.MIPStarRE.QPBT.msConstraintVars i l)).effect b) := by
  simp only [_root_.MIPStarRE.QPBT.pauliMagicCellMeasurement]
  exact _root_.MIPStarRE.QPBT.reflectionEffect_commute
    (_root_.MIPStarRE.QPBT.msConstraintObservable_commute _ _
      (_root_.MIPStarRE.QPBT.obsOf_sq _ (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .X _ _))
      (_root_.MIPStarRE.QPBT.obsOf_sq _ (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .Z _ _))
      (_root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement_anticommute P z hgamma) i k l) a b

/-- The Magic Square measurement family used at a Pauli question with nonzero
phase bit. -/
noncomputable def pauliMagicMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z ≠ 0) :
    _root_.MIPStarRE.QPBT.MsType → _root_.LIDT.MIPStarRE.Quantum.Measurement _root_.MIPStarRE.QPBT.MsAnswer (_root_.MIPStarRE.QPBT.PauliRegister P × ZMod 2) :=
  _root_.MIPStarRE.QPBT.msStrategyMeasurement (_root_.MIPStarRE.QPBT.pauliMagicCellMeasurement P z hgamma)
    (_root_.MIPStarRE.QPBT.pauliMagicCellMeasurement_projective P z hgamma)
    (_root_.MIPStarRE.QPBT.pauliMagicCellMeasurement_commute P z hgamma)

/-- The Pauli-induced Magic Square measurement is projective. -/
theorem pauliMagicMeasurement_projective (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z ≠ 0) (x : _root_.MIPStarRE.QPBT.MsType) :
    _root_.MIPStarRE.QPBT.Measurement.IsProjective
      (_root_.MIPStarRE.QPBT.pauliMagicMeasurement P z hgamma x) := by
  exact _root_.MIPStarRE.QPBT.msStrategyMeasurement_projective _ _ _ x

/-- Every effect of the Pauli-induced Magic Square measurement is symmetric. -/
theorem pauliMagicMeasurement_effect_transpose (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z ≠ 0)
    (x : _root_.MIPStarRE.QPBT.MsType) (a : _root_.MIPStarRE.QPBT.MsAnswer) :
    ((_root_.MIPStarRE.QPBT.pauliMagicMeasurement P z hgamma x).effect a)ᵀ =
      (_root_.MIPStarRE.QPBT.pauliMagicMeasurement P z hgamma x).effect a := by
  apply _root_.MIPStarRE.QPBT.msStrategyMeasurement_effect_transpose
  intro j b
  simp only [_root_.MIPStarRE.QPBT.pauliMagicCellMeasurement]
  apply _root_.MIPStarRE.QPBT.msCellMeasurement_transpose
  · rw [_root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement]
    exact _root_.MIPStarRE.QPBT.tauObservable_transpose _ _
  · rw [_root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement]
    exact _root_.MIPStarRE.QPBT.tauObservable_transpose _ _





/-! ### The Pair measurement in the case `γ = 0`

If the phase bit vanishes, the two honest Pair/W measurements commute and their
product is the Pair measurement `E^{Pair,ω}_{β_X, β_Z} = A_{β_X} B_{β_Z}` of
Equation `eq:pair-definition` in the proof of `lem:pauli-completeness`, paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1331-1344`.
-/

/-- If the phase bit `γ` of `eq:gamma-value` vanishes, the two honest Pair/W
observables commute.  Paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1316-1330`. -/
theorem obsOf_pauliTraceMeasurement_commute (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z = 0) :
    Commute (_root_.MIPStarRE.QPBT.obsOf (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z)))
      (_root_.MIPStarRE.QPBT.obsOf (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z))) := by
  rw [commute_iff_eq, _root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement_mul_comm, hgamma]
  simp [_root_.MIPStarRE.QPBT.phaseSign]

/-- If the phase bit `γ` vanishes, the effects of the two honest Pair/W
measurements commute; this is the commutation assertion of the honest strategy
in the case `γ = 0`, paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1374-1382`. -/
theorem pauliTraceMeasurement_effect_commute (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
    (z : _root_.MIPStarRE.QPBT.PauliSpace P) (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z = 0) (a b : ZMod 2) :
    Commute ((_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z)).effect a)
      ((_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z)).effect b) := by
  have hOO :
      Commute (_root_.MIPStarRE.QPBT.tauObservable _root_.MIPStarRE.QPBT.PauliKind.X (_root_.MIPStarRE.QPBT.pauliRXBlock z • _root_.MIPStarRE.QPBT.indicatorVec (_root_.MIPStarRE.QPBT.pauliXBlock z)))
        (_root_.MIPStarRE.QPBT.tauObservable _root_.MIPStarRE.QPBT.PauliKind.Z (_root_.MIPStarRE.QPBT.pauliRZBlock z • _root_.MIPStarRE.QPBT.indicatorVec (_root_.MIPStarRE.QPBT.pauliZBlock z))) := by
    rw [← _root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z),
      ← _root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z)]
    exact _root_.MIPStarRE.QPBT.obsOf_pauliTraceMeasurement_commute P z hgamma
  rw [_root_.MIPStarRE.QPBT.pauliTraceMeasurement_effect_eq_reflectionEffect,
    _root_.MIPStarRE.QPBT.pauliTraceMeasurement_effect_eq_reflectionEffect]
  exact _root_.MIPStarRE.QPBT.reflectionEffect_commute hOO a b

/-- The Pair effect `E^{Pair,ω}_{β_X, β_Z} = A_{β_X} B_{β_Z}` of Equation
`eq:pair-definition`, paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1331-1339`. -/
noncomputable def pauliPairEffect (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (z : _root_.MIPStarRE.QPBT.PauliSpace P)
    (β : ZMod 2 × ZMod 2) : _root_.LIDT.MIPStarRE.Quantum.Op (_root_.MIPStarRE.QPBT.PauliRegister P) :=
  (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z)).effect β.1 *
    (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z)).effect β.2

/-- For `γ = 0` the Pair effects are projectors, being products of commuting
projectors.  Paper
`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1331-1344`. -/
theorem pauliPairEffect_isProj (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (z : _root_.MIPStarRE.QPBT.PauliSpace P)
    (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z = 0) (β : ZMod 2 × ZMod 2) :
    _root_.LIDT.MIPStarRE.Quantum.IsProj (_root_.MIPStarRE.QPBT.pauliPairEffect P z β) :=
  IsStarProjection.mul (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .X _ _ β.1)
    (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_projective P .Z _ _ β.2)
    (_root_.MIPStarRE.QPBT.pauliTraceMeasurement_effect_commute P z hgamma β.1 β.2)

/-- The Pair effects sum to the identity. -/
theorem sum_pauliPairEffect (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (z : _root_.MIPStarRE.QPBT.PauliSpace P) :
    ∑ β : ZMod 2 × ZMod 2, _root_.MIPStarRE.QPBT.pauliPairEffect P z β = 1 := by
  calc ∑ β : ZMod 2 × ZMod 2, _root_.MIPStarRE.QPBT.pauliPairEffect P z β
      = ∑ a : ZMod 2, ∑ b : ZMod 2,
          (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z)).effect a *
            (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z)).effect b :=
        Fintype.sum_prod_type _
    _ = ∑ a : ZMod 2,
          (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z)).effect a *
            ∑ b : ZMod 2,
              (_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z)).effect b :=
        Finset.sum_congr rfl fun a _ => by rw [Finset.mul_sum]
    _ = 1 := by
        rw [(_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .Z (_root_.MIPStarRE.QPBT.pauliZBlock z) (_root_.MIPStarRE.QPBT.pauliRZBlock z)).sum_eq_one]
        simp [(_root_.MIPStarRE.QPBT.pauliTraceMeasurement P .X (_root_.MIPStarRE.QPBT.pauliXBlock z) (_root_.MIPStarRE.QPBT.pauliRXBlock z)).sum_eq_one]

/-- The Pair measurement of Equation `eq:pair-definition` in the case `γ = 0`,
paper `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:1331-1344`,
blueprint `lem:pauli-completeness`. -/
noncomputable def pauliPairMeasurement (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (z : _root_.MIPStarRE.QPBT.PauliSpace P)
    (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z = 0) : _root_.LIDT.MIPStarRE.Quantum.Measurement (ZMod 2 × ZMod 2) (_root_.MIPStarRE.QPBT.PauliRegister P) :=
  _root_.LIDT.MIPStarRE.Quantum.Measurement.ofSumEqOne (_root_.MIPStarRE.QPBT.pauliPairEffect P z)
    (fun β => (_root_.MIPStarRE.QPBT.pauliPairEffect_isProj P z hgamma β).nonneg) (_root_.MIPStarRE.QPBT.sum_pauliPairEffect P z)

/-- The Pair measurement is projective. -/
theorem pauliPairMeasurement_projective (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (z : _root_.MIPStarRE.QPBT.PauliSpace P)
    (hgamma : _root_.MIPStarRE.QPBT.pauliPairGamma P z = 0) :
    _root_.MIPStarRE.QPBT.Measurement.IsProjective (_root_.MIPStarRE.QPBT.pauliPairMeasurement P z hgamma) :=
  _root_.MIPStarRE.QPBT.pauliPairEffect_isProj P z hgamma



end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Test/Completeness/HonestStrategy.lean#L53-L660

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