Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Combining / DirectLowDegree / Transport / DiagonalRecursion

Definition
QPBT_QPBT_Combining_DirectLowDegree_Transport_DiagonalRecursion

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

qpbt

This bundle defines the direct and decoded diagonal rejection quantities. It splits a direction into the free and lower coordinates for a restricted diagonal test, records both orderings of the rejected direct mass, and defines the corresponding LDT diagonal defects.

Principal definitions:

  • MIPStarRE.QPBT.restrictedDirectionEquiv: splits a direct direction into the free coordinates of the restricted diagonal test and the coordinates below the reversed index.
  • MIPStarRE.QPBT.diagonalLinePointRejection: defines rejected direct mass for a direct sample with the diagonal line on the left.
  • MIPStarRE.QPBT.diagonalPointLineRejection: defines rejected direct mass for a direct sample with the point on the left.
  • MIPStarRE.QPBT.diagonalLinePointDefect: defines the LDT diagonal defect with the line on the left as a function of the decoded base point and direction.
  • MIPStarRE.QPBT.diagonalPointLineDefect: defines the LDT diagonal defect with the point on the left as a function of the decoded base point and direction.

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/DiagonalRecursion.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_Basic_SubMeasurementCore
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_SubMeasurementFamilies
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_Defs
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_Game
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_BranchComparison
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Correspondence
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Questions
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Strategy
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Games_StrategyClasses
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

/-!
# Diagonal branches of the coordinate strategies of the direct low-degree game

The LDT `j`-restricted diagonal sampler decodes to a direct direction with
vanishing prefix below the reversed index `i = Fin.rev j`, and the transported
question of `Transport.Questions` carries the leading index of that direction.
On the generic event that the direction is nonzero at `i`, the leading index
is `i` and the question is the canonical direct question of the direct sample
`(p, i, v)`, where the LDT defect is bounded by the direct rejection.
Otherwise the restricted direction is also the restriction at the next index,
so the LDT quantity recurses to that index with the factor `q⁻¹`, the
probability that the sampled coordinate vanishes; at the last index the zero
direction has the last coordinate as its leading index by convention and no
recursion occurs.  Summing the recursion shows that each LDT diagonal branch
is at most `q / (q - 1) ≤ 2` times the corresponding branch rejection of the
direct game.  The factor is genuine: a strategy that answers the canonical
question of a direction badly and the non-canonical questions of the same
geometric line well has LDT diagonal failure exceeding the direct branch
rejection.

## References

- `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:214-458`
- `references/ldt-paper/test_definition.tex:49-65,130-151`
- Blueprint `def:ld-question-distribution`, `lem:ld-aline-level`,
  `lem:ld-dline-level`, `lem:ld-question-typed-cl`, `lem:alnf`, and `lem:dlnf`
