Consequence 28
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.joint_convexity_remainder_and_equivalenceAll registers are finite-dimensional and logarithms are natural. For probability weights and positive definite density matrices , set , , and . Conjecture 26 implies the universal joint-convexity remainder inequality
Independently of Conjecture 26, this universal inequality is equivalent to the universal relative-entropy recovery inequality (6.24), on its positive definite state and strict CPTP channel domain. Here is squared fidelity, extended to positive recovered operators without normalizing them; the square root is inside the weighted sum.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
noncomputable section
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P56
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)
open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)
variable {A B C D E X : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]
open scoped Matrix.Norms.L2Operator
/-- arXiv:1410.1443v3, PDF pp.27–29, Consequence 28, (6.28).
The quantitative bound assumes Conjecture 26. The equivalence between the
UNIVERSAL inequality schemes is unconditional, as its two-direction proof shows. -/
theorem joint_convexity_remainder_and_equivalence :
(DifferenceParameterConjecture → JointRemainder) ∧
(JointRemainder ↔ RecoveryRemainder) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P56
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
The declaration asserts , with the three propositions defined as follows. All index types quantified below are finite and nonempty; matrices have complex entries, denotes conjugate transpose, and a density matrix is a positive semidefinite matrix with trace exactly . A channel is a map admitting a finite Kraus representation with . Write for the continuous functional calculus of the real function that is at and elsewhere, so zero eigenvalues contribute even when . Write for the continuous functional calculus of the real logarithm, whose totalized value at is , and define
Here logarithms are natural, and expressions involving and inequalities against it are evaluated in the extended real numbers. The proposition says that for every pair of finite nonempty types , every positive definite density matrices on , and every channel from matrices on to matrices on satisfying the additional condition that sends every positive definite matrix to a positive definite matrix for every natural number , the following two quantities are nondecreasing in their positive real parameter: for all real ,
Both quantities equal at parameter ; for , setting , , , and , they are
Thus the parameter comparison includes or through the stated branches, and the amplification condition includes . The proposition says that for every finite nonempty matrix index type and finite nonempty label type , every weights with , and every families of positive definite density matrices on , writing , , and
one has
Zero weights are allowed, but the positive definiteness and density requirements still apply to every label. Finally, says that for every finite nonempty , positive definite density matrices on , and channel satisfying the same positive definiteness condition for every amplification, the map
where inverse square roots use functional calculus with value at zero, satisfies
In these remainder inequalities a nonpositive argument of makes the left side . The declaration therefore gives the implication from the specified parameter monotonicity proposition to the specified joint remainder proposition, together with both directions of equivalence between that joint remainder proposition and the specified recovery remainder proposition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.