Read · 1 min

Given two vector spaces VV and WW, a linear map is a map T:V→WT:V\rightarrow W such that, for any two scalars α\alpha and β\beta and two vectors u,v∈Vu, v\in V, T(α⋅u+β⋅v)=α⋅T(u)+β⋅T(v)T(\alpha\cdot u + \beta\cdot v) = \alpha\cdot T(u) + \beta\cdot T(v)

You might also see the condition equivalently expressed as two simpler conditions: T(α⋅u)=α⋅T(u)T(\alpha\cdot u) = \alpha\cdot T(u) T(u+v)=T(u)+T(v)T(u+v) = T(u)+T(v) It is easy to verify that these two sets of conditions are completely equivalent. As a side note, the linear transformation T(v)T(v) is often also denoted TvTv when it is clear that suppressing the parentheses will not create confusion.

Given two affine spaces VV and WW, an affine map is a map F:V→WF:V\rightarrow W such that, for every vector v∈Vv\in V, F(v)=Tv+bF(v) = Tv+b, where TT is some linear transformation and b∈Wb\in W is a constant vector.

Quite simply, an affine map is the composition of a transformation and a linear map. The only difference is that, in an affine map, the zero vector can be mapped to an arbitrary vector, rather than having to be mapped to the zero vector.

Type a concept, like “slope” or “photosynthesis”.

↑ ↓ to choose · Enter to openSearch explanations and problems