An official website of the United States government
The success of matrix factorizations such as the singular value decomposition (SVD)has motivated the search for even more factorizations. We catalog 53 matrix factorizations, most ofwhich we believe to be new. Our systematic approach, inspired by the generalized Cartan decom-position of the Lie theory, also encompasses known factorizations such as the SVD, the symmetriceigendecomposition, the CS decomposition, the hyperbolic SVD, structured SVDs, the Takagi factor-ization, and others thereby covering familiar matrix factorizations, as well as ones that were waitingto be discovered. We suggest that the Lie theory has one way or another been lurking hidden in thefoundations of the very successful field of matrix computations with applications routinely used in somany areas of computation. In this paper, we investigate consequences of the Cartan decompositionand the little known generalized Cartan decomposition for matrix factorizations. We believe thatthese factorizations once properly identified can lead to further work on algorithmic computationsand applications.
more »
« less
On the Cartan decomposition for classical random matrix ensembles
We complete Dyson’s dream by cementing the links between symmetric spaces and classical random matrix ensembles. Previous work has focused on a one-to-one correspondence between symmetric spaces and many but not all of the classical random matrix ensembles. This work shows that we can completely capture all of the classical random matrix ensembles from Cartan’s symmetric spaces through the use of alternative coordinate systems. In the end, we have to let go of the notion of a one-to-one correspondence. We emphasize that the KAK decomposition traditionally favored by mathematicians is merely one coordinate system on the symmetric space, albeit a beautiful one. However, other matrix factorizations, especially the generalized singular value decomposition from numerical linear algebra, reveal themselves to be perfectly valid coordinate systems that one symmetric space can lead to many classical random matrix theories. We establish the connection between this numerical linear algebra viewpoint and the theory of generalized Cartan decompositions. This, in turn, allows us to produce yet more random matrix theories from a single symmetric space. Yet, again, these random matrix theories arise from matrix factorizations, though ones that we are not aware have appeared in the literature.
more »
« less
- PAR ID:
- 10387787
- Date Published:
- Journal Name:
- Journal of Mathematical Physics
- Volume:
- 63
- Issue:
- 6
- ISSN:
- 0022-2488
- Page Range / eLocation ID:
- 061705
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Various coordinate rings of varieties appearing in the theory of Poisson Lie groups and Poisson homogeneous spaces belong to the large, axiomatically defined class of symmetric Poisson nilpotent algebras, e.g. coordinate rings of Schubert cells for symmetrizable Kac–Moody groups, affine charts of Bott-Samelson varieties, coordinate rings of double Bruhat cells (in the last case after a localization). We prove that every symmetric Poisson nilpotent algebra satisfying a mild condition on certain scalars is canonically isomorphic to a cluster algebra which coincides with the corresponding upper cluster algebra, without additional localizations by frozen variables. The constructed cluster structure is compatible with the Poisson structure in the sense of Gekhtman, Shapiro and Vainshtein. All Poisson nilpotent algebras are proved to be equivariant Poisson Unique Factorization Domains. Their seeds are constructed from sequences of Poisson-prime elements for chains of Poisson UFDs; mutation matrices are effectively determined from linear systems in terms of the underlying Poisson structure. Uniqueness, existence, mutation, and other properties are established for these sequences of Poisson-prime elements.more » « less
-
A trace inequality for Euclidean gravitational path integrals (and a new positive action conjecture)A<sc>bstract</sc> The AdS/CFT correspondence states that certain conformal field theories are equivalent to string theories in a higher-dimensional anti-de Sitter space. One aspect of the correspondence is an equivalence of density matrices or, if one ignores normalizations, of positive operators. On the CFT side of the correspondence, any two positive operatorsA, Bwill satisfy the trace inequality Tr(AB) ≤ Tr(A)Tr(B). This relation holds on any Hilbert space$$ \mathcal{H} $$ and is deeply associated with the fact that the algebraB($$ \mathcal{H} $$ ) of bounded operators on$$ \mathcal{H} $$ is a type I von Neumann factor. Holographic bulk theories must thus satisfy a corresponding condition, which we investigate below. In particular, we argue that the Euclidean gravitational path integral respects this inequality at all orders in the semi-classical expansion and with arbitrary higher-derivative corrections. The argument relies on a conjectured property of the classical gravitational action, which in particular implies a positive action conjecture for quantum gravity wavefunctions. We prove this conjecture for Jackiw-Teitelboim gravity and we also motivate it for more general theories.more » « less
-
Abstract Generalized cross-validation (GCV) is a widely used method for estimating the squared out-of-sample prediction risk that employs scalar degrees of freedom adjustment (in a multiplicative sense) to the squared training error. In this paper, we examine the consistency of GCV for estimating the prediction risk of arbitrary ensembles of penalized least-squares estimators. We show that GCV is inconsistent for any finite ensemble of size greater than one. Towards repairing this shortcoming, we identify a correction that involves an additional scalar correction (in an additive sense) based on degrees of freedom adjusted training errors from each ensemble component. The proposed estimator (termed CGCV) maintains the computational advantages of GCV and requires neither sample splitting, model refitting, or out-of-bag risk estimation. The estimator stems from a finer inspection of the ensemble risk decomposition and two intermediate risk estimators for the components in this decomposition. We provide a non-asymptotic analysis of the CGCV and the two intermediate risk estimators for ensembles of convex penalized estimators under Gaussian features and a linear response model. Furthermore, in the special case of ridge regression, we extend the analysis to general feature and response distributions using random matrix theory, which establishes model-free uniform consistency of CGCV.more » « less
-
Abstract A linear principal minor polynomial or lpm polynomial is a linear combination of principal minors of a symmetric matrix. By restricting to the diagonal, lpm polynomials are in bijection with multiaffine polynomials. We show that this establishes a one-to-one correspondence between homogeneous multiaffine stable polynomials and PSD-stable lpm polynomials. This yields new construction techniques for hyperbolic polynomials and allows us to find an explicit degree 3 hyperbolic polynomial in six variables some of whose Rayleigh differences are not sums of squares. We further generalize the well-known Fisher–Hadamard and Koteljanskii inequalities from determinants to PSD-stable lpm polynomials. We investigate the relationship between the associated hyperbolicity cones and conjecture a relationship between the eigenvalues of a symmetric matrix and the values of certain lpm polynomials evaluated at that matrix. We refer to this relationship as spectral containment.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1063/5.0087010
