Simple explanation:
Part 2.1
It is a (C.) Permuation because it is a rearrangement of the rows of x .
Part 2.2
\mathbf{A} \begin{bmatrix} x_0 \\ x_1 \\ x_2 \\ x_3\end{bmatrix} = \begin{bmatrix} x_2 \\ x_3 \\ x_1 \\ x_0\end{bmatrix}
\mathbf{A} must be made of 1βs and 0βs because the values of \mathbf{A}x are all the same.
Say \mathbf{A} = \begin{bmatrix} a_{00} & a_{01} & a_{02} & a_{03} \\ a_{10} & a_{11} & a_{12} & a_{13} \\ a_{20} & a_{21} & a_{22} & a_{23}\\ a_{30} & a_{31} & a_{32} & a_{33}\end{bmatrix},
Most people with a good understanding of matrix mutiplication would skip this next step.
then we can write \mathbf{A}x as \begin{bmatrix} a_{00}x_0 + a_{01}x_1 + a_{02}x_2 + a_{03}x_3\\ a_{10}x_0 + a_{11}x_1 + a_{12}x_2 + a_{13}x_3\\ a_{20}x_0 + a_{21}x_1 + a_{22}x_2 + a_{23}x_3\\ a_{30}x_0 + a_{31}x_1 + a_{32}x_2 + a_{33}x_3\end{bmatrix}
which is quite the mouthful! But now, because the top value of \mathbf{A}x is x_2, we know that a_{02} is 1, and all the other 1\text{st} row coefficients are 0βs.
So now, our matrix looks like this: \mathbf{A} = \begin{bmatrix} 0 & 0 & 1 & 0 \\ a_{10} & a_{11} & a_{12} & a_{13} \\ a_{20} & a_{21} & a_{22} & a_{23}\\ a_{30} & a_{31} & a_{32} & a_{33}\end{bmatrix},
Following the same steps for the next few rows, we get
\boxed{\mathbf{A} = \begin{bmatrix} 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \\ 0 &1 & 0 & 0\\ 1 & 0 & 0 & 0\end{bmatrix} }
(You could also trace each element directly to \mathbf{A} without needing to write it out, saving much time.)
Part 2.3
Letβs break down the problem: We want to multiply a column vector of length 4 by a row vector of length 4
This is (4,1) \times (1,4), so we will get a full (4,4) matrix out each time.
Because i ranges from 0 to 3, we have 4 matrices that we add together to get \mathbf{A}. Taking a closer look, the product of a 4 by 4 column times unit matrix looks like this:
\begin{bmatrix} c_0 \\ c_1 \\ c_2 \\ c_3 \end{bmatrix} \begin{bmatrix} r_0 & r_1 & r_2 & r_3 \end{bmatrix} = \begin{bmatrix} c_0 r_0 & c_0 r_1 & c_0 r_2 & c_0 r_3 \\ c_1 r_0 & c_1 r_1 & c_1 r_2 & c_1 r_3\\ c_2 r_0& c_2 r_1 & c_2 r_2 & c_2 r_3\\ c_3 r_0& c_3 r_1 & c_3 r_2 & c_3 r_3\end{bmatrix}
(Again, an experienced LA user would skip this part)
Now, \hat{e}^{(i)\top} dictates which column the 1 goes in. Because of the summation, when i=0, we must find f(0) such that the 1 goes where it would in the first column of \mathbf{A}.
Because the first column has itβs 1 at the very last index (0,3) this means f(0) = 3.
Repeating this process for increasing values of i (expanding the summation), the answer is \boxed{f(0) = 3, f(1) = 2, f(2) = 0, f(3) = 1}
