Answer:
False, they take form of a U shape
Answer:
Matrix multiplication is not conmutative
Step-by-step explanation:
The matrix multiplication can be performed if the number of columns of the first matrix is equal to the number of rows of the second matrix
Let A with dimension mxn and B with dimension nxp represent two matrix
The multiplication of A by B is a matrix C with dimension mxp, but the multiplication of B by A is can't be calculated because the number of columns of B is not the number of rows of A. Therefore, you can notice that is not conmutative in general.
But even if the multiplication of AB and BA is defined (For example if A and B are squared matrix of 2x2) the multiplication is not necessary conmutative.
The matrix multiplication result is a matrix which entries are given by dot product of the corresponding row of the first matrix and the corresponding column of the second matrix:
Notice that in general, the result is not the same. It could be the same for very specific values of the elements of each matrix.
9514 1404 393
Answer:
- (c1, c2, c3) = (-2t, 4t, t) . . . . for any value of t
- NOT linearly independent
Step-by-step explanation:
We want ...
c1·f1(x) +c2·f2(x) +c3·f3(x) = g(x) ≡ 0
Substituting for the fn function values, we have ...
c1·x +c2·x² +c3·(2x -4x²) ≡ 0
This resolves to two equations:
x(c1 +2c3) = 0
x²(c2 -4c3) = 0
These have an infinite set of solutions:
c1 = -2c3
c2 = 4c3
Then for any parameter t, including the "trivial" t=0, ...
(c1, c2, c3) = (-2t, 4t, t)
__
f1, f2, f3 are NOT linearly independent. (If they were, there would be only one solution making g(x) ≡ 0.)