Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LIDT definitions: LDT / Preliminaries / CauchySchwarz

Definition
LIDT_MIPStarRE_LDT_Preliminaries_CauchySchwarz

by Dengnifer · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

lidt

This bundle provides the Cauchy-Schwarz estimates used to pass from approximate-δ\deltaδ control to the easier approximation relation. It includes a square-root bound for a sum of expectation products, the implication between approximation predicates, and the named approximate-defect estimate.

Principal definitions:

  • sum_ev_mul_le_sqrt: bounds a sum of expectation products by a square-root expression.
  • question_easyApproxFromApproxDelta: derives question-level easy approximation.
  • easyApproxFromApproxDelta: derives the general easy approximation relation.
  • cabApproxDelta: bounds the named approximate defect by Cauchy-Schwarz.

Formalization credit: Sirui Lu, Ruixuan Deng, Yanqiao Zhu, and Zhengfeng Ji (arXiv:2609.19814). Mathematical source: Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen (arXiv:2009.12982).

Definition code
-- Generated from MIPStarRE/LDT/Preliminaries/CauchySchwarz.lean by skeleton subtraction.
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_DistributionAvg
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DistributionUniformSums
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LinePolynomials
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LowDegreePolynomial
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_MeasurementLift
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OpFamily
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OperatorExpectations
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_PMFAverages
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_PMFUniformAverages
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_Basic_SubMeasurementCore
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_SubMeasurementFamilies
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_TensorPlacement
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_ComparisonCore
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_DistanceBounds
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_SwitchSandwichPrep_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_Preliminaries_SwitchSandwichPrep_InnerProduct
import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_QuantumNonneg
import Definitions.Def_LIDT_MIPStarRE_LDT_Test_Defs
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_BlockDiagonal
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_NormalizedTrace
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Order
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_TracePairing
import Mathlib
import Mathlib.Analysis.MeanInequalitiesPow
import Mathlib.Probability.ProbabilityMassFunction.Integrals
import Mathlib.Probability.ProbabilityMassFunction.Monad

open scoped _root_.Matrix

namespace LIDT

namespace MIPStarRE.LDT.Preliminaries
end MIPStarRE.LDT.Preliminaries

/-!
# Cauchy–Schwarz Inequalities for Approximate Measurements

Formalizes Cauchy–Schwarz-style propositions from Section 3
(Preliminaries) of the LDT paper:
- `easyApproxFromApproxDelta` — Proposition `prop:easy-approx-from-approx-delta`
- `closenessOfIP` / `closenessOfIPAdjoint` — Proposition `prop:closeness-of-ip`
  (`eq:closeness3` / `eq:closeness4`)
- `cabApproxDelta` — Proposition `prop:cab-approx-delta`

## References

- `references/ldt-paper/preliminaries.tex`
- `blueprint/src/chapter/ch03_preliminaries.tex`
-/

@[expose] public section

open scoped BigOperators MatrixOrder _root_.Matrix ComplexOrder

namespace MIPStarRE.LDT.Preliminaries

open MIPStarRE.LDT

lemma sum_ev_mul_le_sqrt
    {Outcome : Type*} {ι : Type*}
    [Fintype Outcome] [Fintype ι] [DecidableEq ι]
    (ψ : QuantumState ι)
    (X Y : Outcome → MIPStarRE.Quantum.Op ι) :
    |∑ a : Outcome, ev ψ (X a * Y a)| ≤
      Real.sqrt (∑ a : Outcome, ev ψ (X a * (X a)ᴴ)) *
        Real.sqrt (∑ a : Outcome, ev ψ ((Y a)ᴴ * Y a)) := by
  calc
    |∑ a : Outcome, ev ψ (X a * Y a)|
      ≤ ∑ a : Outcome, |ev ψ (X a * Y a)| := by
          exact Finset.abs_sum_le_sum_abs _ _
    _ ≤ ∑ a : Outcome,
          Real.sqrt (ev ψ (X a * (X a)ᴴ)) *
            Real.sqrt (ev ψ ((Y a)ᴴ * Y a)) := by
          refine Finset.sum_le_sum ?_
          intro a ha
          exact ev_abs_mul_le_sqrt ψ (X a) (Y a)
    _ ≤ Real.sqrt
          (∑ a : Outcome, ev ψ (X a * (X a)ᴴ)) *
        Real.sqrt
          (∑ a : Outcome, ev ψ ((Y a)ᴴ * Y a)) := by
          exact
            Real.sum_sqrt_mul_sqrt_le (s := Finset.univ)
              (f := fun a => ev ψ (X a * (X a)ᴴ))
              (g := fun a => ev ψ ((Y a)ᴴ * Y a))
              (fun a => by
                simpa using ev_adjoint_self_nonneg ψ ((X a)ᴴ))
              (fun a => ev_adjoint_self_nonneg ψ (Y a))

