Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Combining / ExtendedLines / Measurement

Definition
QPBT_QPBT_Combining_ExtendedLines_Measurement

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

qpbt

This bundle defines supported subline triples and the extended-line POVM used by the measurement construction. It gives conditional laws, affine coordinates, source polynomial combinations, positive masses, and normalization after conditioning.

Principal definitions:

  • MIPStarRE.QPBT.directLinePointDist_line_weight_pos: every canonical direct line has positive marginal mass.
  • The supported-triple fiber records subline data over a fixed extended line.
  • The conditional law normalizes supported triples over the selected extended line.
  • Affine coordinates and combined polynomials describe each supported triple.
  • The extended measurement averages the postprocessed paired-line POVMs.

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/Measurement.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_Lines
import Definitions.Def_QPBT_QPBT_Algebra_LowDegreeCode
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_Witnesses
import Definitions.Def_QPBT_QPBT_Games_DistributionAux
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_Test_LowDegreeGame
import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest
import Mathlib
import Mathlib.Analysis.MeanInequalitiesPow
import Theorems.Thm_LIDT_MIPStarRE_LDT_averageOperatorOverDistribution_const_of_isProbability

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

/-!
# Conditional 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

/-- A positive atom gives a positive atom of every push-forward. -/
private theorem map_weight_pos_of_weight_pos {Source Target : Type*}
    [DecidableEq Target] (law : _root_.LIDT.MIPStarRE.LDT.Distribution Source) (mapping : Source → Target)
    (sample : Source) (hpositive : 0 < law.weight sample) :
    0 < (law.map mapping).weight (mapping sample) := by
  classical
  have hmem : sample ∈ law.support := by
    by_contra hnot
    simp [law.outsideSupport sample hnot] at hpositive
  exact hpositive.trans_le (Finset.single_le_sum
    (fun other _ => law.nonnegative other) (Finset.mem_filter.mpr ⟨hmem, rfl⟩))

/-- Every canonical direct line has positive marginal mass. In particular, the
conditional distribution in the construction at paper lines 1118--1132 is defined
on every direct line, including zero-direction diagonal lines. -/
theorem directLinePointDist_line_weight_pos (params : _root_.MIPStarRE.QPBT.DirectLdParams)
    (line : _root_.MIPStarRE.QPBT.DirectLineDesc params) :
    0 < ((_root_.MIPStarRE.QPBT.directLinePointDist params).map Prod.fst).weight line := by
  have huniform (sample : _root_.MIPStarRE.QPBT.DirectLdSpace params) :
      0 < (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (_root_.MIPStarRE.QPBT.DirectLdSpace params)).weight sample := by
    rw [_root_.MIPStarRE.QPBT.uniformDistribution_weight_apply]
    positivity
  suffices hpoint : 0 < (_root_.MIPStarRE.QPBT.directLinePointDist params).weight (line, line.base) by
    exact map_weight_pos_of_weight_pos _ Prod.fst _ hpoint
  cases line with
  | axis base index baseFixed =>
    let sample : _root_.MIPStarRE.QPBT.DirectLdSpace params := ⟨base, index, 0⟩
    have haxis := map_weight_pos_of_weight_pos
      (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (_root_.MIPStarRE.QPBT.DirectLdSpace params))
      (fun source => (_root_.MIPStarRE.QPBT.directALineDescOf params source, source.point)) sample (huniform sample)
    have hdecode : _root_.MIPStarRE.QPBT.directALineDescOf params sample = .axis base index baseFixed := by
      simp [_root_.MIPStarRE.QPBT.directALineDescOf, sample, baseFixed]
    change 0 < (_root_.MIPStarRE.QPBT.directALinePointDist params).weight _ at haxis
    rw [hdecode] at haxis
    have hother := (_root_.MIPStarRE.QPBT.directDLinePointDist params).nonnegative
      (_root_.MIPStarRE.QPBT.DirectLineDesc.axis base index baseFixed, base)
    change 0 < (1 / 2 : ℝ) * (_root_.MIPStarRE.QPBT.directALinePointDist params).weight _ +
      (1 - 1 / 2) * (_root_.MIPStarRE.QPBT.directDLinePointDist params).weight _
    change 0 < (_root_.MIPStarRE.QPBT.directALinePointDist params).weight
      (_root_.MIPStarRE.QPBT.DirectLineDesc.axis base index baseFixed, base) at haxis
    dsimp only [_root_.MIPStarRE.QPBT.DirectLineDesc.base]
    linarith
  | diagonal base index direction baseFixed prefixZero =>
    let sample : _root_.MIPStarRE.QPBT.DirectLdSpace params := ⟨base, index, direction⟩
    have hprefix : _root_.MIPStarRE.QPBT.directPrefixProjection index direction = direction := by
      funext coordinate
      simp only [_root_.MIPStarRE.QPBT.directPrefixProjection]
      split_ifs with hbefore
      · exact (prefixZero coordinate hbefore).symm
      · rfl
    have hdiagonal := map_weight_pos_of_weight_pos
      (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (_root_.MIPStarRE.QPBT.DirectLdSpace params))
      (fun source => (_root_.MIPStarRE.QPBT.directDLineDescOf params source, source.point)) sample (huniform sample)
    have hdecode : _root_.MIPStarRE.QPBT.directDLineDescOf params sample =
        .diagonal base index direction baseFixed prefixZero := by
      simp [_root_.MIPStarRE.QPBT.directDLineDescOf, sample, hprefix, baseFixed]
    change 0 < (_root_.MIPStarRE.QPBT.directDLinePointDist params).weight _ at hdiagonal
    rw [hdecode] at hdiagonal
    have hother := (_root_.MIPStarRE.QPBT.directALinePointDist params).nonnegative
      (_root_.MIPStarRE.QPBT.DirectLineDesc.diagonal base index direction baseFixed prefixZero, base)
    change 0 < (1 / 2 : ℝ) * (_root_.MIPStarRE.QPBT.directALinePointDist params).weight _ +
      (1 - 1 / 2) * (_root_.MIPStarRE.QPBT.directDLinePointDist params).weight _
    change 0 < (_root_.MIPStarRE.QPBT.directDLinePointDist params).weight
      (_root_.MIPStarRE.QPBT.DirectLineDesc.diagonal base index direction baseFixed prefixZero, base) at hdiagonal
    dsimp only [_root_.MIPStarRE.QPBT.DirectLineDesc.base]
    linarith

