5
$\begingroup$

$\newcommand{\eqqcolon}{=\mathrel{\vcenter{:}}}$ Fix $n, m \in \mathbb N$ with $n > m$. Let $\zeta \in \mathcal{M}(m \times n; \mathbb C)$ and we fix a $\zeta_0 \in \mathcal M( (n-m) \times n; \mathbb C)$ with rank $n-m$. Let us define a parameterization by \begin{align*} F : \zeta \mapsto \begin{pmatrix} \zeta \\ \zeta_0 \end{pmatrix} \eqqcolon A(\zeta). \end{align*} Let $S = \{ \zeta: \rho( A(\zeta) )<1\}$ where $\rho(\cdot)$ denotes the spectral radius and assume $S \neq \emptyset$. I am interested to know whether $S$ is connected?

$\endgroup$
4
  • $\begingroup$ What is $\rho$ in the definition of $S$? $\endgroup$ Commented Jun 6, 2018 at 10:51
  • $\begingroup$ It’s spetral radius of a matrix. $\endgroup$ Commented Jun 6, 2018 at 13:37
  • $\begingroup$ If I understood the question, If the right square block of $\zeta_0$ is up-tridiagonal and only $0$ are in the left bloc of $\zeta_0$ , then the only condition for $\zeta\in S$ is that the left square block has a spectral radius lower than $1$, so $S$ seams clearly connected in this particular case... Maybe we can try to bring the study of general case to this particular case. $\endgroup$
    – jcdornano
    Commented Jul 24, 2018 at 2:01
  • $\begingroup$ I put an answer on an equivalent question in MSE [here][math.stackexchange.com/questions/2804569/… $\endgroup$
    – Helmut
    Commented Dec 6, 2018 at 23:35

1 Answer 1

1
+100
$\begingroup$

As a test case, for $n=2, m=1$ one can see it is connected.

Consider a matrix $A=\left[\begin{array}{cc}a & b \\c & d\end{array}\right]$, and assume that $c, d$ are given so $\zeta_0=[c,d]$.

Case 1: $c=0$, and the spectral radius is $\max \{ |a|,|d|\}$, so clearly the set with $\rho(A) <1$ is connected.

Case 2: $c\neq 0$. Supppose we have matrices $A_0 = \left[\begin{array}{cc}a_0 & b_0 \\c & d\end{array}\right], A_1=\left[\begin{array}{cc}a_1 & b_1 \\c & d\end{array}\right]$ with $\rho(A_i)<1$. Then $tr(A)=a+d$, so $a=tr(A)-d$, and $det(A)=ad-bc$, so $b=((tr(A)-d)d-det(A))/c$. Thus each matrix in $im(F)$ is determined by its trace and determinant, and hence by its (generalized) eigenvalues. So if the eigenvalues of $A_i$ are $\lambda_i, \mu_i$, so $\rho(A_i)=\max\{|\lambda_i|,|\mu_i|\}<1$, we may connect the pair by a path $(\lambda_t,\mu_t)$ with $\max\{|\lambda_t|,|\mu_t|\}<1$, and hence get a unique path of matrices $A_t \in im(F)$ with $tr(A_t)=\lambda_t+\mu_t, det(A_t)= \lambda_t\mu_t$ according to the above formula with $\rho(A_t)<1, 0\leq t\leq 1$. Hence $S$ is connected.

More generally, the coefficients of the characteristic polynomial of $A(\zeta)$ is a linear function of the first row of $\zeta$. If this linear function is invertible, then one may first interpolate eigenvalues keeping the maximum absolute value $<1$, then interpolate the first rows of $\zeta$ to match the eigenvalues. Since invertible linear functions are generic, I would expect this strategy to work in general, but some case-by-case analysis will still be needed.

$\endgroup$
3
  • $\begingroup$ Thanks for taking time answering this question. It is very insightful. But since the general case is missing, I cannot acknowledge it as a full answer. $\endgroup$ Commented Jul 24, 2018 at 20:44
  • $\begingroup$ @user9527 I suggest reposting bounty for the general case. $\endgroup$ Commented Jul 24, 2018 at 22:15
  • $\begingroup$ @user9527 : I suspect for the general case, the hardest case will be when $m=n-1$. If $m<n-1$, I suspect my hint about the characteristic polynomial should lead to a solution easily. But I haven’t thought it through carefully. $\endgroup$
    – Ian Agol
    Commented Jul 25, 2018 at 0:24

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .