Non-commutative Entries Research Articles

An asymptotic property of large matrices with identically distributed Boolean independent entries

Motivated by the recent work on asymptotic independence relations for random matrices with non-commutative entries, we investigate the limit distribution and independence relations for large matrices with identically distributed and Boolean independent entries. More precisely, we show that, under some moment conditions, such random matrices are asymptotically [Formula: see text]-diagonal and Boolean independent from each other. This paper also gives a combinatorial condition under which such matrices are asymptotically Boolean independent from the matrix obtained by permuting the entries (thus extending a recent result in Boolean probability). In particular, we show that the random matrices considered are asymptotically Boolean independent from some of their partial transposes. The main results of the paper are based on combinatorial techniques.

A combinatorial result on asymptotic independence relations for random matrices with non-commutative entries

The paper gives a general condition on permutations, condition under which a semicircular matrix is free independent, or asymptotically free independent from the semicircular matrix obtained by permuting its entries. In particular, it is shown that semicircular matrices are asymptotically free from their transposes, a result similar to the case of Gaussian random matrices. There is also an analysis of asymptotic second order relations between semicircular matrices and their transposes, with results not very similar to the commutative (i.e. Gaussian random matrices) framework. The paper also presents an application of the main results to the study of Gaussian random matrices and furthermore it is shown that the same condition as in the case of semicircular matrices gives Boolean independence, or asymptotic Boolean independence when applied to Bernoulli matrices.

Complex Hadamard matrices with noncommutative entries

We axiomatize and study the matrices of type $H\in M_N(A)$, having unitary entries, $H_{ij}\in U(A)$, and whose rows and columns are subject to orthogonality type conditions. Here $A$ can be any $C^*$-algebra, for instance $A=\mathbb C$, where we obtain the usual complex Hadamard matrices, or $A=C(X)$, where we obtain the continuous families of complex Hadamard matrices. Our formalism allows the construction of a quantum permutation group $G\subset S_N^+$, whose structure and computation is discussed here.

The Non-Commutative A 1 T-System and its Positive Laurent Property

We define a non-commutative version of the A 1 T-system, which underlies frieze patterns of the integer plane. This system has discrete conserved quantities and has a particular reduction to the known non-commutative Q-system for A 1. We solve the system by generalizing the flat GL 2 connection method used in the commuting case to a 2 × 2 flat matrix connection with non-commutative entries. This allows us to prove the non-commutative positive Laurent phenomenon for the solutions when expressed in terms of admissible initial data. These are rephrased as partition functions of paths with non-commutative weights on networks, and alternatively of dimer configurations with non-commutative weights on ladder graphs made of chains of squares and hexagons.

Algebraic properties of Manin matrices II: q-analogues and integrable systems

We study a natural q-analogue of a class of matrices with non-commutative entries, which were first considered by Yu.I. Manin in 1988 in relation with quantum group theory, (called Manin matrices in [5]). We call these q-analogues q-Manin matrices. These matrices are defined, in the 2×2 case by the following relations among their matrix entries:M21M12=qM12M21,M22M12=qM12M22,[M11,M22]=q−1M21M12−qM12M21. They were already considered in the literature, especially in connection with the q-MacMahon master theorem [10], and the q-Sylvester identities [22]. The main aim of the present paper is to give a full list and detailed proofs of the algebraic properties of q-Manin matrices known up to the moment and, in particular, to show that most of the basic theorems of linear algebras (e.g., Jacobi ratio theorems, Schur complement, the Cayley–Hamilton theorem and so on and so forth) have a straightforward counterpart for such a class of matrices. We also show how q-Manin matrices fit within the theory of quasideterminants of Gelfand–Retakh and collaborators (see, e.g., [11]). We frame our definitions within the tensorial approach to non-commutative matrices of the Leningrad school in the last sections. We finally discuss how the notion of q-Manin matrix is related to theory of Quantum Integrable Systems.

Non-commutative large entries for cognitive radio applications

Cognitive radio has been proposed as a solution for the problem of underutilization of the radio spectrum. Indeed, measurements have shown that large portions of frequency bands are not efficiently assigned since large pieces of bandwidth are unused or only partially used. In the last decade, studies in different areas, such as signal processing, random matrix theory, information theory, game theory, etc., have brought us to the current state of cognitive radio research. These theoretical advancements represents a solid base for practical applications and even further developments. However, still open questions need to be answered. In this study, free probability theory, through the free deconvolution technique, is used to attack the huge problem of retrieving useful information from the network with a finite number of observations. Free deconvolution, based on the moments method, has shown to be a helpful approach to this problem. After giving the general idea of free deconvolution for known models, we show how the moments method works in the case where scalar random variables are considered. Since, in general, we have a situation where more complex systems are involved, the parameters of interest are no longer scalar random variables but random vectors and random matrices. Random matrices are non-commutative operators with respect to the matrix product and they can be considered elements of what is called non-commutative probability space. Therefore, we focus on the case where random matrices are considered. Concepts from combinatorics, such as crossing and non-crossing partitions are useful tools to express the moments of Gaussian and Vandermonde matrices, respectively. Our analysis and simulation results show that free deconvolution framework can be used for studying relevant information in cognitive radio such as power detection, users detection, etc.

