Linear Transformations and Matrices

A linear transformation must satisfy the properties of linearity: additivity and homogeneity. f(x) = 2x + 3 satisfies these properties, while the other options do not.

The matrix representation of a linear transformation is a matrix whose columns are the coordinates of the transformed basis vectors. In this case, the basis vector is [1, 0], and its transformed vector is [2, -1]. Therefore, the matrix representation is [[2, -1]].

Eigenvalues are the values of lambda for which the equation (A - lambdaI)x = 0 has a non-trivial solution. Solving this equation for the given matrix, we get the characteristic polynomial lambda^2 - 4lambda + 5 = 0. The roots of this polynomial are 1 and 3, which are the eigenvalues of the matrix.

A matrix is diagonalizable if it is similar to a diagonal matrix. This means that there exists an invertible matrix P such that P^-1AP is a diagonal matrix. The matrix [[2, 3], [-3, 2]] is diagonalizable because it has distinct eigenvalues and a complete set of eigenvectors.

The determinant of a matrix is a scalar value that can be calculated using various methods. For a 2x2 matrix, the determinant is given by the formula det([[a, b], [c, d]]) = ad - bc. In this case, det([[1, 2], [3, 4]]) = (1)(4) - (2)(3) = -2.

An invertible matrix is a square matrix that has an inverse matrix. The inverse matrix is a matrix that, when multiplied by the original matrix, results in the identity matrix. The matrix [[2, 1], [1, 2]] is invertible because its determinant is non-zero.

The null space of a matrix A is the set of all vectors x such that Ax = 0. This is also known as the kernel of the linear transformation represented by A.

An orthogonal matrix is a square matrix whose inverse is equal to its transpose. This means that the rows and columns of an orthogonal matrix are orthogonal to each other. The matrix [[1, 0], [0, 1]] is orthogonal because its inverse is also [[1, 0], [0, 1]].

The rank of a matrix is the maximum number of linearly independent rows or columns in the matrix. The matrix [[1, 2, 3], [4, 5, 6], [7, 8, 9]] has rank 2 because its first two rows are linearly independent, but its third row is a linear combination of the first two rows.

A singular matrix is a square matrix whose determinant is zero. The matrix [[0, 1], [0, 0]] is singular because its determinant is 0.

The trace of a matrix is the sum of its diagonal elements. The trace of the matrix [[1, 2], [3, 4]] is 1 + 4 = 5.

A symmetric matrix is a square matrix that is equal to its transpose. The matrix [[2, 1], [1, 2]] is symmetric because its transpose is also [[2, 1], [1, 2]].

The product of two matrices is calculated by multiplying the elements of the rows of the first matrix by the elements of the columns of the second matrix and adding the products. The product of the matrices [[1, 2], [3, 4]] and [[5, 6], [7, 8]] is [[19, 22], [43, 50]].

An elementary matrix is a square matrix that can be obtained from the identity matrix by performing a single elementary row operation. The matrix [[0, 1], [1, 0]] is an elementary matrix because it can be obtained from the identity matrix by swapping the first and second rows.

The adjoint of a matrix is the transpose of its cofactor matrix. The cofactor matrix of a matrix is obtained by replacing each element of the matrix with the determinant of the submatrix formed by deleting the row and column containing that element. The adjoint of the matrix [[1, 2], [3, 4]] is [[4, -2], [-3, 1]].