ProbXiv
Explorersign in
Problem archiveProblem record

Statement

To state the conjectured generalizations of (3) and (4), we first introduce (what we conjecture is) the correct notion of stability, which is compatible with an appro- priate determinantal representation, via the following lemma. where \alpha = (\alpha1 , . . . , \alphad ) \in Nd is the usual multi-index notation and c\alpha (N ) is expressed in terms of binomial and multinomial coefficients as d 2 Y −1 N |\alpha| N (7) c\alpha (N ) = . |\alpha| \alpha1 , \alpha2 , . . . , \alphad j=1 \alphaj P P In particular, if |zj |2 ,|wj |2 < 1, then     Z Xd d X 1 (8) lim det 1 − zj Uj  det 1 − wj Uj∗  dU d = , N \to\infty U (N )d j=1 j=1 1 − hz, wi P where hz, wi = zj wj is the standard inner product on Cd . Lemma 9. Let p(x1 , . . . , xd ) be a polynomial in non-commuting indeterminates x1 , . . . , xd satisfying p(0) = 1. The following are equivalent: 1) det p(X1 , . . . , Xd ) 6= 0 for all n and all d-tuples X of n \times n matrices satisfying kXkrow \leq 1. 2) There exists a d-tuple of square matrices A1 , . . . , Ad of some size m \times m, with kAkrow < 1, such that for all n and all P d-tuples of n \times n square matrices X, we have det p(X) = det(Im ⊗ In − Aj ⊗ Xj ).

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.