6.13
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.classical_optimizersAll 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 a subnormalized state classical on X and Y, each of the two smooth entropy optimizations has an optimizer classical on X and Y.
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.13
6.13, arXiv:1504.00233v5, PDF p.100. -/
theorem classical_optimizers [Nonempty A] [Nonempty B] [Nonempty X] [Nonempty Y]
(r : paperMat ((A × X) × (B × Y))) (hr : paperSubnormalized r) (hc : ClassicalXY r) (e : ℝ) (he : Radius r e) :
(∃ t ∈ paperBall r e, ClassicalXY t ∧ paperSmoothMin r e = paperHmin t) ∧
(∃ t ∈ paperBall r e, ClassicalXY t ∧ paperSmoothMax r e = hmax t) := 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 complex matrix on with . Assume that
for every choice of the displayed indices, and let . For matrices on this same bipartite space, with left subsystem and right subsystem , define
These are extended-real suprema; means , square roots use continuous functional calculus, and , with otherwise. Define
and , . There exists satisfying the same displayed vanishing condition as and ; separately, there exists satisfying that vanishing condition and . The radius hypothesis excludes trace-zero .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.