Scott P. answered 10/02/21
Proof-based and computational linear algebra tutor
Yes, there is such a linear transformation. You could probably figure out the matrix for one by inspection but here's a more systematic way to do it.
Let {e1, e2, e3} be the standard ordered basis for R^3. Then the matrix A for the linear transformation L has columns L(e1), L(e2), and L(e3) and is given by A = [ L(e1) L(e2) L(e3)].
By expressing the product of A with (1, 1, 1) as a linear combination of the columns of A we get that L(e1) + L(e2) + L(e3) = (1, 0, 1).
Similarly, expressing A*(1, 0, -1) as a linear combination of the columns of A gives us the equation L(e1) - L(e3) = (1, 1, 2).
We now have a system of two equations in the three unknown column vectors.
Solving the second system equation for L(e1) gives us that L(e1) = (1, 1, 2) + L(e3). Substituting that into the first system equation and then solving for L(e2) gives us that L(e2) = (0, -1, -1) - 2L(e3).
We now have L(e1) and L(e2) solved for in terms of L(e3). Like a free variable you can let L(e3) be any column vector in R^3 you want. Hence, there are infinitely many such matrices for this linear transformation.
For example, let L(e3) = (0, 0, -1). Then L(e1) = (1, 1, 1) and L(e2) = (0, -1, 1). Using these column vectors as the column vectors for A gives us a matrix for L such that A*(1, 1, 1) = (1, 0, 1) and A*(1, 0, -1) = (1, 1, 2), as desired.