6.16
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.smooth_chain_rulesAll 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 . Write for .
The six inequalities below hold. δ=ε−εprime−2εdoubleprime>0 and g(δ)=−log(1−sqrt(1−δ²)); coefficients are 1,2,3 and smoothing indices in the displays are binding.
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.16
6.16, arXiv:1504.00233v5, PDF p.103. -/
theorem smooth_chain_rules [Nonempty A] [Nonempty B] [Nonempty C] (r : paperMat ((A × B) × C))
(hr : paperSubnormalized r) (e ep epp : ℝ) (he : Radius r e) (hep : Radius r ep) (hepp : Radius r epp)
(hg : ep+2*epp < e) :
paperSmoothMin (paperRegroup r) ep+paperSmoothMin (paperMarginalBC r) epp-(paperPenalty (e-ep-2*epp):EReal) ≤ paperSmoothMin r e ∧
paperSmoothMin r ep ≤ paperSmoothMin (paperRegroup r) e+paperSmoothMax (paperMarginalBC r) epp+((2*paperPenalty (e-ep-2*epp):ℝ):EReal) ∧
paperSmoothMin r ep ≤ paperSmoothMax (paperRegroup r) epp+paperSmoothMin (paperMarginalBC r) e+((3*paperPenalty (e-ep-2*epp):ℝ):EReal) ∧
paperSmoothMax r e ≤ paperSmoothMax (paperRegroup r) ep+paperSmoothMax (paperMarginalBC r) epp+(paperPenalty (e-ep-2*epp):EReal) ∧
paperSmoothMin (paperRegroup r) epp+paperSmoothMax (paperMarginalBC r) e-((2*paperPenalty (e-ep-2*epp):ℝ):EReal) ≤ paperSmoothMax r ep ∧
paperSmoothMax (paperRegroup r) e+paperSmoothMin (paperMarginalBC r) epp-((3*paperPenalty (e-ep-2*epp):ℝ):EReal) ≤ paperSmoothMax r ep := 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 types with decidable equality, and let be a complex matrix on with , where . Let each satisfy , and suppose ; in particular, these hypotheses require . Put , and put . For positive semidefinite matrices write , with square roots defined by spectral functional calculus, and let consist of all with and . On a bipartition , define and , where and otherwise . Define and , all in the extended reals. With itself regarded as , and with , all six inequalities hold:
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.