Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Combining / DirectLowDegree / Transport / SeedFiber

Definition
QPBT_QPBT_Combining_DirectLowDegree_Transport_SeedFiber

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

qpbt

This bundle constructs the seed-fiber dilation that turns a strategy indexed by seed-specific low-degree questions into a strategy for directly indexed questions. It transports outcome labels, assembles block-diagonal measurements, and supplies the correlated residue state used in the lift.

Principal definitions:

  • MIPStarRE.QPBT.matrixMeasurementTransport: relabels a matrix measurement along an equivalence of outcome alphabets.
  • MIPStarRE.QPBT.blockDiagonalMeasurement: assembles finitely many matrix measurements as diagonal blocks indexed by a classical register.
  • MIPStarRE.QPBT.seedResidueAncilla: the normalized maximally correlated state on the common seed-fiber residue.
  • MIPStarRE.QPBT.seedFiberLiftedState: tensors the original strategy state with the residue ancilla and rearranges the local tensor factors.
  • MIPStarRE.QPBT.seededLdQuestion: selects the seed-indexed low-degree question inside one residue block of a direct question.
  • MIPStarRE.QPBT.ldStrategyToDirect: dilates a seed-indexed low-degree strategy to the directly indexed game.
  • MIPStarRE.QPBT.matrixMeasurementTransport_effect: gives the transported effect through the inverse outcome equivalence.
  • MIPStarRE.QPBT.blockDiagonalMeasurement_effect: identifies each assembled effect with the block-diagonal matrix of its component effects.

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/Combining/DirectLowDegree/Transport/SeedFiber.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_BlockDiagonal
import Definitions.Def_LIDT_MIPStarRE_Quantum_Measurement
import Definitions.Def_QPBT_QPBT_Algebra_Pauli
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Game
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Correspondence
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_State
import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame
import Mathlib

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

/-!
# Seed-fiber dilation for the directly indexed low-degree game

This module dilates a seed-indexed low-degree strategy by a maximally
correlated residue register.  Block-diagonal projective measurements retain
arbitrary dependence on the seed within each `chiIndex` fiber.

## References

- `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:31-458`
- `docs/paper-gaps/qpbt_ld-dimension-divisibility.tex`
-/

@[expose] public section

open scoped BigOperators MatrixOrder Matrix ComplexOrder

namespace MIPStarRE.QPBT

open LIDT.MIPStarRE.LDT
open LIDT.MIPStarRE.Quantum

noncomputable section

/-! ## Projective block measurements -/

/-- Relabel a matrix measurement along an equivalence of outcome alphabets. -/
noncomputable def matrixMeasurementTransport
    {alpha beta iota : Type*}
    [Fintype alpha] [Fintype beta] [Fintype iota] [DecidableEq iota]
    (e : alpha ≃ beta) (M : _root_.LIDT.MIPStarRE.Quantum.Measurement alpha iota) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement beta iota :=
  _root_.LIDT.MIPStarRE.Quantum.Measurement.ofSumEqOne
    (fun b => M.effect (e.symm b))
    (fun b => M.pos (e.symm b))
    (by
      calc
        ∑ b, M.effect (e.symm b) = ∑ a, M.effect a :=
          Equiv.sum_comp e.symm M.effect
        _ = 1 := M.sum_eq_one)

@[simp] theorem matrixMeasurementTransport_effect
    {alpha beta iota : Type*}
    [Fintype alpha] [Fintype beta] [Fintype iota] [DecidableEq iota]
    (e : alpha ≃ beta) (M : _root_.LIDT.MIPStarRE.Quantum.Measurement alpha iota)
    (b : beta) :
    (_root_.MIPStarRE.QPBT.matrixMeasurementTransport e M).effect b = M.effect (e.symm b) :=
  rfl



