§6.4.2 (6.107): relaxed smooth min/max comparison
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.smooth_relaxed_comparisonAll 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 .
Let rho_AB be normalized, let epsilon and delta be strictly positive with epsilon+delta<1, and let n>=1. The displayed comparison holds for the actual iid product state; interchanging the two radii gives its symmetric counterpart.
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.relaxedcomparison
§6.4.2 (6.107): relaxed smooth min/max comparison, arXiv:1504.00233v5, PDF p.110. -/
theorem smooth_relaxed_comparison [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : IsDensityMatrix r)
(e d : ℝ) (he : 0 < e) (hd : 0 < d) (hed : e+d < 1) (n : ℕ) (hn : 0 < n) :
minRate r e n ≤ maxRate r d n+((Real.logb 2 (1/(1-(e+d)^2))/(n:ℝ):ℝ):EReal) ∧
minRate r d n ≤ maxRate r e n+((Real.logb 2 (1/(1-(e+d)^2))/(n:ℝ):ℝ):EReal) := 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 positive semidefinite complex matrix on with trace . Let satisfy , and let be a positive integer. Put , indexed by . For matrices on any such bipartite space , define by real functional calculus, , and . Define , , , and , where all entropy extrema are extended-real, , otherwise, and denotes positive semidefinite difference. Then both inequalities hold:
The factors and the added real quantities are embedded in the extended reals, where the arithmetic is performed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.