|↑| ❪✺₁❫ Linear Classes ○ | Linear Transformation ○꠹ ⦍[[| ]]⦎
⮞ 🟣 𓂃𓂃𓂃
⮞ ➔ 𓂃𓂃𓂃
⮞ ⛛ 𓂃𓂃𓂃
Entries
Linear Transformation ○꠹|Definition|1st|20251119205401-00-⌔
Linear map
In mathematics, and more specifically in linear algebra, a linear map (or linear mapping) is a particular kind of function between vector spaces, which respects the basic operations of vector addition and scalar multiplication. A standard example of a linear map is an matrix, which takes vectors in -dimensions into vectors in -dimensions in a way that is compatible with addition of vectors, and multiplication of vectors by scalars.
A linear map is a homomorphism of vector spaces.1 Thus, a linear map satisfies , where and are scalars, and and are vectors (elements of the vector space ). A linear mapping always maps the origin of to the origin of , and linear subspaces of onto linear subspaces in (possibly of a lower dimension);2 for example, it maps a plane through the origin in to either a plane through the origin in , a line through the origin in , or just the origin in . Linear maps can often be represented as matrices, and simple examples include rotation and reflection linear transformations.
Printed 2026-06-28.
(echo:: @ ᯤ)
is a subspace of X, called the null space of
Link to original Footnotes
In the language of category theory, linear maps are the morphisms of vector spaces. Restricted to the category of finite-dimensional vector spaces, they form a category equivalent to the one of matrices. ↩
Rudin 1991, p. 14
Here are some properties of linear mappings whose proofs are so easy that we omit them; it is assumed that and : If A is a subspace (or a convex set, or a balanced set) the same is true of If B is a subspace (or a convex set, or a balanced set) the same is true of In particular, the set: ↩
Fields
admin::|[[|⚐]],[[|⚐]],[[|⚐]],[[|⚐]],
withheld::|————
relation::|————
parent_::|Transformation ○꠹,
parent::|↑| ❪✺₁❫ Linear Classes ○ | Linear Transformation ○꠹ ⦍[[| ]]⦎