/-- Assemble a family of matrix measurements as diagonal blocks indexed by a
finite classical register. -/
noncomputable def blockDiagonalMeasurement
    {alpha iota block : Type*}
    [Fintype alpha] [Fintype iota] [DecidableEq iota]
    [Fintype block] [DecidableEq block]
    (M : block → _root_.LIDT.MIPStarRE.Quantum.Measurement alpha iota) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement alpha (iota × block) :=
  _root_.LIDT.MIPStarRE.Quantum.Measurement.ofSumEqOne
    (fun a => Matrix.blockDiagonal fun r => (M r).effect a)
    (fun a => _root_.LIDT.Matrix.blockDiagonal_nonneg
      (fun r => (M r).effect a) (fun r => (M r).pos a))
    (by
      ext ⟨i, r⟩ ⟨j, s⟩
      simp only [Matrix.sum_apply, Matrix.blockDiagonal_apply]
      by_cases hrs : r = s
      · subst s
        simp only [if_pos]
        calc
          ∑ x, (M r).effect x i j = (1 : Matrix iota iota ℂ) i j :=
            by
              simpa only [Matrix.sum_apply] using
                congrFun (congrFun (M r).sum_eq_one i) j
          _ = (1 : Matrix (iota × block) (iota × block) ℂ)
              (i, r) (j, r) := by
                change (if i = j then 1 else 0) =
                  (if (i, r) = (j, r) then 1 else 0)
                simp
      · simp [hrs])

@[simp] theorem blockDiagonalMeasurement_effect
    {alpha iota block : Type*}
    [Fintype alpha] [Fintype iota] [DecidableEq iota]
    [Fintype block] [DecidableEq block]
    (M : block → _root_.LIDT.MIPStarRE.Quantum.Measurement alpha iota)
    (a : alpha) :
    (_root_.MIPStarRE.QPBT.blockDiagonalMeasurement M).effect a =
      Matrix.blockDiagonal (fun r => (M r).effect a) :=
  rfl



/-! ## The correlated residue state -/

/-- The normalized maximally correlated state on the common seed-fiber
residue. -/
noncomputable def seedResidueAncilla (L : _root_.MIPStarRE.QPBT.LdParams) :
    EuclideanSpace ℂ
      (Fin (L.q / L.m) × Fin (L.q / L.m)) := by
  letI : Nonempty (Fin (L.q / L.m)) :=
    Fin.pos_iff_nonempty.mp L.seedFiberCard_pos
  exact _root_.MIPStarRE.QPBT.eprState (Fin (L.q / L.m))

/-- The seed-residue ancilla has unit norm. -/
theorem seedResidueAncilla_norm (L : _root_.MIPStarRE.QPBT.LdParams) :
    ‖_root_.MIPStarRE.QPBT.seedResidueAncilla L‖ = 1 := by
  letI : Nonempty (Fin (L.q / L.m)) :=
    Fin.pos_iff_nonempty.mp L.seedFiberCard_pos
  exact _root_.MIPStarRE.QPBT.eprState_norm (Fin (L.q / L.m))

/-- Tensor the original strategy state with the maximally correlated residue
state and shuffle the factors back into the two local carriers. -/
noncomputable def seedFiberLiftedState
    {G : _root_.MIPStarRE.QPBT.Game} (S : _root_.MIPStarRE.QPBT.Strategy G) (L : _root_.MIPStarRE.QPBT.LdParams) :
    EuclideanSpace ℂ
      ((S.ιA × Fin (L.q / L.m)) × (S.ιB × Fin (L.q / L.m))) :=
  _root_.MIPStarRE.QPBT.reindexState _root_.MIPStarRE.QPBT.prodShuffle (_root_.MIPStarRE.QPBT.vecTensor S.ψ (_root_.MIPStarRE.QPBT.seedResidueAncilla L))

/-- The correlated seed-fiber lift preserves normalization of the strategy
state. -/
theorem seedFiberLiftedState_norm
    {G : _root_.MIPStarRE.QPBT.Game} (S : _root_.MIPStarRE.QPBT.Strategy G) (L : _root_.MIPStarRE.QPBT.LdParams) :
    ‖_root_.MIPStarRE.QPBT.seedFiberLiftedState S L‖ = 1 := by
  rw [_root_.MIPStarRE.QPBT.seedFiberLiftedState, _root_.MIPStarRE.QPBT.reindexState_norm_eq, _root_.MIPStarRE.QPBT.vecTensor_norm_eq,
    S.ψ_norm, _root_.MIPStarRE.QPBT.seedResidueAncilla_norm, one_mul]