/-- The supported triples over a fixed extended line. Restricting the carrier
retains the affine compatibility proof without choosing any substitute lines. -/
abbrev SubLineWitness.Fiber {params : _root_.MIPStarRE.QPBT.AdmissibleParams} (sublines : _root_.MIPStarRE.QPBT.SubLineWitness params)
    (line : _root_.MIPStarRE.QPBT.DirectLineDesc params.extendedDirectLd) :=
  ↥(sublines.D.support.filter (fun sample => sample.1 = line))

/-- The mass of a subline fiber is positive by the prescribed extended marginal. -/
theorem SubLineWitness.fiber_mass_pos {params : _root_.MIPStarRE.QPBT.AdmissibleParams}
    (sublines : _root_.MIPStarRE.QPBT.SubLineWitness params) (line : _root_.MIPStarRE.QPBT.DirectLineDesc params.extendedDirectLd) :
    0 < (sublines.D.map Prod.fst).weight line := by
  rw [sublines.extended_marginal]
  exact _root_.MIPStarRE.QPBT.directLinePointDist_line_weight_pos _ _

/-- The genuine conditional law of the supported subline triples given their
extended line, as in paper lines 1118--1132. There is no zero-mass branch. -/
def SubLineWitness.conditionalLaw {params : _root_.MIPStarRE.QPBT.AdmissibleParams}
    (sublines : _root_.MIPStarRE.QPBT.SubLineWitness params) (line : _root_.MIPStarRE.QPBT.DirectLineDesc params.extendedDirectLd) :
    _root_.LIDT.MIPStarRE.LDT.Distribution (sublines.Fiber line) where
  support := Finset.univ
  weight sample := sublines.D.weight sample.val / (sublines.D.map Prod.fst).weight line
  nonnegative sample := div_nonneg (sublines.D.nonnegative sample.val)
    (sublines.fiber_mass_pos line).le
  outsideSupport sample hnot := (hnot (Finset.mem_univ sample)).elim

/-- Conditioning on an extended line preserves total mass one. -/
theorem SubLineWitness.conditionalLaw_isProbability {params : _root_.MIPStarRE.QPBT.AdmissibleParams}
    (sublines : _root_.MIPStarRE.QPBT.SubLineWitness params) (line : _root_.MIPStarRE.QPBT.DirectLineDesc params.extendedDirectLd) :
    (sublines.conditionalLaw line).IsProbability := by
  change (∑ sample : sublines.Fiber line,
    sublines.D.weight sample.val / (sublines.D.map Prod.fst).weight line) = 1
  rw [← Finset.sum_div, Finset.sum_coe_sort]
  exact div_self (sublines.fiber_mass_pos line).ne'

/-- Supported subline triples supply all eight affine coordinates in the
polynomial combination formula; the choice is only of proved compatible data. -/
 theorem SubLineWitness.exists_affineData {params : _root_.MIPStarRE.QPBT.AdmissibleParams}
    (sublines : _root_.MIPStarRE.QPBT.SubLineWitness params) (sample : _root_.MIPStarRE.QPBT.SubLineTriple params)
    (hsample : sample ∈ sublines.D.support) :
    ∃ data : Fin 8 → _root_.MIPStarRE.QPBT.PauliScalar params,
      _root_.MIPStarRE.QPBT.IsCombineLineCompatible (_root_.MIPStarRE.QPBT.directPointToPauli params sample.1.base)
        (_root_.MIPStarRE.QPBT.directPointToPauli params sample.1.direction)
        sample.2.1.base sample.2.1.direction sample.2.2.base sample.2.2.direction
        (data 0) (data 1) (data 2) (data 3) (data 4) (data 5) (data 6) (data 7) := by
  obtain ⟨offsetX, slopeX, offsetZ, slopeZ, alpha, alphaSlope, beta, betaSlope, hcompat⟩ :=
    sublines.compatibility sample hsample
  exact ⟨![offsetX, slopeX, offsetZ, slopeZ, alpha, alphaSlope, beta, betaSlope], hcompat⟩

