Linear operators and vector spaces

In summary, the conversation is about a person's independent study on vector spaces and linear operators. They are trying to show that the set of linear transformations from a vector space into itself forms a vector space over a field, using point-wise addition and scalar multiplication. The conversation includes a discussion of the vector space axioms and shows how they are satisfied by these operations. The person also mentions some uncertainty and asks for confirmation on their approach.
  • #1
"Don't panic!"
601
8
Hi all,

I've been doing some independent study on vector spaces and have moved on to looking at linear operators, in particular those of the form [itex] T:V \rightarrow V[/itex]. I know that the set of linear transformations [itex]\mathcal{L}\left( V,V\right) =\lbrace T:V \rightarrow V \vert \text{T is linear} \rbrace [/itex] form a vector space over [itex] \mathbb{F}[/itex], under the operations of point-wise addition and scalar multiplication, but I've been trying to show this explicitly by showing that these operations satisfy the vector space axioms. Here's my attempt so far:

Let [itex]V[/itex] be a vector space over [itex]\mathbb{F}[/itex] and let [itex]\mathcal{L}\left( V,V\right) =\lbrace T:V \rightarrow V \vert \text{T is linear} \rbrace [/itex] be the set of all linear transformations from [itex]V[/itex] into itself. As the operators [itex]T \in \mathcal{L}\left(V,V\right)[/itex] are linear, they satisfy the following conditions [tex]T\left(\mathbf{v} + \mathbf{w}\right)= T\left(\mathbf{v}\right) + T\left(\mathbf{w}\right) \quad\forall \mathbf{v},\mathbf{w} \in V,\; T\in \mathcal{L}\left(V,V\right)[/tex] and [tex] T\left(c\mathbf{v}\right) = cT\left(\mathbf{v}\right) [/tex]
And as such, we define point-wise addition of two operators [itex]S, T\in \mathcal{L}\left(V,V\right)[/itex] as [tex]\left(T+S\right) \left(\mathbf{v}\right) = T\left(\mathbf{v}\right) + S\left(\mathbf{v}\right)[/tex] and scalar multiplication of and operator [itex]T\in \mathcal{L}\left(V,V\right) [/itex] by some scalar from the underlying field [itex]\mathbb{F}[/itex] as [tex]T\left(c\mathbf{v}\right) = \left(cT\right) \left(\mathbf{v}\right) = cT\left( \mathbf{v}\right)[/tex]

Given this, we can now show that [itex]\mathcal{L}\left(V,V\right)[/itex] forms a vector space. First, we note that as both [itex]S, T\in \mathcal{L}\left(V,V\right)[/itex] clearly their "operator sum" [itex]T+S \in\mathcal{L}\left(V,V\right)[/itex] and similarly [itex]cT \in\mathcal{L}\left(V,V\right)[/itex] and hence the set [itex]\mathcal{L}\left(V,V\right)[/itex] is closed under these binary operations. Now, we shall check that [itex]\mathcal{L}\left(V,V\right)[/itex] satisfies the vector space axioms.

[itex]1.[/itex] (Commutativity of vector addition). Given [itex]S, T\in \mathcal{L}\left(V,V\right)[/itex] and [itex]\mathbf{v} \in V[/itex], and noting that as both [itex]S[/itex] and [itex]T[/itex] maps [itex]V[/itex] into itself, such that [itex] S\left(\mathbf{v}\right), T\left(\mathbf{v}\right) \in V [/itex] and therefore satisfy the vector space axioms, we have that [tex]\left(T+S\right) \left(\mathbf{v}\right) = T\left(\mathbf{v}\right) + S\left(\mathbf{v}\right)= S\left(\mathbf{v}\right) +T\left(\mathbf{v}\right)= \left(S+T\right) \left(\mathbf{v}\right).[/tex]