/-! ## From the seed-indexed game to the direct game -/

/-- The seed-indexed question selected in one residue block of a direct
question.  Applying `ldCL` ensures that irrelevant ambient coordinates are
canonicalized exactly as in the source game. -/
noncomputable def seededLdQuestion (L : _root_.MIPStarRE.QPBT.LdParams)
    (q : _root_.MIPStarRE.QPBT.DirectLdQuestion L.toDirectLdParams)
    (residue : Fin (L.q / L.m)) : _root_.MIPStarRE.QPBT.LdQuestion L :=
  (q.1, _root_.MIPStarRE.QPBT.ldCL L q.1 (_root_.MIPStarRE.QPBT.ldSpaceOfDirectResidue L q.2 residue))

/-- Dilate a strategy for the seed-indexed low-degree game to the directly
indexed game.  The two local carriers receive correlated copies of the seed
residue, and each measurement is block diagonal in that residue. -/
noncomputable def ldStrategyToDirect (L : _root_.MIPStarRE.QPBT.LdParams)
    (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.ldGame L)) : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame L.toDirectLdParams) where
  ιA := S.ιA × Fin (L.q / L.m)
  ιB := S.ιB × Fin (L.q / L.m)
  ψ := _root_.MIPStarRE.QPBT.seedFiberLiftedState S L
  ψ_norm := _root_.MIPStarRE.QPBT.seedFiberLiftedState_norm S L
  A q := _root_.MIPStarRE.QPBT.blockDiagonalMeasurement fun residue =>
    _root_.MIPStarRE.QPBT.matrixMeasurementTransport (_root_.MIPStarRE.QPBT.ldDirectAnswerEquiv L)
      (S.A (_root_.MIPStarRE.QPBT.seededLdQuestion L q residue))
  B q := _root_.MIPStarRE.QPBT.blockDiagonalMeasurement fun residue =>
    _root_.MIPStarRE.QPBT.matrixMeasurementTransport (_root_.MIPStarRE.QPBT.ldDirectAnswerEquiv L)
      (S.B (_root_.MIPStarRE.QPBT.seededLdQuestion L q residue))



@[simp] theorem ldStrategyToDirect_A_effect (L : _root_.MIPStarRE.QPBT.LdParams)
    (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.ldGame L))
    (q : _root_.MIPStarRE.QPBT.DirectLdQuestion L.toDirectLdParams)
    (answer : _root_.MIPStarRE.QPBT.DirectLdAnswer L.toDirectLdParams) :
    ((_root_.MIPStarRE.QPBT.ldStrategyToDirect L S).A q).effect answer =
      Matrix.blockDiagonal fun residue =>
        (S.A (_root_.MIPStarRE.QPBT.seededLdQuestion L q residue)).effect
          ((_root_.MIPStarRE.QPBT.ldDirectAnswerEquiv L).symm answer) :=
  rfl

@[simp] theorem ldStrategyToDirect_B_effect (L : _root_.MIPStarRE.QPBT.LdParams)
    (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.ldGame L))
    (q : _root_.MIPStarRE.QPBT.DirectLdQuestion L.toDirectLdParams)
    (answer : _root_.MIPStarRE.QPBT.DirectLdAnswer L.toDirectLdParams) :
    ((_root_.MIPStarRE.QPBT.ldStrategyToDirect L S).B q).effect answer =
      Matrix.blockDiagonal fun residue =>
        (S.B (_root_.MIPStarRE.QPBT.seededLdQuestion L q residue)).effect
          ((_root_.MIPStarRE.QPBT.ldDirectAnswerEquiv L).symm answer) :=
  rfl





end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/DirectLowDegree/Transport/SeedFiber.lean#L33-L223

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