Quantum monodromy matrices

The canonical quantization of the chiral Wess–Zumino–Novikov–Witten (WZNW) monodromy matrices, both the diagonal and the general one, requires additional numerical factors that can be attributed to renormalization. We discuss the field-theoretic and algebraic aspects of this phenomenon for the SU(n) WZNW model and show that these quantum renormalization factors are compatible with the natural definitions for the determinants of the involved matrices with non-commuting entries.

Compound Real Wishart and q-Wishart Matrices

We introduce a family of matrices with noncommutative entries that generalize the classical real Wishart matrices. With the help of the Brauer product, we derive a nonasymptotic expression for the moments of traces of monomials in such matrices; the expression is quite similar to the formula derived in [9, Theorem 2.1; Asymptotic normality for traces of polynomials in independent complex Wishart matrices; Probability Theory and Related fields, 140, 2008] for independent complex Wishart matrices.We then analyze the fluctuations about the Marchenko-Pastur law. We show that after centering by the mean, traces of real symmetric polynomials in q-Wishart matrices converge in distribution, and we identify the asymptotic law as the normal law when q = 1, and as the semicircle law when q = 0.

Algebraic properties of Manin matrices 1

We study a class of matrices with noncommutative entries, which were first considered by Yu.I. Manin in 1988 in relation with quantum group theory. They are defined as “noncommutative endomorphisms” of a polynomial algebra. More explicitly their defining conditions read: (1) elements in the same column commute; (2) commutators of the cross terms are equal: [ M i j , M k l ] = [ M k j , M i l ] (e.g. [ M 11 , M 22 ] = [ M 21 , M 12 ] ). The basic claim is that despite noncommutativity many theorems of linear algebra hold true for Manin matrices in a form identical to that of the commutative case. Moreover in some examples the converse is also true, that is, Manin matrices are the most general class of matrices such that linear algebra holds true for them. The present paper gives a complete list and detailed proofs of algebraic properties of Manin matrices known up to the moment; many of them are new. In particular we provide complete proofs that an inverse to a Manin matrix is again a Manin matrix and for the Schur formula for the determinant of a block matrix; we generalize the noncommutative Cauchy–Binet formulas discovered recently arXiv:0809.3516, which includes the classical Capelli and related identities. We also discuss many other properties, such as the Cramer formula for the inverse matrix, the Cayley–Hamilton theorem, Newton and MacMahon–Wronski identities, Plücker relations, Sylvester's theorem, the Lagrange–Desnanot–Lewis Carroll formula, the Weinstein–Aronszajn formula, some multiplicativity properties for the determinant, relations with quasideterminants, calculation of the determinant via Gauss decomposition, conjugation to the second normal (Frobenius) form, and so on and so forth. Finally several examples and open question are discussed. We refer to [A. Chervov, G. Falqui, Manin matrices and Talalaev's formula, J. Phys. A 41 (2008) 194006; V. Rubtsov, A. Silantiev, D. Talalaev, Manin matrices, elliptic commuting families and characteristic polynomial of quantum gl n elliptic Gaudin model, in press] for some applications in the realm of quantum integrable systems.

Representations of Lie groups and random matrices

We study the asymptotics of representations of a fixed compact Lie group. We prove that the limit behavior of a sequence of such representations can be described in terms of certain random matrices; in particular operations on representations (for example: tensor product, restriction to a subgroup) correspond to some natural operations on random matrices (respectively: sum of independent random matrices, taking the corners of a random matrix). Our method of proof is to treat the canonical block matrix associated to a representation as a random matrix with non-commutative entries.

On the Proof of the Capelli Identities

Using exterior calculus, we present detailed proofs of the classical Capelli identities in a purely computational manner. The proof of the fact that the Capelli elements are central is also given in a similar way. In the course of proofs of these two facts, one can easily see the mechanism of the multiplication formula of determinant with non-commutative entries. Simple treatments of the related facts from the Appendix of [HU] are also given.

Noncommutative spectral decomposition with quasideterminant

We develop a noncommutative analogue of the spectral decomposition with the quasideterminant defined by I. Gelfand and V. Retakh. In this theory, by introducing a noncommutative Lagrange interpolating polynomial and combining a noncommutative Cayley–Hamilton's theorem and an identity given by a Vandermonde-like quasideterminant, we can systematically calculate a function of a matrix even if it has noncommutative entries. As examples, the noncommutative spectral decomposition and the exponential matrices of a quaternionic matrix and of a matrix with entries being harmonic oscillators are given.

Matrix Inequalities: A Symbolic Procedure to Determine Convexity Automatically

This paper presents a theory of noncommutative functions which results in an algorithm for determining where they are “matrix convex”. Of independent interest is a theory of noncommutative quadratic functions and the resulting algorithm which calculates the region where they are “matrix positive”. This is accomplished via a theorem (a type of Positivstellensatz) on writing noncommutative quadratic functions with noncommutative rational coefficients as a weighted sum of squares. Furthermore the paper gives an LDU algorithm for matrices with noncommutative entries and conditions guaranteeing that the decomposition is successful.

