An Order Relation between Eigenvalues and Symplectic Eigenvalues of a Class of Infinite-Dimensional Operators

• URL: http://arxiv.org/abs/2212.03900v3
• Date: Sat, 29 Jun 2024 19:24:36 GMT
• Title: An Order Relation between Eigenvalues and Symplectic Eigenvalues of a Class of Infinite-Dimensional Operators
• Authors: Tiju Cherian John, V. B. Kiran Kumar, Anmary Tonny,
• Abstract summary: We prove an inequality between the eigenvalues and symplectic eigenvalues of a special class of infinite dimensional operators. The only possible accumulation point for the symplectic eigenvalues is $alpha$.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this article, we obtain some results in the direction of ``infinite dimensional symplectic spectral theory". We prove an inequality between the eigenvalues and symplectic eigenvalues of a special class of infinite dimensional operators. Let $T$ be an operator such that $T - \alpha I$ is compact for some $\alpha > 0$. Denote by $\{{\lambda_j^R}^\downarrow(T)\}$, the set of eigenvalues of $T$ lying strictly to the right side of $\alpha$ arranged in the decreasing order and let $\{{\lambda_j^L}^\uparrow(T)\}$ denote the set of eigenvalues of $T$ lying strictly to the left side of $\alpha$ arranged in the increasing order. Furthermore, let $\{{d_j^R}^\downarrow(T)\}$ denote the symplectic eigenvalues of $T$ lying strictly to the right of $\alpha$ arranged in decreasing order and $\{{d_j^L}^\uparrow(T)\}$ denote the set of symplectic eigenvalues of $T$ lying strictly to the left of $\alpha$ arranged in increasing order, respectively (such an arrangement is possible as it will be shown that the only possible accumulation point for the symplectic eigenvalues is $\alpha$). Then we show that $${d_j^R}^\downarrow(T) \leq {\lambda_j^R}^\downarrow(T), \quad j = 1,2, \cdots, s_r$$ and $${\lambda_j^L}^\uparrow(T) \leq {d_j^L}^\uparrow(T), \quad j = 1,2, \cdots, s_l,$$ where $s_r$ and $s_l$ denote the number of symplectic eigenvalues of $T$ strictly to the right and left of $\alpha$, respectively. This generalizes a finite dimensional result obtained by Bhatia and Jain (J. Math. Phys. 56, 112201 (2015)). The class of Gaussian Covariance Operators (GCO) and positive Absolutely Norm attaining Operators ($(\mathcal{A}\mathcal{N})_+$ operators) appear as special cases of the set of operators we consider.

Related papers

• Limit formulas for norms of tensor power operators [49.1574468325115]
  Given an operator $phi:Xrightarrow Y$ between Banach spaces, we consider its tensor powers. We show that after taking the $k$th root, the operator norm of $phiotimes k$ converges to the $2$-dominated norm.
  arXiv  Detail & Related papers  (2024-10-30T14:39:21Z)
• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• Approximating the eigenvalues of self-adjoint trace-class operators [0.0]
  We define a set $Lambda_nsubset mathbbR$ for each self-adjoint, trace-class operator $O$. We show that it converges to the spectrum of $O$ in the Hausdorff metric under mild conditions.
  arXiv  Detail & Related papers  (2024-07-05T12:56:20Z)
• Block perturbation of symplectic matrices in Williamson's theorem [0.0]
  We show that any symplectic matrix $tildeS$ diagonalizing $A+H$ in Williamson's theorem is of the form $tildeS=S Q+mathcalO(|H|)$. Our results hold even if $A$ has repeated symplectic eigenvalues.
  arXiv  Detail & Related papers  (2023-07-03T14:56:19Z)
• Krylov Methods are (nearly) Optimal for Low-Rank Approximation [8.017116107657206]
  We show that any algorithm requires $Omegaleft(log(n)/varepsilon1/2right)$ matrix-vector products, exactly matching the upper bound obtained by Krylov methods. Our lower bound addresses Open Question 1WooWoo14, providing evidence for the lack of progress on algorithms for Spectral LRA.
  arXiv  Detail & Related papers  (2023-04-06T16:15:19Z)
• Optimal Query Complexities for Dynamic Trace Estimation [59.032228008383484]
  We consider the problem of minimizing the number of matrix-vector queries needed for accurate trace estimation in the dynamic setting where our underlying matrix is changing slowly. We provide a novel binary tree summation procedure that simultaneously estimates all $m$ traces up to $epsilon$ error with $delta$ failure probability. Our lower bounds (1) give the first tight bounds for Hutchinson's estimator in the matrix-vector product model with Frobenius norm error even in the static setting, and (2) are the first unconditional lower bounds for dynamic trace estimation.
  arXiv  Detail & Related papers  (2022-09-30T04:15:44Z)
• Low-Rank Approximation with $1/\epsilon^{1/3}$ Matrix-Vector Products [58.05771390012827]
  We study iterative methods based on Krylov subspaces for low-rank approximation under any Schatten-$p$ norm. Our main result is an algorithm that uses only $tildeO(k/sqrtepsilon)$ matrix-vector products.
  arXiv  Detail & Related papers  (2022-02-10T16:10:41Z)
• Spectral properties of sample covariance matrices arising from random matrices with independent non identically distributed columns [50.053491972003656]
  It was previously shown that the functionals $texttr(AR(z))$, for $R(z) = (frac1nXXT- zI_p)-1$ and $Ain mathcal M_p$ deterministic, have a standard deviation of order $O(|A|_* / sqrt n)$. Here, we show that $|mathbb E[R(z)] - tilde R(z)|_F
  arXiv  Detail & Related papers  (2021-09-06T14:21:43Z)
• The Average-Case Time Complexity of Certifying the Restricted Isometry Property [66.65353643599899]
  In compressed sensing, the restricted isometry property (RIP) on $M times N$ sensing matrices guarantees efficient reconstruction of sparse vectors. We investigate the exact average-case time complexity of certifying the RIP property for $Mtimes N$ matrices with i.i.d. $mathcalN(0,1/M)$ entries.
  arXiv  Detail & Related papers  (2020-05-22T16:55:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.