Proving Matrix A's Entries are Between 0 & 1

  • Thread starter Thread starter tom08
  • Start date Start date
  • Tags Tags
    Matrix
tom08
Messages
19
Reaction score
0

Homework Statement



Hi, everyone! I encounter a problem as follows:

I have got a matrix A, all the entries in A is between 0 and 1. and the sum of each row of A is 1.

Can we say that all the entries in Ak is also between 0 and 1 ?

Can everyone kindly show me how to prove it when answer is yes :-)
 
Physics news on Phys.org
Can you show that if a_i and b_i are lists of numbers (like rows or columns of a matrix) and sum(a_i)=1 then min(b_i)<=sum(a_i*b_i)<=max(b_i)?
 
tom08 said:

Homework Statement



Hi, everyone! I encounter a problem as follows:

I have got a matrix A, all the entries in A is between 0 and 1. and the sum of each row of A is 1.

Can we say that all the entries in Ak is also between 0 and 1 ?

Can everyone kindly show me how to prove it when answer is yes :-)

The answer is YES! To show how it happens, the only hint is that you start by setting two of each row-entries equal to 1/2 in a variety of ways where you will get the maximum numbers after taking the matrix to the power 2 and the larger the power is, the smaller components get. If you proved the theorem for 1/2, it would be obviously proven for 1/n.

AB
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top