Unnumbered identity (26): common dilation convex roof and constrained Holevo difference
ProvedQAlgorithms.Papers.Independent.Gap48.P36.common_dilation_convex_roofAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Let and let be a density matrix. Write for the two marginal channels and . Let be the convex roof of marginal entropy, and , where is the convex roof over finite normalized pure input decompositions of the same . Then
This is the constrained Holevo identity for one common dilation; it does not equate unconstrained conjugate capacities.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P36
open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal
open QAlgorithms.Papers.Independent.Claimed50.P48
open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)
open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)
open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)
open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C D E K L A2 B2 C2 : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]
variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]
variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]
/-- Unnumbered identity (26), PDF p.12: the SAME rho and the common dilation.
Only constrained Holevo differences are equated, not unconstrained capacities. -/
theorem common_dilation_convex_roof [Nonempty A] [Nonempty B] [Nonempty C]
(V : Matrix (B × C) A ℂ) (hV : Vᴴ * V = 1)
(rho : Matrix A A ℂ) (hrho : IsDensityMatrix rho) :
entanglementFormation (V * rho * Vᴴ) =
entropy (receiverChannel V rho) - constrainedHolevo (receiverChannel V) rho ∧
entanglementFormation (V * rho * Vᴴ) =
entropy (complementaryChannel V rho) - constrainedHolevo (complementaryChannel V) rho := by sorry
end QAlgorithms.Papers.Independent.Gap48.P36
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite nonempty index types , each equipped with decidable equality, any complex matrix satisfying , and any positive semidefinite matrix on with trace , define and . Write , where , the logarithm is natural, and uses continuous functional calculus. Define to be the real infimum of over all finite ensembles of vectors with , weights summing to , and . For a map with input , define as the real infimum of over all finite ensembles of unit vectors with nonnegative weights summing to and , and set . Then both identities hold:
All ensemble sizes are finite natural numbers and zero weights are allowed; the requirement that the weights sum to excludes an empty ensemble.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.