Quantum matrix algebra for theSU(n) WZNW model

The zero modes of the chiral SU(n) WZNW model give rise to an intertwining quantum matrix algebra A generated by an n x n matrix a=(a^i_\alpha) (with noncommuting entries) and by rational functions of n commuting elements q^{p_i}. We study a generalization of the Fock space (F) representation of A for generic q (q not a root of unity) and demonstrate that it gives rise to a model of the quantum universal enveloping algebra U_q(sl_n), each irreducible representation entering F with multiplicity 1. For an integer level k the complex parameter q is an even root of unity, q^h=-1 (h=k+n) and the algebra A has an ideal I_h such that the factor algebra A_h = A/I_h is finite dimensional.

Triple Massey Products on Curves, Fay's Trisecant Identity and Tangents to the Canonical Embedding

We show that Fay's trisecant identity follows from the A_{infinity}-constraint between certain triple Massey products in the derived category of coherent sheaves on a curve. We also deduce the matrix analogue of this identity that can be conveniently formulated using quasideterminants of matrices with non-commuting entries. On the other hand, looking at more special triple Massey products we derive a formula for the tangent line to a canonically embedded curve at a given point.

Quantum Matrix Pairs

The notion of quantum matrix pairs is defined. These are pairs of matrices with noncommuting entries, which have the same pattern of internal relations, q-commute with each other under matrix multiplication, and are such that products of powers of the matrices obey the same pattern of internal relations as the original pair. Such matrices appear in an approach by the authors to quantizing gravity in 2 space and 1 time dimensions with negative cosmological constant on the torus. Explicit examples and transformations which generate new pairs from a given pair are presented.

A non-commutative version of Jacobi's equality on the cofactors of a matrix

We give a combinatorial proof of Jacobi's equality relating a cofactor of a matrix with the complementary cofactor of its inverse. This result unifies two previous approaches of the combinatorial interpretation of determinants: generating functions of weighted permutations and generating functions of families (configurations) of non-crossing paths. We show that Jacobi's equality is valid with the same choice of non-commutative entries as in Foata's proof of matrix inversion by cofactors.

Cyclic monodromy matrices forsl(n) trigonometricR-matrices

The algebra of monodromy matrices for sl(n) trigonometric R-matrices is studied. It is shown that a generic finite-dimensional polynomial irreducible representation of this algebra is equivalent to a tensor product of L-operators. Cocommutativity of representations is discussed. A special class of representations - factorizable representations is introduced and intertwiners for cocommuting factorizable representations are written through the Boltzmann weights of the sl(n) chiral Potts model. Let us consider an algebra generated by noncommutative entries of the matrix $T(u)$ satisfying the famous bilinear relation originated from the quantum inverse scattering method: $R(\la-\mu)T(\la)T(\mu)=T(\mu)T(\la) R(\la-\mu)$ where $R(\la)$ is R-matrix. For historical reasons this algebra is called the algebra of monodromy matrices. If $\g$ is a simple finite-dimensional Lie algebra and $R(\la)$ is $\g$-invariant R-matrix the algebra of monodromy matrices after a proper specialization gives the Yangian $Y(\g)$ introduced by Drinfeld. If $R(\la)$ is corresponding trigonometric R-matrix this algebra is closely connected with $U_q(\g)$ and $U_q(\hat\g)$ at zero level. If $R(\la)$ is $sl(2)$ elliptic R-matrix the algebra of monodromy matrices gives rise to Sklyanin's algebra. In this paper we shall study algebras of monodromy matrices for $sl(n)$ trigonometric R-matrices at roots of 1. Finite-dimensional cyclic irreducible polynomial representations and their intertwiners are discussed.

Properties of 2×2 quantum matrices inZ 2-graded spaces

We construct the quantum supergroupGL q(1/1) in its matrix representation. We investigate properties of powers of 2×2 quantum super-matrices and we show that any element ofGL q(1/1) can be written as the exponential of a matrix with non-commuting entries. An explicit construction of this exponential form is presented. Finally, we prove a relation between the quantum superdeterminant of a quantum matrix and the supertrace of the logarithm of the quantum matrix.

Permanents and determinants with generic noncommuting entries

This paper studies some basic combinatorial properties of matrix functions of generic matrices. A generic matrix is one with entries from a free associative algebra, over a field, and on a finite set of non-commuting variables (i.e. a tensor algebra). The principal tools are shuffle products. Generic column and row permanents are defined and analogs of the Laplace and Cauchy-Binet theorems are derived in terms of shuffles. In this setting, the generic permanents include as special cases all of the classical matrix functions: Schur matrix functions, determinants, and permanents. 1980 Mathematics Classification 05, 15. Keywords: Shuffle product, generic matrix functions, minor expansions, Laplace Expansion Theorem, Cauchy-Binet Theorem, permanents, determinants, tensor algebra, matrices with non-commuting entries.