Extended Q Spec
ProvedMIPStarRE.QPBT.extendedQ_specRegister placement preserves the total of a finite operator family.
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_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_Points import Definitions.Def_QPBT_QPBT_Combining_Witnesses import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Games_Distance import Definitions.Def_QPBT_QPBT_Games_Sandwich_Support import Definitions.Def_QPBT_QPBT_Observables_Defs import Definitions.Def_QPBT_QPBT_Observables_ExpandedDefs import Definitions.Def_QPBT_QPBT_Observables_PointConsistency 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.CombinedPointsWitness end MIPStarRE.QPBT.CombinedPointsWitness /-! # Combining the point measurements This module constructs the projective joint X/Z point measurements and defines their scalar linear coarse-graining. The latter is the genuine postprocessing of a complete measurement on each heterogeneous player space. ## References The construction is `lem:qld-4-10` in `blueprint/src/chapter/ch15_qpbt_combining.tex`, with paper source `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:689-709`. The coarse-graining is `lem:qld-4-12` in the same blueprint, with paper source `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:993-1011`. -/ open scoped BigOperators Matrix MatrixOrder ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open LIDT.MIPStarRE.Quantum open MIPStarRE.QPBT.CombinedPointsWitness
set_option maxHeartbeats 1600000 in
-- Coarse-graining the joint point POVM expands three large finite consistency sums.
theorem MIPStarRE.QPBT.extendedQ_spec {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {ε δ : ℝ}
{S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε} (points : _root_.MIPStarRE.QPBT.CombinedPointsWitness S δ) :
(∀ side x z alpha beta,
_root_.MIPStarRE.QPBT.Measurement.IsProjective (points.extendedQ side x z alpha beta)) ∧
(∀ p1 p2 : _root_.MIPStarRE.QPBT.Placement, p1.IsOpposite p2 ->
_root_.MIPStarRE.QPBT.opFamilyDistSq (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (_root_.MIPStarRE.QPBT.ExtendedPointQuestion P))
(fun question c => S.place p1
((points.extendedQ p1.side question.1.1 question.1.2
question.2.1 question.2.2).effect c))
(fun question c => S.place p2
((points.extendedQ p2.side question.1.1 question.1.2
question.2.1 question.2.2).effect c))
S.psiHat <= δ) ∧
(∀ p1 p2 : _root_.MIPStarRE.QPBT.Placement, p1.IsOpposite p2 ->
_root_.MIPStarRE.QPBT.opFamilyDistSq (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (_root_.MIPStarRE.QPBT.ExtendedPointQuestion P))
(fun question c => S.place p1
((points.extendedQ p1.side question.1.1 question.1.2
question.2.1 question.2.2).effect c))
(fun question c => S.place p2
(∑ ab ∈ Finset.univ.filter (fun ab : _root_.MIPStarRE.QPBT.PauliScalar P × _root_.MIPStarRE.QPBT.PauliScalar P =>
question.2.1 * ab.1 + question.2.2 * ab.2 = c),
(S.pointMeasExp p2.side .X question.1.1).effect ab.1 *
(S.pointMeasExp p2.side .Z question.1.2).effect ab.2))
S.psiHat <= δ) ∧
∀ p1 p2 : _root_.MIPStarRE.QPBT.Placement, p1.IsOpposite p2 ->
_root_.MIPStarRE.QPBT.opFamilyDistSq (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (_root_.MIPStarRE.QPBT.ExtendedPointQuestion P))
(fun question c => S.place p1
((points.extendedQ p1.side question.1.1 question.1.2
question.2.1 question.2.2).effect c))
(fun question c => S.place p2
(∑ ab ∈ Finset.univ.filter (fun ab : _root_.MIPStarRE.QPBT.PauliScalar P × _root_.MIPStarRE.QPBT.PauliScalar P =>
question.2.1 * ab.1 + question.2.2 * ab.2 = c),
(S.pointMeasExp p2.side .Z question.1.2).effect ab.2 *
(S.pointMeasExp p2.side .X question.1.1).effect ab.1))
S.psiHat <= δ := by sorry