logo

Affine Transformation 📂Matrix Algebra

Affine Transformation

Definition

Simple Definition

Suppose a matrix AA and a vector b\mathbf{b} are given. The transformation that multiplies the matrix AA to the vector x\mathbf{x} and adds b\mathbf{b} is called an affine transformation. xAx+b \mathbf{x} \mapsto A \mathbf{x} + \mathbf{b}

Complex Definition 1

If f:VVf : V \to V defined on a vector space VV satisfies the following condition for any scalar λ\lambda, then ff is called an affine transformation. f(λx+[1λ]y)=λf(x)+[1λ]f(y) f \left( \lambda x + \left[ 1 - \lambda \right] y \right) = \lambda f (x) + \left[ 1 - \lambda \right] f (y)

Explanation

In contexts such as machine learning or geometry, multiplying by matrix AA refers to taking a linear transformation like a rotation transformation, and adding vector b\mathbf{b} refers to a translation.

In fields familiar with mathematics, the expression affine transformation is often used essentially to mean just multiplying by a matrix, because an affine transformation like y=Ax+b\mathbf{y} = A \mathbf{x} + \mathbf{b} can be thought of in a block matrix form, where it’s possible to adjust by adding 11 to the bottom of the two vectors y\mathbf{y} and x\mathbf{x} as follows. [y1]=[Ab0T1][x1]=[Ax+b1] \begin{bmatrix} \mathbf{y} \\ 1 \end{bmatrix} = \begin{bmatrix} A & \mathbf{b} \\ \mathbf{0}^{T} & 1 \end{bmatrix} \begin{bmatrix} \mathbf{x} \\ 1 \end{bmatrix} = \begin{bmatrix} A \mathbf{x} + \mathbf{b} \\ 1 \end{bmatrix}


  1. Aggarwal. (2020). Linear Algebra and Optimization for Machine Learning: p43. ↩︎