- The paper develops hockeystick and f-divergences from Jordan decompositions of normal selfadjoint functionals, establishing convexity, lower semicontinuity, data processing, and martingale convergence for arbitrary von Neumann algebras.
- It gives hockeystick divergences an operational Bayesian hypothesis-testing interpretation and derives a state-comparison dictionary linking them to orthogonality, absolute continuity, domination, and max-relative entropy.
- The paper proves the central identity D^M_{f₀}=S^M_rel for every von Neumann algebra using semifinite operator-integral methods and Haagerup reduction, while showing regularized tensor-power f₀-divergence converges to Araki relative entropy.
The paper develops a framework for f-divergences on arbitrary von Neumann algebras, built on hockeystick divergences defined through the Jordan decomposition of normal selfadjoint functionals. Its central result is the identity Df0M=SrelM between the f0-divergence and Araki's relative entropy for general von Neumann algebras, extending earlier finite-dimensional and semifinite results (2607.05195).
Background and motivation
In classical probability, Csiszár f-divergences Df(μ1∥μ2)=∫f(dμ1/dμ2)dμ2 quantify state distinguishability, and Sason and Verdú showed that for twice differentiable convex f they admit an integral representation over hockeystick divergences Et(μ1∥μ2)=∥(μ1−tμ2)+∥, the total variation of the positive part of the signed measure μ1−tμ2. In the quantum setting, prior extensions of f-divergences to von Neumann algebras by Petz used the relative modular operator Δφ1,φ2, while the hypothesis-testing interpretation of hockeystick divergences was developed mainly for matrix algebras by Sharma–Warsi and later Hirche–Tomamichel.
The authors observe that the hockeystick divergence has a direct hypothesis-testing meaning: for prior probabilities Df0M=SrelM0 and likelihood ratio Df0M=SrelM1, the Helstrom optimal success probability is Df0M=SrelM2, and in the commutative case Df0M=SrelM3 coincides exactly with the classical Df0M=SrelM4. This motivates defining, for any von Neumann algebra Df0M=SrelM5 and positive normal functionals Df0M=SrelM6,
Df0M=SrelM7
the norm of the positive part in the Jordan decomposition. A notable feature is that this definition is independent of modular theory; the authors emphasize that the resulting quantum Df0M=SrelM8-divergences are in general different from Petz's modular-operator-based ones whenever the density operators do not commute.
Properties derived from the Jordan decomposition
The technical core for the first part of the paper is a set of properties of the positive variation Df0M=SrelM9 on f00: it equals f01, and is contractive, norm continuous, ultraweakly lower semicontinuous, monotone, subadditive, positively homogeneous, and convex. The paper also establishes its behavior under direct sums, tensor products, positive contractions, conditional expectations (where equality holds), compressions, and martingale convergence over increasing nets of subalgebras.
From these, the hockeystick divergence inherits a variational characterization f02, joint continuity and lower semicontinuity, monotonicity, convexity in both the functionals and the parameter, a "triangle inequality" f03, and the data processing inequality for normal positive contractions. The paper also gives a complete state-comparison dictionary: orthogonality is equivalent to f04 for some (equivalently all) f05; absolute continuity is equivalent to f06; and domination f07 is equivalent to vanishing of f08 for f09, connecting the divergence to the max-relative entropy f0.
f1-divergences and their properties
The f2-divergence is defined, following Hirche–Tomamichel's finite-dimensional construction, by integrating hockeystick divergences over the likelihood ratio:
f3
where f4 and the correction term handles non-normalized functionals. The main structural result (their Theorem on f5-divergence properties) collects: bounds f6; state discrimination (f7 when f8 a.e.); divergence to f9 when supports are incomparable and Df(μ1∥μ2)=∫f(dμ1/dμ2)dμ20; joint lower semicontinuity; joint convexity; the state-exchange relation; the data processing inequality for unital normal maps (with equality for conditional expectations); additivity over direct sums; and martingale convergence. The proofs are short, carried over from finite-dimensional arguments via the Jordan decomposition — the authors point out that the data processing inequality follows in a few lines, in contrast to earlier involved arguments.
As concrete estimates, the paper derives a two-dimensional lower bound from any projection Df(μ1∥μ2)=∫f(dμ1/dμ2)dμ21, and for Df(μ1∥μ2)=∫f(dμ1/dμ2)dμ22 recovers Pinsker's inequality in the form Df(μ1∥μ2)=∫f(dμ1/dμ2)dμ23 for arbitrary von Neumann algebras.
Modular bounds and the regularized Df(μ1∥μ2)=∫f(dμ1/dμ2)dμ24-divergence
To connect the Jordan-decomposition-based quantities with Araki's relative entropy Df(μ1∥μ2)=∫f(dμ1/dμ2)dμ25, the paper proves upper and lower bounds on hockeystick divergences in terms of Df(μ1∥μ2)=∫f(dμ1/dμ2)dμ26: for any Df(μ1∥μ2)=∫f(dμ1/dμ2)dμ27,
Df(μ1∥μ2)=∫f(dμ1/dμ2)dμ28
the upper bound following from a geometric graph-projection lemma, the lower bound from Ogata's generalization of the Powers–Størmer inequality. The upper bound is shown to be sharp only in the limits Df(μ1∥μ2)=∫f(dμ1/dμ2)dμ29, f0, or when f1 — the error stems from restricting the graph-distance infimum to vectors of the form f2. The authors concede that this route does not seem to yield the exact equality f3, and they do not have an independent proof of additivity of f4 over tensor products at this stage.
Nevertheless, the bounds are strong enough to establish that for states,
f5
i.e., the multi-shot regularized f6-divergence equals Araki's relative entropy. This is operationally meaningful: the regularization describes asymptotic decay rates of testing errors in composite hypothesis testing. The proof optimizes the exponent f7 in the lower bound as f8, exploiting the log-convexity of f9.
The identity Et(μ1∥μ2)=∥(μ1−tμ2)+∥0
The exact identification proceeds in two stages. First, for semifinite Et(μ1∥μ2)=∥(μ1−tμ2)+∥1, the paper shows that the relative modular operator is implemented by densities as Et(μ1∥μ2)=∥(μ1−tμ2)+∥2 on Et(μ1∥μ2)=∥(μ1−tμ2)+∥3, recovering Umegaki's formula Et(μ1∥μ2)=∥(μ1−tμ2)+∥4. The proof of Et(μ1∥μ2)=∥(μ1−tμ2)+∥5 then reduces to the equality of two operator integrals, Et(μ1∥μ2)=∥(μ1−tμ2)+∥6 and Et(μ1∥μ2)=∥(μ1−tμ2)+∥7 involving the resolvent-type family Et(μ1∥μ2)=∥(μ1−tμ2)+∥8, which for Et(μ1∥μ2)=∥(μ1−tμ2)+∥9 evaluates to μ1−tμ20. The densities are approximated by spectrally cut-off versions and μ1−tμ21 by the approximants μ1−tμ22 with μ1−tμ23, with dominated and monotone convergence of Araki's relative entropy supplying the limiting steps.
Second, the semifinite result is extended to general μ1−tμ24 via Haagerup reduction: the crossed product μ1−tμ25 carries a faithful normal conditional expectation μ1−tμ26 and an increasing sequence of finite subalgebras μ1−tμ27 dense in μ1−tμ28 in the μ1−tμ29-strong-f0 topology. Since both f1 and f2 are invariant under conditional expectations and continuous under martingale convergence, chaining these facts yields f3 for arbitrary von Neumann algebras. The authors note that this identity was proven independently and simultaneously by Koßmann, Schwonnek, Liu, and Cheng, and credit Lauritz van Luijk for the Haagerup reduction argument.
The operator-integral machinery itself is developed in a dedicated section: the integrands are shown to be Bochner integrable in f4 and f5; the equality f6 for constant f7 is proven by an analytic continuation argument using contour integration of resolvent expressions in half-planes; and the general continuous case follows by differentiating with respect to a parameter and invoking the Weierstraß approximation theorem. These techniques parallel Cheng–Liu's matrix-algebra proof via layer cake representations.
Limitations and open questions
The paper is explicit about several restrictions. The modular bounds on hockeystick divergences are not sharp for f8 except in the orthogonal case, and the authors state that establishing f9 through these bounds appears difficult because the graph-distance variational problem over general Δφ1,φ20 leads to Kosaki's formula rather than hockeystick form. Additivity of Δφ1,φ21 over tensor products is not proven independently — the tensor-power limit in the regularization theorem is obtained from the bounds rather than from additivity. The lower bound on Δφ1,φ22 in terms of Rényi-type quantities becomes trivial in the limits Δφ1,φ23 for states, and the paper does not develop the corresponding bounds for general Δφ1,φ24-divergences. Finally, the paper is purely mathematical: applications, particularly to quantum field theory where type III algebras are ubiquitous and which motivated the work, are deferred to future publications.
Conclusion
The paper provides a self-contained theory of hockeystick and Δφ1,φ25-divergences for general von Neumann algebras grounded entirely in the Jordan decomposition, with short proofs of the standard distinguishability-measure axioms and an operational interpretation via Bayesian hypothesis testing. Its main theorem, Δφ1,φ26 for arbitrary Δφ1,φ27, unifies Frenkel's matrix-algebra identity with its semifinite and general extensions and offers a new integral representation of Araki's relative entropy. The remaining gap between the modular bounds and the exact identity, and the lack of an independent additivity proof for Δφ1,φ28, are the principal open technical questions left by the analysis.