Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Approximate operator identities imply robust extraction

Open
QAlgorithms.Papers.Independent.Intakethird100.P75.robust_operator_criterion

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ∣ψ′⟩|\psi'\rangle∣ψ′⟩ be a unit vector in the completed tensor product of arbitrary complex Hilbert spaces HA,HBH_A,H_BHA​,HB​, and let XA,ZA,XB,ZBX_A,Z_A,X_B,Z_BXA​,ZA​,XB​,ZB​ be local bounded self-adjoint involutions. Choose 0≤θ≤π/40\leq\theta\leq\pi/40≤θ≤π/4 and nonnegative tolerances ϵ,τ\epsilon,\tauϵ,τ, and suppose

∥(ZA−ZB)∣ψ′⟩∥≤2ϵ,∥(sin⁡θ XA(I+ZB)−cos⁡θ XB(I−ZA))∣ψ′⟩∥≤τ.\|(Z_A-Z_B)|\psi'\rangle\|\leq2\epsilon,\qquad \|(\sin\theta\,X_A(I+Z_B)-\cos\theta\,X_B(I-Z_A))|\psi'\rangle\|\leq\tau.∥(ZA​−ZB​)∣ψ′⟩∥≤2ϵ,∥(sinθXA​(I+ZB​)−cosθXB​(I−ZA​))∣ψ′⟩∥≤τ.

Put

ϵˉ=4ϵ+τ2∣cos⁡θ∣<1,∣q⟩=I+ZA2cos⁡θ∣ψ′⟩,∣junk⟩=∣q⟩∥q∥.\bar\epsilon=4\epsilon+\frac{\tau}{2|\cos\theta|}<1,\qquad |q\rangle=\frac{I+Z_A}{2\cos\theta}|\psi'\rangle,\qquad |\mathrm{junk}\rangle=\frac{|q\rangle}{\|q\|}.ϵˉ=4ϵ+2∣cosθ∣τ​<1,∣q⟩=2cosθI+ZA​​∣ψ′⟩,∣junk⟩=∥q∥∣q⟩​.

Then q≠0q\ne0q=0, junk is normalized, and the fixed complex-linear maps

VDv=(I+ZD)v⊗∣0⟩+XD(I−ZD)v⊗∣1⟩2(D=A,B)V_Dv=\frac{(I+Z_D)v\otimes|0\rangle+X_D(I-Z_D)v\otimes|1\rangle}{2} \quad(D=A,B)VD​v=2(I+ZD​)v⊗∣0⟩+XD​(I−ZD​)v⊗∣1⟩​(D=A,B)

are isometric embeddings satisfying, after fixed register regrouping,

∥(VA⊗VB)∣ψ′⟩−∣junk⟩⊗(cos⁡θ∣00⟩+sin⁡θ∣11⟩)∥≤2ϵˉ.\|(V_A\otimes V_B)|\psi'\rangle- |\mathrm{junk}\rangle\otimes(\cos\theta|00\rangle+\sin\theta|11\rangle)\| \leq2\bar\epsilon.∥(VA​⊗VB​)∣ψ′⟩−∣junk⟩⊗(cosθ∣00⟩+sinθ∣11⟩)∥≤2ϵˉ.

This isolates the conditional extraction argument (24)–(32). The tolerance τ\tauτ, denoted ϵ2′\epsilon'_2ϵ2′​ in the paper, is an independent input. The small-error condition permits normalization of the specified witness; no invalid Bell-deficit conversion is assumed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P75
Formal statement
noncomputable section

open scoped BigOperators

namespace QAlgorithms.Papers.Independent.Intakethird100.P75

universe u v w x

open QAlgorithms.Papers.Independent.Claimed50.P34 (HilbertTensor)

open QAlgorithms.Papers.Independent.Renew46.P03 (tensorVector)

section ExtractionStatements

variable {H : Type u} {K : Type v}

