6.3
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.min_sdpAll 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. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and . The symbols and denote conditional min- and max-entropy, with values and at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies .
The minimum Tr σ_B subject to σ_B≥0, I_A⊗σ_B≥ρ_AB equals the maximum Tr ρ_AB X_AB subject to X_AB≥0, Tr_A X_AB≤I_B; both extrema attained and equal exp(−Hmin).
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
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#6.3
6.3, arXiv:1504.00233v5, PDF p.93. -/
theorem min_sdp [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : paperSubnormalized r) :
∃ s : paperMat B, ∃ W : paperMat (A × B), MinPrimal r s ∧ MinDual W ∧
ENNReal.ofReal s.trace.re = expE (-paperHmin r) ∧ s.trace.re = (r*W).trace.re ∧
(∀ t, MinPrimal r t → s.trace.re ≤ t.trace.re) ∧
(∀ T, MinDual T → (r*T).trace.re ≤ (r*W).trace.re) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index types with decidable equality, and let be a positive semidefinite complex matrix on with . Write when , and define the extended-real quantity
Let equal for finite real , at , and at . There exist a matrix on and a matrix on such that
The first equality is in the extended nonnegative reals. Moreover, every with satisfies , and every with satisfies . Here ; is allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.