[itex]2.[/itex] (Associativity of vector addition). Given [itex]S, T, U\in \mathcal{L}\left(V,V\right)[/itex] and [itex]\mathbf{v} \in V[/itex], we have that [tex] \left(T +\left(S+U\right)\right) \left(\mathbf{v}\right) = T\left(\mathbf{v}\right) + \left(S+U\right)\left( \mathbf{v}\right) = T\left(\mathbf{v}\right) + \left(S\left(\mathbf{v}\right) + U\left(\mathbf{v}\right) \right)[/tex] [tex]\qquad\qquad\qquad\quad\quad = \left(T\left(\mathbf{v}\right) + S\left(\mathbf{v}\right) \right) + U\left(\mathbf{v}\right) = \left(T+S\right) \left(\mathbf{v}\right) + U\left(\mathbf{v}\right)[/tex] [tex]\qquad\qquad\qquad\quad\quad =\left(\left(T +S \right) +U\right) \left(\mathbf{v}\right).[/tex]

[itex]3.[/itex] (Identity element of vector addition). Let us define an operator [itex]\tilde{T}[/itex] such that [itex]\tilde{T}\left( \mathbf{v}\right) = \mathbf{0}[/itex]. Hence, given [itex]T\in \mathcal{L}\left(V,V\right)[/itex] and [itex]\mathbf{v} \in V[/itex], we have that [tex]\left( T+ \tilde{T} \right)\left(\mathbf{v} \right) = T\left(\mathbf{v}\right) + \tilde{T}\left( \mathbf{v}\right) = T\left(\mathbf{v} \right) + \mathbf{0} = T\left(\mathbf{v} \right) [/tex]
where we have noted that [itex]T\left( \mathbf{v}\right) \in V[/itex]
hence an identity exists for [itex]\mathcal{L}\left(V,V\right)[/itex]. (*I'm really not sure I've done this part correctly, it doesn't seem right?!*).

[itex]4.[/itex] (Inverse elements of addition) Noting that each [itex] \mathbf{v} \in V[/itex] has a unique inverse, [itex] -\mathbf{v} \in V[/itex], such that [itex] \mathbf{v} + \left(-\mathbf{v}\right) = \mathbf{0} [/itex], and that [itex] \left(-1\right)\mathbf{v}= - \mathbf{v} \;\;\forall\;\mathbf{v} \in V[/itex], we have [tex] T\left(\mathbf{0}\right) = T\left( \mathbf{v} + \left(-\mathbf{v}\right) \right) = T\left(\mathbf{v}\right) + T\left(-\mathbf{v}\right)= T\left(\mathbf{v}\right) + T\left(\left(-1\right)\mathbf{v}\right) = T\left(\mathbf{v}\right)+ \left(-1\right)T\left(\mathbf{v}\right) = T\left(\mathbf{v}\right) + \left(-T\left(\mathbf{v}\right)\right)= \left(T + \left(-T\right)\right)\left(\mathbf {v}\right) = \mathbf{0} [/tex] where we have noted that [itex]T\left(\mathbf{0}\right) = T\left(0\mathbf{v}\right) = 0T\left(\mathbf{v}\right) = \mathbf{0} [/itex] (as [itex]0\mathbf{v}=\mathbf{0} \;\; \forall \mathbf{v} \in V[/itex] and [itex]T\left(\mathbf{v}\right) \in \mathcal{L}\left(V,V\right)[/itex].
Hence, each element [itex]T\in \mathcal{L}\left(V,V\right)[/itex] has an inverse [itex]-T\in \mathcal{L}\left(V,V\right)[/itex]. (*Again, I'm not fully sure I'm correct on this one?!*).

[itex]5.[/itex] (Compatibility of scalar multiplication with field multiplication). Let [itex]T\in \mathcal{L}\left(V,V\right)[/itex], [itex]\mathbf{v} \in V[/itex] and [itex]c_{1},c_{2} \in \mathbb{F}[/itex], noting that [itex]\left(c_{1}c_{2}\right) \mathbf{v} = c_{1}\left( c_{2}\mathbf{v}\right) \;\;\forall\, \mathbf{v} \in V, \; c_{1},c_{2} \in \mathbb{F} [/itex], we have that [tex] T\left(\left( c_{1}c_{2}\right) \mathbf{v}\right) = \left( c_{1}c_{2}\right)T\left( \mathbf{v}\right)[/tex] and also [tex] T\left(\left( c_{1}c_{2}\right) \mathbf{v}\right)= T\left(c_{1}\left( c_{2}\mathbf{v}\right)\right)= c_{1}T\left(c_{2}\mathbf{v}\right) = c_{1}\left( c_{2} T\left(\mathbf{v}\right) \right)[/tex] Hence, we have that, [tex] \left( c_{1}c_{2}\right) T\left( \mathbf{v}\right) = c_{1}\left( c_{2} T \right) \left(\mathbf{v}\right) [/tex]

[itex]6.[/itex] (Identity element of scalar multiplication). Noting that [itex]1\mathbf{v} = \mathbf{v} \;\; \forall \mathbf{v} \in V [/itex], then given [itex]T\in \mathcal{L}\left(V,V\right)[/itex] and [itex]\mathbf{v} \in V[/itex] we have [tex]T\left(\mathbf{v} \right)= T\left(1\mathbf{v} \right) = 1T\left(\mathbf{v} \right) = \left(1 T\right)\left(\mathbf{v} \right) [/tex] as required.

[itex]7.[/itex] (Distributivity of scalar multiplication with respect to vector addition). Let [itex]S,T\in \mathcal{L}\left(V,V\right)[/itex], [itex]\mathbf{v} \in V[/itex] and [itex]c \in \mathbb{F}[/itex]. Then, [tex] \left(S+T\right)\left(c\mathbf{v}\right)= c\left(S+T\right)\left(\mathbf{v}\right) [/tex] and also [tex] \left(S+T\right)\left(c\mathbf{v}\right) = S\left(c\mathbf{v}\right) + T\left(c\mathbf{v}\right) = cS\left(\mathbf{v}\right) + cT\left(\mathbf{v}\right) = \left( cS+ cT\right)\left(\mathbf{v}\right) [/tex] and hence, [tex] c\left(S+T\right)\left(\mathbf{v}\right) =\left( cS+ cT\right)\left(\mathbf{v}\right) [/tex]

[itex]8.[/itex] (Distributivity of scalar multiplication with respect to field addition). Let [itex]T\in \mathcal{L}\left(V,V\right)[/itex], [itex]\mathbf{v} \in V[/itex] and [itex]c_{1},c_{2} \in \mathbb{F}[/itex]. Then, noting that [itex] \left(c_{1} +c_{2}\right)\mathbf{v} = c_{1}\mathbf{v} + c_{2}\mathbf{v} \;\;\forall\; \mathbf{v} \in V, c_{1},c_{2} \in \mathbb{F} [/itex], we have that [tex] T\left(\left(c_{1} +c_{2}\right)\mathbf{v}\right) = \left(c_{1} +c_{2}\right) T\left(\mathbf{v}\right)[/tex] and also [tex] T\left(\left(c_{1} +c_{2}\right)\mathbf{v}\right)= T\left(c_{1} \mathbf{v}\right) + T\left(c_{2}\mathbf{v}\right) = c_{1}T\left( \mathbf{v}\right)+ c_{2}T\left( \mathbf{v}\right) = \left(c_{1}T + c_{2}T\right)\left( \mathbf{v}\right) [/tex] and hence, [tex]\left(c_{1} +c_{2}\right) T\left(\mathbf{v}\right)= \left(c_{1}T + c_{2}T\right)\left( \mathbf{v}\right)[/tex] Therefore, the set [itex]\mathcal{L}\left( V,V\right) [/itex] forms a vector space over [itex]\mathbb{F} [/itex] under point-wise addition and scalar multiplication.

Is this a correct analysis?
 
Physics news on Phys.org
  • #2
"Don't panic!" said:
Is this a correct analysis?

Yes.
 
  • #3
Yes, don't panic.
 
  • #4
Thanks guys, appreciate you checking it over.
 
  • #5
"Don't panic!" said:
[itex]4.[/itex] (Inverse elements of addition)
...
[tex] T\left(\mathbf{0}\right) = \cdots = T\left(\mathbf{v}\right)+ \left(-1\right)T\left(\mathbf{v}\right) = T\left(\mathbf{v}\right) + \left(-T\left(\mathbf{v}\right)\right)= \left(T + \left(-T\right)\right)\left(\mathbf {v}\right) = \mathbf{0} [/tex]
You shouldn't use the notation -T anywhere in this calculation, since we don't know that there's something that deserves that notation until we have completed it. Also, (this is just a presentation issue) if you have proved that the first thing in your chain of equalities is equal to ##\mathbf 0##, then you should put ##\mathbf 0=## at the start of it, not ##=\mathbf 0## at the end of it. Your notation and the "=0" at the end make it look like you're using the result that you're trying to prove in the final step. (I realize that you're not).

This would be better:
$$\mathbf 0=T(\mathbf 0)=\cdots=T(\mathbf v)+(-1)T(\mathbf v) =T(\mathbf v)+((-1)T)(\mathbf v)=(T+(-1)T)(\mathbf v).$$ And it would be even better to write the start of the calculation as ##\tilde T(\mathbf v)=\mathbf 0=\cdots##, because then we can conclude (since the equalities hold for all ##\mathbf v## that ##\tilde T=T+(-1)T##, where ##\tilde T## is the function you defined and proved to be the identity in step 3. The result ##\tilde T=T+(-1)T## implies that (-1)T is the additive inverse of T. Now we can start using the notation -T=(-1)T.

Another thing, you used that T is linear in steps 4-8, but there's no need to do that. There's nothing wrong with using linearity, considering what you want to prove, but it's useful to know that the assumption of linearity is unnecessary.

Step 4 without linearity:
$$(T+(-1)T)(\mathbf v) = T(\mathbf v)+((-1)T)(\mathbf v) =T(\mathbf v)+(-1)T(\mathbf v) =(1+(-1))T(\mathbf v) =0 T(\mathbf v)=\mathbf 0=\tilde T(\mathbf v).$$ Step 5 without linearity:
$$((ab)T)(\mathbf v) =(ab)T(\mathbf v) =a(bT(\mathbf v)) =a((bT)(\mathbf v)) =(a(bT))(\mathbf v).$$

Edit: In fact, you can prove that for all vector spaces V,W, the set of all functions from V into W, with the definitions of addition and scalar multiplication that you included in your post, is a vector space. Then you know that the set of all functions from V into V is a vector space, and you can prove quite easily that the set of linear operators on V is a vector space by only checking the usual three things to verify that it's a subspace of that larger vector space.
 
Last edited:
  • #6
Thanks once again for your help Fredrik! Extremely useful and helpful :)
 