private lemma question_easyApproxFromApproxDelta
    {Outcome : Type*} {ι : Type*}
    [Fintype Outcome] [Fintype ι] [DecidableEq ι]
    (ψ : QuantumState ι) (hψ : ψ.IsNormalized)
    (A B C : SubMeas Outcome ι) :
    |(∑ a : Outcome, ev ψ (A.outcome a * C.outcome a)) -
        ∑ a : Outcome, ev ψ (B.outcome a * C.outcome a)| ≤
      Real.sqrt (qSDD ψ A B) := by
  let diagC : Error := ∑ a : Outcome, ev ψ (C.outcome a * C.outcome a)
  have hdiagC_le_one : diagC ≤ 1 := by
    simpa [diagC] using subMeas_diagMass_le_one ψ hψ C
  have hmain :
      |∑ a : Outcome, ev ψ ((A.outcome a - B.outcome a) * C.outcome a)| ≤
        Real.sqrt (qSDD ψ A B) * Real.sqrt diagC := by
    have hherm :
        ∀ a : Outcome, (A.outcome a - B.outcome a)ᴴ = A.outcome a - B.outcome a := by
      intro a
      simp [SubMeas.outcome_hermitian]
    calc
      |∑ a : Outcome, ev ψ ((A.outcome a - B.outcome a) * C.outcome a)|
        ≤ Real.sqrt
            (∑ a : Outcome,
              ev ψ
                ((A.outcome a - B.outcome a) *
                  (A.outcome a - B.outcome a)ᴴ)) *
            Real.sqrt
              (∑ a : Outcome, ev ψ ((C.outcome a)ᴴ * C.outcome a)) := by
              simpa using
                sum_ev_mul_le_sqrt ψ
                  (fun a => A.outcome a - B.outcome a)
                  (fun a => C.outcome a)
      _ = Real.sqrt (qSDD ψ A B) * Real.sqrt diagC := by
            have hleft :
                (∑ a : Outcome,
                    ev ψ
                      ((A.outcome a - B.outcome a) *
                        (A.outcome a - B.outcome a)ᴴ)) =
                  qSDD ψ A B := by
              simp [qSDD, qSDDCore, hherm]
            have hright :
                (∑ a : Outcome, ev ψ ((C.outcome a)ᴴ * C.outcome a)) = diagC := by
              simp [diagC, SubMeas.outcome_hermitian]
            rw [hleft, hright]
  have hsqrt_diagC : Real.sqrt diagC ≤ 1 := by
    simpa using Real.sqrt_le_sqrt hdiagC_le_one
  have hmain' :
      |∑ a : Outcome, ev ψ ((A.outcome a - B.outcome a) * C.outcome a)| ≤
        Real.sqrt (qSDD ψ A B) := by
    calc
      |∑ a : Outcome, ev ψ ((A.outcome a - B.outcome a) * C.outcome a)|
        ≤ Real.sqrt (qSDD ψ A B) * Real.sqrt diagC := hmain
      _ ≤ Real.sqrt (qSDD ψ A B) * 1 := by
            exact mul_le_mul_of_nonneg_left hsqrt_diagC (Real.sqrt_nonneg _)
      _ = Real.sqrt (qSDD ψ A B) := by ring
  convert hmain' using 1
  refine congrArg abs ?_
  calc
    ∑ a : Outcome, ev ψ (A.outcome a * C.outcome a) -
        ∑ a : Outcome, ev ψ (B.outcome a * C.outcome a)
      = ∑ a : Outcome,
          (ev ψ (A.outcome a * C.outcome a) -
            ev ψ (B.outcome a * C.outcome a)) := by
              rw [← Finset.sum_sub_distrib]
    _ = ∑ a : Outcome, ev ψ ((A.outcome a - B.outcome a) * C.outcome a) := by
          refine Finset.sum_congr rfl ?_
          intro a ha
          rw [(ev_sub ψ (A.outcome a * C.outcome a) (B.outcome a * C.outcome a)).symm]
          simp [sub_mul]

/-- `prop:easy-approx-from-approx-delta`.

