Papers
Topics
Authors
Recent
Search
2000 character limit reached

Integral representations of ff-divergences for general von Neumann algebras

Published 6 Jul 2026 in math.OA, math-ph, and quant-ph | (2607.05195v1)

Abstract: We define and analyze hockeystick divergences and ff-divergences for normal positive functionals on general von Neumann algebras, generalizing and unifying previous work in classical probability and finite-dimensional von Neumann algebras. All the main properties of these state distinguishability measures (including in particular monotonicity, convexity, semicontinuity, bounds, state discrimination, data processing inequality) are derived from properties of the Jordan decomposition of selfadjoint normal functionals. This is done by representing the ff-divergences as integrals over hockeystick divergences, and their significance in quantum hypothesis testing is reviewed. The f0f_0-divergence given by the information function f0(t)=tlntf_0(t) = t \ln t is shown to coincide with Araki's relative entropy, extending results of Frenkel to general von Neumann algebras.

Summary

  • 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 ff-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=SrelMD^M_{f_0} = S^M_\mathrm{rel} between the f0f_0-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 ff-divergences Df(μ1μ2)=f(dμ1/dμ2)dμ2D_f(\mu_1\|\mu_2)=\int f(\mathrm{d}\mu_1/\mathrm{d}\mu_2)\,\mathrm{d}\mu_2 quantify state distinguishability, and Sason and Verdú showed that for twice differentiable convex ff they admit an integral representation over hockeystick divergences Et(μ1μ2)=(μ1tμ2)+E_t(\mu_1\|\mu_2)=\|(\mu_1 - t\mu_2)_+\|, the total variation of the positive part of the signed measure μ1tμ2\mu_1 - t\mu_2. In the quantum setting, prior extensions of ff-divergences to von Neumann algebras by Petz used the relative modular operator Δφ1,φ2\Delta_{\varphi_1,\varphi_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=SrelMD^M_{f_0} = S^M_\mathrm{rel}0 and likelihood ratio Df0M=SrelMD^M_{f_0} = S^M_\mathrm{rel}1, the Helstrom optimal success probability is Df0M=SrelMD^M_{f_0} = S^M_\mathrm{rel}2, and in the commutative case Df0M=SrelMD^M_{f_0} = S^M_\mathrm{rel}3 coincides exactly with the classical Df0M=SrelMD^M_{f_0} = S^M_\mathrm{rel}4. This motivates defining, for any von Neumann algebra Df0M=SrelMD^M_{f_0} = S^M_\mathrm{rel}5 and positive normal functionals Df0M=SrelMD^M_{f_0} = S^M_\mathrm{rel}6,

Df0M=SrelMD^M_{f_0} = S^M_\mathrm{rel}7

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=SrelMD^M_{f_0} = S^M_\mathrm{rel}8-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=SrelMD^M_{f_0} = S^M_\mathrm{rel}9 on f0f_00: it equals f0f_01, 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 f0f_02, joint continuity and lower semicontinuity, monotonicity, convexity in both the functionals and the parameter, a "triangle inequality" f0f_03, and the data processing inequality for normal positive contractions. The paper also gives a complete state-comparison dictionary: orthogonality is equivalent to f0f_04 for some (equivalently all) f0f_05; absolute continuity is equivalent to f0f_06; and domination f0f_07 is equivalent to vanishing of f0f_08 for f0f_09, connecting the divergence to the max-relative entropy ff0.

ff1-divergences and their properties

The ff2-divergence is defined, following Hirche–Tomamichel's finite-dimensional construction, by integrating hockeystick divergences over the likelihood ratio:

ff3

where ff4 and the correction term handles non-normalized functionals. The main structural result (their Theorem on ff5-divergence properties) collects: bounds ff6; state discrimination (ff7 when ff8 a.e.); divergence to ff9 when supports are incomparable and Df(μ1μ2)=f(dμ1/dμ2)dμ2D_f(\mu_1\|\mu_2)=\int f(\mathrm{d}\mu_1/\mathrm{d}\mu_2)\,\mathrm{d}\mu_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μ2D_f(\mu_1\|\mu_2)=\int f(\mathrm{d}\mu_1/\mathrm{d}\mu_2)\,\mathrm{d}\mu_21, and for Df(μ1μ2)=f(dμ1/dμ2)dμ2D_f(\mu_1\|\mu_2)=\int f(\mathrm{d}\mu_1/\mathrm{d}\mu_2)\,\mathrm{d}\mu_22 recovers Pinsker's inequality in the form Df(μ1μ2)=f(dμ1/dμ2)dμ2D_f(\mu_1\|\mu_2)=\int f(\mathrm{d}\mu_1/\mathrm{d}\mu_2)\,\mathrm{d}\mu_23 for arbitrary von Neumann algebras.

Modular bounds and the regularized Df(μ1μ2)=f(dμ1/dμ2)dμ2D_f(\mu_1\|\mu_2)=\int f(\mathrm{d}\mu_1/\mathrm{d}\mu_2)\,\mathrm{d}\mu_24-divergence

To connect the Jordan-decomposition-based quantities with Araki's relative entropy Df(μ1μ2)=f(dμ1/dμ2)dμ2D_f(\mu_1\|\mu_2)=\int f(\mathrm{d}\mu_1/\mathrm{d}\mu_2)\,\mathrm{d}\mu_25, the paper proves upper and lower bounds on hockeystick divergences in terms of Df(μ1μ2)=f(dμ1/dμ2)dμ2D_f(\mu_1\|\mu_2)=\int f(\mathrm{d}\mu_1/\mathrm{d}\mu_2)\,\mathrm{d}\mu_26: for any Df(μ1μ2)=f(dμ1/dμ2)dμ2D_f(\mu_1\|\mu_2)=\int f(\mathrm{d}\mu_1/\mathrm{d}\mu_2)\,\mathrm{d}\mu_27,

Df(μ1μ2)=f(dμ1/dμ2)dμ2D_f(\mu_1\|\mu_2)=\int f(\mathrm{d}\mu_1/\mathrm{d}\mu_2)\,\mathrm{d}\mu_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μ2D_f(\mu_1\|\mu_2)=\int f(\mathrm{d}\mu_1/\mathrm{d}\mu_2)\,\mathrm{d}\mu_29, ff0, or when ff1 — the error stems from restricting the graph-distance infimum to vectors of the form ff2. The authors concede that this route does not seem to yield the exact equality ff3, and they do not have an independent proof of additivity of ff4 over tensor products at this stage.

Nevertheless, the bounds are strong enough to establish that for states,

ff5

i.e., the multi-shot regularized ff6-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 ff7 in the lower bound as ff8, exploiting the log-convexity of ff9.

The identity Et(μ1μ2)=(μ1tμ2)+E_t(\mu_1\|\mu_2)=\|(\mu_1 - t\mu_2)_+\|0

The exact identification proceeds in two stages. First, for semifinite Et(μ1μ2)=(μ1tμ2)+E_t(\mu_1\|\mu_2)=\|(\mu_1 - t\mu_2)_+\|1, the paper shows that the relative modular operator is implemented by densities as Et(μ1μ2)=(μ1tμ2)+E_t(\mu_1\|\mu_2)=\|(\mu_1 - t\mu_2)_+\|2 on Et(μ1μ2)=(μ1tμ2)+E_t(\mu_1\|\mu_2)=\|(\mu_1 - t\mu_2)_+\|3, recovering Umegaki's formula Et(μ1μ2)=(μ1tμ2)+E_t(\mu_1\|\mu_2)=\|(\mu_1 - t\mu_2)_+\|4. The proof of Et(μ1μ2)=(μ1tμ2)+E_t(\mu_1\|\mu_2)=\|(\mu_1 - t\mu_2)_+\|5 then reduces to the equality of two operator integrals, Et(μ1μ2)=(μ1tμ2)+E_t(\mu_1\|\mu_2)=\|(\mu_1 - t\mu_2)_+\|6 and Et(μ1μ2)=(μ1tμ2)+E_t(\mu_1\|\mu_2)=\|(\mu_1 - t\mu_2)_+\|7 involving the resolvent-type family Et(μ1μ2)=(μ1tμ2)+E_t(\mu_1\|\mu_2)=\|(\mu_1 - t\mu_2)_+\|8, which for Et(μ1μ2)=(μ1tμ2)+E_t(\mu_1\|\mu_2)=\|(\mu_1 - t\mu_2)_+\|9 evaluates to μ1tμ2\mu_1 - t\mu_20. The densities are approximated by spectrally cut-off versions and μ1tμ2\mu_1 - t\mu_21 by the approximants μ1tμ2\mu_1 - t\mu_22 with μ1tμ2\mu_1 - t\mu_23, with dominated and monotone convergence of Araki's relative entropy supplying the limiting steps.

Second, the semifinite result is extended to general μ1tμ2\mu_1 - t\mu_24 via Haagerup reduction: the crossed product μ1tμ2\mu_1 - t\mu_25 carries a faithful normal conditional expectation μ1tμ2\mu_1 - t\mu_26 and an increasing sequence of finite subalgebras μ1tμ2\mu_1 - t\mu_27 dense in μ1tμ2\mu_1 - t\mu_28 in the μ1tμ2\mu_1 - t\mu_29-strong-ff0 topology. Since both ff1 and ff2 are invariant under conditional expectations and continuous under martingale convergence, chaining these facts yields ff3 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 ff4 and ff5; the equality ff6 for constant ff7 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 ff8 except in the orthogonal case, and the authors state that establishing ff9 through these bounds appears difficult because the graph-distance variational problem over general Δφ1,φ2\Delta_{\varphi_1,\varphi_2}0 leads to Kosaki's formula rather than hockeystick form. Additivity of Δφ1,φ2\Delta_{\varphi_1,\varphi_2}1 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,φ2\Delta_{\varphi_1,\varphi_2}2 in terms of Rényi-type quantities becomes trivial in the limits Δφ1,φ2\Delta_{\varphi_1,\varphi_2}3 for states, and the paper does not develop the corresponding bounds for general Δφ1,φ2\Delta_{\varphi_1,\varphi_2}4-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,φ2\Delta_{\varphi_1,\varphi_2}5-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,φ2\Delta_{\varphi_1,\varphi_2}6 for arbitrary Δφ1,φ2\Delta_{\varphi_1,\varphi_2}7, 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,φ2\Delta_{\varphi_1,\varphi_2}8, are the principal open technical questions left by the analysis.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.