Scribd
Upload
20 views3 pages

Chapter 2 Linear Maps

Uploaded by

Oum Houssem
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
20 views3 pages

Chapter 2 Linear Maps

Uploaded by

Oum Houssem
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 3

Chapter 2 : Linear maps

In linear algebra, a linear map (also called a linear mapping, linear transformation, vector
space homomorphism, or in some contexts linear function) is a mapping between
two vector spaces that preserves the operations of vector addition and scalar
multiplication. The same names and the same definition are also used for the more general
case of modules over a ring, see Module homomorphism.
Definition (Linear algebra)
Let 𝐸 and 𝐹 be vector spaces over the same field 𝕂.
A function 𝑓: 𝐸 ⟶ 𝐹 is said to be a linear map if :

1 ▪ ∀(𝑢, 𝑣 ) ∈ 𝐸 2 : 𝑓(𝑢 + 𝑣 ) = 𝑓(𝑢) + 𝑓(𝑣)

2 ▪ ∀𝑢 ∈ 𝐸, ∀𝜆 ∈ 𝕂 ∶ 𝑓(𝜆𝑢) = 𝜆𝑓(𝑢)
Or
∀(𝑢, 𝑣 ) ∈ 𝐸 2 , ∀(𝜆, 𝜇) ∈ 𝕂2 : 𝑓(𝜆𝑢 + 𝜇𝑣 ) = 𝜆𝑓 (𝑢) + 𝜇𝑓(𝑣)
Remark

If 𝑓: 𝐸 ⟶ 𝐹 is a linear map, then : 𝑓 (0𝐸 ) = 0𝐹 .

Examples
Are the following functions linear?
𝑓 ∶ ℝ3 ⟶ ℝ2 defined by 𝑓(𝑥, 𝑦, 𝑧) = (2𝑥 + 3𝑦 − 𝑧, 𝑥 + 𝑧 − 1)
𝑇 ∶ ℝ ⟶ ℝ defined by 𝑥 ⟼ 𝑠𝑖𝑛𝑥
𝑔 ∶ ℂ ⟶ ℂ defined by 𝑔(𝑧) = 𝑧̅
ℎ ∶ ℝ[𝑥 ] ⟶ ℝ[𝑥 ] defined by 𝑃 ⟼ 𝑃′

Remark
Let 𝑓: 𝐸 ⟶ 𝐹 be a linear map, so :
- If 𝑓 is bijective then 𝑓 is called a linear isomorphism of vector spaces.
- If 𝐸 = 𝐹 then 𝑓 is called a linear endomorphism of 𝐸.
- If 𝐸 = 𝐹 and 𝑓 is bijective, then 𝑓 is called a linear automorphism of 𝐸.

1
Chapter 2 : Linear maps

Proposition
Let ℱ(𝐸, 𝐹) the set of all maps of 𝐸 over 𝐹.
Let ℒ(𝐸, 𝐹) the set of all linear maps of 𝐸 over 𝐹.
ℒ(𝐸, 𝐹) provided with the addition of applications, and the product of an application by a
scalar, is a vector subspace of ℱ(𝐸, 𝐹).

Kernel – Image (Rang) of a linear maps


If 𝑓: 𝐸 ⟶ 𝐹 is linear, we define the kernel and the image of 𝑓 by :
𝑘𝑒𝑟(𝑓 ) = {𝑥 ∈ 𝐸/ 𝑓(𝑥) = 0𝐹 }

ℐ𝑚(𝑓 ) = {𝑦 ∈ 𝐹/ ∃𝑥𝜖𝐸, 𝑓(𝑥) = 𝑦}

Proposition
Let 𝑓: 𝐸 ⟶ 𝐹 a linear map.
𝑘𝑒𝑟(𝑓 ) is a subspace of 𝐸, and ℐ𝑚(𝑓 ) is a subspace of 𝐹.
Theorem
Let 𝑓: 𝐸 ⟶ 𝐹 a linear map, then we have
𝑓 𝑖𝑠 𝑖𝑛𝑗𝑒𝑐𝑡𝑖𝑣𝑒 ⟺ 𝑘𝑒𝑟(𝑓 ) = {0𝐸 }
𝑓 𝑖𝑠 𝑠𝑢𝑟𝑗𝑒𝑐𝑡𝑖𝑣𝑒 ⟺ ℐ𝑚(𝑓 ) = 𝐹

Exercise
Let ℎ ∶ ℝ3 ⟶ ℝ3 ; (𝑥, 𝑦, 𝑧) ⟼ (𝑥, 𝑥 − 𝑧, 𝑦 + 𝑧)
1- Prove that ℎ is linear.
2- Find the kernel and the image of ℎ, deduce if it is injective ? surjective ? bijective ?

Linear maps in finite dimension


Let 𝐸 and 𝐹 two finite-dimensional vector spaces.
Rank-nullity theorem
Definition
The rank of a linear map 𝑓 is equal to the dimension of ℐ𝑚(𝑓 ) :
𝑟𝑔(𝑓 ) = 𝑑𝑖𝑚ℐ𝑚 (𝑓 )

2
Chapter 2 : Linear maps

Properties
Let 𝑓: 𝐸 ⟶ 𝐹 a linear map, we have
𝑓 𝑒𝑠𝑡 𝑖𝑛𝑗𝑒𝑐𝑡𝑖𝑣𝑒 ⟺ 𝑟𝑔(𝑓 ) = 𝑑𝑖𝑚𝐸
𝑓 𝑒𝑠𝑡 𝑠𝑢𝑟𝑗𝑒𝑐𝑡𝑖𝑣𝑒 ⟺ 𝑟𝑔(𝑓 ) = 𝑑𝑖𝑚𝐹
𝑓 𝑒𝑠𝑡 𝑏𝑖𝑗𝑒𝑐𝑡𝑖𝑣𝑒 ⟺ 𝑟𝑔(𝑓 ) = 𝑑𝑖𝑚𝐸 = 𝑑𝑖𝑚𝐹

Proposition
Let 𝑓 is an endomorphism of 𝐸, then
𝑓 𝑖𝑛𝑗𝑒𝑐𝑡𝑖𝑣𝑒 ⟺ 𝑓 𝑠𝑢𝑟𝑗𝑒𝑐𝑡𝑖𝑣𝑒 ⟺ 𝑓 𝑏𝑖𝑗𝑒𝑐𝑡𝑖𝑣𝑒

Theorem
Let 𝑓: 𝐸 ⟶ 𝐹 a linear map, then
dim(ℐ𝑚𝑓 ) + dim(𝑘𝑒𝑟𝑓 ) = 𝑑𝑖𝑚𝐸

You might also like