variable [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

variable [NormedAddCommGroup K] [InnerProductSpace ℂ K] [CompleteSpace K]

/-- PDF pp.8–9, (24)–(32): conditional robust extraction. epsilon2 is an
independent tolerance, not an assumed consequence of a Bell deficit. The
small-error regime makes the specified projection witness nonzero before
normalization. The full factor 2 of (32) is retained. -/
theorem robust_operator_criterion (theta epsilon epsilon2 : ℝ)
    (htheta : 0 ≤ theta) (hthetaUpper : theta ≤ Real.pi / 4)
    (hepsilon : 0 ≤ epsilon) (hepsilon2 : 0 ≤ epsilon2)
    (hsmall : extractionBudget theta epsilon epsilon2 < 1)
    (psi : HilbertTensor H K) (hpsi : ‖psi‖ = 1)
    (XA ZA : H →L[ℂ] H) (XB ZB : K →L[ℂ] K)
    (hXA : Dichotomic XA) (hZA : Dichotomic ZA)
    (hXB : Dichotomic XB) (hZB : Dichotomic ZB)
    (hmatch : ‖alice ZA psi - bob ZB psi‖ ≤ 2 * epsilon)
    (htransfer : ‖transferError theta XA ZA XB ZB psi‖ ≤ epsilon2) :
    Isometry (swapLocal XA ZA) ∧ Isometry (swapLocal XB ZB) ∧
    projectionWitness theta ZA psi ≠ 0 ∧
    ‖normalizedProjection theta ZA psi‖ = 1 ∧
    ‖mapHilbertFactors (swapLocal XA ZA) (swapLocal XB ZB) psi -
      attachSchmidt (qubitCoefficients theta) (normalizedProjection theta ZA psi)‖ ≤
        2 * extractionBudget theta epsilon epsilon2 := by sorry

end ExtractionStatements

end QAlgorithms.Papers.Independent.Intakethird100.P75

end
Source
Robust Self Testing of Unknown Quantum Systems into Any Entangled Two-Qubit States, arXiv:1210.4409v2, PDF p. 8, Supplement §3b, (24)–(32): robust extraction from approximate operator identities
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let H,KH,KH,K be complete complex normed inner product spaces, with H⊗^KH\widehat\otimes KH⊗​K denoting the completion of their algebraic complex tensor product and operator tensor products denoting continuous extensions. For every real θ,ϵ,ϵ2\theta,\epsilon,\epsilon_2θ,ϵ,ϵ2​ satisfying 0≤θ≤π/40\le\theta\le\pi/40≤θ≤π/4, ϵ≥0\epsilon\ge0ϵ≥0, ϵ2≥0\epsilon_2\ge0ϵ2​≥0, and b=4ϵ+ϵ2/(2∣cos⁡θ∣)<1b=4\epsilon+\epsilon_2/(2|\cos\theta|)<1b=4ϵ+ϵ2​/(2∣cosθ∣)<1, every unit vector ψ∈H⊗^K\psi\in H\widehat\otimes Kψ∈H⊗​K, and every continuous complex-linear XA,ZA:H→HX_A,Z_A:H\to HXA​,ZA​:H→H and XB,ZB:K→KX_B,Z_B:K\to KXB​,ZB​:K→K that are self-adjoint and square to the identity, assume

∥(ZA⊗I)ψ−(I⊗ZB)ψ∥≤2ϵ,∥sin⁡θ (XA⊗(I+ZB))ψ−cos⁡θ ((I−ZA)⊗XB)ψ∥≤ϵ2.\|(Z_A\otimes I)\psi-(I\otimes Z_B)\psi\|\le2\epsilon,\qquad \|\sin\theta\,(X_A\otimes(I+Z_B))\psi-\cos\theta\,((I-Z_A)\otimes X_B)\psi\|\le\epsilon_2.∥(ZA​⊗I)ψ−(I⊗ZB​)ψ∥≤2ϵ,∥sinθ(XA​⊗(I+ZB​))ψ−cosθ((I−ZA​)⊗XB​)ψ∥≤ϵ2​.

Define SX,Zh=12((I+Z)h⊗e0+X(I−Z)h⊗e1)S_{X,Z}h=\tfrac12\bigl((I+Z)h\otimes e_0+X(I-Z)h\otimes e_1\bigr)SX,Z​h=21​((I+Z)h⊗e0​+X(I−Z)h⊗e1​), where e0,e1e_0,e_1e0​,e1​ are the standard vectors indexed by false,true\mathrm{false},\mathrm{true}false,true, and define J=(2cos⁡θ)−1((I+ZA)⊗I)ψJ=(2\cos\theta)^{-1}((I+Z_A)\otimes I)\psiJ=(2cosθ)−1((I+ZA​)⊗I)ψ and J^=∥J∥−1J\widehat J=\|J\|^{-1}JJ=∥J∥−1J. Then SXA,ZAS_{X_A,Z_A}SXA​,ZA​​ and SXB,ZBS_{X_B,Z_B}SXB​,ZB​​ are isometries on their entire domains, J≠0J\ne0J=0, ∥J^∥=1\|\widehat J\|=1∥J∥=1, and

∥(SXA,ZA⊗SXB,ZB)ψ−cos⁡θ T0J^−sin⁡θ T1J^∥≤2b,\|(S_{X_A,Z_A}\otimes S_{X_B,Z_B})\psi -\cos\theta\,T_0\widehat J-\sin\theta\,T_1\widehat J\|\le2b,∥(SXA​,ZA​​⊗SXB​,ZB​​)ψ−cosθT0​J−sinθT1​J∥≤2b,

where TbT_bTb​ continuously extends h⊗k↦(h⊗eb)⊗(k⊗eb)h\otimes k\mapsto(h\otimes e_b)\otimes(k\otimes e_b)h⊗k↦(h⊗eb​)⊗(k⊗eb​). Zero error parameters and both endpoints of the interval for θ\thetaθ are included.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me