6.7
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.min_max_dualityAll 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 .
For rank-one subnormalized ρ_ABC, Hmax(A|B)=−Hmin(A|C), using actual marginals.
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.7
6.7, arXiv:1504.00233v5, PDF p.96. -/
theorem min_max_duality [Nonempty A] [Nonempty B] [Nonempty C] (r : paperMat ((A × B) × C))
(hr : paperSubnormalized r) (hp : paperPure r) : hmax (traceRight r) = -paperHmin (paperTraceMiddle r) := 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 and rank exactly . For a positive semidefinite matrix on , define
as extended-real suprema, where means , square roots use continuous functional calculus, and is except that . Define marginals by
Then . The trace of need not be ; rank excludes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.