/-- Affine coordinates for the actual subline triple, not a replacement POVM. -/
def SubLineWitness.affineData {params : _root_.MIPStarRE.QPBT.AdmissibleParams}
    (sublines : _root_.MIPStarRE.QPBT.SubLineWitness params) (sample : _root_.MIPStarRE.QPBT.SubLineTriple params)
    (hsample : sample ∈ sublines.D.support) : Fin 8 → _root_.MIPStarRE.QPBT.PauliScalar params :=
  Classical.choose (show
    ∃ data : Fin 8 → _root_.MIPStarRE.QPBT.PauliScalar params,
      _root_.MIPStarRE.QPBT.IsCombineLineCompatible (_root_.MIPStarRE.QPBT.directPointToPauli params sample.1.base)
        (_root_.MIPStarRE.QPBT.directPointToPauli params sample.1.direction)
        sample.2.1.base sample.2.1.direction sample.2.2.base sample.2.2.direction
        (data 0) (data 1) (data 2) (data 3) (data 4) (data 5) (data 6) (data 7) from by
    exact sublines.exists_affineData sample hsample)



/-- The source polynomial combination on a supported triple, transported only
along the canonical identification of the two scalar models. -/
def SubLineWitness.combinedPolynomial {params : _root_.MIPStarRE.QPBT.AdmissibleParams}
    (sublines : _root_.MIPStarRE.QPBT.SubLineWitness params) (sample : _root_.MIPStarRE.QPBT.SubLineTriple params)
    (hsample : sample ∈ sublines.D.support)
    (polynomials : _root_.MIPStarRE.QPBT.DegPoly params.toLdParams (params.m * params.d) ×
      _root_.MIPStarRE.QPBT.DegPoly params.toLdParams (params.m * params.d)) :
    _root_.MIPStarRE.QPBT.DirectDegPoly params.extendedDirectLd (params.m * params.d + 1) :=
  let data := sublines.affineData sample hsample
  fun index => (_root_.MIPStarRE.QPBT.extendedDirectScalarEquiv params).symm
    (_root_.MIPStarRE.QPBT.combineLinePoly (data 0) (data 1) (data 2) (data 3)
      (data 4) (data 5) (data 6) (data 7) polynomials.1 polynomials.2 index)

/-- The directly indexed form of the extended-line POVM at paper lines
1118--1132: condition the subline law and average the postprocessed paired-line POVMs. -/
def SubLineWitness.extendedMeasurement {params : _root_.MIPStarRE.QPBT.AdmissibleParams}
    {error pointError lineError : ℝ} {setting : _root_.MIPStarRE.QPBT.ProjectiveSetting params error}
    {points : _root_.MIPStarRE.QPBT.CombinedPointsWitness setting pointError}
    (sublines : _root_.MIPStarRE.QPBT.SubLineWitness params) (lines : _root_.MIPStarRE.QPBT.CombinedLinesWitness setting points lineError)
    (side : _root_.MIPStarRE.QPBT.PlayerSide) (line : _root_.MIPStarRE.QPBT.DirectLineDesc params.extendedDirectLd) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.DirectDegPoly params.extendedDirectLd (params.m * params.d + 1))
      (setting.ExpandedLocalSpace side) := by
  let family (sample : sublines.Fiber line) :=
    (lines.T side sample.val.2.1 sample.val.2.2).postprocess
      (sublines.combinedPolynomial sample.val (Finset.mem_filter.mp sample.property).1)
  have hsum : (∑ polynomial, _root_.LIDT.MIPStarRE.LDT.averageOperatorOverDistribution (sublines.conditionalLaw line)
      (fun sample => (family sample).effect polynomial)) = 1 := by
    rw [← _root_.LIDT.MIPStarRE.LDT.averageOperatorOverDistribution_sum]
    simp only [_root_.LIDT.MIPStarRE.Quantum.Measurement.sum_eq_one]
    exact _root_.LIDT.MIPStarRE.LDT.averageOperatorOverDistribution_const_of_isProbability _
      (sublines.conditionalLaw_isProbability line) 1
  exact { effect := fun polynomial => _root_.LIDT.MIPStarRE.LDT.averageOperatorOverDistribution
            (sublines.conditionalLaw line) (fun sample => (family sample).effect polynomial)
          pos := fun polynomial => _root_.LIDT.MIPStarRE.LDT.averageOperatorOverDistribution_nonneg _ _
            (fun sample => (family sample).pos polynomial)
          sum_le_one := le_of_eq hsum
          sum_eq_one := hsum }




























end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/ExtendedLines/Measurement.lean#L31-L204

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