Unnumbered main property (54): convexity of E_sq
ProvedQAlgorithms.Papers.Independent.Support50.P09.squashed_convexFor a normalized state with finite nonzero local systems, define
Entropies are in bits. The infimum ranges over all normalized extensions and every positive finite dimension of , with no dimension bound or attainment assumption. One-party inputs use this same entropy expression and have value zero.
Let be normalized density operators on the same honest-party systems, let , and set . Then
This is convexity for the actual computed mixture, including both endpoints.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P09
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P09
open QAlgorithms.Papers.Independent.Claimed50.P33
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Unnumbered convexity property, PDF p.17, (54): actual mixture and endpoints. -/
theorem squashed_convex {m : ℕ} (hm : 0 < m) {D : Fin m → Type}
[∀ i, Fintype (D i)] [∀ i, Nonempty (D i)]
(rho sigma : Matrix (RegisterBasis D) (RegisterBasis D) ℂ)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(lambda : ℝ) (hlambda : 0 ≤ lambda) (hlambda1 : lambda ≤ 1) :
halfExtensionSquashed .total (stateMixture lambda rho sigma) ≤
lambda * halfExtensionSquashed .total rho +
(1-lambda) * halfExtensionSquashed .total sigma := by sorry
end QAlgorithms.Papers.Independent.Support50.P09
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number , every family of finite nonempty sets , , and every two positive semidefinite complex matrices of trace indexed by , define
Here ranges over positive integer environment dimensions, the subscripts denote partial traces, and , where and . For every real number satisfying ,
Both endpoints , singleton local sets, and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.