(I was asking a similar question before but maybeSorry, I do hate editing this ismany many times but let me try the best way to put it: last time)
Gelfand's formula says that
$$\lim_{k\rightarrow \infty} \|A^k\|^{1/k} = \rho(A)$$
I am wondering whether there exists constant $C$ such that foris any $n$way to make this non-asymptotic. for example, there existsI would like to have a square matrix $A$ of dimension $n\times n$ such that the spectral radiusset $\rho(A)$$S$ of $A$ is bounded away from 1 (say, $\rho(A) < 1-1/n$ or $\rho(A) < .99$), and in the meantime, there exists a $k\ge 0$ suchmatrices so that the operator norm offor any matrix $A^k$ is very big$A\in S$, say $\|A^k\|\ge n^{C}$.
Thanks to the comments such bad situation could happen. Although my point here is not really to solve a brain-teaser but to try$\|A^k\|$ goes to build0 with some constructive theory hereexponential rate. For example, my plan for rescuing the situation is as follows:
Could one assume additionally some matrix norm bound on $A$ so that this doesn't happen. That is(A candidate might be, whether there exists a matrix norm so that for any matrix with some matrix norm $\le poly(n)$$A$ with (with a fixed poly)$\rho(A) < 1/2$ and $\rho(A) < 1-\delta$$\|A\|\le T$, it is true that $\|A^k\|\le poly(n)$ for any $k$$\|A^k\| \le T^{100}(2/3)^k$. (Or slightly stronger,Although I would like to have $\|A^k\|\le poly(n) (1-\delta)^k$haven't thought through whether there is any trivial counterexample for this statement.
Thanks a lot! Any pointers/references would be most appreciated! )