§6.2.2: attained extrema, radius monotonicity, zero smoothing
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.smoothing_propertiesAll 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 .
Both smooth entropy extrema are attained; Hmin^ε increases and Hmax^ε decreases in radius; at zero radius they equal the respective unsmoothed entropies.
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.smoothingproperties
§6.2.2: attained extrema, radius monotonicity, zero smoothing, arXiv:1504.00233v5, PDF p.98. -/
theorem smoothing_properties [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : paperSubnormalized r)
(e ep : ℝ) (he : Radius r e) (hep : Radius r ep) :
(∃ t ∈ paperBall r e, paperSmoothMin r e = paperHmin t) ∧ (∃ t ∈ paperBall r e, paperSmoothMax r e = hmax t) ∧
(e ≤ ep → paperSmoothMin r e ≤ paperSmoothMin r ep ∧ paperSmoothMax r ep ≤ paperSmoothMax r e) ∧
paperSmoothMin r 0 = paperHmin r ∧ paperSmoothMax r 0 = hmax 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 nonempty finite types with decidable equality, and let be a complex matrix indexed by , positive semidefinite with . Let satisfy and ; in particular, these hypotheses exclude . Define
where matrix square roots are given by real functional calculus, and put . For a matrix on , define the extended-real quantities
where is indexed by , means , and , while for , using the total real logarithm. Set and . The assertion is that both extrema at radius are attained by matrices in , possibly by different matrices; that implies both and ; and that and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.