\documentclass[11pt]{amsart} \pdfoutput=1 \usepackage[usenames,dvipsnames]{xcolor} % \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage[letterpaper,margin=1in]{geometry} \usepackage{lmodern} \usepackage{microtype} \usepackage{etoolbox} % \usepackage{lettrine} \usepackage{mathtools} \usepackage{amsmath,amssymb,amsfonts,amsxtra,bm} \usepackage{amsthm} \usepackage{mathrsfs} \usepackage{latexsym} \usepackage{nicefrac} % \usepackage{booktabs} \usepackage{makecell,multirow} % \usepackage{colortbl} \usepackage{graphicx} \usepackage{epstopdf} \usepackage{float} \floatstyle{plaintop} \restylefloat{table} \usepackage{footnote, tablefootnote} \usepackage{enumitem} \usepackage{algorithm} \usepackage{algorithmic} \usepackage{comment} \usepackage{xspace} \usepackage{url} \usepackage[most]{tcolorbox} \usepackage[round]{natbib} \usepackage{hyperref} \numberwithin{equation}{section} \makeatletter \definecolor{darkblue}{rgb}{0.0,0.0,0.65} \definecolor{darkred}{rgb}{0.68,0.05,0.0} \definecolor{darkgreen}{rgb}{0.0,0.29,0.29} \definecolor{darkpurple}{rgb}{0.47,0.09,0.29} \renewcommand{\topfraction}{0.85} \renewcommand{\bottomfraction}{0.4} \renewcommand{\textfraction}{0.1} \renewcommand{\floatpagefraction}{0.9} \patchcmd{\section}{\scshape}{\fontfamily{ppl}\bfseries\scshape\selectfont}{}{% \PackageWarning{aiproofs}{Could not bold the section font; amsart may have changed}} \newcommand{\aiauthor}{% \author[Suvrit Sra]{Suvrit Sra\textsuperscript{\normalfont*}}% \thanks{*\,TU Munich, Dept.~of Mathematics, School of CIT; Garching, Germany. Email: \texttt{s.sra@tum.de}.}} \makeatother \hypersetup{colorlinks=true,linkcolor=blue!45!black,citecolor=blue!45!black,urlcolor=red!65!black} \setlist{nosep,leftmargin=*} \renewcommand{\bibnumfmt}[1]{{\color{darkblue}\bf\textsc{#1}}.\hskip 6pt} \newenvironment{aiusage}{\section*{AI usage}}{} \newcommand{\aiacknowledgements}[1][]{% \section*{Acknowledgements} \if\relax\detokenize{#1}\relax\else #1\ \fi The author (SS) thanks the Alexander von Humboldt (AvH) Foundation for their generous support via a Humboldt Professorship in AI.% } \newcommand{\reals}{\mathbb{R}} \newcommand{\N}{\mathbb{N}} \newcommand{\pp}{\mathbb{P}} \newcommand{\E}{\mathbb{E}} \newcommand{\bmOne}{\bm{1}} \newcommand{\C}{\mathbb{C}} \newcommand{\Cc}{\mathcal{C}} \newcommand{\Dc}{\mathcal{D}} \newcommand{\Nc}{\mathcal{N}} \newcommand{\Xc}{\mathcal{X}} \newcommand{\Fc}{\mathcal{F}} \newcommand{\symm}{\mathfrak{S}} \newcommand{\ma}{\bm{A}} \newcommand{\mx}{\bm{X}} \newcommand{\my}{\bm{Y}} \newcommand{\mz}{\bm{Z}} \newcommand{\vx}{\bm{x}} \newcommand{\vy}{\bm{y}} \newcommand{\vv}{\bm{v}} \newcommand{\vz}{\bm{z}} \newcommand{\vr}{\bm{r}} \newcommand{\mb}{\bm{B}} \newcommand{\dpp}{\textsc{Dpp}} \newcommand{\etal}{et~al.\@\xspace} \newcommand{\half}{\tfrac{1}{2}} \newcommand{\kron}{\otimes} \newcommand{\inv}[1]{{#1}^{-1}} \newcommand{\nlsum}{\sum\nolimits} \newcommand{\nlprod}{\prod\nolimits} \newcommand{\ip}[2]{\langle {#1},\, {#2} \rangle} \newcommand{\iplr}[2]{\left\langle {#1},\, {#2}\right\rangle} \newcommand{\set}[1]{\left\lbrace#1\right\rbrace} \newcommand{\norm}[1]{\|{#1}\|} \newcommand{\bignorm}[1]{\left\lVert #1\right\rVert} \newcommand{\pnorm}[2]{\|#1\|_{#2}} \newcommand{\enorm}[1]{\bigl\|#1\bigr\|_{2}} \newcommand{\frob}[1]{\|#1\|_{\text{F}}} \newcommand{\fdel}[2]{\frac{\partial {#1}}{\partial {#2}}} \newcommand{\what}{\widehat} \newcommand{\ld}{\ell{}d} \newcommand{\gm}{\#} \newcommand{\nf}[2]{\nicefrac{#1}{#2}} \newcommand{\pfrac}[2]{\left(\tfrac{#1}{#2}\right)} \def\sint{\begingroup\textstyle\int\endgroup} % \DeclareMathOperator{\trace}{tr} \DeclareMathOperator{\diag}{diag} \DeclareMathOperator{\Diag}{Diag} \DeclareMathOperator{\real}{Re} \DeclareMathOperator{\imag}{Im} \DeclareMathOperator{\per}{per} \DeclareMathOperator{\Vol}{Vol} \DeclareMathOperator{\Imm}{Imm} \DeclareMathOperator{\mdet}{det} \DeclareMathOperator{\supp}{supp} \DeclareMathOperator{\qjsd}{QJSD} \DeclareMathOperator{\qjrd}{QJRD} \DeclareMathOperator*{\argmin}{argmin} \DeclareMathOperator*{\argmax}{argmax} \newtheorem{theorem}{Theorem}[section] \newtheorem{conj}[theorem]{Conjecture} \newtheorem{prop}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corr}[theorem]{Corollary} \newtheorem{rmk}[theorem]{Remark} \newtheorem{example}[theorem]{Example} \newtheorem{claim}[theorem]{Claim} \theoremstyle{definition} \newtheorem{defn}[theorem]{Definition} \newtheorem{prob}[theorem]{Problem} \definecolor{cdarkred}{RGB}{180,70,30} % \definecolor{cdarkgreen}{RGB}{0,130,0} % \definecolor{azure}{RGB}{240,255,255} \definecolor{cmidgreen}{RGB}{201,219,216} \definecolor{clightgreen}{RGB}{200,255,200} \definecolor{clightgray}{RGB}{240,240,240} \definecolor{cmygreen}{RGB}{10,120,0} \definecolor{cmyblue}{RGB}{50,50,255} \definecolor{sblue}{RGB}{100,100,255} \definecolor{cmypurple}{RGB}{150,50,180} \definecolor{cmyred}{RGB}{238, 64, 0} \definecolor{cdarkblue}{RGB}{30,75,170} \definecolor{csharpred}{RGB}{255,0,0} \newcommand{\sred}[1]{{\color{csharpred} #1}} \newcommand{\darkred}[1]{{\color{cdarkred} #1}} \newcommand{\bred}[1]{\textbf{\sred{#1}}} \newcommand{\darkblue}[1]{{\color{cdarkblue} #1}} \newcommand{\bblue}[1]{\textbf{\darkblue{#1}}} \newcommand{\darkbred}[1]{\textbf{\color{cdarkred} #1}} \newcommand{\darkgreen}[1]{{\color{cmygreen} #1}} \newtcolorbox{dashedbox}[1][]{ before={\par\medskip\noindent}, after={\par\medskip}, colback=yellow!10!white, boxrule=0pt, enhanced jigsaw, top=2pt, left=2pt, right=2pt, bottom=0pt, borderline horizontal={0.5pt}{0pt}{dashed}, borderline vertical={0.5pt}{0pt}{dashed}, #1 } \newtcbox{\tcbmathbox}[1][]{ nobeforeafter, colback=yellow!30!white, boxrule=0pt, enhanced jigsaw, top=0pt, left=1pt, right=1pt, bottom=0pt, borderline horizontal={0.5pt}{0pt}{dashed}, borderline vertical={0.5pt}{0pt}{dashed}, #1 } \newcommand{\one}{\mathbf 1} % \newcommand{\dd}{\,\mathrm{d}} \allowdisplaybreaks \subjclass[2020]{15A42, 46L51, 47A63, 94A17} \keywords{Tsallis relative entropy, quantum Jensen--Shannon divergence, Sibson information radius, S-divergence, negative type, Schatten norm, quantum R\'enyi entropy, log-determinant inequality} \hypersetup{ pdftitle={Tsallis metrics on density matrices via the S-divergence}, pdfauthor={Suvrit Sra} } \makeatletter \newcommand{\preprintslink}[2]{% \thanks{First public release: #2, as v1 in the author's preprint repository, \url{https://github.com/suvrit/preprints/tree/main/preprints/#1}; every version is kept there with its timestamp.}} \makeatother \begin{document} \title[Tsallis metrics on density matrices]{Tsallis Metrics on Density Matrices via the S-Divergence} \aiauthor \begin{abstract} We study symmetrized divergences induced by centroids of $\alpha$-Tsallis relative entropies between density matrices $\sigma$ and $\rho$; up to scaling, the induced divergence equals $|2-\pnorm{\rho^\alpha+\sigma^\alpha}{1/\alpha}|$. Earlier work (S.~Sra. \darkblue{\emph{``Metrics induced by Jensen--Shannon and related divergences on positive definite matrices.''}} Linear Algebra Appl., 2021) studied such divergences and metrics induced by them. That paper allowed centroids to range over the positive definite cone, while we require that the centroid itself be a density matrix. This (more natural) choice makes the metricity in this paper considerably stronger than that of the aforementioned paper. Specifically, we prove that $|2-\pnorm{\rho^\alpha+\sigma^\alpha}{1/\alpha}|^{1/2}$ is a metric on density matrices for $1/2\le\alpha\le2$, $\alpha\ne1$. For $\alpha<1$, the proof uses a new four-point theorem for the S-divergence that might be of independent interest. For $\alpha>1$, we first prove the endpoint $\alpha=2$, and then transfer it to the other orders by a tensoring trick. % \end{abstract} \preprintslink{tsallis}{13 October 2026} \maketitle \section{Introduction}\label{sec:intro} We continue the study of metric properties of symmetrized divergences on quantum states started in~\citep{sra2021metrics}. Square roots of symmetrized divergences sometimes turn out to be metrics, for instance Jensen--Shannon divergences for commuting states \citep{endres2003new,fuglede2004jensen}. For noncommuting states \citet{lamberti2008metric} conjectured the metric property, which was proved by both~\citet{sra2021metrics} and \citet{virosztek2021metric} independently. We study herein a symmetrized version of Tsallis relative entropy obtained by computing centroids, and ask whether the resulting divergence is a metric. We denote via $\pp^{d}$ ($\pp_+^d$) the set of $d\times d$ positive semidefinite (definite) Hermitian matrices; and let $\Dc_d:=\{\rho\in\pp^d:\trace\rho=1\}$ be the density matrices, or states. For $\rho,\tau\in\Dc_d$, the Tsallis relative entropy \citep{tsallis1988possible,petz1986quasi} is \begin{equation}\label{eq:tsallis-density} T_\alpha(\rho,\tau):= \frac{1-\trace\rho^\alpha\tau^{1-\alpha}}{1-\alpha}, \qquad \alpha>0,\quad\alpha\ne1. \end{equation} The symmetrized divergence obtained by computing the Tsallis centroid of $\rho$ and $\sigma$ is then: \begin{equation}\label{eq:state-distance} \begin{aligned} d_\alpha^2(\rho,\sigma) &:=|1-\alpha|\min_{\tau\in\Dc_d} \bigl\{T_\alpha(\rho,\tau)+T_\alpha(\sigma,\tau)\bigr\}\quad=\quad\bigl|2-\pnorm{\rho^\alpha+\sigma^\alpha}{1/\alpha}\bigr|, \end{aligned} \end{equation} where $\pnorm{X}{p}=(\trace|X|^p)^{1/p}$ is the Schatten-$p$ norm. % The equality in~\eqref{eq:state-distance} is the quantum Sibson identity \citep{konig2009strong,sharma2013fundamental,dalai2013lower}; Proposition~\ref{prop:centroid} verifies it for $0<\alpha<1$ by H\"older's inequality; the reverse H\"older inequality gives the case $\alpha>1$ (Section~\ref{sec:alpha-large}). It is evident that $d_\alpha$ is symmetric and nonnegative. The challenge is to show that it satisfies the triangle inequality. When the center $\tau$ in~\eqref{eq:state-distance} is allowed to range over all $\pp^d$, the minimum value is $2\alpha(1-h)$, where $h=\trace ((\rho^\alpha+\sigma^\alpha)/2)^{1/\alpha}$, and its square root is a metric for $1/2\le\alpha<1$ \citep[Theorem~4.1]{sra2021metrics}. But in~\eqref{eq:state-distance}, we require the center to lie in $\Dc_d$, which changes the minimum to $d_\alpha^2=2(1-h^\alpha)$. It turns out to be much more difficult to establish that $d_\alpha$ is a metric in this case. The proof of this metricity is our first main result. \begin{dashedbox} \begin{theorem}\label{thm:tsallis} For every $d$ and $1/2\le\alpha\le2$, $\alpha\ne1$, $d_\alpha$ is a metric on $\Dc_d$. % \end{theorem} \end{dashedbox} Theorem~\ref{thm:tsallis} also implies the previous results of~\citet{sra2021metrics}; indeed, as $\alpha\uparrow1$, $d_\alpha^2/(2(1-\alpha))\to \qjsd$, which gives the Jensen--Shannon metric (Corollary~\ref{cor:qjsd}), and the proof gives the cone metric of \citet[Theorem~4.1]{sra2021metrics}. At $\alpha=1/2$, the distance is also of negative type (Proposition~\ref{prop:p2}). For $\alpha<1$, with $p=1/\alpha$, Theorem~\ref{thm:tsallis} follows from positivity of the trace-power kernel $\trace(A+B)^p-\trace A^p-\trace B^p$ on every three positive semidefinite matrices (Theorem~\ref{thm:Lp}). For $1|\xi_j|$ for $j=1,2,3$; by Lemma~\ref{lem:S-basic}(a), we may take $P_0=I$. The domain $(\pp_+^d)^3$ of $F_\xi(I,\cdot)$ is not compact, so a minimizer need not exist. A coercive lower bound rules this out. The bound depends on $\xi$ through \( \nu_\xi:=\min_{\varnothing\ne T\subsetneq\{0,1,2,3\}} \Bigl|\nlsum_{a\in T}\xi_a\Bigr|, \) which is positive for the fixed $\xi$. \begin{prop}\label{prop:coercive} If $\nu_\xi>0$, then $F_\xi(I,P_1,P_2,P_3)\ge2\nu_\xi^2\max_{1\le i\le3}\delta_S^2(I,P_i) -d\log2\nlsum_a\xi_a^2.$ Consequently, $F_\xi(I,\cdot)$ attains its minimum on $(\pp_+^d)^3$. \end{prop} \begin{proof} The values $\delta_S^2(P_a,P_c)$ need not satisfy the triangle inequality, but by Lemma~\ref{lem:S-basic}(b) and~(c) they do after a shift: on $\{0,1,2,3\}$, the function $D(a,c)=\delta_S^2(P_a,P_c)+d\log2$ for $a\ne c$, with $D(a,a)=0$, is a metric. Since $\sum_{a\ne c}\xi_a\xi_c=-\sum_a\xi_a^2$, the shift changes $F_\xi$ only by a constant: \[ -\nlsum_{a,c}\xi_a\xi_c\,D(a,c)=F_\xi(I,P_1,P_2,P_3)+d\log2\nlsum_a\xi_a^2. \] Metrics on four points are conic combinations of cut metrics \citep[p.~422]{deza1997geometry}, so, \[ D(a,c)=\nlsum_{\varnothing\ne T \subsetneq \{0,1,2,3\}} w_T\bigl(\one_T(a)-\one_T(c)\bigr)^2,\qquad w_T\ge0, \] where $\one_T$ is the indicator vector of $T$. Each cut contributes at least $2\nu_\xi^2w_T$, because $\sum_a\xi_a=0$ gives \[ -\nlsum_{a,c}\xi_a\xi_c\bigl(\one_T(a)-\one_T(c)\bigr)^2 =2\Bigl(\nlsum_{a\in T}\xi_a\Bigr)^2\ge2\nu_\xi^2, \] and $\sum_Tw_T\ge\max_{a,c}D(a,c)\ge\max_i\delta_S^2(I,P_i)$ as each cut takes values in $\{0,1\}$. Together, these prove the bound. Finally, if $F_\xi(I,P_1,P_2,P_3)\le0$, the bound caps every $\delta_S^2(I,P_i)$, so by Lemma~\ref{lem:S-basic}(b) and $\log\cosh t\ge|t|-\log2$, eigenvalues of each $P_i$ lie in a compact interval that depends only on $\xi$ and $d$. The triples with this property form a compact set containing $(I,I,I)$, where $F_\xi$ vanishes, and $F_\xi(I,\cdot)>0$ outside it. Hence the minimum of $F_\xi(I,\cdot)$ over this set is its minimum over $(\pp_+^d)^3$. \end{proof} \subsection{Potential minimizers (critical points of \texorpdfstring{$F_\xi$}{F})}\label{sec:cayley} Since $(\pp_+^d)^3$ is open, the minimizer of Proposition~\ref{prop:coercive} is a critical point. Lemma~\ref{lem:critical} describes these critical points. % \begin{lemma}\label{lem:critical} For the $\xi$ fixed above, put $\lambda_j=-\xi_j/\xi_0$, so that $\lambda_1+\lambda_2+\lambda_3=1$, $\lambda_j\ne0$, and $|\lambda_j|<1$. If $(P_1,P_2,P_3)$ is a critical point of $F_\xi(I,\cdot)$, then the coordinates $U_j=(P_j-I)(P_j+I)^{-1}$ satisfy \begin{equation}\label{eq:resolvent-system} \nlsum_{j=1}^3\lambda_jU_j=0, \qquad \nlsum_{j=1}^3\lambda_j(I-U_iU_j)^{-1}=I\quad(i=1,2,3). \end{equation} \end{lemma} \begin{proof} Noting $\sum_a\xi_a=0$, and expanding $\delta_S^2(P_a,P_c)$, we see that only joint terms survive, so that \[ F_\xi=-\nlsum_{a,c=0}^3\xi_a\xi_c\log\det(P_a+P_c). \] Taking derivatives of $F_\xi$ with respect to the $P_i$ we obtain the criticality condition \begin{equation}\label{eq:stationary} \nlsum_{a=0}^3\xi_a(P_i+P_a)^{-1}=0\qquad(i=1,2,3). \end{equation} The equation also holds for $i=0$. Indeed, by Lemma~\ref{lem:S-basic}(a), $F_\xi$ is unchanged when we replace $P_a$ by $e^{tH/2}P_ae^{tH/2}$. The derivative $(d/dt)F_\xi|_{t=0}$ along this curve is the sum of its four partial derivatives. At a critical point the last three vanish, so the derivative in $P_0$ at $I$ in the direction $H$ also vanishes. Now divide \eqref{eq:stationary} by $-\xi_0$ and rewrite it as the set of equations \begin{equation}\label{eq:consensus} \nlsum_{j=1}^3\lambda_j(P_i+P_j)^{-1}=(P_i+I)^{-1}\quad(i=1,2,3), \qquad \nlsum_{j=1}^3\lambda_j(I+P_j)^{-1}=\tfrac12I. \end{equation} The second equation in Cayley coordinates is $\sum_j\lambda_j(I-U_j)=I$, thus $\sum_j\lambda_jU_j=0$. Expanding $(I-U_i)(P_i+P_j)(I-U_j)$ with $(I-U_i)P_i=I+U_i$ and $P_j(I-U_j)=I+U_j$ and rearranging gives $(P_i+P_j)^{-1}=\frac12(I-U_j)(I-U_iU_j)^{-1}(I-U_i)$; % so, the first equation becomes $\sum_j \lambda_j(I-U_iU_j)^{-1}=I$. % \end{proof} \subsection{Solving the critical-point equations}\label{sec:rigidity} On a common eigenvector of the products $U_iU_j$, the system \eqref{eq:resolvent-system} becomes scalar, so we first show that these products commute. \begin{lemma}\label{lem:rigidity} Let $\lambda_1,\lambda_2,\lambda_3$ be as in Lemma~\ref{lem:critical}, and let $U_1,U_2,U_3$ be Hermitian strict contractions satisfying \eqref{eq:resolvent-system}. Then $U_1=U_2=U_3=0$. \end{lemma} \begin{proof} \textbf{The squares commute with all $U_j$.} Fix $i$, let $j,k$ be the other two indices, and write $X=U_i^2$, $B_j=I-U_iU_j$ and $B_k=I-U_iU_k$. Multiplying the first equation in~\eqref{eq:resolvent-system} on the left by $U_i$ gives the first identity below, and the second is the equation of~\eqref{eq:resolvent-system} for this $i$: \begin{equation}\label{eq:paired} \lambda_i(I-X)+\lambda_jB_j+\lambda_kB_k=I, \qquad \lambda_i(I-X)^{-1}+\lambda_jB_j^{-1}+\lambda_kB_k^{-1}=I. \end{equation} Here $H=(1-\lambda_i)I+\lambda_iX$ is positive definite, since $|\lambda_i|<1$. With $B_j=HZ$, the first identity gives $\lambda_kB_k=H(I-\lambda_jZ)$; substituting into the second and multiplying on the right by $H$ yields \begin{equation}\label{eq:rigidity-key} \lambda_jZ^{-1}+\lambda_k^2(I-\lambda_jZ)^{-1} =\bigl(I-\lambda_i(I-X)^{-1}\bigr)H=\varphi(X), \qquad \varphi(x):=(1-\lambda_i)^2-\lambda_i\frac{x^2}{1-x}. \end{equation} The left side commutes with $Z$. Since $\lambda_i\ne0$ and $x^2/(1-x)$ increases strictly on $[0,1)$, $\varphi$ is injective there, so $X$ is a polynomial in $\varphi(X)$ and commutes with $Z$, hence with $B_j=HZ$. For $C=[U_i^2,U_j]$ this says $U_iC=[U_i^2,U_iU_j]=0$, and taking adjoints gives $CU_i=0$. So $C=PCP$ for the projection $P$ onto $\ker U_i$, and $PCP=0$ because $U_i^2P=PU_i^2=0$. By symmetry in $j$ and $k$, \begin{equation}\label{eq:central-squares} [U_i^2,U_j]=0\qquad\text{for all }i,j. \end{equation} \textbf{Shared eigenbasis.} By the first equation in~\eqref{eq:resolvent-system}, $U_3=-(\lambda_1U_1+\lambda_2U_2)/\lambda_3$, so every product $U_iU_j$ lies in the span of $U_1^2$, $U_2^2$, $U_1U_2$ and $U_2U_1$. The first two commute with all $U_j$ by~\eqref{eq:central-squares}, and $U_1U_2$ commutes with its adjoint $U_2U_1$, since both products equal $U_1^2U_2^2$. So these four matrices are normal and commute, and have a common orthonormal eigenbasis. Let $v$ be a vector in it. The eigenvalue of $U_iU_j$ on $v$ is $(U_iv)^*(U_jv)$, and since $(U_iU_j)(U_jU_i)=U_i^2U_j^2$, its modulus is $\|U_iv\|\,\|U_jv\|$. By the equality case of Cauchy--Schwarz, the vectors $U_1v,U_2v,U_3v$ are parallel: $U_iv=z_ie$ for a unit vector $e$ and scalars $z_i$ with $|z_i|=\|U_iv\|<1$. Thus $U_iU_j$ acts on $v$ as $\overline{z_i}\,z_j$. \textbf{The scalar moments vanish.} On $v$, the second set of equations in~\eqref{eq:resolvent-system} becomes \[ \nlsum_{j=1}^3\frac{\lambda_j}{1-\overline{z_i}\,z_j}=1\qquad(i=1,2,3). \] Expand the denominators as geometric series, multiply by $\lambda_i$ and sum over $i$. Since $\sum_i\lambda_i=1$ and $|z_i|<1$, we obtain \[ 0=\nlsum_{n\ge1}\Bigl|\nlsum_{j=1}^3\lambda_jz_j^n\Bigr|^2. \] Let $\zeta_1,\dots,\zeta_m$ be the distinct nonzero values among the $z_j$, with weights $w_\ell=\sum_{j:z_j=\zeta_\ell}\lambda_j$. Then $\sum_\ell w_\ell\zeta_\ell^n=0$ for $n=1,\dots,m$, and this Vandermonde system forces every $w_\ell=0$. But no nonempty subset of the $\lambda_j$ sums to zero: such a sum is $\lambda_j\ne0$, $1-\lambda_j>0$, or $1$. Thus $m=0$, so all $z_j=0$ and $U_jv=0$. As $v$ runs over an orthonormal basis, $U_1=U_2=U_3=0$. \end{proof} \noindent\textbf{\emph{Proof of~\eqref{eq:four-point}}}. We can now prove the four-point negative-type condition~\eqref{eq:four-point}. By Proposition~\ref{prop:coercive} and Lemmas~\ref{lem:critical} and~\ref{lem:rigidity}, the minimum of $F_\xi(I,\cdot)$ is attained at a critical point, and every critical point has $U_1=U_2=U_3=0$, that is, $P_1=P_2=P_3=I$. The minimum is therefore $F_\xi(I,I,I,I)=0$. This proves \eqref{eq:four-point} for the $\xi$ fixed above, and continuity in $\xi$ gives it for every zero-sum $\xi$; by the equivalence established via identity~\eqref{eq:polarization}, the truth of~\eqref{eq:logdet-psd} also follows. \subsection{Number of points}\label{sec:sharp} The following configuration gives the sharpness of both forms of Theorem~\ref{thm:four} for $d=2$. The embeddings $X\mapsto X\oplus0$ and $P\mapsto P\oplus I$ extend it to every $d\ge2$. \begin{prop}\label{prop:sharp} Let $u_k=(\cos\frac{k\pi}3,\sin\frac{k\pi}3)^\top$ for $k=0,1,2$, and let $c=(1,1,1,-\frac32)^\top$. \begin{enumerate}[label=\textup{(\alph*)}] \item Let $x=\sqrt3/2$, $X_k=x\,u_ku_k^\top$ for $k=0,1,2$, and $X_3=xI$. Then $0\preceq X_k\prec I$, and the matrix $K=[-\log\det(I-X_iX_j)]_{i,j=0}^3$ satisfies $c^\top Kc=\log(2^{21}/13^6)<0$. \item With $X_k$ as in \textup{(a)}, let $P_0=I$ and $P_{k+1}=(I+X_k)(I-X_k)^{-1}$ for $k=0,\dots,3$. Then $\delta_S^2$ is not of negative type on $P_0,\dots,P_4$. \end{enumerate} \end{prop} \begin{proof} (a) For $i,j\le2$, $X_iX_j$ has rank one and $\det(I-X_iX_j)=1-x^2(u_i^\top u_j)^2$. Since $(u_i^\top u_j)^2=\frac14$ for $i\ne j$, this determinant is $\frac14$ for $i=j$ and $\frac{13}{16}$ for $i\ne j$. Also $\det(I-X_kX_3)=1-x^2=\frac14$ and $\det(I-X_3^2)=\frac1{16}$. With $L=\log4$ and $\ell=\log\frac{16}{13}$, \[ K=\begin{pmatrix}L&\ell&\ell&L\\ \ell&L&\ell&L\\ \ell&\ell&L&L\\ L&L&L&2L\end{pmatrix}, \qquad c^\top Kc=6\ell-\tfrac32L=\log\frac{2^{21}}{13^6}<0. \] (b) The vector $\xi=(-\frac32,1,1,1,-\frac32)$ ($\xi^T1=0$) gives $\sum_{a,e=0}^4\xi_a\xi_e\,\delta_S^2(P_a,P_e)=-c^\top Kc>0$. \end{proof} \section{Proof of \texorpdfstring{Theorem~\ref{thm:tsallis} for $1/2\le\alpha<1$}{Theorem 1.1 for 1/2 <= alpha < 1}}\label{sec:schatten} We prove Theorem~\ref{thm:tsallis} for $\alpha<1$ on the positive unit sphere of a Schatten norm. The passage to the sphere rests on the equality in \eqref{eq:state-distance}, which we prove first. \subsection{Reduction to a Schatten sphere}\label{sec:reduction} \begin{prop}\label{prop:centroid} Let $0<\alpha<1$, let $\rho,\sigma\in\Dc_d$, and put $M=\rho^\alpha+\sigma^\alpha$. Then \begin{equation}\label{eq:centroid-value} (1-\alpha)\min_{\tau\in\Dc_d} \bigl\{T_\alpha(\rho,\tau)+T_\alpha(\sigma,\tau)\bigr\} =2-\pnorm{M}{1/\alpha}, \end{equation} and the minimum is attained only at \begin{equation}\label{eq:state-centroid} \tau_\star=\frac{M^{1/\alpha}}{\trace M^{1/\alpha}}. \end{equation} \end{prop} \begin{proof} The scaled objective is $2-\trace(M\tau^{1-\alpha})$, and Schatten H\"older with exponents $1/\alpha$ and $1/(1-\alpha)$ gives $\trace(M\tau^{1-\alpha})\le\pnorm{M}{1/\alpha}\pnorm{\tau^{1-\alpha}}{1/(1-\alpha)}=\pnorm{M}{1/\alpha}$. The state~\eqref{eq:state-centroid} attains equality, and strict convexity of the Schatten $1/(1-\alpha)$-norm makes it the only maximizer. \end{proof} For $12$. \subsection{An integral representation}\label{sec:mellin} We transfer the log-determinant form \eqref{eq:logdet-psd} of Theorem~\ref{thm:four} to the trace-power kernel \begin{equation}\label{eq:Lp-definition} L_p(A,B):=\trace(A+B)^p-\trace A^p-\trace B^p, \qquad A,B\in\pp^d, \end{equation} and then use its three-point positivity on the sphere. \begin{theorem}\label{thm:Lp} Let $A_1,A_2,A_3\in\pp^d$. For $10$ and use the scalar identity \citep{sra2021metrics} \begin{equation}\label{eq:power-integral} x^p=\kappa_p\int_0^\infty \bigl(x/t-\log(1+x/t)\bigr)t^{p-1}\dd t\qquad(x\ge0). \end{equation} For $t>0$, set $X_A(t)=A(A+tI)^{-1}$ and \begin{equation}\label{eq:Kt} K_t(A,B):=\log\frac{\det(A+tI)\det(B+tI)}{t^d\det(A+B+tI)} =-\log\det\bigl(I-X_A(t)X_B(t)\bigr). \end{equation} Applying \eqref{eq:power-integral} to $A+B$, $A$ and $B$ and taking traces cancels the linear terms and gives \begin{equation}\label{eq:mellin} L_p(A,B)=\kappa_p\int_0^\infty t^{p-1}K_t(A,B)\dd t. \end{equation} Since $0\preceq X_{A_i}(t)\prec I$, Theorem~\ref{thm:four} gives $[K_t(A_i,A_j)]\succeq0$, and integrating proves~\eqref{eq:Lp-psd}. \end{proof} \subsection{The triangle inequality}\label{sec:triangle} Three-point positivity of $L_p$ places any three points of $\mathcal S_p$ on a sphere, where $D_p$ becomes a function of an angle. Let $10$ and $b_1=-\frac12\cos(\pi/8)<0$, the recurrence gives $b_k<0$ for every $k\ge1$. Let $x_1,\dots,x_n\in\mathbb S$, let $c\in\reals^n$ with $\sum_ic_i=0$, and let $02$, the triangle inequality fails even on diagonal matrices. \begin{prop}\label{prop:p-large} Let $p>2$ and $d=2$, and let $A=\diag(0,1)$, $C=\diag(1,0)$ and $B_\varepsilon=\diag\bigl(\varepsilon,(1-\varepsilon^p)^{1/p}\bigr)$ for $0<\varepsilon<1$. Then $A,B_\varepsilon,C\in\mathcal S_p$, and \[ D_p(C,B_\varepsilon)+D_p(B_\varepsilon,A)2$, so \[ D_p(C,B_\varepsilon)=D_p(C,A)-\frac{2^{1/p}}{4D_p(C,A)}\,\varepsilon+O(\varepsilon^2). \] Since $p/2>1$, the sum $D_p(C,B_\varepsilon)+D_p(B_\varepsilon,A)$ is smaller than $D_p(C,A)$ for small $\varepsilon$. Adjoining zero blocks gives the same counterexample for every $d\ge2$. \end{proof} \section{Proof of \texorpdfstring{Theorem~\ref{thm:tsallis} for $1<\alpha\le2$}{Theorem 1.1 for 1 < alpha <= 2}}\label{sec:alpha-large} For $\alpha>1$, the proof of Proposition~\ref{prop:centroid} with the reverse H\"older inequality gives the equality in~\eqref{eq:state-distance}, with the same minimizing state~\eqref{eq:state-centroid}. We prove the triangle inequality first at $\alpha=2$. At a minimizing middle state, the stationarity equation forces two auxiliary matrices to commute; the trace-one constraints then reduce the problem to a scalar inequality. A positive linear construction on tensor powers transfers this endpoint to the remaining orders. For $p=1/\alpha$ and $A_i=\rho_i^\alpha$, strict concavity of $X\mapsto\trace X^p$ gives $\trace(A_i+A_j)^p\ge2^p$, with equality only when $A_i=A_j$, so $d_\alpha$ separates states. It remains to prove the triangle inequality. \subsection{The scalar inequality} The trace-one constraints will give weighted scalar means of at least one. To use these inequalities directly, we subtract the tangent term $(x+y)/\sqrt2$ before averaging. \begin{lemma}\label{lem:weighted-endpoint} Let $w_k,x_k,y_k\ge0$ satisfy $\nlsum_k w_k=1$, $\nlsum_k w_kx_k\ge1$, and $\sum_k w_ky_k\ge1$. If $r=\nlsum_k w_k\sqrt{1+x_k^2}$ and $s=\nlsum_k w_k\sqrt{1+y_k^2}$, then \begin{equation}\label{eq:weighted-endpoint} \nlsum_k w_k\sqrt{x_k^2+y_k^2} \le L(r,s):=\sqrt{2+\bigl(\sqrt{r^2-2}+\sqrt{s^2-2}\bigr)^2}. \end{equation} \end{lemma} \begin{proof} Jensen's inequality gives $r,s\ge\sqrt2$. For $a,b\ge0$, put \[ \delta(a,b)=\sqrt{a^2+b^2}-\frac{a+b}{\sqrt2},\qquad D(a,b)=\sqrt{\delta(a,b)\bigl(\delta(a,b)+2\sqrt2\bigr)}. \] We first prove the pointwise inequality \begin{equation}\label{eq:scalar-middle} D(x,y)\le D(x,1)+D(1,y),\qquad x,y\ge0. \end{equation} For $a\le b$, both $\delta$ and $D$ are nonincreasing in $a$ and nondecreasing in $b$. Thus \eqref{eq:scalar-middle} holds when $x,y$ lie on the same side of $1$. By symmetry and continuity, it remains to treat $00$. Then $D^2=E(E+4)/2$, and differentiation gives \[ D_{xy}(x,y)=\frac{E^2}{H^3D(x,y)^3} \bigl[6(S-xy)+(2-xy)E\bigr]. \] Since $S-xy=x+(1-x)y>0$, the bracket is positive if $xy\le2$. If $xy>2$, it has the sign of \[ 6-\frac{xy-2}{x+(1-x)y}E. \] Both factors in the subtracted product are positive and increasing in $y$, since \[ \frac{\partial}{\partial y}\frac{xy-2}{x+(1-x)y} =\frac{x^2-2x+2}{(x+(1-x)y)^2}>0,\qquad E_y=\frac{2y}{H}-1>0. \] Thus $D_{xy}$ can change sign only from positive to negative, so $-D_x(x,y)$ has no interior maximum as a function of $y\ge1$. Its limit at infinity is $1/\sqrt2$. At $y=1$, rationalization gives \[ D(x,1)=(1-x)h(x),\qquad h(x)^2=\frac12+\frac{1-x}{\sqrt{2(1+x^2)}+x+1}. \] The fraction is positive and decreasing, so $h>1/\sqrt2$, $h'<0$, and $-D_x(x,1)=h(x)-(1-x)h'(x)>1/\sqrt2$. Hence $-D_x(x,y)\le-D_x(x,1)$ for $00,\qquad v=d_2(\sigma,z)>0,\qquad K_1=\sqrt{\rho^2+z^2},\quad K_2=\sqrt{\sigma^2+z^2}, \] and $t_j=\trace K_j$, so $t_1^2=u^2+2$ and $t_2^2=v^2+2$. The gradient is \[ \nabla f(z)=\tfrac12(zH+Hz),\qquad H=\frac{t_1}{u}K_1^{-1}+\frac{t_2}{v}K_2^{-1}\succ0. \] The minimizer is positive definite. Indeed, if $e\in\ker z$ is a unit vector, the feasible path $z_\varepsilon=(1-\varepsilon)z+\varepsilon ee^*$ has derivative $-\trace(z^2H)<0$. Stationarity under $\trace z=1$ gives $zH+Hz=2\lambda I$, so $H=\lambda z^{-1}$, that is, \begin{equation}\label{eq:endpoint-stationarity} \frac{t_1}{u}R_1^{-1}+\frac{t_2}{v}R_2^{-1}=\lambda I,\qquad R_j:=z^{-1/2}K_jz^{-1/2}. \end{equation} Thus $R_1,R_2$ commute. Operator monotonicity of the square root also gives $K_j\succeq z$, so $R_j\succeq I$. In a common eigenbasis $e_k$, write \[ R_je_k=r_{jk}e_k,\qquad w_k=\langle e_k,ze_k\rangle,\qquad x_k=\sqrt{r_{1k}^2-1},\quad y_k=\sqrt{r_{2k}^2-1}. \] Then $\sum_k w_k=1$ and \[ t_1=\nlsum_k w_k\sqrt{1+x_k^2},\qquad t_2=\nlsum_k w_k\sqrt{1+y_k^2}. \] Since $\rho^2=z^{1/2}(R_1zR_1-z)z^{1/2}$, Lemma~\ref{lem:commuting-trace} gives \[ 1=\trace\rho\le\nlsum_k w_kx_k,\qquad 1=\trace\sigma\le\nlsum_k w_ky_k. \] Applying that lemma once more to $\rho^2+\sigma^2=z^{1/2}(R_1zR_1+R_2zR_2-2z)z^{1/2}$ yields \[ T(\rho,\sigma)\le\nlsum_k w_k\sqrt{x_k^2+y_k^2} \le L(t_1,t_2)=\sqrt{2+(u+v)^2}, \] where the second inequality is Lemma~\ref{lem:weighted-endpoint}. Thus $d_2(\rho,\sigma)\le f(z)$, and minimality gives the triangle inequality for every middle state. \end{proof} \subsection{Transfer to the other orders} The transfer uses positive linear maps so that sums are preserved even when the inputs do not commute. \begin{lemma}\label{lem:power-transfer} Let $1/21/2$, so dominated convergence gives \begin{equation}\label{eq:tensor-root-limit} \mathbb E\tau_{d^N}\sqrt{\Phi_N(X)} \longrightarrow\gamma_p(\tau_dX^p)^{1/(2p)},\qquad \gamma_p:=\frac1{2\sqrt\pi}\int_0^\infty (1-e^{-\ell_p t^p})t^{-3/2}\dd t\in(0,\infty). \end{equation} For each $N$, approximate these expectations simultaneously for the six inputs $A_i$ and $A_i+A_j$ ($i0$, \[ m_i^{(N)}:=\trace D_i^{(N)}\longrightarrow M,\qquad T_{ij}^{(N)}:=\trace\sqrt{(D_i^{(N)})^2+(D_j^{(N)})^2} \longrightarrow M\bigl[\trace(A_i+A_j)^p\bigr]^{1/(2p)}. \] For sufficiently large $N$, normalize $B_i^{(N)}=D_i^{(N)}/m_i^{(N)}$. Operator monotonicity gives \[ \frac{T_{ij}^{(N)}}{\max\{m_i^{(N)},m_j^{(N)}\}} \le\trace\sqrt{(B_i^{(N)})^2+(B_j^{(N)})^2} \le\frac{T_{ij}^{(N)}}{\min\{m_i^{(N)},m_j^{(N)}\}}. \] Both bounds have the limit in \eqref{eq:power-transfer}. \end{proof} \begin{proof}[Proof of Theorem~\ref{thm:tsallis} for $1<\alpha\le2$] Proposition~\ref{prop:alpha-two} proves the triangle inequality at $\alpha=2$. For $1<\alpha<2$, set $p=1/\alpha$ and $A_i=\rho_i^\alpha$. Lemma~\ref{lem:power-transfer} gives \[ d_2(B_i^{(N)},B_j^{(N)}) \longrightarrow \sqrt{\bigl[\trace(A_i+A_j)^p\bigr]^{1/p}-2} =d_\alpha(\rho_i,\rho_j). \] The endpoint triangle inequality passes to this limit. \end{proof} \begin{aiusage} % The results in this paper were developed through extensive use of AI assistants: OpenAI's GPT~Pro for the main line of argument, and Anthropic's Claude for the endpoint results in Section~\ref{sec:p2} and Appendix~\ref{sec:qjsd}, Remark~\ref{rmk:free-metric}, Proposition~\ref{prop:p-large}, and the writing, positioning, and literature search. OpenAI assistants also developed the four-point consequences in Appendix~\ref{sec:jensen} and assisted with proof simplification and reorganization. The arguments emerged through sustained work involving failed attempts, counterexamples, numerical checks, proof audits, and repairs. \end{aiusage} \aiacknowledgements \begin{thebibliography}{21} \providecommand{\natexlab}[1]{#1} \providecommand{\url}[1]{\texttt{#1}} \expandafter\ifx\csname urlstyle\endcsname\relax \providecommand{\doi}[1]{doi: #1}\else \providecommand{\doi}{doi: \begingroup \urlstyle{rm}\Url}\fi \bibitem[Bhatia(1997)]{bhatia1997matrix} Rajendra Bhatia. \newblock \emph{Matrix Analysis}. \newblock Graduate Texts in Mathematics 169. Springer, New York, 1997. \newblock \doi{10.1007/978-1-4612-0653-8}. \bibitem[Bri{\"e}t and Harremo{\"e}s(2009)]{briet2009properties} Jop Bri{\"e}t and Peter Harremo{\"e}s. \newblock Properties of classical and quantum {J}ensen--{S}hannon divergence. \newblock \emph{Physical Review A}, 79\penalty0 (5):\penalty0 052311, 2009. \newblock \doi{10.1103/PhysRevA.79.052311}. \bibitem[Cherian et~al.(2013)Cherian, Sra, Banerjee, and Papanikolopoulos]{cherian2012jensen} Anoop Cherian, Suvrit Sra, Arindam Banerjee, and Nikolaos Papanikolopoulos. \newblock Jensen--{B}regman logdet divergence with application to efficient similarity search for covariance matrices. \newblock \emph{IEEE Transactions on Pattern Analysis and Machine Intelligence}, 35\penalty0 (9):\penalty0 2161--2174, 2013. \newblock \doi{10.1109/TPAMI.2012.259}. \bibitem[Dalai(2013)]{dalai2013lower} Marco Dalai. \newblock Lower bounds on the probability of error for classical and classical-quantum channels. \newblock \emph{IEEE Transactions on Information Theory}, 59\penalty0 (12):\penalty0 8027--8056, 2013. \newblock \doi{10.1109/TIT.2013.2283794}. \bibitem[Deza and Laurent(1997)]{deza1997geometry} Michel~Marie Deza and Monique Laurent. \newblock \emph{Geometry of Cuts and Metrics}, volume~15 of \emph{Algorithms and Combinatorics}. \newblock Springer, Berlin, 1997. \newblock ISBN 3-540-61611-X. \newblock \doi{10.1007/978-3-642-04295-9}. \bibitem[Endres and Schindelin(2003)]{endres2003new} D.~M. Endres and J.~E. Schindelin. \newblock A new metric for probability distributions. \newblock \emph{IEEE Transactions on Information Theory}, 49\penalty0 (7):\penalty0 1858--1860, 2003. \newblock \doi{10.1109/TIT.2003.813506}. \bibitem[Fuglede and Tops{\o}e(2004)]{fuglede2004jensen} Bent Fuglede and Flemming Tops{\o}e. \newblock {J}ensen--{S}hannon divergence and {H}ilbert space embedding. \newblock In \emph{Proceedings of the IEEE International Symposium on Information Theory (ISIT)}, page~31, 2004. \newblock \doi{10.1109/ISIT.2004.1365067}. \bibitem[Hua(1955)]{hua1955inequalities} Loo-Keng Hua. \newblock Inequalities involving determinants. \newblock \emph{Acta Mathematica Sinica}, 5:\penalty0 463--470, 1955. \bibitem[K{\"o}nig and Wehner(2009)]{konig2009strong} Robert K{\"o}nig and Stephanie Wehner. \newblock A strong converse for classical channel coding using entangled inputs. \newblock \emph{Physical Review Letters}, 103:\penalty0 070504, 2009. \newblock \doi{10.1103/PhysRevLett.103.070504}. \newblock Appendix of arXiv:0903.2838. \bibitem[Lamberti et~al.(2008)Lamberti, Majtey, Borras, Casas, and Plastino]{lamberti2008metric} P.~W. Lamberti, A.~P. Majtey, A.~Borras, M.~Casas, and A.~Plastino. \newblock Metric character of the quantum {J}ensen--{S}hannon divergence. \newblock \emph{Physical Review A}, 77\penalty0 (5):\penalty0 052311, 2008. \newblock \doi{10.1103/PhysRevA.77.052311}. \bibitem[Luo and Zhang(2004)]{luo2004informational} Shunlong Luo and Qiang Zhang. \newblock Informational distance on quantum-state space. \newblock \emph{Physical Review A}, 69:\penalty0 032106, 2004. \newblock \doi{10.1103/PhysRevA.69.032106}. \bibitem[Martins et~al.(2009)Martins, Smith, Xing, Aguiar, and Figueiredo]{martins2009nonextensive} Andr{\'e} F.~T. Martins, Noah~A. Smith, Eric~P. Xing, Pedro M.~Q. Aguiar, and M{\'a}rio A.~T. Figueiredo. \newblock Nonextensive information theoretic kernels on measures. \newblock \emph{Journal of Machine Learning Research}, 10:\penalty0 935--975, 2009. \bibitem[{\"O}sterreicher and Vajda(2003)]{osterreicher2003new} Ferdinand {\"O}sterreicher and Igor Vajda. \newblock A new class of metric divergences on probability spaces and its applicability in statistics. \newblock \emph{Annals of the Institute of Statistical Mathematics}, 55\penalty0 (3):\penalty0 639--653, 2003. \newblock \doi{10.1007/BF02517812}. \bibitem[Petz(1986)]{petz1986quasi} D{\'e}nes Petz. \newblock Quasi-entropies for finite quantum systems. \newblock \emph{Reports on Mathematical Physics}, 23\penalty0 (1):\penalty0 57--65, 1986. \newblock \doi{10.1016/0034-4877(86)90067-4}. \bibitem[Schoenberg(1935)]{schoenberg1935remarks} I.~J. Schoenberg. \newblock Remarks to {Maurice Fr{\'e}chet}'s article ``{Sur} la d{\'e}finition axiomatique d'une classe d'espace distanci{\'e}s vectoriellement applicable sur l'espace de {Hilbert}''. \newblock \emph{Annals of Mathematics}, 36\penalty0 (3):\penalty0 724--732, 1935. \newblock \doi{10.2307/1968654}. \bibitem[Sharma and Warsi(2013)]{sharma2013fundamental} Naresh Sharma and Naqueeb~Ahmad Warsi. \newblock Fundamental bound on the reliability of quantum information transmission. \newblock \emph{Physical Review Letters}, 110:\penalty0 080501, 2013. \newblock \doi{10.1103/PhysRevLett.110.080501}. \bibitem[Sra(2016)]{ssdiv} Suvrit Sra. \newblock Positive definite matrices and the {S}-divergence. \newblock \emph{Proceedings of the American Mathematical Society}, 144\penalty0 (7):\penalty0 2787--2797, 2016. \newblock \doi{10.1090/proc/12953}. \bibitem[Sra(2021{\natexlab{a}})]{sra2021hua} Suvrit Sra. \newblock Positive definite functions of noncommuting contractions, {H}ua--{B}ellman matrices, and a new distance metric, 2021{\natexlab{a}}. \bibitem[Sra(2021{\natexlab{b}})]{sra2021metrics} Suvrit Sra. \newblock Metrics induced by {J}ensen--{S}hannon and related divergences on positive definite matrices. \newblock \emph{Linear Algebra and its Applications}, 616:\penalty0 125--138, 2021{\natexlab{b}}. \newblock \doi{10.1016/j.laa.2020.12.023}. \bibitem[Tsallis(1988)]{tsallis1988possible} Constantino Tsallis. \newblock Possible generalization of {B}oltzmann--{G}ibbs statistics. \newblock \emph{Journal of Statistical Physics}, 52\penalty0 (1--2):\penalty0 479--487, 1988. \newblock \doi{10.1007/BF01016429}. \bibitem[Virosztek(2021)]{virosztek2021metric} D{\'a}niel Virosztek. \newblock The metric property of the quantum {J}ensen--{S}hannon divergence. \newblock \emph{Advances in Mathematics}, 380:\penalty0 107595, 2021. \newblock \doi{10.1016/j.aim.2021.107595}. \end{thebibliography} \appendix \section{Relation to the cone and Jensen--Shannon metrics}\label{sec:variational} For $0<\alpha<1$, we relate $d_\alpha$ to the two earlier metrics of the introduction: the cone metric of \citet{sra2021metrics}, which drops the trace constraint, and the Jensen--Shannon metric, the limit of the rescaled $d_\alpha$ as $\alpha\uparrow1$. \subsection{Comparison with the cone minimum} To let the center range over the cone, extend $T_\alpha$ to $X,Z\in\pp^d$ by \begin{equation}\label{eq:tsallis-general} T_\alpha(X,Z):=\frac{\alpha\trace X+(1-\alpha)\trace Z-\trace X^\alpha Z^{1-\alpha}}{1-\alpha}. \end{equation} Minimizing over the cone gives the relative-entropy Jensen--Tsallis divergence of \citet[Theorem~4.1]{sra2021metrics}; its commuting case was studied by \citet{osterreicher2003new}. \begin{prop}\label{prop:free} Let $0<\alpha<1$ and $\rho,\sigma\in\Dc_d$, and put \[ M_\alpha:=\Bigl(\frac{\rho^\alpha+\sigma^\alpha}2\Bigr)^{1/\alpha}, \qquad h:=\trace M_\alpha. \] The unique minimizer over $\pp^d$ is $M_\alpha$, and \begin{equation}\label{eq:free-value} (1-\alpha)\min_{Z\in\pp^d} \bigl\{T_\alpha(\rho,Z)+T_\alpha(\sigma,Z)\bigr\}=2\alpha(1-h). \end{equation} Proposition~\ref{prop:centroid} gives the constrained center $M_\alpha/h$ and \begin{equation}\label{eq:constrained-value} d_\alpha(\rho,\sigma)^2=2(1-h^\alpha). \end{equation} \end{prop} \begin{proof} Write $Z=s\tau$, where $s=\trace Z$ and $\tau\in\Dc_d$. For fixed $s>0$, Proposition~\ref{prop:centroid} gives the unique optimal state $\tau=M_\alpha/h$. Since $\pnorm{\rho^\alpha+\sigma^\alpha}{1/\alpha}=2h^\alpha$, the scaled objective reduces to $2\alpha+2(1-\alpha)s-2h^\alpha s^{1-\alpha}$, a strictly convex function of $s\ge0$ minimized at $s=h$, with value $2\alpha(1-h)$. The minimizing matrix is $s\tau=M_\alpha$. \end{proof} \begin{rmk}\label{rmk:free-metric} For $1/2\le\alpha<1$ and three states $\rho_i$, let $p=1/\alpha$ and take $A_i=\rho_i^\alpha$ in the Gram matrix $G$ of \eqref{eq:gram}. Then $h_{ij}:=\trace((\rho_i^\alpha+\rho_j^\alpha)/2)^{1/\alpha}=(1+G_{ij})/2$. Thus $H=[h_{ij}]=(\one\one^\top+G)/2$ is a Gram matrix of unit vectors $v_i$, and the scaled cone minimum satisfies $2\alpha(1-h_{ij})=\alpha\|v_i-v_j\|^2$. Its square root satisfies the triangle inequality and separates states by \eqref{eq:constrained-value} and Theorem~\ref{thm:tsallis}, recovering the cone metric of \citet[Theorem~4.1]{sra2021metrics} on states. In contrast, $d_\alpha(\rho_i,\rho_j)^2=2(1-h_{ij}^\alpha)$ by \eqref{eq:constrained-value}, and its triangle inequality needs Lemma~\ref{lem:fp}. \end{rmk} \subsection{The limit \texorpdfstring{$\alpha\uparrow1$}{alpha->1}}\label{sec:qjsd} For the Umegaki relative entropy $\trace\rho(\log\rho-\log\tau)$, the optimal center is $m=(\rho+\sigma)/2$ and the least total is $2\qjsd(\rho,\sigma)$, where \begin{equation}\label{eq:qjsd} \qjsd(\rho,\sigma):=\tfrac12\trace\rho(\log\rho-\log m) +\tfrac12\trace\sigma(\log\sigma-\log m) \end{equation} is the quantum Jensen--Shannon divergence. \begin{corr}\label{cor:qjsd} For $\rho,\sigma\in\Dc_d$, \[ \lim_{\alpha\uparrow1}\frac{d_\alpha(\rho,\sigma)^2}{2(1-\alpha)} =\qjsd(\rho,\sigma). \] Consequently $\qjsd^{1/2}$ is a metric on $\Dc_d$. \end{corr} \begin{proof} Put $Y_\alpha=\rho^\alpha+\sigma^\alpha$, $g(\alpha)=\trace Y_\alpha^{1/\alpha}$ and $f(\alpha)=g(\alpha)^\alpha=\pnorm{Y_\alpha}{1/\alpha}$. Then $f(1)=2$, so $d_\alpha(\rho,\sigma)^2=f(1)-f(\alpha)$ by Proposition~\ref{prop:centroid}, and the limit is $f'(1)/2$. A brief calculation gives \[ g'(1)=\trace(\rho\log\rho+\sigma\log\sigma) -\trace\bigl((\rho+\sigma)\log(\rho+\sigma)\bigr)=2\qjsd(\rho,\sigma)-2\log2, \] so $(\log f)'(1)=\log g(1)+g'(1)/g(1)=\qjsd(\rho,\sigma)$ and $f'(1)=2\qjsd(\rho,\sigma)$. Since $d_\alpha/(2(1-\alpha))^{1/2}$ is a metric for $1/2\le\alpha<1$ by Theorem~\ref{thm:tsallis}, its pointwise limit $\qjsd^{1/2}$ satisfies the triangle inequality, and strict convexity of $X\mapsto\trace X\log X$ makes it separate states. \end{proof} \section{Quantum Jensen--Tsallis and Jensen--R\'enyi divergences}\label{sec:jensen} We apply Theorem~\ref{thm:four} to entropy-based Jensen divergences. For $\rho,\sigma\in\Dc_d$ and $m=(\rho+\sigma)/2$, let \begin{equation}\label{eq:jensen-tsallis} \qjsd_q(\rho,\sigma) :=\frac{\trace m^q-\tfrac12\trace\rho^q-\tfrac12\trace\sigma^q}{1-q} \qquad(00$, Theorem~\ref{thm:four} proves four-point negative type for $\qjsd_q$. At $q=2$ the same conclusion follows from $\qjsd_2(\rho,\sigma)=\tfrac14\pnorm{\rho-\sigma}{2}^2$. For the R\'enyi case, we apply the logarithmic argument of \citet[Theorem~6.3]{sra2021metrics} to four states. Fix $00$, and rescaling rows and columns by $e^{-sh_{ii}/2}$ gives $[e^{-sh_{ij}}]\succeq0$. For any $\xi\in\reals^4$ with $\sum_i\xi_i=0$, the identity $\log r=\int_0^\infty(e^{-s}-e^{-sr})\dd s/s$ therefore gives \[ \sum_{i,j}\xi_i\xi_j\log h_{ij} =-\int_0^\infty\sum_{i,j}\xi_i\xi_j e^{-s h_{ij}}\,\frac{\dd s}{s} \le0. \] Since $(1-q)\qjrd_q(\rho_i,\rho_j)=\log h_{ij}-\frac12\log h_{ii}-\frac12\log h_{jj}$ and $\sum_i\xi_i=0$, this proves four-point negative type for $\qjrd_q$. For distinct states, $\delta_S^2(\rho+tI,\sigma+tI)>0$, so \eqref{eq:jensen-integral} gives $\qjsd_q(\rho,\sigma)>0$. For $0(h_{ii}+h_{jj})/2\ge\sqrt{h_{ii}h_{jj}}$, hence $\qjrd_q(\rho_i,\rho_j)>0$ when $\rho_i\ne\rho_j$. Schoenberg's criterion now gives the claimed Euclidean embeddings, so the square roots are metrics. \end{proof} \end{document}