Linear Algebra Polynomial Vector Space

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
7 replies · 3K views
Snippy
Messages
5
Reaction score
0

Homework Statement


Use the subspace theorem to decide which of the following are real vector spaces with the usual operations.

a) The set of all real polynomials of any degree.
b) The set of real polynomials of degree [tex]\leq n[/tex]
c) The set of real polynomails of degree exactly n.


Homework Equations





The Attempt at a Solution



I know how to do b) since the equation for the set of real polynomials of degree [tex]\leq n[/tex] is:
Pn = {a0 + a1x + a2x2 + ... + anx2 | a0, a1, ... , an [tex]\in[/tex] R }

And I can prove that it is closed under addition and scalar multiplication.

But I am not sure what the difference between the equation for b) (at most n) and a) (any n) and c) (= n) is.

Also I know b) is a real vector space but I would've thought that meant c) was too since b) includes degree = n. But the answers say a) is b) is but c isn't.
 
Physics news on Phys.org
you need to check through all the axioms systematically... for c) is there an identity element? and is it closed?
 
Last edited:
My problem is I don't know what the difference between the equations for the 3 different problems is in order to check the axioms.
 
ok so i would read it a polynomial of degree n, is any polynomial given by [itex]P_n = {a_0 + a_1x + a_2x^2 + ... + a_nx^2 | a_0, a_1, ... , a_n \in R}[/itex], when a_n is non-zero.

so
a) contains every Pm, for m = 0 to infinity
b) contains every Pm, for m = 0 to n
c) contains every Pm with m = n

though you also need to assume they contain 0... ie. in the n = 0 case, a_0 can be zero
 
Last edited: