Linear algebra: Vector subspaces

In summary, a vector subspace is a subset of a vector space that follows all the properties of a vector space and can be thought of as a smaller space within the larger vector space. To determine if a set of vectors is a subspace, you need to check if it contains the zero vector, is closed under addition and scalar multiplication. A subspace can have infinitely many dimensions, meaning there are infinitely many linearly independent vectors that span the subspace. Vector subspaces are used in linear algebra to study the properties and behavior of linear transformations in various fields. Additionally, all vector spaces are also subspaces of themselves by definition.
  • #1
cesaruelas
53
0

Homework Statement


Is the subset of
P= {a0 + a1x + a2x2 + ... + anxn}
formed only by the polynomials that satisfy the condition:
a1a3≤0
a vector subspace?


Homework Equations


I already proved the subset is not closed under addition so I know it's not a vector subspace, however, the answer my teacher marked as correct reads: "No, it's closed under the product but not under addition."


The Attempt at a Solution


Let Pb and Pc be elements of a subset of P= {a0 + a1x + a2x2 + ... + annn} with their coefficients given by any series in function of n (this is an assumption I'm not sure I can make but I find no other way to tackle the product step without making it).

Addition:
Pb + Pc = {b0+c0 + (b1+c1)x + ... + (b3+c3)x3 + ... + (bn+cn)xn}
where
(b1+c1)(b3+c3)≤0
if
(b1+c1)≤0 and (b3+c3)≥0
or
(b1+c1)≥0 and (b3+c3)≤0

Therefore, it is not closed under addition.

Product:
Pb * Pc = {b0c0 + (b1c1)x + ... + (b3c3)x3 + ... + (bncn)xn}
where
(b1c1)(b3c3)≤0
if
(b1c1)= 0
and/or
(b3c3)= 0
(because of their positions in the series).

Therefore, it is not closed under the product.

Was the assumption mistaken? If so, can you give me a clue how to prove that it is/isn't closed under the product?
 
Physics news on Phys.org
  • #2
cesaruelas said:

Homework Statement


Is the subset of
P= {a0 + a1x + a2x2 + ... + anxn}
formed only by the polynomials that satisfy the condition:
a1a3≤0
a vector subspace?


Homework Equations


I already proved the subset is not closed under addition so I know it's not a vector subspace, however, the answer my teacher marked as correct reads: "No, it's closed under the product but not under addition."


The Attempt at a Solution


Let Pb and Pc be elements of a subset of P= {a0 + a1x + a2x2 + ... + annn} with their coefficients given by any series in function of n (this is an assumption I'm not sure I can make but I find no other way to tackle the product step without making it).

Addition:
Pb + Pc = {b0+c0 + (b1+c1)x + ... + (b3+c3)x3 + ... + (bn+cn)xn}
where
(b1+c1)(b3+c3)≤0
if
(b1+c1)≤0 and (b3+c3)≥0
or
(b1+c1)≥0 and (b3+c3)≤0

Therefore, it is not closed under addition.
I don't get what your logic is here.

Product:
Pb * Pc = {b0c0 + (b1c1)x + ... + (b3c3)x3 + ... + (bncn)xn}
where
(b1c1)(b3c3)≤0
if
(b1c1)= 0
and/or
(b3c3)= 0
(because of their positions in the series).

Therefore, it is not closed under the product.

Was the assumption mistaken? If so, can you give me a clue how to prove that it is/isn't closed under the product?
You want to show that subset P has to be closed under scalar multiplication. That is, if p ∈ P and r ∈ R, then (rp) ∈ P.
 
  • #3
Thank you for replying. I know, I realized after two hours that I needed to use scalar product and not whatever I was doing, lol. How would you do the first part, though? I suck at this type of problems :/.
 
  • #4
Since you're trying to disprove a statement, all you need to do is find a single counterexample. So first assume
\begin{align*}
p_b &= b_0 + b_1x + b_2x^2 + \cdots + b_n x^n \in P \\
p_c &= c_0 + c_1x + c_2x^2 + \cdots + c_n x^n \in P \\
\end{align*} which means ##b_1b_3 \le 0## and ##c_1c_3 \le 0##. Then form the sum
$$ p = p_b + p_c = (b_0+c_0) + (b_1+c_1)x + (b_2+c_2)x^2 + \cdots + (b_n+c_n)x^n.$$ You want to show there exists a case where ##(b_1+c_1)(b_3+c_3) \gt 0## which would imply that p is not an element of P. In other words, find specific numbers for b1, b3, c1, and c3 that satisfy those three conditions.
 

FAQ: Linear algebra: Vector subspaces

What is a vector subspace?

A vector subspace is a subset of a vector space that follows all the properties of a vector space, such as closure under addition and scalar multiplication. It can be thought of as a smaller space within the larger vector space.

How do you determine if a set of vectors is a subspace?

To determine if a set of vectors is a subspace, you need to check if it follows three conditions: it must contain the zero vector, it must be closed under addition, and it must be closed under scalar multiplication. If all three conditions are met, then the set of vectors is a subspace.

Can a subspace have infinitely many dimensions?

Yes, a subspace can have infinitely many dimensions. This means that there are infinitely many linearly independent vectors that span the subspace. However, the subspace can still be contained within a larger vector space with even more dimensions.

How are vector subspaces used in linear algebra?

Vector subspaces are used in linear algebra to study the properties and behavior of linear transformations. They help us understand how linear systems behave and can be used to solve complex problems in physics, engineering, and other fields.

Are all vector spaces also subspaces?

Yes, all vector spaces are also subspaces. This is because a vector space is a set of vectors that follow specific properties, and a subspace is a subset of a vector space that also follows those properties. So, by definition, a vector space is a subspace of itself.

Back
Top