91Ó°ÊÓ

Matrix representation is a powerful tool that helps to express a linear transformation in a simplified form. For a linear transformation like \( T: \mathbb{R}^{n} \rightarrow \mathbb{R} \), which combines all the components of a vector \( \mathbf{x} \) by summing them up, the matrix representation becomes indispensable to know.

In essence, a matrix is a structured array of numbers, and in this context, it captures how the transformation affects any input vector from \( \mathbb{R}^{n} \). This transformation \( T \) can be expressed by a single row matrix, because it maps from \( n \) dimensions down to 1 dimension:

• The matrix encapsulates the transformation \( T \) so that for any vector \( \mathbf{x} = (x_1, x_2, \ldots, x_n) \), applying \( T \) is equivalent to multiplying by the matrix \[ A = [1, 1, \ldots, 1] \].
• The result of this multiplication \( A\mathbf{x} \) yields \( T(\mathbf{x}) \), which in this case is \( x_1 + x_2 + \ldots + x_n \).

In summary, matrix representation transforms the procedure of applying \( T \) from a more complex equation into a simple matrix multiplication. This leads to concise computations, ideal for implementation in various fields like computer graphics or engineering.

Additivity is a fundamental property of linear transformations, providing insight into the structure and behavior of these functions. In simple terms, a function \( T \) is additive if it satisfies the property:

• \( T(\mathbf{u} + \mathbf{v}) = T(\mathbf{u}) + T(\mathbf{v}) \) for any vectors \( \mathbf{u}, \mathbf{v} \).

In the given exercise, if you take two vectors \( \mathbf{u} \) and \( \mathbf{v} \) from \( \mathbb{R}^n \), you can use additivity to predict the outcome of \( T(\mathbf{u} + \mathbf{v}) \) based purely on the sum of their individual transformations. Specifically:

• When we calculate \( T(\mathbf{u} + \mathbf{v}) \), it simplifies to a single sum of individual components, showing that \( T \) respects linear addition.

This property is instrumental because it validates that the transformation uniformly scales across any additions in the input vectors, without distorting or altering the core operation. Understanding additivity allows students to confidently approach problems involving sums in linear spaces.

Homogeneity is another cornerstone property of linear transformations, closely tied to the principle of scalability in linear algebra. A function \( T \) demonstrates homogeneity if it respects scalar multiplication as follows:

• \( T(c\mathbf{u}) = cT(\mathbf{u}) \) for any scalar \( c \) and vector \( \mathbf{u} \).

In practice, this property ensures that if you scale a vector by any number \( c \), the transformation \( T \) will yield a result that is equivalently scaled. Let's visualize this using the exercise:

• If we scale \( \mathbf{u} \) to become \( c\mathbf{u} \), applying \( T \) results in \( c(u_1 + u_2 + \ldots + u_n) \), which simplifies to multiplying the sum by the scalar \( c \).

Thus, consequently, homogeneity confirms that \( T \) performs consistently across any scalar adjustments, reflecting a proportional response to any scaling applied to the input vector. This property assures that transformations maintain a uniform behavior, which is crucial for predicting the outcomes of operations involving scalars and vectors.