5.5
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.conditional_data_processingAll 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. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are and ; the divergences include division by inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation means support inclusion. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation denotes conditional von Neumann entropy.
For an actual CPTP map on B, each fixed and optimized Petz entropy (0≤α≤2) and sandwiched entropy (α≥1/2) cannot decrease; act as identity on A.
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#5.5
5.5, arXiv:1504.00233v5, PDF p.81. -/
theorem conditional_data_processing [Nonempty A] [Nonempty B] [Nonempty C] (r : paperMat (A × B))
(hr : IsDensityMatrix r) (E : paperMat B →ₗ[ℂ] paperMat C) (hE : paperCPTP E)
(sand up : Bool) (a : ENNReal) (ha : DPIOrder sand a) :
paperConditional sand up a r ≤ paperConditional sand up a (idTensorSuperop E r) := 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 positive semidefinite complex matrix on with trace , and let be a complex-linear map from matrices on to matrices on that preserves complex trace on every matrix and whose every finite identity amplification preserves positive semidefiniteness. Choose independently one of the Petz or sandwiched formulas and one of the down or up formulas, and let ; require for the Petz choice and for the sandwiched choice. The quantities used in the assertion are defined as follows. For positive semidefinite , let be functional calculus of off zero with value zero at zero, let be functional calculus of with its total value zero at zero, and set if , and otherwise. For real , put
For the chosen , define ; when , define if or , and otherwise, where and otherwise. Define at finite positive , , and, at , define in the Petz case and in the sandwiched case, with all infima and suprema taken in the extended reals and meaning is positive semidefinite. For a matrix on , put , and define
Let be the matrix on obtained by applying to each -indexed block of , explicitly . Then, with the same chosen formula and the same chosen arrow on both sides,
This includes the order endpoints allowed by the respective inequalities, including in the Petz case and in the sandwiched case.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.