Given the matrix 𝐴 is equal to one, negative 16, five, two, negative four, negative three, negative one, seven, four, what is the greatest number 𝑘 for which no entry of 𝑘 times 𝐴 is greater than one?
In this question, we’re given a matrix 𝐴. And we need to determine the greatest number 𝑘 for which no entry of 𝑘 multiplied by 𝐴 is greater than one. There’s a lot to this question, so we’ll break it down. First, we need to know what we mean by 𝑘 multiplied by 𝐴. Remember, 𝑘 is a number and 𝐴 is a matrix, so 𝑘 multiplied by 𝐴 is a scalar multiplied by a matrix. This is scalar multiplication of a matrix. So we need to recall how we do scalar multiplication of a matrix. This means we need to multiply every single entry of our matrix 𝐴 by our scalar 𝑘. So let’s start by finding the expression for 𝑘 multiplied by 𝐴. We need to multiply every entry of 𝐴 by 𝑘.
In matrix 𝐴, in row one column one, the entry is one. So in our matrix 𝑘 multiplied by 𝐴, we need to multiply this value of one by 𝑘. And in row one column two of matrix 𝐴, we have the value of negative 16. So in row one column two of our matrix 𝑘 times 𝐴, we need to multiply this value of negative 16 by 𝑘. And we can carry on this process for the rest of the entries of our matrix. We get the following three-by-three matrix which represents 𝑘 multiplied by 𝐴. All we did is multiply every single entry inside of 𝐴 by our scalar 𝑘.
And of course we can simplify this. All we’ll do is simplify every single entry inside of our matrix. We get the following three-by-three matrix. Now, remember, the question is asking us to find the greatest number 𝑘 such that no entry of this matrix is greater than one. In other words, we need to find the largest value of 𝑘 such that no entry inside of this three-by-three matrix is bigger than one. This means by looking at each entry individually, we could form a system of inequalities. The entry in row one and column one of our matrix is 𝑘. And remember, the question wants us to have no entry of 𝑘 times 𝐴 to be bigger than one. So this entry 𝑘 must be less than or equal to one.
We can form a similar inequality by looking at the entry in row one column two. This entry is negative 16𝑘. And since it’s not allowed to be bigger than one, it must be less than or equal to one. And by using exactly the same method, we can find seven more inequalities by looking at the other seven entries of our matrix. This gives us the following nine inequalities. All of these inequalities must be true to make no entry of 𝑘 times 𝐴 bigger than one. Solving a system of inequalities is very similar to solving a system of equations.
However, we do need to be careful. Remember, if we divide or multiply both sides of an inequality by a negative number, we need to switch the sign of our inequality. And this can make it quite tricky dealing with inequalities. There’s a few different ways we could solve this. We’ll only go through one of these. Remember, the question wants us to find the greatest number 𝑘 such that this is true. So we’ll start by assuming that 𝑘 is positive. If we find a positive solution for 𝑘, we don’t even need to check for negative solutions of 𝑘 because they’ll be smaller. And we’re any interested in the biggest one.
And this is actually very useful because a negative number multiplied by a positive number is negative. So it’s always going to be less than or equal to one. So all of our inequalities that have a negative coefficient of 𝑘 must be true. Negative 16𝑘 is negative, negative four 𝑘 is negative, negative three 𝑘 is negative, and negative 𝑘 is negative. So they’re all less than or equal to one. So if 𝑘 is positive, these four inequalities are already true. We just need to make the remaining five inequalities true.
There’s several different ways to do this. The easiest way is to rearrange each inequality for 𝑘. For example, our first inequality is already in terms of 𝑘. We have 𝑘 is less than or equal to one. We can change our third inequality by dividing both sides of the inequality through by five. Doing this, we get that 𝑘 must be less than or equal to one-fifth. And we can do exactly the same thing for our other three positive coefficient inequalities. We just divide through by the coefficient. We get 𝑘 is less than or equal to one-half, 𝑘 is less than or equal to one-seventh, and 𝑘 is less than or equal to one-quarter. And don’t forget our first inequality, 𝑘 must be less than or equal to one.
We need all of these inequalities to be true for our value of 𝑘. But all this is telling us is 𝑘 needs to be positive and 𝑘 needs to be less than or equal to some list of values. For 𝑘 to be less than or equal to all of these values, all we need to do is make 𝑘 less than or equal to the smallest of these values. Of course, the smallest of these positive numbers is one over seven since we’re dividing by the biggest positive number. Therefore, if 𝑘 is less than or equal to one over seven, then we can conclude 𝑘 is less than or equal to one. It’s also less than or equal to one-fifth and one-half and one-quarter because one over seven is smaller than all of these.
But in fact, this is enough to answer our question. We know if 𝑘 is positive, then 𝑘 must also be less than or equal to one-seventh. We want to know the biggest of these values. That will be when 𝑘 is equal to one-seventh. Therefore, we found our answer will be one-seventh. It is worth pointing out again though these are not the only values of 𝑘 which will solve our equation since we assume that 𝑘 will be positive. There are also nonpositive values of 𝑘 which also have this property. For example, 𝑘 is equal to zero also has this property, but we only wanted the largest value of 𝑘 and all of these will be smaller.
Therefore, given the three-by-three matrix 𝐴, we were able to show the greatest number 𝑘 for which no entry of 𝑘𝐴 is greater than one was given by one-seventh.