Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix: uniform-input versions of Theorems 2 and 3

Open
QAlgorithms.Papers.Independent.Intakethird100.P09.uniform_input_entropy_bounds

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

prove2quantum

All states are normalized finite-dimensional bipartite density matrices. Gamma denotes transposition of Bob in the fixed product basis. The trace norm is the full trace norm. For a finite Bell expression S with real coefficients, C(S) and Q(S) are its largest signed classical value and its supremal signed quantum value over arbitrary finite local dimensions; Q_S(rho) optimizes complete local POVMs on the fixed state. Define R_u, T_u^infinity and R_H,u by consistently replacing every joint-input-law optimization in the definitions of R, T^infinity and R_H by the uniform law on that experiment’s finite input alphabet. Keep the same limsup regularization, LOCC class, iid separable reference and normalized success-weighted filter as above. Every regularization uses positive copy numbers and limsup; all logarithms are base two, support violations have infinite relative entropy, and E_r is the unregularized relative entropy distance to normalized separable states. For any state rho,

Ru(ρ)≤Tu∞(ρ)≤Er(ρ),RH,u(ρ)≤Tu∞(ρ).R_u(\rho)\le T_u^\infty(\rho)\le E_r(\rho),\qquad R_{H,u}(\rho)\le T_u^\infty(\rho).Ru​(ρ)≤Tu∞​(ρ)≤Er​(ρ),RH,u​(ρ)≤Tu∞​(ρ).

For PPT rho,

Tu∞(ρ)≤Er(ρΓ),RH,u(ρ)≤Er(ρΓ).T_u^\infty(\rho)\le E_r(\rho^\Gamma),\qquad R_{H,u}(\rho)\le E_r(\rho^\Gamma).Tu∞​(ρ)≤Er​(ρΓ),RH,u​(ρ)≤Er​(ρΓ).

The optimized and uniform measures are not identified. This records the appendix’s additional uniform-input assertion.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P09
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P09

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

open Filter

open QAlgorithms.Entanglement (IsSeparableDensity)

open QAlgorithms.Papers.Independent.Dependency50.P24
  (transposeSecond partyCut xForm swapPrivate hidingOne hidingTwo)

open QAlgorithms.Papers.Independent.Dependency50.P42 (dimensionedPower)

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

open QAlgorithms.Papers.Independent.Advance50.P47 (Box)

