Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Combining / ExtendedLines / Overlap

Definition
QPBT_QPBT_Combining_ExtendedLines_Overlap

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

qpbt

This bundle defines the overlap quantities for paired and extended lines. It distinguishes the actual paired-subline overlap, the extended line versus point overlap, and the ordered Z-then-X overlap under the subline distribution.

Principal definitions:

  • MIPStarRE.QPBT.pairedSublineOverlap: the paired-line and point-pair overlap on one subline triple.
  • MIPStarRE.QPBT.extendedPointOverlap: the extended-line versus extended-point overlap.
  • MIPStarRE.QPBT.orderedSublineOverlap: the ordered Z-then-X overlap on the actual subline law.

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/ExtendedLines/Overlap.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_Distribution
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_Measurement
import Definitions.Def_QPBT_QPBT_Algebra_FieldBasis
import Definitions.Def_QPBT_QPBT_Algebra_LowDegreeCode
import Definitions.Def_QPBT_QPBT_Algebra_Pauli
import Definitions.Def_QPBT_QPBT_Combining_Defs
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Game
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry
import Definitions.Def_QPBT_QPBT_Combining_ExtendedLines_Measurement
import Definitions.Def_QPBT_QPBT_Combining_Witnesses
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_Support
import Definitions.Def_QPBT_QPBT_Observables_Defs
import Definitions.Def_QPBT_QPBT_Observables_ExpandedDefs
import Definitions.Def_QPBT_QPBT_Observables_LineDefs
import Definitions.Def_QPBT_QPBT_Observables_LineMeasurement_Expanded
import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame
import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest
import Mathlib
import Mathlib.Analysis.MeanInequalitiesPow

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.DistanceCalculus
end MIPStarRE.QPBT.DistanceCalculus

/-!
# Consistency of the extended-line measurements

This directly indexed auxiliary construction follows the first consistency
route for combined lines. The question carrier, completed answer alphabet,
and corrected error convention retain their existing meanings.

## References

Paper `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1118-1246`,
blueprint `lem:qld-4-13-established`.
See `docs/paper-gaps/qpbt_combined-lines-error-term.tex` and
`docs/paper-gaps/qpbt_ld-dimension-divisibility.tex` for the remaining
comparison with the printed source theorem.
-/

@[expose] public section

namespace MIPStarRE.QPBT

open LIDT.MIPStarRE.LDT hiding Measurement
open LIDT.MIPStarRE.Quantum MIPStarRE.QPBT.DistanceCalculus
open scoped BigOperators Matrix MatrixOrder ComplexOrder

noncomputable section















/-- The actual paired-line versus point-pair overlap on one subline triple,
with its uniform affine parameter. This is the integrand of the first route. -/
def pairedSublineOverlap {params : _root_.MIPStarRE.QPBT.AdmissibleParams} {error pointError lineError : ℝ}
    (setting : _root_.MIPStarRE.QPBT.ProjectiveSetting params error) (points : _root_.MIPStarRE.QPBT.CombinedPointsWitness setting pointError)
    (lines : _root_.MIPStarRE.QPBT.CombinedLinesWitness setting points lineError) (first second : _root_.MIPStarRE.QPBT.Placement)
    (sample : _root_.MIPStarRE.QPBT.SubLineTriple params) : ℝ :=
  _root_.LIDT.MIPStarRE.LDT.avgOver (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (_root_.MIPStarRE.QPBT.DirectScalarQ params.extendedDirectLd)) (fun parameter =>
    let point := _root_.MIPStarRE.QPBT.directPointToPauli params (sample.1.base + parameter • sample.1.direction)
    ∑ pair, _root_.MIPStarRE.QPBT.DistanceCalculus.stateQForm setting.psiHat
      (setting.place first ((lines.T first.side sample.2.1 sample.2.2).effect pair) *
        setting.place second (((points.Q second.side (_root_.MIPStarRE.QPBT.projX point) (_root_.MIPStarRE.QPBT.projZ point)).postprocess
          (fun values => (some values.1, some values.2))).effect
            (_root_.MIPStarRE.QPBT.evalOpt sample.2.1 (_root_.MIPStarRE.QPBT.projX point) pair.1,
              _root_.MIPStarRE.QPBT.evalOpt sample.2.2 (_root_.MIPStarRE.QPBT.projZ point) pair.2))))