If `A ≈_δ B` (sub-measurements) and `C` is a sub-measurement, then
`|𝔼_x Σ_a ⟨ψ| A_a C_a |ψ⟩ - 𝔼_x Σ_a ⟨ψ| B_a C_a |ψ⟩| ≤ √δ`. -/
theorem easyApproxFromApproxDelta
    {Question Outcome : Type*} {ι : Type*}
    [Fintype Outcome] [Fintype ι] [DecidableEq ι]
    (ψ : QuantumState ι) (hψ : ψ.IsNormalized)
    (𝒟 : Distribution Question)
    (h𝒟 : ∑ q ∈ 𝒟.support, 𝒟.weight q ≤ 1)
    (A B C : IdxSubMeas Question Outcome ι)
    (δ : Error)
    (hAB : SDDRel ψ 𝒟 A B δ) :
    |avgOver 𝒟 (fun q => ∑ a : Outcome, ev ψ ((A q).outcome a * (C q).outcome a)) -
        avgOver 𝒟 (fun q => ∑ a : Outcome, ev ψ ((B q).outcome a * (C q).outcome a))| ≤
      Real.sqrt δ := by
  calc
    |avgOver 𝒟 (fun q => ∑ a : Outcome, ev ψ ((A q).outcome a * (C q).outcome a)) -
        avgOver 𝒟 (fun q => ∑ a : Outcome, ev ψ ((B q).outcome a * (C q).outcome a))|
      = |avgOver 𝒟 (fun q =>
          (∑ a : Outcome, ev ψ ((A q).outcome a * (C q).outcome a)) -
            ∑ a : Outcome, ev ψ ((B q).outcome a * (C q).outcome a))| := by
          simp [avgOver, Finset.sum_sub_distrib, mul_sub]
    _ ≤ Real.sqrt (avgOver 𝒟 (fun q => qSDD ψ (A q) (B q))) := by
          exact avgOver_abs_le_sqrt_of_pointwise 𝒟
            (fun q =>
              (∑ a : Outcome, ev ψ ((A q).outcome a * (C q).outcome a)) -
                ∑ a : Outcome, ev ψ ((B q).outcome a * (C q).outcome a))
            (fun q => qSDD ψ (A q) (B q))
            (fun q => question_easyApproxFromApproxDelta ψ hψ (A q) (B q) (C q))
            (fun q => qSDD_nonneg ψ (A q) (B q))
            h𝒟
    _ ≤ Real.sqrt δ := by
          exact Real.sqrt_le_sqrt hAB.squaredDistanceBound





/-- `prop:cab-approx-delta`.

If `A ≈_δ B` and `∀ x a, Σ_b (C_{a,b})† C_{a,b} ≤ I`, then
`C_{a,b} A_a ≈_δ C_{a,b} B_a`. -/
theorem cabApproxDelta
    {Question OutcomeA OutcomeB : Type*} {ι : Type*}
    [Fintype OutcomeA] [Fintype OutcomeB] [Fintype ι] [DecidableEq ι]
    (ψ : QuantumState ι)
    (𝒟 : Distribution Question)
    (A B : Question → OutcomeA → MIPStarRE.Quantum.Op ι)
    (C : Question → OutcomeA → OutcomeB → MIPStarRE.Quantum.Op ι)
    (δ : Error)
    (hAB : avgOver 𝒟 (fun q => qSDDCore ψ (A q) (B q)) ≤ δ)
    (hC : ∀ q, ∀ a : OutcomeA, ∑ b : OutcomeB, (C q a b)ᴴ * C q a b ≤ 1) :
    avgOver 𝒟
      (fun q =>
        qSDDCore ψ
          (fun ab : OutcomeA × OutcomeB => C q ab.1 ab.2 * A q ab.1)
          (fun ab : OutcomeA × OutcomeB => C q ab.1 ab.2 * B q ab.1))
      ≤ δ := by
  let AOp : IdxOpFamily Question OutcomeA ι := fun q =>
    { outcome := A q
      total := ∑ a : OutcomeA, A q a }
  let BOp : IdxOpFamily Question OutcomeA ι := fun q =>
    { outcome := B q
      total := ∑ a : OutcomeA, B q a }
  have hAB_op : SDDOpRel ψ 𝒟 AOp BOp δ := by
    constructor
    simpa [sddErrorOp, qSDDOp, AOp, BOp] using hAB
  have hcab :
      SDDOpRel ψ 𝒟
        (fun q => ({
          outcome := fun ab : OutcomeA × OutcomeB =>
            C q ab.1 ab.2 * (AOp q).outcome ab.1
          total := ∑ ab : OutcomeA × OutcomeB,
            C q ab.1 ab.2 * (AOp q).outcome ab.1
        } : OpFamily (OutcomeA × OutcomeB) ι))
        (fun q => ({
          outcome := fun ab : OutcomeA × OutcomeB =>
            C q ab.1 ab.2 * (BOp q).outcome ab.1
          total := ∑ ab : OutcomeA × OutcomeB,
            C q ab.1 ab.2 * (BOp q).outcome ab.1
        } : OpFamily (OutcomeA × OutcomeB) ι))
        δ :=
    cabApproxDelta_raw ψ 𝒟 AOp BOp C δ hAB_op hC
  simpa [sddErrorOp, qSDDOp, AOp, BOp] using hcab.squaredDistanceBound

end MIPStarRE.LDT.Preliminaries

end

end LIDT
Source
https://github.com/LionSR/MIPStarRE/blob/f382c801026f53a9efc260fdee707cb35e0adb15/MIPStarRE/LDT/Preliminaries/CauchySchwarz.lean#L29-L259

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me