open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntanglement)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF pp.8--9: uniform-input variants keep all input-law optimizations uniform,
without identifying them with the optimized measures. Both numbered theorems' chains retained. -/
theorem uniform_input_entropy_bounds (a b : ℕ+) (rho : Op (Fin a × Fin b))
    (hrho : IsDensityMatrix rho) :
    asymptoticR true rho ≤ asymptoticT true rho ∧
    asymptoticRH true rho ≤ asymptoticT true rho ∧
    asymptoticT true rho ≤ relativeEntanglement rho ∧
    ((transposeSecond rho).PosSemidef →
      asymptoticT true rho ≤ relativeEntanglement (transposeSecond rho) ∧
      asymptoticRH true rho ≤ relativeEntanglement (transposeSecond rho)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P09

end
Source
Bounds on quantum nonlocality via partial transposition, arXiv:1407.6999v3, PDF p. 8, Appendix: uniform-input versions of Theorems 2 and 3
Read-back

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

For all positive integers a,ba,ba,b and every positive semidefinite trace-111 complex matrix ρ\rhoρ on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb,

Ru(ρ)≤Tu(ρ),RH,u(ρ)≤Tu(ρ),Tu(ρ)≤Erel(ρ),R_{\mathrm u}(\rho)\le T_{\mathrm u}(\rho),\qquad R_{H,\mathrm u}(\rho)\le T_{\mathrm u}(\rho),\qquad T_{\mathrm u}(\rho)\le E_{\mathrm{rel}}(\rho),Ru​(ρ)≤Tu​(ρ),RH,u​(ρ)≤Tu​(ρ),Tu​(ρ)≤Erel​(ρ),

and, if ρΓ⪰0\rho^\Gamma\succeq0ρΓ⪰0, then

Tu(ρ)≤Erel(ρΓ),RH,u(ρ)≤Erel(ρΓ).T_{\mathrm u}(\rho)\le E_{\mathrm{rel}}(\rho^\Gamma), \qquad R_{H,\mathrm u}(\rho)\le E_{\mathrm{rel}}(\rho^\Gamma).Tu​(ρ)≤Erel​(ρΓ),RH,u​(ρ)≤Erel​(ρΓ).

Here (XΓ)(i,j),(k,l)=X(i,l),(k,j)(X^\Gamma)_{(i,j),(k,l)}=X_{(i,l),(k,j)}(XΓ)(i,j),(k,l)​=X(i,l),(k,j)​. A separable density matrix is a finite sum ∑twtAt⊗Bt\sum_t w_t A_t\otimes B_t∑t​wt​At​⊗Bt​ with nonnegative weights summing to 111 and positive semidefinite trace-111 local matrices. Define Erel(θ)=inf⁡σ separable densityD2(θ∥σ)E_{\mathrm{rel}}(\theta)=\inf_{\sigma\text{ separable density}}D_2(\theta\|\sigma)Erel​(θ)=infσ separable density​D2​(θ∥σ), where D2=+∞D_2=+\inftyD2​=+∞ unless both arguments are density matrices and ker⁡σ⊆ker⁡θ\ker\sigma\subseteq\ker\thetakerσ⊆kerθ; otherwise D2D_2D2​ is the nonnegative part of Re⁡tr⁡[f(θ)−θlog⁡σ]/log⁡2\operatorname{Re}\operatorname{tr}[f(\theta)-\theta\log\sigma]/\log2Retr[f(θ)−θlogσ]/log2, with f(x)=xlog⁡xf(x)=x\log xf(x)=xlogx, matrix functions given by continuous functional calculus, and the real logarithm equal to 000 at 000. A Bell experiment applies a map Φ\PhiΦ in the closure of finite LOCC maps to positive finite output dimensions and then local POVMs in a scenario with positive finite input and output counts; finite LOCC maps are generated by identities and finite complete local Kraus operations with outcome-dependent continuations, summing over outcomes. Its measured box is Pθ(x,y,u,v)=Re⁡tr⁡[(Ax,u⊗By,v)Φ(θ)]P_\theta(x,y,u,v)=\operatorname{Re}\operatorname{tr}[(A_{x,u}\otimes B_{y,v})\Phi(\theta)]Pθ​(x,y,u,v)=Retr[(Ax,u​⊗By,v​)Φ(θ)], with positive semidefinite POVM effects summing to the identity for each input. For its nx,nyn_x,n_ynx​,ny​ inputs, define

Du(P∥Q)=1nxny∑x,yDcl,2(Pxy∥Qxy),Nu(P)=inf⁡Q finite localDu(P∥Q).D_{\mathrm u}(P\|Q)=\frac1{n_xn_y}\sum_{x,y}D_{\mathrm{cl},2}(P_{xy}\|Q_{xy}), \qquad \mathcal N_{\mathrm u}(P)=\inf_{Q\text{ finite local}}D_{\mathrm u}(P\|Q).Du​(P∥Q)=nx​ny​1​x,y∑​Dcl,2​(Pxy​∥Qxy​),Nu​(P)=Q finite localinf​Du​(P∥Q).

A finite local box is a finite convex combination of deterministic boxes 1{u=f(x), v=g(y)}\mathbf1_{\{u=f(x),\,v=g(y)\}}1{u=f(x),v=g(y)}​. The classical divergence is +∞+\infty+∞ if some first-distribution entry is positive and its corresponding second-distribution entry is zero; otherwise it is the nonnegative part of ∑i:pi≠0pilog⁡(pi/qi)/log⁡2\sum_{i:p_i\ne0}p_i\log(p_i/q_i)/\log2∑i:pi​=0​pi​log(pi​/qi​)/log2. For positive nnn, let ρ[n]\rho^{[n]}ρ[n] be the grouped tensor power with entries ∏t=1nρ(it,jt),(kt,lt)\prod_{t=1}^n\rho_{(i_t,j_t),(k_t,l_t)}∏t=1n​ρ(it​,jt​),(kt​,lt​)​. Define Ru,n(ρ)R_{\mathrm u,n}(\rho)Ru,n​(ρ) as the supremum over Bell experiments of Nu(Pρ[n])\mathcal N_{\mathrm u}(P_{\rho^{[n]}})Nu​(Pρ[n]​), and Tu,n(ρ)T_{\mathrm u,n}(\rho)Tu,n​(ρ) as the supremum over those experiments of inf⁡σ separable density on Ca⊗CbDu(Pρ[n]∥Pσ[n])\inf_{\sigma\text{ separable density on }\mathbb C^a\otimes\mathbb C^b}D_{\mathrm u}(P_{\rho^{[n]}}\|P_{\sigma^{[n]}})infσ separable density on Ca⊗Cb​Du​(Pρ[n]​∥Pσ[n]​). Define Hu,n(ρ)H_{\mathrm u,n}(\rho)Hu,n​(ρ) by additionally choosing complete finite local Kraus families and one selected operator on each side after Φ\PhiΦ: for ω=KΦ(ρ[n])K†\omega=K\Phi(\rho^{[n]})K^\daggerω=KΦ(ρ[n])K†, with KKK the tensor product of the selected operators and p=Re⁡tr⁡ωp=\operatorname{Re}\operatorname{tr}\omegap=Retrω, the contribution is 000 if p=0p=0p=0, and otherwise p Nu(Pω/p)p\,\mathcal N_{\mathrm u}(P_{\omega/p})pNu​(Pω/p​), measured with the experiment’s POVMs. Finally, Ru,Tu,RH,uR_{\mathrm u},T_{\mathrm u},R_{H,\mathrm u}Ru​,Tu​,RH,u​ are respectively the lim sup⁡\limsuplimsup of these three block quantities divided by nnn as positive n→∞n\to\inftyn→∞, all valued in [0,+∞][0,+\infty][0,+∞].

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