Last edited:

FAQ: Linear operators and vector spaces

1. What is a linear operator?

A linear operator is a mathematical function that maps one vector space to another, while preserving the vector space structure. It follows the properties of linearity, such as the preservation of addition and scalar multiplication.

2. What is a vector space?

A vector space is a set of objects, called vectors, that can be added together and multiplied by scalars. It also follows certain axioms, such as closure under addition and scalar multiplication, associativity, and distributivity.

3. How do you determine if a function is a linear operator?

To determine if a function is a linear operator, it must satisfy the properties of linearity. This means that the function must preserve addition and scalar multiplication. Additionally, it must also satisfy the property of homogeneity, where f(cx) = cf(x) for all scalars c. If a function satisfies these properties, it is a linear operator.

4. What is the difference between a linear operator and a linear transformation?

A linear operator is a type of linear transformation that maps one vector space to another. However, a linear transformation can also refer to a mapping between other mathematical structures, such as matrices or polynomials. Linear operators specifically refer to mappings between vector spaces.

5. How are linear operators used in real-world applications?

Linear operators are used in a variety of real-world applications, such as computer graphics, signal processing, and quantum mechanics. They are also essential in the study of differential equations, where they are used to solve boundary value problems and model physical systems. Additionally, linear operators are used in data analysis and machine learning algorithms to manipulate and transform data.

Similar threads

Replies
1
Views
1K
Replies
7
Views
2K
Replies
10
Views
2K
Replies
2
Views
1K
Replies
2
Views
1K
Back
Top