Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

4.5

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.general_mean_curvature_iff_dpi

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All 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 Q~α=Tr⁡(σ(1−α)/(2α)ρσ(1−α)/(2α))α\widetilde Q_\alpha=\operatorname{Tr}(\sigma^{(1-\alpha)/(2\alpha)}\rho\sigma^{(1-\alpha)/(2\alpha)})^\alphaQ​α​=Tr(σ(1−α)/(2α)ρσ(1−α)/(2α))α and Q‾α=Tr⁡(ρασ1−α)\overline Q_\alpha=\operatorname{Tr}(\rho^\alpha\sigma^{1-\alpha})Q​α​=Tr(ρασ1−α); the divergences include division by Tr⁡ρ\operatorname{Tr}\rhoTrρ inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation ρ≪σ\rho\ll\sigmaρ≪σ 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.

joint curvature of Q=g∘D⟺D(E(ρ)∥E(σ))≤D(ρ∥σ) for all CPTP E.\text{joint curvature of }Q=g\circ D\quad\Longleftrightarrow\quad D(\mathcal E(\rho)\|\mathcal E(\sigma))\le D(\rho\|\sigma)\text{ for all CPTP }\mathcal E.joint curvature of Q=g∘D⟺D(E(ρ)∥E(σ))≤D(ρ∥σ) for all CPTP E.

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
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
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 57, 4.5
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let DI(r,s)D_I(r,s)DI​(r,s) be a real-valued rule on pairs of square complex matrices for every finite index type III with decidable equality, and let g:R→Rg:\mathbb R\to\mathbb Rg:R→R. Write AI={(r,s):r,s are positive semidefinite, r≠0, ker⁡s⊆ker⁡r}\mathcal A_I=\{(r,s):r,s\text{ are positive semidefinite},\ r\ne0,\ \ker s\subseteq\ker r\}AI​={(r,s):r,s are positive semidefinite, r=0, kers⊆kerr}. Assume all of the following: ggg is continuous and either strictly increasing or strictly decreasing; for every finite nonempty III with decidable equality, DID_IDI​ is continuous on AI\mathcal A_IAI​; for every two such types I,JI,JI,J, every (r,s)∈AI(r,s)\in\mathcal A_I(r,s)∈AI​, and every complex matrix UUU from III-coordinates to JJJ-coordinates satisfying both U∗U=1U^*U=1U∗U=1 and UU∗=1UU^*=1UU∗=1, one has DI(r,s)=DJ(UrU∗,UsU∗)D_I(r,s)=D_J(UrU^*,UsU^*)DI​(r,s)=DJ​(UrU∗,UsU∗); on the singleton type, D(1,12 1)=log⁡22D(1,\tfrac12\,1)=\log_2 2D(1,21​1)=log2​2; for every (r,s)∈AI(r,s)\in\mathcal A_I(r,s)∈AI​, positive semidefiniteness of r−sr-sr−s implies 0≤DI(r,s)0\le D_I(r,s)0≤DI​(r,s), and positive semidefiniteness of s−rs-rs−r implies DI(r,s)≤0D_I(r,s)\le0DI​(r,s)≤0; and for every such I,JI,JI,J, (r,s)∈AI(r,s)\in\mathcal A_I(r,s)∈AI​, and (t,u)∈AJ(t,u)\in\mathcal A_J(t,u)∈AJ​,

DI×J(r⊗t,s⊗u)=DI(r,s)+DJ(t,u),g ⁣(DI⊔J(r⊕t,s⊕u))=Re⁡tr⁡rRe⁡tr⁡r+Re⁡tr⁡t g(DI(r,s))+Re⁡tr⁡tRe⁡tr⁡r+Re⁡tr⁡t g(DJ(t,u)).\begin{aligned} D_{I\times J}(r\otimes t,s\otimes u)&=D_I(r,s)+D_J(t,u),\\ g\!\left(D_{I\sqcup J}(r\oplus t,s\oplus u)\right) &= \frac{\operatorname{Re}\operatorname{tr}r} {\operatorname{Re}\operatorname{tr}r+\operatorname{Re}\operatorname{tr}t}\,g(D_I(r,s)) + \frac{\operatorname{Re}\operatorname{tr}t} {\operatorname{Re}\operatorname{tr}r+\operatorname{Re}\operatorname{tr}t}\,g(D_J(t,u)). \end{aligned}DI×J​(r⊗t,s⊗u)g(DI⊔J​(r⊕t,s⊕u))​=DI​(r,s)+DJ​(t,u),=Retrr+RetrtRetrr​g(DI​(r,s))+Retrr+RetrtRetrt​g(DJ​(t,u)).​

Here ⊗\otimes⊗ is the Kronecker product, U∗U^*U∗ is the conjugate transpose, and ⊕\oplus⊕ 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 III, every (r,s),(t,u)∈AI(r,s),(t,u)\in\mathcal A_I(r,s),(t,u)∈AI​ for which all four matrices have complex trace 111, and every l∈[0,1]l\in[0,1]l∈[0,1], writing rl=lr+(1−l)tr_l=lr+(1-l)trl​=lr+(1−l)t and sl=ls+(1−l)us_l=ls+(1-l)usl​=ls+(1−l)u, both

g strictly increasing ⟹ g(DI(rl,sl))≤l g(DI(r,s))+(1−l) g(DI(t,u)),g strictly decreasing ⟹ l g(DI(r,s))+(1−l) g(DI(t,u))≤g(DI(rl,sl))\begin{aligned} g\text{ strictly increasing}&\ \Longrightarrow\ g(D_I(r_l,s_l))\le l\,g(D_I(r,s))+(1-l)\,g(D_I(t,u)),\\ g\text{ strictly decreasing}&\ \Longrightarrow\ l\,g(D_I(r,s))+(1-l)\,g(D_I(t,u))\le g(D_I(r_l,s_l)) \end{aligned}g strictly increasingg strictly decreasing​ ⟹ g(DI​(rl​,sl​))≤lg(DI​(r,s))+(1−l)g(DI​(t,u)), ⟹ lg(DI​(r,s))+(1−l)g(DI​(t,u))≤g(DI​(rl​,sl​))​

hold, including at l=0,1l=0,1l=0,1. The second is that, for every such I,JI,JI,J, every complex linear, completely positive map EEE preserving the complex trace of every matrix, and every (r,s)∈AI(r,s)\in\mathcal A_I(r,s)∈AI​, without trace normalization,

DJ(E(r),E(s))≤DI(r,s).D_J(E(r),E(s))\le D_I(r,s).DJ​(E(r),E(s))≤DI​(r,s).

Complete positivity means preservation of positive semidefiniteness after applying EEE separately to every block of a matrix indexed by Fin⁡k×I\operatorname{Fin}k\times IFink×I, for every natural number kkk, including 000.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me