Exists Opposite Bipartition
ProvedMIPStarRE.QPBT.ProjectiveSetting.exists_opposite_bipartitionUnder the BA'' | AA'(B'B'') bipartition, a BA'' placement is the ordinary left tensor placement.
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_FiniteMatrix_Basic import Definitions.Def_QPBT_QPBT_Algebra_FieldBasis import Definitions.Def_QPBT_QPBT_Algebra_LowDegreeCode import Definitions.Def_QPBT_QPBT_Combining_Lines_Construction import Definitions.Def_QPBT_QPBT_Combining_Points_Orthonormalization import Definitions.Def_QPBT_QPBT_Games_Defs 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 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 /-! # Construction of consistent combined lines The heterogeneous pasting theorem bounds the actual X-Z-X measurement. Polynomial absorption produces a line error for each polynomial point family. ## References Paper `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:882-963`, blueprint `lem:qld-xz-lines`. The source and completed-answer distinctions remain as documented in `docs/paper-gaps/qpbt_combined-lines-error-term.tex`. -/ open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open LIDT.MIPStarRE.Quantum MIPStarRE.QPBT.DistanceCalculus open scoped BigOperators Matrix MatrixOrder ComplexOrder
set_option synthInstance.maxSize 400 in
theorem MIPStarRE.QPBT.ProjectiveSetting.exists_opposite_bipartition {params : _root_.MIPStarRE.QPBT.AdmissibleParams}
{error : ℝ} (setting : _root_.MIPStarRE.QPBT.ProjectiveSetting params error)
(first second : _root_.MIPStarRE.QPBT.Placement) (hopposite : first.IsOpposite second) :
∃ equivalence : _root_.MIPStarRE.QPBT.SixReg params setting.toStrategy.ιA setting.toStrategy.ιB ≃
setting.ExpandedLocalSpace first.side ×
(setting.ExpandedLocalSpace second.side ×
(_root_.MIPStarRE.QPBT.PauliRegister params × _root_.MIPStarRE.QPBT.PauliRegister params)),
(∀ operator : _root_.LIDT.MIPStarRE.Quantum.Op (setting.ExpandedLocalSpace first.side),
_root_.MIPStarRE.QPBT.reindexOp equivalence (_root_.MIPStarRE.QPBT.heteroKron operator 1) = setting.place first operator) ∧
(∀ operator : _root_.LIDT.MIPStarRE.Quantum.Op (setting.ExpandedLocalSpace second.side),
_root_.MIPStarRE.QPBT.reindexOp equivalence (_root_.MIPStarRE.QPBT.heteroKron 1 (_root_.MIPStarRE.QPBT.heteroKron operator
(1 : _root_.LIDT.MIPStarRE.Quantum.Op (_root_.MIPStarRE.QPBT.PauliRegister params × _root_.MIPStarRE.QPBT.PauliRegister params)))) =
setting.place second operator) := by sorry