Is the Set of Pairs of Real Numbers with Non-Negative First Term a Vector Space?

trixitium
Messages
7
Reaction score
0

Homework Statement



Determine if the following set is a vector space under the given operations. List all the axioms that fail to hold.

The set of all pairs of real numbers of the form (x,y), where x >= 0, with the standard operations on R^2

Homework Equations



The Attempt at a Solution



By the axioms of a vector space the set fail on hold this axiom:

for each u in V, there is an object -u in V, called negative of u, such that u + (-u) = (-u) + u = 0.

If the x term in the pair (x,y) is positive (or zero) then -u = (-x, -y) can not exists. Thus, the negative of u does not exist, and V is not a vector space.

Is this correct?
 
Physics news on Phys.org
trixitium said:

Homework Statement



Determine if the following set is a vector space under the given operations. List all the axioms that fail to hold.

The set of all pairs of real numbers of the form (x,y), where x >= 0, with the standard operations on R^2

Homework Equations



The Attempt at a Solution



By the axioms of a vector space the set fail on hold this axiom:

for each u in V, there is an object -u in V, called negative of u, such that u + (-u) = (-u) + u = 0.

If the x term in the pair (x,y) is positive (or zero) then -u = (-x, -y) can not exists. Thus, the negative of u does not exist, and V is not a vector space.

Is this correct?

It's OK as far as you went, but you have some more work to do. You need to check all the axioms. There is at least one more that isn't satisfied.
 
It also fails in:

K is any scalar, u is in V, ku is in V.

u = (x,y)

If I choose k < 0, then ku = k(x,y) = (kx,ky) and kx < 0 and ku is not in V.
 
Note that if the problem had asked only if this was a vector space, you could have stopped after showing one axiom did not hold. But this problem specifically asks you to list all axioms that do not hold.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top