Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7.2 (7.23)–(7.24): bipartite uncertainty relation

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.bipartite_uncertainty

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are Q~α=Tr⁡(σ(1−α)/(2α)ρσ(1−α)/(2α))α\widetilde Q_\alpha=\operatorname{Tr}(\sigma^{(1-\alpha)/(2\alpha)}\rho\sigma^{(1-\alpha)/(2\alpha)})^\alphaQ​α​=Tr(σ(1−α)/(2α)ρσ(1−α)/(2α))α and Q‾α=Tr⁡(ρασ1−α)\overline Q_\alpha=\operatorname{Tr}(\rho^\alpha\sigma^{1-\alpha})Q​α​=Tr(ρασ1−α); the divergences include division by Tr⁡ρ\operatorname{Tr}\rhoTrρ inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation ρ≪σ\rho\ll\sigmaρ≪σ means support inclusion. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation H(A∣B)=H(AB)−H(B)H(A|B)=H(AB)-H(B)H(A∣B)=H(AB)−H(B) denotes conditional von Neumann entropy. In hypothesis testing, αn(T;ρ)=Tr⁡((I−T)ρ⊗n)\alpha_n(T;\rho)=\operatorname{Tr}((I-T)\rho^{\otimes n})αn​(T;ρ)=Tr((I−T)ρ⊗n) and βn(T;σ)=Tr⁡(Tσ⊗n)\beta_n(T;\sigma)=\operatorname{Tr}(T\sigma^{\otimes n})βn​(T;σ)=Tr(Tσ⊗n), with 0≤T≤I0\le T\le I0≤T≤I. The value αn∗(u)\alpha_n^*(u)αn∗​(u) minimizes the first error subject to the second being at most uuu.

Let rho_AB be normalized, and let two orthonormal-basis measurements on A have maximum squared overlap c. Let alpha,beta,gamma>=1/2 be finite, different from one, with gamma/(gamma-1)=alpha/(alpha-1)+beta/(beta-1) and (alpha-1)(beta-1)(gamma-1)<0. Then the displayed bipartite uncertainty relation holds for the actual measured marginals.

H~α↑(X∣B)MX(ρ)+H~β↑(Y∣B)MY(ρ)≥H~γ↑(A∣B)ρ−log⁡2c.\widetilde H_\alpha^\uparrow(X|B)_{\mathcal M_X(\rho)}+\widetilde H_\beta^\uparrow(Y|B)_{\mathcal M_Y(\rho)}\ge\widetilde H_\gamma^\uparrow(A|B)_\rho-\log_2c.Hα↑​(X∣B)MX​(ρ)​+Hβ↑​(Y∣B)MY​(ρ)​≥Hγ↑​(A∣B)ρ​−log2​c.

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
noncomputable section

open Filter

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P07

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J A B C D X Y Z : Type*}

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z]

/-- NODE paper:1504.00233#7.bipartite
§7.2 (7.23)–(7.24): bipartite uncertainty relation, arXiv:1504.00233v5, PDF p.117,118. -/
theorem bipartite_uncertainty [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : IsDensityMatrix r)
    (U V : paperMat A) (hU : Uᴴ*U = 1) (hV : Vᴴ*V = 1) (a b c : ℝ)
    (ha : 1/2 ≤ a) (hb : 1/2 ≤ b) (hc : 1/2 ≤ c) (ha1 : a ≠ 1) (hb1 : b ≠ 1) (hc1 : c ≠ 1)
    (hrel : c/(c-1) = a/(a-1)+b/(b-1)) (hsign : (a-1)*(b-1)*(c-1) < 0) :
    conditionalUp true (ENNReal.ofReal c) r-paperLogE (basisOverlap U V) ≤ conditionalUp true (ENNReal.ofReal a) (paperBasisMeasurement U r)+
      conditionalUp true (ENNReal.ofReal b) (paperBasisMeasurement V r) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 117, §7.2 (7.23)–(7.24): bipartite uncertainty relation
