SearcharxivSearch

arXiv · 2203.10841

Relating moments of self-adjoint polynomials in two orthogonal projections

Abstract

Given two orthogonal projections $\{P,Q\}$ in a non commutative tracial probability space, we prove relations between the moments of $P+Q$, of $\sqrt{-1}(PQ-QP)$ and of $P+QPQ$ and those of the angle operator $PQP$. Our proofs are purely algebraic and enumerative and does not assume $P,Q$ satisfying Voiculescu's freeness property or being in general position. As far as the sum and the commutator are concerned, the obtained relations follow from binomial-type formulas satisfied by the orthogonal symmetries associated to $P$ and $Q$ together with the trace property. In this respect, they extend those corresponding to the cases where one of the two projections is rotated by a free Haar unitary operator or more generally by a free unitary Brownian motion. As to the operator $P+QPQ$, we derive autonomous recurrence relations for the coefficients (double sequence) of the expansion of its moments as linear combinations of those of $PQP$ and determine explicitly few of them. These relations are obtained after a careful analysis of the structure of words in the alphabet $\{P, QPQ\}$. We close the paper by exploring the connection of our previous results to the so-called Kato's dual pair. Doing so leads to new identities satisfied by their moments.

Explore related subjects

Keep this discovery

BibTeXRIS

Nizar Demni, Tarek Hamdi. 2022-03-21. Relating moments of self-adjoint polynomials in two orthogonal projections. https://arxiv.org/abs/2203.10841

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR