4.5
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.general_mean_curvature_iff_dpiAll 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.
For a dimension-compatible functional D satisfying axioms I–VI with Q=g∘D, joint convexity of Q if g increases (joint concavity if g decreases) is equivalent to CPTP data processing of D.
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#4.5
Proposition 4.5, PDF pp.57-58: the six axioms imply equivalence of
joint curvature of the general mean and CPTP data processing. Neither is assumed in SixAxioms. -/
theorem general_mean_curvature_iff_dpi (D : RealDivergenceFamily) (g : ℝ → ℝ)
(h : paperSixAxioms D g) : MeanCurvature D g ↔ RealDataProcessing D := 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 a real-valued rule on pairs of square complex matrices for every finite index type with decidable equality, and let . Write . Assume all of the following: is continuous and either strictly increasing or strictly decreasing; for every finite nonempty with decidable equality, is continuous on ; for every two such types , every , and every complex matrix from -coordinates to -coordinates satisfying both and , one has ; on the singleton type, ; for every , positive semidefiniteness of implies , and positive semidefiniteness of implies ; and for every such , , and ,
Here is the Kronecker product, is the conjugate transpose, and is the matrix on the disjoint union with the given diagonal blocks and zero mixed blocks. Under these assumptions, the following two conditions are equivalent. The first is that, for every such , every for which all four matrices have complex trace , and every , writing and , both
hold, including at . The second is that, for every such , every complex linear, completely positive map preserving the complex trace of every matrix, and every , without trace normalization,
Complete positivity means preservation of positive semidefiniteness after applying separately to every block of a matrix indexed by , for every natural number , including .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.