Read-back

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

Let A,BA,BA,B be nonempty finite index types with decidable equality, let rrr be a positive semidefinite complex matrix indexed by A×BA\times BA×B with tr⁡r=1\operatorname{tr}r=1trr=1, and let U,VU,VU,V be complex matrices indexed by AAA satisfying U†U=IU^\dagger U=IU†U=I and V†V=IV^\dagger V=IV†V=I. For real numbers a,b,c≥12a,b,c\ge \tfrac12a,b,c≥21​, each different from 111, suppose that c/(c−1)=a/(a−1)+b/(b−1)c/(c-1)=a/(a-1)+b/(b-1)c/(c−1)=a/(a−1)+b/(b−1) and (a−1)(b−1)(c−1)<0(a-1)(b-1)(c-1)<0(a−1)(b−1)(c−1)<0. Define MUM_UMU​, indexed by A×BA\times BA×B, by (MU)(i,j),(i′,j′)=((U⊗IB)†r(U⊗IB))(i,j),(i′,j′)(M_U)_{(i,j),(i',j')}=((U\otimes I_B)^\dagger r(U\otimes I_B))_{(i,j),(i',j')}(MU​)(i,j),(i′,j′)​=((U⊗IB​)†r(U⊗IB​))(i,j),(i′,j′)​ when i=i′i=i'i=i′, and by zero otherwise; define MVM_VMV​ analogously. Put o=sup⁡i,i′∈A∣(U†V)i,i′∣2o=\sup_{i,i'\in A}|(U^\dagger V)_{i,i'}|^2o=supi,i′∈A​∣(U†V)i,i′​∣2. To specify the entropy expressions, write Pt(H)P_t(H)Pt​(H) for the continuous functional calculus of HHH with the real function that is zero at zero and equals xtx^txt elsewhere, and set Qt(M,S)=Re⁡tr⁡Pt(P(1−t)/(2t)(S) M P(1−t)/(2t)(S))Q_t(M,S)=\operatorname{Re}\operatorname{tr}P_t(P_{(1-t)/(2t)}(S)\,M\,P_{(1-t)/(2t)}(S))Qt​(M,S)=RetrPt​(P(1−t)/(2t)​(S)MP(1−t)/(2t)​(S)). For t∈{a,b,c}t\in\{a,b,c\}t∈{a,b,c}, define Dt(M,S)D_t(M,S)Dt​(M,S) to be 1t−1L(Qt(M,S)/Re⁡tr⁡M)\frac1{t-1}L(Q_t(M,S)/\operatorname{Re}\operatorname{tr}M)t−11​L(Qt​(M,S)/RetrM) if either t<1t<1t<1 and Qt(M,S)>0Q_t(M,S)>0Qt​(M,S)>0, or ker⁡S⊆ker⁡M\ker S\subseteq\ker MkerS⊆kerM, and to be +∞+\infty+∞ otherwise, where L(0)=−∞L(0)=-\inftyL(0)=−∞ and L(x)=log⁡2xL(x)=\log_2xL(x)=log2​x for x≠0x\ne0x=0. Define Ht(M)=sup⁡σ{−Dt(M,IA⊗σ)}H_t(M)=\sup_{\sigma}\{-D_t(M,I_A\otimes\sigma)\}Ht​(M)=supσ​{−Dt​(M,IA​⊗σ)}, with σ\sigmaσ ranging over all positive semidefinite matrices indexed by BBB having trace one. Then the asserted extended-real inequality is Hc(r)−L(o)≤Ha(MU)+Hb(MV)H_c(r)-L(o)\le H_a(M_U)+H_b(M_V)Hc​(r)−L(o)≤Ha​(MU​)+Hb​(MV​). The endpoint orders a,b,c=12a,b,c=\tfrac12a,b,c=21​ are included whenever all the stated hypotheses hold; the matrix powers at zero use the specified zero value even for negative exponents.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me