Block Diagonal Measurement Postprocess
ProvedMIPStarRE.QPBT.blockDiagonalMeasurement_postprocessBlock-diagonal assembly commutes with deterministic outcome postprocessing.
All objects, parameters, typeclass assumptions, and hypotheses are quantified in the accompanying formal statement; each symbol denotes the object of the displayed Lean type with that name. The conclusion is the proposition
This result is an importable reduction step in the formal dependency graph for the quantum Pauli basis test completeness or soundness argument.
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.
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_Measurement import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_SeedFiber import Definitions.Def_QPBT_QPBT_Upstream import Mathlib namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace LIDT.MIPStarRE.LDT.Preliminaries end LIDT.MIPStarRE.LDT.Preliminaries namespace LIDT.MIPStarRE.Quantum end LIDT.MIPStarRE.Quantum namespace MIPStarRE.QPBT end MIPStarRE.QPBT /-! # Low-degree consistency transport This module identifies the low individual degree polynomial outcomes with the bounded polynomial representatives used by the directly indexed QPBT game. It also transports complete measurements and their evaluation postprocessings without changing either coordinate order or consistency error. ## References - `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:393-458` - `references/ldt-paper/test_definition.tex:180-202` - `docs/paper-gaps/qpbt_ld-dimension-divisibility.tex` -/ open scoped BigOperators Matrix MatrixOrder ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT open LIDT.MIPStarRE.LDT.Preliminaries open LIDT.MIPStarRE.Quantum /-! ## Polynomial outcomes -/ /-! ## Complete measurements -/ /-! ## Correlated-ancilla compression -/ /-! The diagonal-block conditional expectation preserves either mixed defect exactly because the point measurement on the opposite carrier is constant on the residue register. It does not yield a global/global compression theorem: the lifted state pairs equal residues, whereas separately compressing both polynomial measurements produces an independent double average over residues. Neither quantity bounds the other in general. This open obstruction is recorded in `docs/paper-gaps/qpbt_ld-dimension-divisibility.tex`. -/
theorem MIPStarRE.QPBT.blockDiagonalMeasurement_postprocess
{alpha beta iota block : Type*}
[Fintype alpha] [DecidableEq alpha]
[Fintype beta] [DecidableEq beta]
[Fintype iota] [DecidableEq iota]
[Fintype block] [DecidableEq block]
(M : block → _root_.LIDT.MIPStarRE.Quantum.Measurement alpha iota)
(f : alpha → beta) :
(_root_.MIPStarRE.QPBT.blockDiagonalMeasurement M).postprocess f =
_root_.MIPStarRE.QPBT.blockDiagonalMeasurement (fun r => (M r).postprocess f) := by sorry