Determine whether the set is a vector space

eyehategod
Messages
82
Reaction score
0
15. Determine wheter the set is a vector space.
The set of all fifth-degree polynomials with the standard operations.
AXIOMS
1.u+v is in V
2.u+v=v+u
3.u+(v+w)=(u+v)+w
4.u+0=u
5.u+(-u)=0
6. cu is in V
7.c(u+v)=cu+cv
8.(c+d)u=cu+cd
9.c(du)=(cd)u
10.1(u)=u

the back of my book says that axioms 1,4,5, and 6 fail. I don't know why 4,5,and 6 fail. Can anyone help me?
 
Last edited:
Physics news on Phys.org
hm..if it fails 1 and 6 shouldn't it also fail 7? o.o...Sorry I can't see a counterexample that 1/4/5/6 fails.

say you have
u=ax^5+bx^4y+cx^3y^2+dx^2y^3+exy^4+fy^5
v=gx^5+hx^4y+ix^3y^2+jx^2y^3+kxy^4+ly^5
where a,b,...,l are arbitrary constants where at least 1 of a,b,...,f and g,h,...,l doesn't equal 0.

does:
f(u+v)=f(u)+f(v)?
f(u+0)=f(u)?
f(u+(-u))=0?
f(cu)=cf(u)?

you can write it them out and I think they do hold, or can you give 1 counter-example that proves it doesn't?
 
Last edited:
Oh boy is that too complicated. 4,5,6 simply fail because 0 is not a 5th degree polynomial, thus there is no 0 to add to u in 4, no 0 for u+(-u) to equal, and 0*u is not a 5th degree poly
 
Notice that the set of all polynomials with degree less than or equal to 5 is a vector space. But here, you must have polynomials of precisely degree 5. The "0" polynomial is not in that set.
 
to matts response:
im still getting use to this abstract way of thinking and am not sure if this is stupid or not. For axiom 4 to pass, does the zero vector have to be a 5th degree polynomial? can't the zero vector just be 0? b/c let's say (x^5+x)+(0)=(x^5+x). Whats wrong with the way I am approaching this?
 
eyehategod said:
to matts response:
im still getting use to this abstract way of thinking and am not sure if this is stupid or not. For axiom 4 to pass, does the zero vector have to be a 5th degree polynomial? can't the zero vector just be 0? b/c let's say (x^5+x)+(0)=(x^5+x). Whats wrong with the way I am approaching this?

Well, first of all, you wrote the axioms in such an unprecise manner, that some of them represent nothing. For example, axiom 4 sould be something like: "There exists 0 in V, such that for every x from V, 0 + x = x + 0 = x", etc, which means that merely by reading the axioms you can get the answers to your questions.

You can't add a polynomial and a number. Of course 0 has to be a polynomial. And since it is not a polynomial of degree 4 (or whatever you defined the space to be, I don't remember right now), it fails to be in the vector space at all.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top