LINEAR MAPPING

SUBMITTED BY UNDER THE SUPERVISION

FAISAL KHAN OF
M.Sc (Mathematics) Dr. MALIK RASHID JAMAL
ENROL.-1800102275
INTRODUCTION

Definition of LINEAR MAPPING : "A linear mapping, also known as a linear transformation or linear function,
is a mathematical operation that maps a vector from one vector space to another in a way that preserves the
vector addition and scalar multiplication operations."

Let V and W be vector spaces over the same field T . A function T:V→W is called a linear map or a linear
transformation if
1. T(u+v) = T(u) + T(v) , for all u, v Є V
2. T(αv) = αT(v), for all α Є F & v Є V
HISTORY OF LINEAR MAPPING

The ancient Greeks were the first to study the concept of geometry, which laid the foundation for modern linear algebra.

In the 17th and 18th centuries, French mathematicians such as Rene Descartes and Genard Desargues used vector algebra
and projective geometry to study the properties of linear transformations.

The 19th century saw the development of modern differential geometry, which is an essential tool for studying linear
mappings. German mathematician Georg Friedrich Bernhard Riemann developed the concept of a manifold and introduced
the notion of a metric tensor.

In the 20th century, the development of computer technology and its applications accelerated the development of linear
mapping as a separate field of mathematics. Mathematicians such as David Hilbert, Emmy Noether, and Hermann Weyl
made significant contributions to the development of linear algebra, transforming it into a more abstract and powerful
mathematical discipline.
S
KEYWORDS

Vector Space: A collection of vectors that can be added together and multiplied by scalars.

Basis: A set of vectors that can be used to represent any other vector in that space.

Linearly Independent: A set of vectors in which no vector can be expressed as a linear combination of the others.

Linearly Dependent: A set of vectors in which at least one vector can be expressed as a linear combination of the
others.

Image: The result of applying a linear mapping to a vector.

Cont….

Eigenvector: A non-zero vector that, when a linear mapping is applied, is scaled by a scalar factor.

Matrix Representation: A linear mapping can be represented by a matrix where the columns correspond to the images
of the basis vectors of the domain space.

Inverse Mapping: A linear mapping has an inverse if and only if its matrix is invertible. The inverse of a linear
mapping is also a linear mapping.

Kernel: The set of all vectors in the domain space that are mapped to the zero vector in the range space.

Importance: Linear mapping is a fundamental concept in mathematics that allows us to represent complex operations
in a simple and elegant way.
.
THEOREMS

Theorem 1. Let V be a vector space over a field K.

For any scalar k ∈ K and 0 ∈ V, k0 = 0.
For 0 ∈ K and any vector u ∈ V, 0u = 0.
If ku = 0, where k ∈ K and u ∈ V, then k = 0 or u = 0.
For any k ∈ K and any u ∈ V, (-k)u = k(-u) = -ku

Theorem 2. Let V be a vector space of finite dimension n. Then:

(i) Any n + 1 or more vectors in V are linearly dependent.
(ii) Any linearly independent set S = {u1, u2,...,un} with n elements is a basis of V.
(iii) Any spanning set T = {v1, v2,...,vn} of V with n elements is a basis of V.
Cont…..

Theorem 4. Let V and U be vector spaces over a field K. Let {v 1, v2,...,vn} be a basis of V and let u1, u2,...,un be any
vectors in U. Then there exists a unique linear mapping F : V → U such that F(v 1) = u1, F(v2)= u2,...,F(vn) = un.
We emphasize that the vectors u1, u2,...,un in this theorem are completely arbitrary, they may be linearly dependent or
they may even be equal to each other.

Theorem 3. A linear map is invertible if and only if it is injective and surjective.

Cont…..

Theorem 6. (Linear maps take 0 to 0) Suppose T is a linear map from V to W. Then T (0) = 0.

Theorem 5. Let F : V → U be a linear mapping. Then the kernel of F is a subspace of V and the image of F is a
subspace of U.
APPLICATION OF LINEAR MAPPING

Linear mapping has numerous applications in mathematics, including in fields such as linear algebra, differential
equations, and calculus.

In linear algebra, linear mapping is used to study the properties of vectors and matrices, and to solve systems of linear
equations.

In differential equations, linear mapping is used to solve homogeneous linear differential equations & to transform the
dependent variable to a new variable.

In calculus, linear mapping is used for various tasks such as finding derivatives and integrals of functions & to
transform the domain or range of functions.
Cont…..

In addition to its applications in pure mathematics, linear mapping has numerous practical applications in fields
such as physics, engineering, and computer science.

In physics, linear mapping is used to describe the behavior of physical systems, such as the motion of objects
under the influence of forces.

Engineers also use linear mapping to model and design complex systems, such as electronic circuits and control
systems.

In computer science, linear mapping is used in fields such as computer graphics, machine learning, and data
analysis.
CONCLUSION

"Linear mapping is a fundamental concept in mathematics with applications in various fields such as calculus,
differential equations, linear algebra, physics, and engineering. It is a powerful tool that allows us to represent
complex operations in a simple and elegant way."
REFERENCES

1. Nathanical Johnston, Introduction to Linear and Matrix Algebra, Springer nature Switzerland, Canada, 2021.

2. Sheldon Axler, Linear algebra done right, 2nd edition, Springer International publishing U.S.A., 1997.

3. Hoffman K. and Kunze R., Linear Algebra, 2nd edition, Prentice – Hall of India, New Delhi, 2000.

4. A. K. Sharma, Linear Transformation, Discovery Publishing House, New Delhi, India, 2007.

5. Arak M. Mathai and Hans J. Haubold, Linear Algebra, Walter de Gruyter, Germany, 2017.
THANK YOU