Pauli CL Dline Eq
ProvedMIPStarRE.QPBT.WinImplications.pauliCL_dline_eqqpbt
Prefix projection is idempotent at a fixed cutoff.
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.
Preamble
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_QPBT_QPBT_Algebra_FieldBasis import Definitions.Def_QPBT_QPBT_Algebra_Lines import Definitions.Def_QPBT_QPBT_Algebra_Pauli import Definitions.Def_QPBT_QPBT_Observables_Defs import Definitions.Def_QPBT_QPBT_Observables_LineDefs import Definitions.Def_QPBT_QPBT_Observables_WinImplications_LowDegree import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame 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.WinImplications end MIPStarRE.QPBT.WinImplications /-! # Low-degree winning implications This module proves the exact line-point and Pauli-basis consistency bounds. ## References The line-point and Pauli-basis consistency theorems prove items 2 and 3 of `lem:qld-win-implications` from `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:192-267` and blueprint `lem:qld-win-implications` and `lem:qld-win-implications-obs`. -/ open scoped BigOperators Matrix ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open LIDT.MIPStarRE.Quantum open MIPStarRE.QPBT.WinImplications attribute [local instance] _root_.MIPStarRE.QPBT.WinImplications.instDecidableRel_qPBT attribute [local instance] _root_.MIPStarRE.QPBT.WinImplications.linePointFintypeCanonical
Formal statement
theorem MIPStarRE.QPBT.WinImplications.pauliCL_dline_eq (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (W : _root_.MIPStarRE.QPBT.PauliKind)
(z : _root_.MIPStarRE.QPBT.PauliSpace P) :
_root_.MIPStarRE.QPBT.pauliCL P (.dline W) z = _root_.MIPStarRE.QPBT.ProjectiveSetting.contentOfLine P W
(_root_.MIPStarRE.QPBT.dLineDescOf P.toLdParams (_root_.MIPStarRE.QPBT.ldDLineCL P.toLdParams (_root_.MIPStarRE.QPBT.pauliToLd P W z))) := by sorrySource