Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Higher-dimensional operator criterion and its extraction circuit

Open
QAlgorithms.Papers.Independent.Intakethird100.P75.qudit_operator_criterion

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

prove2quantum

Let d≥2d\geq2d≥2 and let ∣ψ′⟩|\psi'\rangle∣ψ′⟩ be a unit vector in the completed tensor product of arbitrary complex Hilbert spaces HA,HBH_A,H_BHA​,HB​. For each party D=A,BD=A,BD=A,B, let PD(i)P_D(i)PD​(i), 0≤i<d0\leq i<d0≤i<d, be complete pairwise orthogonal self-adjoint projections and let XD(i)X_D(i)XD​(i) be unitaries with XD(0)=IX_D(0)=IXD​(0)=I. For i≥1i\geq1i≥1, let δi∈R\delta_i\in\mathbb Rδi​∈R satisfy cos⁡δi≠0\cos\delta_i\ne0cosδi​=0, and set t0=1,ti=tan⁡δit_0=1,t_i=\tan\delta_it0​=1,ti​=tanδi​. Suppose

PA(i)∣ψ′⟩=PB(i)∣ψ′⟩(0≤i<d),XA(i)PB(i)∣ψ′⟩=tiXB(i)†PA(0)∣ψ′⟩(1≤i<d).P_A(i)|\psi'\rangle=P_B(i)|\psi'\rangle\quad(0\leq i<d), \qquad X_A(i)P_B(i)|\psi'\rangle=t_iX_B(i)^\dagger P_A(0)|\psi'\rangle \quad(1\leq i<d).PA​(i)∣ψ′⟩=PB​(i)∣ψ′⟩(0≤i<d),XA​(i)PB​(i)∣ψ′⟩=ti​XB​(i)†PA​(0)∣ψ′⟩(1≤i<d).

Define the initialized Figure 2 circuit maps and target by

VDv=∑i=0d−1XD(i)PD(i)v⊗∣i⟩,N=1+∑i=1d−1ti2,∣ψt⟩=∣00⟩+∑i=1d−1ti∣ii⟩N.V_Dv=\sum_{i=0}^{d-1}X_D(i)P_D(i)v\otimes|i\rangle,\qquad N=\sqrt{1+\sum_{i=1}^{d-1}t_i^2},\qquad |\psi_t\rangle=\frac{|00\rangle+\sum_{i=1}^{d-1}t_i|ii\rangle}{N}.VD​v=i=0∑d−1​XD​(i)PD​(i)v⊗∣i⟩,N=1+i=1∑d−1​ti2​​,∣ψt​⟩=N∣00⟩+∑i=1d−1​ti​∣ii⟩​.

Then N>0N>0N>0, the target has norm one, both VDV_DVD​ are complex-linear isometric embeddings, and some normalized, possibly entangled junk satisfies, after fixed register regrouping,

(VA⊗VB)∣ψ′⟩=∣junk⟩⊗∣ψt⟩.(V_A\otimes V_B)|\psi'\rangle=|\mathrm{junk}\rangle\otimes|\psi_t\rangle.(VA​⊗VB​)∣ψ′⟩=∣junk⟩⊗∣ψt​⟩.

This is an exact operator criterion. Negative and zero finite ratios are allowed; all non-base ratios zero give a product target, while all ratios one give the maximally entangled target of dimension ddd.

