ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m∈Nm\in\mathbb{N} and ai∈Mm(Z)a_i\in M_m(\mathbb{Z}) be given. Define the completely positive map

η:Mm(C)→Mm(C),b↦η(b):=∑i=1naibai∗.\eta:M_m(\mathbb{C})\to M_m(\mathbb{C}),\qquad b\mapsto \eta(b):=\sum_{i=1}^n a_i b a_i^*.

Assume that η\eta is rank non-decreasing. For nn independent GUE random matrices X1(N),…,Xn(N)X^{(N)}_1,\dots,X^{(N)}_n, let

AN=∑i=1nai⊗Xi(N)A_N=\sum_{i=1}^n a_i\otimes X^{(N)}_i

be the resulting Gaussian block random matrix of size mN×mNmN\times mN. Gaussian block determinant conjecture. The matrix ANA_N is invertible for sufficiently large NN, and

lim⁡N→∞Δ(AN)=cap⁡(η)12me−12,\lim_{N\to\infty}\Delta(A_N)=\operatorname{cap}(\eta)^{\frac{1}{2m}}e^{-\frac{1}{2}},

both in expectation and almost surely. This conjecture extends the determinantal property known for free-group generators and free semicircular operators to Gaussian block random matrices; the rank non-decreasing hypothesis is the condition under which the capacity expression is expected to govern the limiting Fuglede–Kadison determinant, while the asserted invertibility and convergence remain open in the stated generality.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.