Two questions about square matrices and linear combinations
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
Let $A$ be an invertible square matrix in $mathbbR^ntimes n$. Let $lambda$ be the unique eigenvalue of $A$ with the largest norm. Assume that we have two good properties, namely $lambda$ is real and positive and its eigenspace has dimension 1. Let $v$ be one of the unit eigenvectors.
We would like to examine whether both of the two properties are correct:
a) For any $1leq ileq n$ $e_i$ can be written as a linear combination of column vectors of column vectors of $A^k$ for positive $k$ and $v$ where all coefficients are nonnegative with the possible exception of the coefficient of $v$?
b) Does there exist a $k$ such that for all $l>k$ any column vector of $A^l$ can be written as a linear combination of column vectors of $A^i$ where $0leq ileq k$ and $v$ where all coefficients are nonnegative with the possible exception of the coefficient of $v$?
linear-algebra reference-request algorithms
add a comment |Â
up vote
1
down vote
favorite
Let $A$ be an invertible square matrix in $mathbbR^ntimes n$. Let $lambda$ be the unique eigenvalue of $A$ with the largest norm. Assume that we have two good properties, namely $lambda$ is real and positive and its eigenspace has dimension 1. Let $v$ be one of the unit eigenvectors.
We would like to examine whether both of the two properties are correct:
a) For any $1leq ileq n$ $e_i$ can be written as a linear combination of column vectors of column vectors of $A^k$ for positive $k$ and $v$ where all coefficients are nonnegative with the possible exception of the coefficient of $v$?
b) Does there exist a $k$ such that for all $l>k$ any column vector of $A^l$ can be written as a linear combination of column vectors of $A^i$ where $0leq ileq k$ and $v$ where all coefficients are nonnegative with the possible exception of the coefficient of $v$?
linear-algebra reference-request algorithms
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Let $A$ be an invertible square matrix in $mathbbR^ntimes n$. Let $lambda$ be the unique eigenvalue of $A$ with the largest norm. Assume that we have two good properties, namely $lambda$ is real and positive and its eigenspace has dimension 1. Let $v$ be one of the unit eigenvectors.
We would like to examine whether both of the two properties are correct:
a) For any $1leq ileq n$ $e_i$ can be written as a linear combination of column vectors of column vectors of $A^k$ for positive $k$ and $v$ where all coefficients are nonnegative with the possible exception of the coefficient of $v$?
b) Does there exist a $k$ such that for all $l>k$ any column vector of $A^l$ can be written as a linear combination of column vectors of $A^i$ where $0leq ileq k$ and $v$ where all coefficients are nonnegative with the possible exception of the coefficient of $v$?
linear-algebra reference-request algorithms
Let $A$ be an invertible square matrix in $mathbbR^ntimes n$. Let $lambda$ be the unique eigenvalue of $A$ with the largest norm. Assume that we have two good properties, namely $lambda$ is real and positive and its eigenspace has dimension 1. Let $v$ be one of the unit eigenvectors.
We would like to examine whether both of the two properties are correct:
a) For any $1leq ileq n$ $e_i$ can be written as a linear combination of column vectors of column vectors of $A^k$ for positive $k$ and $v$ where all coefficients are nonnegative with the possible exception of the coefficient of $v$?
b) Does there exist a $k$ such that for all $l>k$ any column vector of $A^l$ can be written as a linear combination of column vectors of $A^i$ where $0leq ileq k$ and $v$ where all coefficients are nonnegative with the possible exception of the coefficient of $v$?
linear-algebra reference-request algorithms
linear-algebra reference-request algorithms
asked Sep 10 at 19:31
Ying Zhou
464414
464414
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
0
down vote
Let
$$A=beginbmatrix 2 & 0 & 0 \ 0 & 1 & 1 \ 0 & 0 & 1 endbmatrix Rightarrow A^k=beginbmatrix 2^k & 0 & 0 \ 0 & 1 & k \ 0 & 0 & 1 endbmatrix$$
Then the largest eigenvalue of $A$ is 2 and its corresponding eigenspace has dimension 1.
a. One takes $nu=e_1$ and notes that $e_3$ cannot be written as a combination of the second and third columns of $A^k$ with nonnegative coefficients.
b. Let
$$B=beginbmatrix 2 & 0 & 0 \ 0 & 1 & -1 \ 0 & 0 & 1 endbmatrix Rightarrow A^k=beginbmatrix 2^k & 0 & 0 \ 0 & 1 & -k \ 0 & 0 & 1 endbmatrix$$
Again $B$ satisfies the required conditions. However, the third column of $A^l$ cannot be written as a combination of the second and third columns of $A^i$ for $i<l$.
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
Let
$$A=beginbmatrix 2 & 0 & 0 \ 0 & 1 & 1 \ 0 & 0 & 1 endbmatrix Rightarrow A^k=beginbmatrix 2^k & 0 & 0 \ 0 & 1 & k \ 0 & 0 & 1 endbmatrix$$
Then the largest eigenvalue of $A$ is 2 and its corresponding eigenspace has dimension 1.
a. One takes $nu=e_1$ and notes that $e_3$ cannot be written as a combination of the second and third columns of $A^k$ with nonnegative coefficients.
b. Let
$$B=beginbmatrix 2 & 0 & 0 \ 0 & 1 & -1 \ 0 & 0 & 1 endbmatrix Rightarrow A^k=beginbmatrix 2^k & 0 & 0 \ 0 & 1 & -k \ 0 & 0 & 1 endbmatrix$$
Again $B$ satisfies the required conditions. However, the third column of $A^l$ cannot be written as a combination of the second and third columns of $A^i$ for $i<l$.
add a comment |Â
up vote
0
down vote
Let
$$A=beginbmatrix 2 & 0 & 0 \ 0 & 1 & 1 \ 0 & 0 & 1 endbmatrix Rightarrow A^k=beginbmatrix 2^k & 0 & 0 \ 0 & 1 & k \ 0 & 0 & 1 endbmatrix$$
Then the largest eigenvalue of $A$ is 2 and its corresponding eigenspace has dimension 1.
a. One takes $nu=e_1$ and notes that $e_3$ cannot be written as a combination of the second and third columns of $A^k$ with nonnegative coefficients.
b. Let
$$B=beginbmatrix 2 & 0 & 0 \ 0 & 1 & -1 \ 0 & 0 & 1 endbmatrix Rightarrow A^k=beginbmatrix 2^k & 0 & 0 \ 0 & 1 & -k \ 0 & 0 & 1 endbmatrix$$
Again $B$ satisfies the required conditions. However, the third column of $A^l$ cannot be written as a combination of the second and third columns of $A^i$ for $i<l$.
add a comment |Â
up vote
0
down vote
up vote
0
down vote
Let
$$A=beginbmatrix 2 & 0 & 0 \ 0 & 1 & 1 \ 0 & 0 & 1 endbmatrix Rightarrow A^k=beginbmatrix 2^k & 0 & 0 \ 0 & 1 & k \ 0 & 0 & 1 endbmatrix$$
Then the largest eigenvalue of $A$ is 2 and its corresponding eigenspace has dimension 1.
a. One takes $nu=e_1$ and notes that $e_3$ cannot be written as a combination of the second and third columns of $A^k$ with nonnegative coefficients.
b. Let
$$B=beginbmatrix 2 & 0 & 0 \ 0 & 1 & -1 \ 0 & 0 & 1 endbmatrix Rightarrow A^k=beginbmatrix 2^k & 0 & 0 \ 0 & 1 & -k \ 0 & 0 & 1 endbmatrix$$
Again $B$ satisfies the required conditions. However, the third column of $A^l$ cannot be written as a combination of the second and third columns of $A^i$ for $i<l$.
Let
$$A=beginbmatrix 2 & 0 & 0 \ 0 & 1 & 1 \ 0 & 0 & 1 endbmatrix Rightarrow A^k=beginbmatrix 2^k & 0 & 0 \ 0 & 1 & k \ 0 & 0 & 1 endbmatrix$$
Then the largest eigenvalue of $A$ is 2 and its corresponding eigenspace has dimension 1.
a. One takes $nu=e_1$ and notes that $e_3$ cannot be written as a combination of the second and third columns of $A^k$ with nonnegative coefficients.
b. Let
$$B=beginbmatrix 2 & 0 & 0 \ 0 & 1 & -1 \ 0 & 0 & 1 endbmatrix Rightarrow A^k=beginbmatrix 2^k & 0 & 0 \ 0 & 1 & -k \ 0 & 0 & 1 endbmatrix$$
Again $B$ satisfies the required conditions. However, the third column of $A^l$ cannot be written as a combination of the second and third columns of $A^i$ for $i<l$.
answered Sep 11 at 1:31
Marco
1,85417
1,85417
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2912266%2ftwo-questions-about-square-matrices-and-linear-combinations%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password