Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Palomar / LowDegreeGameStrategyBridge

Definition
QPBT_QPBT_Palomar_LowDegreeGameStrategyBridge

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

qpbt

This bundle bridges compact low-degree games and the registered game interface. It relabels compact POVMs, games, strategies, questions, and outcomes, converts a compact low-degree strategy to the registered game, and records preservation of effects, game data, and Born weights.

Principal definitions:

  • MIPStarRE.QPBT.Palomar.POVM.relabel: relabels the outcomes of a compact POVM along an equivalence.
  • MIPStarRE.QPBT.Palomar.Game.relabel: relabels all question and answer carriers of a compact game.
  • MIPStarRE.QPBT.Palomar.Strategy.relabel: relabels the questions and outcomes of a compact strategy.
  • MIPStarRE.QPBT.Palomar.lowDegreeStrategyToLibrary: converts a compact low-degree strategy into a strategy for the registered game.
  • MIPStarRE.QPBT.Palomar.POVM.relabel_effect: states that outcome relabeling preserves each POVM effect.
  • MIPStarRE.QPBT.Palomar.Game.ext: states equality of compact games when their data fields agree.
  • MIPStarRE.QPBT.Palomar.Strategy.outcomeWeight_relabel: states that relabeling preserves each Born weight after pulling back all labels.

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/LowDegreeGameStrategyBridge.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_Games_Defs
import Definitions.Def_QPBT_QPBT_Palomar_Bridge
import Definitions.Def_QPBT_QPBT_Palomar_Definitions
import Definitions.Def_QPBT_QPBT_Palomar_LowDegreeGameBridge
import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame
import Mathlib

namespace MIPStarRE.QPBT.Palomar
end MIPStarRE.QPBT.Palomar
namespace MIPStarRE.QPBT.Palomar.Game
end MIPStarRE.QPBT.Palomar.Game
namespace MIPStarRE.QPBT.Palomar.POVM
end MIPStarRE.QPBT.Palomar.POVM
namespace MIPStarRE.QPBT.Palomar.Strategy
end MIPStarRE.QPBT.Palomar.Strategy

/-!
# Strategy bridge for the compact low individual degree game

This module transports compact strategies across the exact question and answer
equivalences of `LowDegreeGameBridge`.  The transported game is the existing
low-degree game, and every compact strategy has exactly the same Born value
after conversion through the Palomar foundation bridge.

## References

`references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:31-440`.
-/

@[expose] public section

open scoped BigOperators

namespace MIPStarRE.QPBT.Palomar

noncomputable section

namespace POVM

/-- Relabel the outcomes of a compact POVM along an equivalence. -/
def relabel {A B I : Type*} [Fintype A] [Fintype B] [Fintype I]
    [DecidableEq I] (e : A ≃ B) (M : _root_.MIPStarRE.QPBT.Palomar.POVM A I) : _root_.MIPStarRE.QPBT.Palomar.POVM B I where
  effect := fun b => M.effect (e.symm b)
  pos := fun b => M.pos (e.symm b)
  sum_eq_one := by
    calc
      ∑ b : B, M.effect (e.symm b) = ∑ a : A, M.effect a :=
        Equiv.sum_comp e.symm M.effect
      _ = 1 := M.sum_eq_one

/-- Outcome relabeling preserves every POVM effect. -/
@[simp] theorem relabel_effect {A B I : Type*} [Fintype A] [Fintype B]
    [Fintype I] [DecidableEq I] (e : A ≃ B) (M : _root_.MIPStarRE.QPBT.Palomar.POVM A I) (b : B) :
    (_root_.MIPStarRE.QPBT.Palomar.POVM.relabel e M).effect b = M.effect (e.symm b) :=
  rfl



end POVM

namespace Game

/-- Two compact games on fixed carriers are equal when their data fields agree. -/
theorem ext {X Y A B : Type}
    [Fintype X] [Fintype Y] [Fintype A] [Fintype B]
    [DecidableEq X] [DecidableEq Y] [DecidableEq A] [DecidableEq B]
    {G H : _root_.MIPStarRE.QPBT.Palomar.Game X Y A B} (hμ : G.μ = H.μ) (hdecide : G.decide = H.decide) :
    G = H := by
  cases G
  cases H
  simp_all