Formalization Note The circuit uses ω=e2πi/d\omega=e^{2\pi i/d}ω=e2πi/d, F∣j⟩=d−1/2∑kωjk∣k⟩F|j\rangle=d^{-1/2}\sum_k\omega^{jk}|k\rangleF∣j⟩=d−1/2∑k​ωjk∣k⟩, controlled ZkZ^kZk with Z=∑iωiP(i)Z=\sum_i\omega^iP(i)Z=∑i​ωiP(i), inverse FFF, and controlled X(i)X(i)X(i). Its initialized action is the displayed map. Equation (38) prints a denominator lacking squared ratios; the draft restores them, as orthonormality forces.

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 p.3, (6), pp.9–10, (33)–(39): higher-dimensional operator criterion.
The fixed Fig.2 action includes identity zeroth rotations. The printed (38)
normalization is corrected by squaring ratios, as orthogonality forces.
Negative and zero finite ratios are allowed; zero non-base ratios give a
product target. No correlation-certification or robust conclusion is added. -/
theorem qudit_operator_criterion (d : ℕ) (hd : 2 ≤ d)
    (delta : Fin d → ℝ)
    (hfinite : ∀ i : Fin d, i.val ≠ 0 → Real.cos (delta i) ≠ 0)
    (psi : HilbertTensor H K) (hpsi : ‖psi‖ = 1)
    (PA XA : Fin d → H →L[ℂ] H) (PB XB : Fin d → K →L[ℂ] K)
    (hPA : ProjectiveFamily PA) (hPB : ProjectiveFamily PB)
    (hXA : ∀ i, IsLocalHilbertUnitary (XA i)) (hXB : ∀ i, IsLocalHilbertUnitary (XB i))
    (hXA0 : ∀ i : Fin d, i.val = 0 → XA i = 1)
    (hXB0 : ∀ i : Fin d, i.val = 0 → XB i = 1)
    (hmatch : ∀ i, alice (PA i) psi = bob (PB i) psi)
    (htransfer : ∀ i : Fin d, i.val ≠ 0 →
      alice (XA i) (bob (PB i) psi) = (Real.tan (delta i) : ℂ) •
        bob ((XB i).adjoint) (alice (PA ⟨0, by omega⟩) psi)) :
    0 < Real.sqrt (∑ i, quditRatio delta i ^ 2) ∧
    ‖schmidtTarget (quditCoefficients delta)‖ = 1 ∧
    Isometry (quditLocal PA XA) ∧ Isometry (quditLocal PB XB) ∧
    ∃ junk : HilbertTensor H K, ‖junk‖ = 1 ∧
      mapHilbertFactors (quditLocal PA XA) (quditLocal PB XB) psi =
        attachSchmidt (quditCoefficients delta) junk := 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. 10, §IV (6); Supplement §4a, (33)–(39): higher-dimensional sufficient conditions
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, and interpret ⊗^\widehat\otimes⊗​ as completion of the algebraic complex tensor product and tensor products of operators as continuous extensions. For every natural number d≥2d\ge2d≥2, every family δ:{0,…,d−1}→R\delta:\{0,\ldots,d-1\}\to\mathbb Rδ:{0,…,d−1}→R satisfying cos⁡(δi)≠0\cos(\delta_i)\ne0cos(δi​)=0 for every i≠0i\ne0i=0, every unit vector ψ∈H⊗^K\psi\in H\widehat\otimes Kψ∈H⊗​K, and every family of continuous complex-linear operators PiA,XiAP_i^A,X_i^APiA​,XiA​ on HHH and PiB,XiBP_i^B,X_i^BPiB​,XiB​ on KKK, suppose that each family PA,PBP^A,P^BPA,PB consists of self-adjoint idempotents, distinct members satisfy PiPj=0P_iP_j=0Pi​Pj​=0, and ∑iPi=I\sum_iP_i=I∑i​Pi​=I; that each XiA,XiBX_i^A,X_i^BXiA​,XiB​ satisfies Xi∗Xi=XiXi∗=IX_i^*X_i=X_iX_i^*=IXi∗​Xi​=Xi​Xi∗​=I; and that X0A=X0B=IX_0^A=X_0^B=IX0A​=X0B​=I. Assume also, for every iii, (PiA⊗I)ψ=(I⊗PiB)ψ(P_i^A\otimes I)\psi=(I\otimes P_i^B)\psi(PiA​⊗I)ψ=(I⊗PiB​)ψ, and, for every i≠0i\ne0i=0,

(XiA⊗PiB)ψ=tan⁡(δi) (P0A⊗(XiB)∗)ψ.(X_i^A\otimes P_i^B)\psi =\tan(\delta_i)\,(P_0^A\otimes(X_i^B)^*)\psi.(XiA​⊗PiB​)ψ=tan(δi​)(P0A​⊗(XiB​)∗)ψ.

Set r0=1r_0=1r0​=1, ri=tan⁡(δi)r_i=\tan(\delta_i)ri​=tan(δi​) for i≠0i\ne0i=0, s=∑iri2s=\sqrt{\sum_i r_i^2}s=∑i​ri2​​, and ai=ri/sa_i=r_i/sai​=ri​/s, regarded as complex numbers. Then s>0s>0s>0, the vector ∑iaiei⊗ei\sum_i a_i e_i\otimes e_i∑i​ai​ei​⊗ei​ has norm 111, and the maps FAh=∑iXiAPiAh⊗eiF_Ah=\sum_i X_i^AP_i^Ah\otimes e_iFA​h=∑i​XiA​PiA​h⊗ei​ and FBk=∑iXiBPiBk⊗eiF_Bk=\sum_i X_i^BP_i^Bk\otimes e_iFB​k=∑i​XiB​PiB​k⊗ei​ are isometries on their entire domains, where (ei)i<d(e_i)_{i<d}(ei​)i<d​ is the standard basis of Cd\mathbb C^dCd. There exists J∈H⊗^KJ\in H\widehat\otimes KJ∈H⊗​K with ∥J∥=1\|J\|=1∥J∥=1 such that

(FA⊗FB)ψ=∑i=0d−1aiTiJ,(F_A\otimes F_B)\psi=\sum_{i=0}^{d-1}a_iT_iJ,(FA​⊗FB​)ψ=i=0∑d−1​ai​Ti​J,

where TiT_iTi​ continuously extends h⊗k↦(h⊗ei)⊗(k⊗ei)h\otimes k\mapsto(h\otimes e_i)\otimes(k\otimes e_i)h⊗k↦(h⊗ei​)⊗(k⊗ei​). There is no restriction on δ0\delta_0δ0​, and the coefficients aia_iai​ are not required to be nonnegative or nonzero.

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