Point Tau Consistency Aa Ba Eq
ProvedMIPStarRE.QPBT.ProjectiveSetting.pointTauConsistency_aaBa_eqReindexing an operator along an equivalence is multiplicative. Formalization-only support for the interchanged conclusions of lem:qld-win-implications, blueprint ch14_qpbt_observables.tex:701-703.
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_Games_Consistency import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_Support import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_TensorSupport import Definitions.Def_QPBT_QPBT_Observables_Defs import Definitions.Def_QPBT_QPBT_Observables_ExpandedDefs import Definitions.Def_QPBT_QPBT_Observables_ExpandedPlacement import Definitions.Def_QPBT_QPBT_Observables_PointConsistency import Definitions.Def_QPBT_QPBT_State import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest import Mathlib 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.ProjectiveSetting end MIPStarRE.QPBT.ProjectiveSetting /-! # Expanded point consistency and commutation This module records the quantitative conclusions for the expanded point measurements on each of the four register placements. No symmetry-transfer principle is assumed: the four placements occur explicitly in the statements. ## References The declarations formalize blueprint `lem:qld-comm-cons`, whose paper source is `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:452-505`. -/ open scoped BigOperators Matrix MatrixOrder ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open LIDT.MIPStarRE.Quantum /-! ## Consistency of the unexpanded point measurements -/ -- The statements below are indexed by the fourfold iterated product of -- `eq:def-psihat`; instance search for its `Fintype` and `DecidableEq` -- structure needs a larger budget than the default, which the -- `synthInstance.maxSize` settings below supply declaration by declaration. open MIPStarRE.QPBT.ProjectiveSetting /-! ## Fine-product consistency on the two bipartitions -/ attribute [local instance] _root_.MIPStarRE.QPBT.pauliEdgeNonemptyPointConsistency
set_option synthInstance.maxSize 400 in
theorem MIPStarRE.QPBT.ProjectiveSetting.pointTauConsistency_aaBa_eq {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {ε : ℝ}
(S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε) (W : _root_.MIPStarRE.QPBT.PauliKind) :
_root_.MIPStarRE.QPBT.consistencyDefect (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P))
(fun u p => _root_.MIPStarRE.QPBT.heteroKron ((S.pointTauMeas .alice W u).effect p)
(1 : _root_.LIDT.MIPStarRE.Quantum.Op ((S.toStrategy.ιB × _root_.MIPStarRE.QPBT.PauliRegister P) ×
(_root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P))))
(fun u p => _root_.MIPStarRE.QPBT.heteroKron (1 : _root_.LIDT.MIPStarRE.Quantum.Op (S.toStrategy.ιA × _root_.MIPStarRE.QPBT.PauliRegister P))
(_root_.MIPStarRE.QPBT.heteroKron ((S.pointTauMeas .bob W u).effect p)
(1 : _root_.LIDT.MIPStarRE.Quantum.Op (_root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P))))
(_root_.MIPStarRE.QPBT.reindexState (_root_.MIPStarRE.QPBT.ProjectiveSetting.aaBaBipartition P S.toStrategy.ιA S.toStrategy.ιB)
S.psiHat) =
_root_.MIPStarRE.QPBT.consistencyDefect (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P))
(fun u a => _root_.MIPStarRE.QPBT.heteroKron ((S.pointMeas .alice W u).effect a) 1)
(fun u a => _root_.MIPStarRE.QPBT.heteroKron 1 ((S.pointMeas .bob W u).effect a))
S.toStrategy.ψ := by sorry