/-- The actual extended-line versus extended-point overlap. Both families use
the supplied witnesses and the source polynomial combination. -/
def extendedPointOverlap {params : _root_.MIPStarRE.QPBT.AdmissibleParams} {error pointError lineError : ℝ}
    (setting : _root_.MIPStarRE.QPBT.ProjectiveSetting params error) (points : _root_.MIPStarRE.QPBT.CombinedPointsWitness setting pointError)
    (lines : _root_.MIPStarRE.QPBT.CombinedLinesWitness setting points lineError) (sublines : _root_.MIPStarRE.QPBT.SubLineWitness params)
    (first second : _root_.MIPStarRE.QPBT.Placement)
    (sample : _root_.MIPStarRE.QPBT.DirectLineDesc params.extendedDirectLd ×
      (Fin params.extendedDirectLd.m → _root_.MIPStarRE.QPBT.DirectScalarQ params.extendedDirectLd)) : ℝ :=
  ∑ answer, _root_.MIPStarRE.QPBT.DistanceCalculus.stateQForm setting.psiHat
    (setting.place first (((sublines.extendedMeasurement lines first.side sample.1).postprocess
      (fun polynomial => (_root_.MIPStarRE.QPBT.directEvalOpt sample.1 sample.2 polynomial).map
        (_root_.MIPStarRE.QPBT.extendedDirectScalarEquiv params))).effect answer) *
      setting.place second (((points.Q second.side
        (_root_.MIPStarRE.QPBT.projX (_root_.MIPStarRE.QPBT.directPointToPauli params sample.2))
        (_root_.MIPStarRE.QPBT.projZ (_root_.MIPStarRE.QPBT.directPointToPauli params sample.2))).postprocess (fun values => some
          ((_root_.MIPStarRE.QPBT.directPointToPauli params sample.2) (_root_.MIPStarRE.QPBT.alphaVar params.m) * values.1 +
            (_root_.MIPStarRE.QPBT.directPointToPauli params sample.2) (_root_.MIPStarRE.QPBT.betaVar params.m) * values.2))).effect answer))







/-- The ordered Z-then-X point overlap on the actual subline law. -/
def orderedSublineOverlap {params : _root_.MIPStarRE.QPBT.AdmissibleParams} {error pointError lineError : ℝ}
    (setting : _root_.MIPStarRE.QPBT.ProjectiveSetting params error) (points : _root_.MIPStarRE.QPBT.CombinedPointsWitness setting pointError)
    (lines : _root_.MIPStarRE.QPBT.CombinedLinesWitness setting points lineError) (first second : _root_.MIPStarRE.QPBT.Placement)
    (sample : _root_.MIPStarRE.QPBT.SubLineTriple params) : ℝ :=
  _root_.LIDT.MIPStarRE.LDT.avgOver (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (_root_.MIPStarRE.QPBT.DirectScalarQ params.extendedDirectLd)) (fun parameter =>
    let point := _root_.MIPStarRE.QPBT.directPointToPauli params (sample.1.base + parameter • sample.1.direction)
    ∑ pair, _root_.MIPStarRE.QPBT.DistanceCalculus.stateQForm setting.psiHat
      (setting.place first ((lines.T first.side sample.2.1 sample.2.2).effect pair) *
        setting.place second
          ((setting.pointMeasExpOption second.side .Z (_root_.MIPStarRE.QPBT.projZ point)).effect
              (_root_.MIPStarRE.QPBT.evalOpt sample.2.2 (_root_.MIPStarRE.QPBT.projZ point) pair.2) *
            (setting.pointMeasExpOption second.side .X (_root_.MIPStarRE.QPBT.projX point)).effect
              (_root_.MIPStarRE.QPBT.evalOpt sample.2.1 (_root_.MIPStarRE.QPBT.projX point) pair.1))))




end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/ExtendedLines/Overlap.lean#L257-L397

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