Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Observables / WinImplications / Interchange

Definition
QPBT_QPBT_Observables_WinImplications_Interchange

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

qpbt

This bundle defines the reverse-orientation verifier edges used to interchange the roles of the two answers. It supplies point-line, Pauli-point, Pair-Pair-W, Pair-W-point, and Magic Square variable-point edges in the orientation required by the win implications.

Principal definitions:

  • MIPStarRE.QPBT.WinImplications.pointAlineEdge: the reversed point and axis-line edge.
  • MIPStarRE.QPBT.WinImplications.pointDlineEdge: the reversed point and diagonal-line edge.
  • MIPStarRE.QPBT.WinImplications.pauliPointEdge: the reversed Pauli and point edge.
  • MIPStarRE.QPBT.WinImplications.pairPairWEdge: the reversed Pair and Pair-W edge.
  • MIPStarRE.QPBT.WinImplications.pairWPointEdge: the reversed Pair-W and point edge.
  • MIPStarRE.QPBT.WinImplications.msVarPointEdge: the reversed variable and point edge.

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/Observables/WinImplications/Interchange.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_Pauli
import Definitions.Def_QPBT_QPBT_Test_MagicSquare
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
namespace MIPStarRE.QPBT.WinImplications
end MIPStarRE.QPBT.WinImplications

/-!
# Interchange of the tensor factors in the winning implications

This module collects the statements shared by the operator-distance companions
of the winning implications and by their factor-interchanged forms: transport of
the state-dependent distance along the interchange of the two tensor factors,
the constant-factor passage from consistency to distance, the reversed
verifier edges, and the clause-by-clause symmetry of the Pauli win predicate
on the ordered type pairs that the implications use.

## References

The declarations support the trailing clause of `lem:qld-win-implications` in
`blueprint/src/chapter/ch14_qpbt_observables.tex:616-706`. Their paper source
is `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:192-267`,
whose closing sentences at lines 227 and 263-264 state both companions.
-/

@[expose] public section

open scoped BigOperators Matrix ComplexOrder

namespace MIPStarRE.QPBT

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

noncomputable section

namespace WinImplications

/-! ## Transport of the distance functional along the factor interchange -/

















/-! ## Reversed verifier edges

The Pauli type graph is a set of unordered pairs, so every ordered edge used by
the exact implications has its reverse in the graph. The reversed edges carry
the interchanged conclusions of `lem:qld-win-implications`, blueprint
`ch14_qpbt_observables.tex:701-703`. -/

/-- The point/axis-line verifier edge, reversing `alinePointEdge`. -/
def pointAlineEdge (W : _root_.MIPStarRE.QPBT.PauliKind) : _root_.MIPStarRE.QPBT.PauliEdge :=
  ⟨(.point W, .aline W), by simp [_root_.MIPStarRE.QPBT.pauliEdges]⟩

/-- The point/diagonal-line verifier edge, reversing `dlinePointEdge`. -/
def pointDlineEdge (W : _root_.MIPStarRE.QPBT.PauliKind) : _root_.MIPStarRE.QPBT.PauliEdge :=
  ⟨(.point W, .dline W), by simp [_root_.MIPStarRE.QPBT.pauliEdges]⟩

/-- The Pauli/point verifier edge, reversing `pointPauliEdge`. -/
def pauliPointEdge (W : _root_.MIPStarRE.QPBT.PauliKind) : _root_.MIPStarRE.QPBT.PauliEdge :=
  ⟨(.pauli W, .point W), by simp [_root_.MIPStarRE.QPBT.pauliEdges]⟩

/-- The Pair/Pair-W verifier edge, reversing `pairWPairEdge`. -/
def pairPairWEdge (W : _root_.MIPStarRE.QPBT.PauliKind) : _root_.MIPStarRE.QPBT.PauliEdge :=
  ⟨(.pair, .pairW W), by simp [_root_.MIPStarRE.QPBT.pauliEdges]⟩

/-- The Pair-W/point verifier edge, reversing `pointPairWEdge`. -/
def pairWPointEdge (W : _root_.MIPStarRE.QPBT.PauliKind) : _root_.MIPStarRE.QPBT.PauliEdge :=
  ⟨(.pairW W, .point W), by simp [_root_.MIPStarRE.QPBT.pauliEdges]⟩

/-- The variable/point verifier edge, reversing `pointMsImplicationEdge`. -/
def msVarPointEdge : _root_.MIPStarRE.QPBT.PauliKind → _root_.MIPStarRE.QPBT.PauliEdge
  | .X => ⟨(.ms (.var 0), .point .X), by simp [_root_.MIPStarRE.QPBT.pauliEdges]⟩
  | .Z => ⟨(.ms (.var 4), .point .Z), by simp [_root_.MIPStarRE.QPBT.pauliEdges]⟩

/-! ## Symmetry of the win predicate on the subtests used here

`def:pauli-win-predicate` lists every clause together with its mirror image, so
on each ordered type pair occurring in `lem:qld-win-implications` exchanging the
two questions and the two answers leaves the predicate unchanged. Paper
`08_classical_and_quantum_low_degree_tests.tex:1126-1225`, blueprint
`ch13_qpbt_test.tex:410-449`. -/













/-! ## Numeric bookkeeping -/





end WinImplications

end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Observables/WinImplications/Interchange.lean#L165-L188

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