/-- Relabel all question and answer carriers of a compact game. -/
def relabel {X Y A B X' Y' A' B' : Type}
    [Fintype X] [Fintype Y] [Fintype A] [Fintype B]
    [Fintype X'] [Fintype Y'] [Fintype A'] [Fintype B']
    [DecidableEq X] [DecidableEq Y] [DecidableEq A] [DecidableEq B]
    [DecidableEq X'] [DecidableEq Y'] [DecidableEq A'] [DecidableEq B']
    (G : _root_.MIPStarRE.QPBT.Palomar.Game X Y A B) (eX : X ≃ X') (eY : Y ≃ Y')
    (eA : A ≃ A') (eB : B ≃ B') : _root_.MIPStarRE.QPBT.Palomar.Game X' Y' A' B' where
  μ := G.μ.map (Equiv.prodCongr eX eY)
  decide := fun x y a b =>
    G.decide (eX.symm x) (eY.symm y) (eA.symm a) (eB.symm b)

end Game

namespace Strategy

/-- Relabel the questions and outcomes of a compact strategy. -/
def relabel {X Y A B X' Y' A' B' : Type}
    [Fintype X] [Fintype Y] [Fintype A] [Fintype B]
    [Fintype X'] [Fintype Y'] [Fintype A'] [Fintype B']
    (S : _root_.MIPStarRE.QPBT.Palomar.Strategy X Y A B) (eX : X ≃ X') (eY : Y ≃ Y')
    (eA : A ≃ A') (eB : B ≃ B') : _root_.MIPStarRE.QPBT.Palomar.Strategy X' Y' A' B' where
  ιA := S.ιA
  ιB := S.ιB
  ψ := S.ψ
  ψ_norm := S.ψ_norm
  alice := fun x => _root_.MIPStarRE.QPBT.Palomar.POVM.relabel eA (S.alice (eX.symm x))
  bob := fun y => _root_.MIPStarRE.QPBT.Palomar.POVM.relabel eB (S.bob (eY.symm y))

/-- Relabeling preserves each Born weight after pulling back all four labels. -/
@[simp] theorem outcomeWeight_relabel {X Y A B X' Y' A' B' : Type}
    [Fintype X] [Fintype Y] [Fintype A] [Fintype B]
    [Fintype X'] [Fintype Y'] [Fintype A'] [Fintype B']
    (S : _root_.MIPStarRE.QPBT.Palomar.Strategy X Y A B) (eX : X ≃ X') (eY : Y ≃ Y')
    (eA : A ≃ A') (eB : B ≃ B') (x : X') (y : Y') (a : A') (b : B') :
    (_root_.MIPStarRE.QPBT.Palomar.Strategy.relabel S eX eY eA eB).outcomeWeight x y a b =
      S.outcomeWeight (eX.symm x) (eY.symm y) (eA.symm a) (eB.symm b) :=
  rfl







end Strategy



/-- Convert a compact low-degree strategy into a strategy for the registered game. -/
def lowDegreeStrategyToLibrary (P : _root_.MIPStarRE.QPBT.LdParams)
    (S : _root_.MIPStarRE.QPBT.Palomar.Strategy
      (_root_.MIPStarRE.QPBT.Palomar.LowDegreeQuestion (_root_.MIPStarRE.QPBT.Palomar.LowDegreeParams.ofLdParams P) (_root_.MIPStarRE.QPBT.ScalarQ P))
      (_root_.MIPStarRE.QPBT.Palomar.LowDegreeQuestion (_root_.MIPStarRE.QPBT.Palomar.LowDegreeParams.ofLdParams P) (_root_.MIPStarRE.QPBT.ScalarQ P))
      (_root_.MIPStarRE.QPBT.Palomar.LowDegreeAnswer (_root_.MIPStarRE.QPBT.Palomar.LowDegreeParams.ofLdParams P) (_root_.MIPStarRE.QPBT.ScalarQ P))
      (_root_.MIPStarRE.QPBT.Palomar.LowDegreeAnswer (_root_.MIPStarRE.QPBT.Palomar.LowDegreeParams.ofLdParams P) (_root_.MIPStarRE.QPBT.ScalarQ P))) :
    _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.ldGame P) :=
  _root_.MIPStarRE.QPBT.Palomar.Strategy.toStrategy (G := _root_.MIPStarRE.QPBT.ldGame P)
    (_root_.MIPStarRE.QPBT.Palomar.Strategy.relabel S
      (_root_.MIPStarRE.QPBT.Palomar.lowDegreeQuestionEquiv P) (_root_.MIPStarRE.QPBT.Palomar.lowDegreeQuestionEquiv P)
      (_root_.MIPStarRE.QPBT.Palomar.lowDegreeAnswerEquiv P) (_root_.MIPStarRE.QPBT.Palomar.lowDegreeAnswerEquiv P))





end

end MIPStarRE.QPBT.Palomar
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Palomar/LowDegreeGameStrategyBridge.lean#L28-L206

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