- `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

/-! ## Direction coordinates and the one-coordinate recursion

The LDT `j`-restricted diagonal sampler decodes to a direct direction with
vanishing prefix below the reversed index `i = Fin.rev j`, and the transported
question carries the leading index of that direction.  On the generic event
that the direction is nonzero at `i`, the leading index is `i` and the
question is the canonical direct question of the direct sample `(p, i, v)`.
Otherwise the restricted direction is also the restriction at the next index,
so the LDT quantity recurses with the factor `q⁻¹`, the probability that
the sampled coordinate vanishes.  At the last index the zero direction has the
last coordinate as its leading index by convention, and no recursion occurs. -/

section DirectionCoordinates

variable (D : _root_.MIPStarRE.QPBT.DirectLdParams)









/-- Split a direct direction into the LDT free coordinates of the
`j`-restricted diagonal test, read in reversed coordinate order, and the
coordinates below the reversed index. -/
 def restrictedDirectionEquiv (j : Fin D.m) :
    (Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) ≃
      (Fin (j.val + 1) → _root_.LIDT.MIPStarRE.LDT.Fq D.toLDTParameters) ×
        (Fin (Fin.rev j).val → _root_.MIPStarRE.QPBT.DirectScalarQ D) where
  toFun v :=
    (fun c => _root_.MIPStarRE.QPBT.directScalarEquiv D (v ⟨D.m - 1 - c.val, by have := D.hm; omega⟩),
      fun c => v ⟨c.val, by
        have h1 := c.isLt
        have h2 := Fin.val_rev j
        omega⟩)
  invFun x := fun c =>
    if h : c.val < (Fin.rev j).val then x.2 ⟨c.val, h⟩
    else (_root_.MIPStarRE.QPBT.directScalarEquiv D).symm
      (x.1 ⟨D.m - 1 - c.val, by
        have h1 := c.isLt
        have h2 := j.isLt
        have h3 := Fin.val_rev j
        omega⟩)
  left_inv v := by
    funext c
    by_cases h : c.val < (Fin.rev j).val
    · simp only [dif_pos h, Fin.eta]
    · simp only [dif_neg h, Equiv.symm_apply_apply]
      refine congrArg v (Fin.ext ?_)
      change D.m - 1 - (D.m - 1 - c.val) = c.val
      have h1 := c.isLt
      have h2 := D.hm
      omega
  right_inv x := by
    refine Prod.ext ?_ ?_
    · funext c
      have h1 := c.isLt
      have h2 := j.isLt
      have h3 := Fin.val_rev j
      have hc : ¬ (D.m - 1 - c.val < (Fin.rev j).val) := by omega
      simp only [dif_neg hc, Equiv.apply_symm_apply]
      refine congrArg x.1 (Fin.ext ?_)
      change D.m - 1 - (D.m - 1 - c.val) = c.val
      omega
    · funext c
      simp only [dif_pos c.isLt, Fin.eta]





end DirectionCoordinates





/-! ## The diagonal-line branches -/

section DiagonalBranches

variable (D : _root_.MIPStarRE.QPBT.DirectLdParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D))
  (hS : S.IsProjective) (r : Fin D.k)

/-- The rejected direct mass at the diagonal question of a direct sample with
the line on the left. -/
 def diagonalLinePointRejection (p : Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) (i : Fin D.m)
    (v : Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) : ℝ :=
  _root_.MIPStarRE.QPBT.directRejectedMass D S (.dline, ⟨_root_.MIPStarRE.QPBT.lineRepMap v p, i, v⟩) (_root_.MIPStarRE.QPBT.directLdPointQuestionOf D p)

/-- The rejected direct mass at the diagonal question of a direct sample with
the point on the left. -/
 def diagonalPointLineRejection (p : Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) (i : Fin D.m)
    (v : Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) : ℝ :=
  _root_.MIPStarRE.QPBT.directRejectedMass D S (_root_.MIPStarRE.QPBT.directLdPointQuestionOf D p) (.dline, ⟨_root_.MIPStarRE.QPBT.lineRepMap v p, i, v⟩)

/-- The LDT diagonal defect with the line on the left, as a function of the
decoded base point and decoded direction of the LDT line. -/
 def diagonalLinePointDefect (p v : Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) : ℝ :=
  letI := D.toLDTFieldModel
  _root_.LIDT.MIPStarRE.LDT.qBipartiteConsDefect (_root_.MIPStarRE.QPBT.directCoordinateProjStrat D S hS r).state
    (_root_.LIDT.MIPStarRE.LDT.postprocess ((_root_.MIPStarRE.QPBT.directCoordinateProjStrat D S hS r).diagonalMeasurementA
      (_root_.MIPStarRE.QPBT.ldtDiagonalLineOf D ⟨p, D.firstIndex, v⟩)).toSubMeas (fun g => g _root_.LIDT.MIPStarRE.LDT.zeroCoord))
    ((_root_.MIPStarRE.QPBT.directCoordinateProjStrat D S hS r).pointMeasurementB
      (_root_.MIPStarRE.QPBT.directPointEquiv D p)).toSubMeas

/-- The LDT diagonal defect with the point on the left, as a function of the
decoded base point and decoded direction of the LDT line. -/
 def diagonalPointLineDefect (p v : Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) : ℝ :=
  letI := D.toLDTFieldModel
  _root_.LIDT.MIPStarRE.LDT.qBipartiteConsDefect (_root_.MIPStarRE.QPBT.directCoordinateProjStrat D S hS r).state
    ((_root_.MIPStarRE.QPBT.directCoordinateProjStrat D S hS r).pointMeasurementA
      (_root_.MIPStarRE.QPBT.directPointEquiv D p)).toSubMeas
    (_root_.LIDT.MIPStarRE.LDT.postprocess ((_root_.MIPStarRE.QPBT.directCoordinateProjStrat D S hS r).diagonalMeasurementB
      (_root_.MIPStarRE.QPBT.ldtDiagonalLineOf D ⟨p, D.firstIndex, v⟩)).toSubMeas (fun g => g _root_.LIDT.MIPStarRE.LDT.zeroCoord))

























end DiagonalBranches

end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/DirectLowDegree/Transport/DiagonalRecursion.lean#L174-L468

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