Ky Fan majorization for binary tensor products

• URL: http://arxiv.org/abs/2607.27116v1
• Date: Wed, 29 Jul 2026 16:45:26 GMT
• Title: Ky Fan majorization for binary tensor products
• Abstract summary: This generalizes Alhejji's result (arXiv:2410.18254) from two summands to arbitrary sums.<n>We show a majorization relation between the singular values of a completely positive map and those of its Kraus operators.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We provide a short proof of a Ky Fan-type majorization relation for the singular values of a sum of binary tensor products of matrices. This generalizes Alhejji's result (arXiv:2410.18254) from two summands to arbitrary sums and from positive matrices to arbitrary matrices. As an application, we show a majorization relation between the singular values of a completely positive map and those of its Kraus operators.

Related papers

• Poset-refined majorization relations [45.88028371034407]
  Several classical majorization relations for sums or products of matrices involve a majorizing vector of perfectly aligned eigenvalues or singular values.<n>We show that the majorization can be strengthened, provided the change-of-basis matrices admit an LU-approximation with respect to this partial order.<n>In this way, we obtain refined versions of Ky Fan's majorization relations, Horn's log-majorization relation, and von Neumann's trace inequality.
  arXiv  Detail & Related papers  (2026-07-30T11:40:14Z)
• A majorization relation for a sum of two tensor products of positive semidefinite operators [0.42970700836450476]
  We prove a separable version of Ky Fan's majorization relation for a sum of two operators that are each a tensor product of $n$ positive semidefinite operators.<n>We show that such a relation does not hold in general for sums of three or more tensor products of three or more positive semidefinite operators.
  arXiv  Detail & Related papers  (2026-07-08T20:54:05Z)
• Partial trace relations beyond normal matrices [0.0]
  We find that every pair of matrices of equal size and trace admits dilations of any rank larger than one.<n>We extend the interval of Werner states in which they are provably 2-undistillable in any dimension.
  arXiv  Detail & Related papers  (2025-07-24T10:27:20Z)
• Higher-Order Singular-Value Derivatives of Rectangular Real Matrices [1.5484595752241122]
  We present a theoretical framework for deriving the general $n$-th order Fr'echet derivatives of singular values in real rectangular matrices.<n>We leverage reduced resolvent operators from Kato's perturbation analytic theory for self-adjoint operators.<n>Our framework equips researchers with a practical toolkit for higher-order spectral sensitivity studies in random matrix applications.
  arXiv  Detail & Related papers  (2025-06-04T09:28:35Z)
• Refining Ky Fan's majorization relation with linear programming [1.6317061277457001]
  A separable version of Ky Fan's majorization relation is proven for a sum of two operators that are each a tensor product of two positive semi-definite operators.<n>The spin alignment conjecture in quantum information theory is affirmatively resolved to the 2-letter level.
  arXiv  Detail & Related papers  (2024-10-23T20:02:46Z)
• Entrywise error bounds for low-rank approximations of kernel matrices [55.524284152242096]
  We derive entrywise error bounds for low-rank approximations of kernel matrices obtained using the truncated eigen-decomposition. A key technical innovation is a delocalisation result for the eigenvectors of the kernel matrix corresponding to small eigenvalues. We validate our theory with an empirical study of a collection of synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2024-05-23T12:26:25Z)
• When Random Tensors meet Random Matrices [50.568841545067144]
  This paper studies asymmetric order-$d$ spiked tensor models with Gaussian noise. We show that the analysis of the considered model boils down to the analysis of an equivalent spiked symmetric textitblock-wise random matrix.
  arXiv  Detail & Related papers  (2021-12-23T04:05:01Z)
• Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priors [54.936314353063494]
  We provide recovery guarantees for a correlation-based optimization algorithm for robust 1-bit compressive sensing. We make use of a practical iterative algorithm, and perform numerical experiments on image datasets to corroborate our results.
  arXiv  Detail & Related papers  (2021-08-08T05:28:06Z)
• Adversarially-Trained Nonnegative Matrix Factorization [77.34726150561087]
  We consider an adversarially-trained version of the nonnegative matrix factorization. In our formulation, an attacker adds an arbitrary matrix of bounded norm to the given data matrix. We design efficient algorithms inspired by adversarial training to optimize for dictionary and coefficient matrices.
  arXiv  Detail & Related papers  (2021-04-10T13:13:17Z)
• Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion [101.83262280224729]
  We develop a relative error bound for nuclear norm regularized matrix completion. We derive a relative upper bound for recovering the best low-rank approximation of the unknown matrix.
  arXiv  Detail & Related papers  (2015-04-26T13:12:16Z)

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.