# All Science Fair Projects

## Science Fair Project Encyclopedia for Schools!

Search                 Browse                 Forum               Coach                 Links                 Editor                 Help                 Tell-a-Friend                 Encyclopedia                 Dictionary

# Science Fair Project Encyclopedia

For information on any area of science that interests you,
enter a keyword (eg. scientific method, molecule, cloud, carbohydrate etc.).
Or else, you can start by choosing any of the categories below.

# Linear transformation

(Redirected from Linear map)

In mathematics, a linear transformation (also called linear operator or linear map) is a function between two vector spaces that preserves the operations of vector addition and scalar multiplication. In other words, it "preserves linear combinations".

In the language of abstract algebra, a linear transformation is a homomorphism of vector spaces.

Contents

## Definition and first consequences

Formally, if V and W are vector spaces over the same ground field K, we say that f : V → W is a linear transformation if for any two vectors x and y in V and any scalar a in K, we have

$f(x+y)=f(x)+f(y) \,$ (additivity)
$f(ax)=af(x) \,$               (homogeneity).

This is equivalent to saying that f   "preserves linear combinations", i.e., for any vectors x1, ..., xm and scalars a1, ..., am, we have

$f(a_1 x_1+\cdots+a_m x_m)=a_1 f(x_1)+\cdots+a_m f(x_m).$

Occasionally, V and W can be considered as vector spaces over different ground fields, and it is then important to specify which field was used for the definition of "linear". If V and W are considered as spaces over the field K as above, we talk about K-linear maps. For example, the conjugation of complex numbers is an R-linear map C → C, but it is not C-linear.

## Examples

• If A is an m × n matrix, then A defines a linear transformation from Rn to Rm by sending the column vector x ∈ Rn to the column vector Ax ∈ Rm. Every linear transformation between finite-dimensional vector spaces arises in this fashion; see the following section.
• The integral yields a linear map from the space of all real-valued integrable functions on some interval to R
• Differentiation is a linear transformation from the space of all differentiable functions to the space of all functions.
• If V and W are finite-dimensional vector spaces over the field F, then functions that map linear transformations f : V → W to dimF(W)-by-dimF(V) matrices in the way described in the sequel are themselves linear transformations.

## Matrices

If V and W are finite-dimensional and bases have been chosen, then every linear transformation from V to W can be represented as a matrix; this is useful because it allows concrete calculations. Conversely, matrices yield examples of linear transformations: if A is a real m-by-n matrix, then the rule f(x) = Ax describes a linear transformation Rn → Rm (see Euclidean space).

Let $\{v_1, \cdots, v_n\}$ be a basis for V. Then every vector v in V is uniquely determined by the coefficients $c_1, \cdots, c_n$ in

$c_1 v_1+\cdots+c_n v_n.$

If f : V → W is a linear transformation,

$f(c_1 v_1+\cdots+c_n v_n)=c_1 f(v_1)+\cdots+c_n f(v_n),$

which implies that the function f is entirely determined by the values of $f(v_1),\cdots,f(v_n).$

Now let $\{w_1, \cdots, w_m\}$ be a basis for W. Then we can represent the values of each f(vj) as

$f(v_j)=a_{1j} w_1 + \cdots + a_{mj} w_m.$

So the function f is entirely determined by the values of ai,j.

If we put these values into an m-by-n matrix M, then we can conveniently use it to compute the value of f for any vector in V. For if we place the values of $c_1, \cdots, c_n$ in an n-by-1 matrix C, we have MC = f(v).

It should be noted that there can be multiple matrices that represent a single linear transformation. This is because the values of the elements of the matrix depend on the bases that are chosen. Similarly, if we are given a matrix, we also need to know the bases that it uses in order to determine what linear transformation it represents.

## Forming new linear transformations from given ones

The composition of linear transformations is linear: if f : V → W and g : W → Z are linear, then so is g o f : V → Z.

If f1 : V → W and f2 : V → W are linear, then so is their sum f1 + f2 (which is defined by (f1 + f2)(x) = f1(x) + f2(x)).

If f : V → W is linear and a is an element of the ground field K, then the map af, defined by (af)(x) = a (f(x)), is also linear.

In the finite dimensional case and if bases have been chosen, then the composition of linear maps corresponds to the multiplication of matrices, the addition of linear maps corresponds to the addition of matrices, and the multiplication of linear maps with scalars corresponds to the multiplication of matrices with scalars.

## Endomorphisms and automorphisms

A linear transformation f : V → V is an endomorphism of V; the set of all such endomorphisms End(V) together with addition, composition and scalar multiplication as defined above forms an associative algebra with identity element over the field K (and in particular a ring). The identity element of this algebra is the identity map id : V → V.

A bijective endomorphism of V is called an automorphism of V. The composition of two automorphisms is again an automorphism, and the set of all automorphisms of V forms a group, the automorphism group of V which is denoted by Aut(V) or GL(V).

If V has finite dimension n, then End(V) is isomorphic to the associative algebra of all n by n matrices with entries in K. The automorphism group of V is isomorphic to the general linear group GL(n, K) of all n by n invertible matrices with entries in K.

## Kernel and image

If f : V → W is linear, we define the kernel and the image of f by

$\ker(f)=\{\,x\in V:f(x)=0\,\}$
$\operatorname{im}(f)=\{\,f(x):x\in V\,\}$

ker(f) is a subspace of V and im(f) is a subspace of W. The following dimension formula is often useful (but note that it only applies if V is finite dimensional):

$\dim(\ker( f )) + \dim(\operatorname{im}( f )) = \dim( V ) \,$

The number dim(im(f)) is also called the rank of f and written as rk(f). If V and W are finite dimensional, bases have been chosen and f is represented by the matrix A, then the rank of f is equal to the rank of the matrix A. The dimension of the kernel is also known as the nullity of the matrix.

f(x)=a is called a homogeneous equation if a=0, otherwise inhomogeneous. If c is one solution (the so-called "particular solution") then the set of solutions is the set of x that can be written as c plus any solution of the corresponding homogeneous equation (i.e. any element of the kernel). This can be applied e.g. to systems of linear equations, linear recurrence relations, and (systems of) linear differential equations. See e.g. damped, driven harmonic oscillator.

## See also

03-10-2013 05:06:04
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 14, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8746163845062256, "perplexity_flag": "head"}