Cauchy--Schwarz for a selected set of outcome-indexed operator products
ProvedMIPRE.Introspection.abs_sum_qform_mul_leA statement of the module MIPRE.Foundations.Introspection.ValueStability of the MIP* = RE formalization (commit 70cbf1c of vidick/MIPRE-formalization). Value stability for the introspection induction. The induction replaces projective measurements using summed squared state distance. The resulting change in test acceptance is dimension independent: 2 sqrt(delta) per party. Summing outcomes before Cauchy--Schwarz avoids any loss depending on the size of the introspection answer alphabet.
Cauchy--Schwarz for a selected set of outcome-indexed operator products.
Formal statement. In Lean, with the scope shown:
open MIPRE
open MIPRE.Introspection
open Finset Matrix Classical
open scoped Kronecker ComplexOrder MatrixOrder
variable {N C : Type*} [Fintype N] [DecidableEq N] [Fintype C] [DecidableEq C]
theorem MIPRE.Introspection.abs_sum_qform_mul_le (v : N → ℂ) (s : Finset C)
(M R : C → Matrix N N ℂ) (hM : ∀ c, (M c)ᴴ = M c) :
|∑ c ∈ s, qform v (M c * R c)| ≤
Real.sqrt (∑ c ∈ s, snorm v (M c) ^ 2) *
Real.sqrt (∑ c ∈ s, snorm v (R c) ^ 2)
Formalization Note MIPRE.Introspection.abs_sum_qform_mul_le is declared in MIPRE/Foundations/Introspection/ValueStability.lean, lines 37–56. The binders, hypotheses and conclusion are exactly those of the Lean statement above; the uploaded statement elaborates to the same type as the declaration in the repository. The definitions it mentions are those of the published definition bundles of the module's import closure.
import Mathlib.Algebra.MvPolynomial.CommRing
import Mathlib.Algebra.MvPolynomial.Degrees
import Mathlib.Algebra.MvPolynomial.SchwartzZippel
import Mathlib.Algebra.Polynomial.Roots
import Mathlib.Analysis.CStarAlgebra.CStarMatrix
import Mathlib.Analysis.CStarAlgebra.Classes
import Mathlib.Analysis.CStarAlgebra.Matrix
import Mathlib.Analysis.InnerProductSpace.PiL2
import Mathlib.Analysis.Matrix.Order
import Mathlib.Analysis.Matrix.PosDef
import Mathlib.Analysis.SpecialFunctions.Complex.Circle
import Mathlib.Data.ENat.Lattice
import Mathlib.Data.Rat.Cast.Order
import Mathlib.Data.Real.Basic
import Mathlib.Data.ZMod.Basic
import Mathlib.FieldTheory.Finite.GaloisField
import Mathlib.LinearAlgebra.Matrix.Kronecker
import Mathlib.RingTheory.Trace.Basic
import Mathlib.Tactic.IntervalCases
import Definitions.Def_MIPRE_Foundations_Games
import Definitions.Def_MIPRE_Foundations_Distances
import Definitions.Def_MIPRE_Foundations_LowDegree_Encoding
import Definitions.Def_MIPRE_Foundations_Closeness
import Definitions.Def_MIPRE_Foundations_OpBound
import Definitions.Def_MIPRE_Foundations_OpBound_B
import Definitions.Def_MIPRE_Foundations_StateDistance
import Definitions.Def_MIPRE_Foundations_StateDistance_B
import Definitions.Def_MIPRE_Foundations_POVMValue
import Definitions.Def_MIPRE_Foundations_Sign
import Definitions.Def_MIPRE_Foundations_CrossConsistency
import Definitions.Def_MIPRE_Foundations_CrossConsistency_B
import Definitions.Def_MIPRE_Foundations_PVM
import Definitions.Def_MIPRE_Foundations_PVM_B
import Definitions.Def_MIPRE_Foundations_Commutation
import Definitions.Def_MIPRE_Foundations_Dilation
import Definitions.Def_MIPRE_Foundations_Expanded
import Definitions.Def_MIPRE_Foundations_LowDegree_SchwartzZippel
import Definitions.Def_MIPRE_Foundations_LowDegree_Anticomm
import Definitions.Def_MIPRE_Foundations_Weyl
import Definitions.Def_MIPRE_Foundations_Parseval
import Definitions.Def_MIPRE_Foundations_Linearity
import Definitions.Def_MIPRE_Foundations_Sandwich
import Definitions.Def_MIPRE_Foundations_Pasting
import Definitions.Def_MIPRE_Foundations_Swap
import Definitions.Def_MIPRE_Foundations_Introspection_ValueStability
open MIPRE
open MIPRE.Introspection
open Finset Matrix Classical
open scoped Kronecker ComplexOrder MatrixOrder
set_option linter.unusedSectionVars false
variable {N C : Type*} [Fintype N] [DecidableEq N] [Fintype C] [DecidableEq C]theorem MIPRE.Introspection.abs_sum_qform_mul_le (v : N → ℂ) (s : Finset C)
(M R : C → Matrix N N ℂ) (hM : ∀ c, (M c)ᴴ = M c) :
|∑ c ∈ s, qform v (M c * R c)| ≤
Real.sqrt (∑ c ∈ s, snorm v (M c) ^ 2) *
Real.sqrt (∑ c ∈ s, snorm v (R c) ^ 2) := by sorry