4.20
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.petz_joint_curvatureAll 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.
Petz trace Qbar_α is jointly concave for 0<α<1 and jointly convex for 1<α≤2.
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.20
4.20, arXiv:1504.00233v5, PDF p.69. -/
theorem petz_joint_curvature [Nonempty I] (a : ℝ) (r s t u : paperMat I) (hr : r.PosSemidef) (hs : s.PosSemidef)
(ht : t.PosSemidef) (hu : u.PosSemidef) (l : ℝ) (hl : l ∈ Set.Icc 0 1) :
(0 < a → a < 1 → l*paperRenyiQ false r s a+(1-l)*paperRenyiQ false t u a ≤ paperRenyiQ false (paperMix l r t) (paperMix l s u) a) ∧
(1 < a → a ≤ 2 → petzExtendedQ (paperMix l r t) (paperMix l s u) a ≤ (l:EReal)*petzExtendedQ r s a+((1-l:ℝ):EReal)*petzExtendedQ t u a) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every nonempty finite index type with decidable equality, every real number , every four positive semidefinite complex matrices indexed by , and every real , the following two implications both hold. Define by continuous functional calculus using the real function that is at and otherwise, and set , , and . Also define if and , and otherwise define it as the real value embedded into the extended reals. Then
and
The second inequality uses extended-real arithmetic, including at and . The matrices need not have trace and may be zero or singular; the power convention assigns zero to zero eigenvalues even when the exponent is zero or negative. For , , or , neither implication imposes an inequality.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.