6.12
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.normalized_min_optimizerAll 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 normalized center and allowed radius, there exists an isometric enlargement of A and a normalized state in the enlarged ball attaining the original smooth min-entropy.
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.12
6.12, arXiv:1504.00233v5, PDF p.100. -/
theorem normalized_min_optimizer [Nonempty A] [Nonempty B] (r : paperMat (A × B))
(hr : IsDensityMatrix r) (e : ℝ) (he : Radius r e) :
∃ n : ℕ, ∃ U : Matrix (Fin (n+1)) A ℂ, Uᴴ*U = 1 ∧ ∃ t : paperMat (Fin (n+1) × B),
IsDensityMatrix t ∧ t ∈ paperBall (paperLocalEmbedding U (1:paperMat B) r) e ∧ paperHmin t = paperSmoothMin r e := 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, let be a complex matrix on with trace , and let satisfy . For a matrix on , define the extended-real quantity
where means . Define, using continuous-functional-calculus square roots,
and , with this supremum taken over matrices on . There exist a natural number , including possibly , a complex -by- matrix satisfying , and a matrix on such that , , and, for ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.