Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Combining / DirectLowDegree / Transport / Combining / QuestionLaw

Definition
QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_QuestionLaw

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

qpbt

This bundle defines the coordinate maps and direction facts for the combined question law. It identifies how point and coefficient coordinates sit in the combined index and how prefix projections and coordinate directions decompose.

Principal definitions:

  • MIPStarRE.QPBT.directCombinedIndexNonempty: provides a nonemptiness witness for the direct combined index.
  • MIPStarRE.QPBT.directCombinedSampleProjection: projects a combined sample to the original-game sample at a point-coordinate index.
  • MIPStarRE.QPBT.combinedPointVar_val: states that a point variable keeps its original coordinate in the combined index.
  • MIPStarRE.QPBT.combinedCoefficientVar_val: states that a coefficient variable follows the point coordinates in the combined index.
  • MIPStarRE.QPBT.directCombinedPointPart_coordinateDirection_pointVar: identifies the point part of the coordinate direction for a point coordinate.
  • MIPStarRE.QPBT.directCombinedPointPart_coordinateDirection_coefficientVar: identifies the vanishing point part of the coordinate direction for a coefficient coordinate.
  • MIPStarRE.QPBT.directCombinedPointPart_directPrefixProjection_pointVar: identifies prefix projection at a point coordinate with prefix projection on the corresponding point part.
  • MIPStarRE.QPBT.directCombinedPointPart_directPrefixProjection_coefficientVar: states that prefix projection at a coefficient coordinate annihilates the point part because all point coordinates precede coefficient coordinates.

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/Combining/QuestionLaw.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_Algebra_Lines
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Parameters
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Polynomial
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Strategy
import Mathlib

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

/-!
# The questions measured by the combined strategy

`lem:ld-combined-question-law` identifies the pair of questions measured by the
combined strategy of `def:ld-combined-strategy` on a sample of the combined
game.  The coordinate index of the common sample is uniform on the `m + k`
coordinates of the combined dimension, and the identification splits according
to whether that index is a point coordinate or a combining coordinate.

On a point coordinate `j`, all three question types measure the canonical
question of the same type of the original game attached to the *projected*
sample `directCombinedSampleProjection`: the point part of the sampled point,
the index `j`, and the point part of the sampled direction.  This uses the
coordinate order of `def:ld-combining-map`: the point coordinates precede the
combining coordinates, so the coordinate direction of a point coordinate has
point part the corresponding coordinate direction, and the prefix projection at
a point coordinate restricts to the prefix projection at that coordinate of the
point part.

On a combining coordinate, every direction produced by the question
distribution has vanishing point part, so all three question types measure the
point question at the point part of the sampled point.

The projected sample is read from the *canonical* base of the combined line,
which need not project to the canonical base of the image line; the two agree
after rebasing along the image direction, which is
`lineRepMap_directCombinedPointPart_lineRepMap`.

## References

* `references/neexp-paper/05_quantum_preliminaries.tex:1409-1503`
* `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:413-458`
* `blueprint/src/chapter/ch13_qpbt_test.tex:473-508`
-/

@[expose] public section

open scoped BigOperators

namespace MIPStarRE.QPBT

open LIDT.MIPStarRE.LDT
open LIDT.MIPStarRE.LDT.Preliminaries

noncomputable section

local instance directCombinedIndexNonempty (D : _root_.MIPStarRE.QPBT.DirectLdParams) :
    Nonempty (Fin D.combined.m) :=
  ⟨D.combined.firstIndex⟩

/-! ## Coordinates of the combined dimension -/

@[simp] theorem combinedPointVar_val (m k : ℕ) (j : Fin m) :
    (_root_.MIPStarRE.QPBT.combinedPointVar m k j).val = j.val := by
  simp [_root_.MIPStarRE.QPBT.combinedPointVar]

@[simp] theorem combinedCoefficientVar_val (m k : ℕ) (r : Fin k) :
    (_root_.MIPStarRE.QPBT.combinedCoefficientVar m k r).val = m + r.val := by
  simp [_root_.MIPStarRE.QPBT.combinedCoefficientVar]

