Hello pricey customer to our community We will proffer you an answer to this query linear algebra – Recover approximate monotonicity of induced norms ,and the respond will breathe typical by way of documented info sources, We welcome you and proffer you fresh questions and solutions, Many customer are questioning in regards to the respond to this query.
linear algebra – Recover approximate monotonicity of induced norms
Let $A$ some sq. matrix with actual entries.
Take any norm $cdot$ in line with a vector norm.
Gelfand’s formulation tells us that $rho(A) = lim_{n rightarrow infty} A^n^{1/n}$.
Moreover, from [1], for a sequence of $(n_i)_{i in mathbb{N}}$ such that $n_i$ is divisible by $n_{i1}$, we too know that the sequence $A^{n_i}^{1/n_i}$ is monotone lowering and converges in direction of $rho(A)$. I’m thinking about what occurs when this divisibility property shouldn’t be verified.

If the matrix has nonnegative entries, it appears the common property holds: For integers $n$ and $m$ such that $m > n$, it’s the illustration that $A^m^{1/m} leq A^n^{1/n}$.

If the matrix can have constructive and unfavorable entries, this extra common statement doesn’t appear to carry. I’m attempting to grasp why it fails, how worse can the inequality turn out to be, and whether it is workable to regain an inequality as much as some duty of $A$: $A^m^{1/m} leq f(A)cdotA^n^{1/n}$.
Any references to 1., or pointers for judgement 2. would breathe mighty appreciated.
[1] Yamamoto, Tetsuro. “On the extreme values of the roots of matrices.” Journal of the Mathematical Society of Japan 19.2 (1967): 173178.we’ll proffer you the answer to linear algebra – Recover approximate monotonicity of induced norms query through our community which brings all of the solutions from a number of dependable sources.
Add comment