/-- The coordinate direction of a point coordinate of the combined dimension
has point part the corresponding coordinate direction. -/
@[simp] theorem directCombinedPointPart_coordinateDirection_pointVar
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (j : Fin D.m) :
    _root_.MIPStarRE.QPBT.directCombinedPointPart D (_root_.MIPStarRE.QPBT.coordinateDirection (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j)) =
      _root_.MIPStarRE.QPBT.coordinateDirection j := by
  funext j'
  show (_root_.MIPStarRE.QPBT.coordinateDirection (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j) :
      Fin (D.m + D.k) → _root_.MIPStarRE.QPBT.DirectScalarQ D) (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j') =
    _root_.MIPStarRE.QPBT.coordinateDirection j j'
  by_cases h : j' = j
  · subst h
    rw [_root_.MIPStarRE.QPBT.coordinateDirection, _root_.MIPStarRE.QPBT.coordinateDirection, Pi.single_eq_same,
      Pi.single_eq_same]
  · rw [_root_.MIPStarRE.QPBT.coordinateDirection, _root_.MIPStarRE.QPBT.coordinateDirection,
      Pi.single_eq_of_ne fun hc => h (_root_.MIPStarRE.QPBT.combinedPointVar_injective D.m D.k hc),
      Pi.single_eq_of_ne h]

/-- The coordinate direction of a combining coordinate of the combined
dimension has vanishing point part. -/
@[simp] theorem directCombinedPointPart_coordinateDirection_coefficientVar
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (r : Fin D.k) :
    _root_.MIPStarRE.QPBT.directCombinedPointPart D
        (_root_.MIPStarRE.QPBT.coordinateDirection (_root_.MIPStarRE.QPBT.combinedCoefficientVar D.m D.k r)) = 0 := by
  funext j
  show (_root_.MIPStarRE.QPBT.coordinateDirection (_root_.MIPStarRE.QPBT.combinedCoefficientVar D.m D.k r) :
      Fin (D.m + D.k) → _root_.MIPStarRE.QPBT.DirectScalarQ D) (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j) = 0
  rw [_root_.MIPStarRE.QPBT.coordinateDirection,
    Pi.single_eq_of_ne (_root_.MIPStarRE.QPBT.combinedCoefficientVar_ne_combinedPointVar D.m D.k r j).symm]

/-- Prefix projection at a point coordinate restricts to prefix projection at
that coordinate of the point part.  This is the coordinate order of
`def:ld-combining-map`: the point coordinates precede the combining ones. -/
@[simp] theorem directCombinedPointPart_directPrefixProjection_pointVar
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (j : Fin D.m)
    (w : Fin D.combined.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) :
    _root_.MIPStarRE.QPBT.directCombinedPointPart D
        (_root_.MIPStarRE.QPBT.directPrefixProjection (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j) w) =
      _root_.MIPStarRE.QPBT.directPrefixProjection j (_root_.MIPStarRE.QPBT.directCombinedPointPart D w) := by
  funext j'
  show (if (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j').val < (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j).val
      then 0 else w (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j')) =
    if j'.val < j.val then 0 else _root_.MIPStarRE.QPBT.directCombinedPointPart D w j'
  rw [_root_.MIPStarRE.QPBT.combinedPointVar_val, _root_.MIPStarRE.QPBT.combinedPointVar_val]
  rfl

/-- Prefix projection at a combining coordinate annihilates the point part:
every point coordinate precedes every combining coordinate. -/
@[simp] theorem directCombinedPointPart_directPrefixProjection_coefficientVar
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (r : Fin D.k)
    (w : Fin D.combined.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) :
    _root_.MIPStarRE.QPBT.directCombinedPointPart D
        (_root_.MIPStarRE.QPBT.directPrefixProjection (_root_.MIPStarRE.QPBT.combinedCoefficientVar D.m D.k r) w) = 0 := by
  funext j'
  show (if (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j').val <
      (_root_.MIPStarRE.QPBT.combinedCoefficientVar D.m D.k r).val
      then 0 else w (_root_.MIPStarRE.QPBT.combinedPointVar D.m D.k j')) = 0
  rw [_root_.MIPStarRE.QPBT.combinedPointVar_val, _root_.MIPStarRE.QPBT.combinedCoefficientVar_val, if_pos]
  omega

/-! ## Canonical bases -/







/-! ## The measured questions -/

/-- The sample of the original game to which a sample of the combined game
projects at a point coordinate index: the point part of the sampled point, the
index, and the point part of the sampled direction. -/
def directCombinedSampleProjection (D : _root_.MIPStarRE.QPBT.DirectLdParams) (j : Fin D.m)
    (sample : _root_.MIPStarRE.QPBT.DirectLdSpace D.combined) : _root_.MIPStarRE.QPBT.DirectLdSpace D :=
  ⟨_root_.MIPStarRE.QPBT.directCombinedPointPart D sample.point, j,
    _root_.MIPStarRE.QPBT.directCombinedPointPart D sample.direction⟩





/-! ## The law of the projected sample -/

/-- A point of the combined space is recovered from its two parts. -/
@[simp] theorem combinedPoint_combinedPointPart_combinedCoefficientPart
    {K : Type*} {m k : ℕ} (z : Fin (m + k) → K) :
    _root_.MIPStarRE.QPBT.combinedPoint (_root_.MIPStarRE.QPBT.combinedPointPart z) (_root_.MIPStarRE.QPBT.combinedCoefficientPart z) = z := by
  funext i
  rw [_root_.MIPStarRE.QPBT.combinedPoint]
  rcases hi : finSumFinEquiv.symm i with j | r
  · show _root_.MIPStarRE.QPBT.combinedPointPart z j = z i
    rw [_root_.MIPStarRE.QPBT.combinedPointPart, _root_.MIPStarRE.QPBT.combinedPointVar, ← hi, Equiv.apply_symm_apply]
  · show _root_.MIPStarRE.QPBT.combinedCoefficientPart z r = z i
    rw [_root_.MIPStarRE.QPBT.combinedCoefficientPart, _root_.MIPStarRE.QPBT.combinedCoefficientVar, ← hi,
      Equiv.apply_symm_apply]







/-- The decomposition of a sample of the combined game into its coordinate
index and its two point parts on the one side, and its two combining parts on
the other. -/
 def directCombinedSpaceIndexEquiv (D : _root_.MIPStarRE.QPBT.DirectLdParams) :
    _root_.MIPStarRE.QPBT.DirectLdSpace D.combined ≃
      ((Fin D.combined.m ×
          ((Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) × (Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D))) ×
        ((Fin D.k → _root_.MIPStarRE.QPBT.DirectScalarQ D) × (Fin D.k → _root_.MIPStarRE.QPBT.DirectScalarQ D))) where
  toFun sample :=
    ((sample.index,
        (_root_.MIPStarRE.QPBT.directCombinedPointPart D sample.point,
          _root_.MIPStarRE.QPBT.directCombinedPointPart D sample.direction)),
      (_root_.MIPStarRE.QPBT.directCombinedCoefficientPart D sample.point,
        _root_.MIPStarRE.QPBT.directCombinedCoefficientPart D sample.direction))
  invFun x := ⟨_root_.MIPStarRE.QPBT.combinedPoint x.1.2.1 x.2.1, x.1.1, _root_.MIPStarRE.QPBT.combinedPoint x.1.2.2 x.2.2⟩
  left_inv sample := by
    obtain ⟨point, index, direction⟩ := sample
    dsimp only
    congr 1 <;>
      first
        | rfl
        | exact _root_.MIPStarRE.QPBT.combinedPoint_combinedPointPart_combinedCoefficientPart _
  right_inv x := by
    obtain ⟨⟨i, u, v⟩, α, w⟩ := x
    dsimp only
    simp only [Prod.mk.injEq]
    exact ⟨⟨trivial, _root_.MIPStarRE.QPBT.combinedPointPart_combinedPoint u α,
        _root_.MIPStarRE.QPBT.combinedPointPart_combinedPoint v w⟩,
      _root_.MIPStarRE.QPBT.combinedCoefficientPart_combinedPoint u α,
      _root_.MIPStarRE.QPBT.combinedCoefficientPart_combinedPoint v w⟩



end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/DirectLowDegree/Transport/Combining/QuestionLaw.lean#L51-L337

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