Let A,B be subsets of an ordered field F
Let A+B denote the set {(x+y)|x is in A, y is in B)}
Let q=sup A, p=sup B
Show that supA+B = q+p
If this were a test question (which it isn't!), and I turned the following in, what grade do you think would I receive and why?.
Here is what I need to show:
- this says that (q+p) is an upper bound
- this says that nothing less than (q+p) is an upper bound
Here is the proof:
( by definition )
( by definition )
(so (i) is true)
(By definition)
(By definition)
( note: t1 < p t2<q )
So (ii) is true
Therefore sup A+B = q+p
Thanks :-)
I am trying to go thru a book on my own before school starts, but I am always worried because there is no answer key.
That was a cool and short way of doing it
When you add the two inequalities you get sup A+B < sup A+B
BUT, since you demonstrated that you clearly understand the problem, can you read my proof and tell me if it is right. I had no doubt that what i was trying to prove was actually true, but I am not so sure that my proof is right.
Thanks
Don't you need some sort of assumption on the completeness of the field to be sure this exists? Or at least that it is a linear continuum or something?
I think your proof looks okay provided your field is nice enough. you have the inequalities backwards in those two lines under (so (i) is true). Also I think you need to be a little more careful with your proof writing. I am assuming and . When you say let you are only sure that at least one of t1 or t2 is less than p or q respectively. It could be the case that t1=p and t2<q. But the main idea of the proof looks okay to me.
I am just slightly concerned about the lack of assumptions on the field itself, like how do you know for sure that if you have for that there exists some such that ?
Thanks for the reply :-)
I see what you mean about being more clear on t1 and t2, and I cannot believe i put the inequalities backwards - I read over that post many times lol
I don't think so, here is why (warning:this could be quite wrong because I am very tired)
First, and
If didn't exist, then t1 would be an upper bound on A, and p wouldn't be the least upper bound
p could be in the set A too though, so is not an upper bound either. for instance .
I am just kind of worried about like what if there were only two elements in A or something, you might not be able to find an element between the sup and your t1.
I am not sure exactly if there are ordered fields out there like that, all finite fields in the algebraic sense are of the form for a prime p in terms of isomorphism class, but I have no clue what kinds of order topologies could be put on them. I am not sure how one would put a proper ordering on fields like that where something like that could happen.
I am just thinking the field needs to be a linear continuum at least for these two proofs that have been supplied to go through. I am pretty sure the statement has to still be correct; however I am not sure how to prove it without sort of constructing a new element that I cannot be sure necessarily exists.
If , then can't ?
I think that if you can't find an between t1 and then isn't the least upper bound.
In the set {0,1} in an ordered Field, I think you can always pick 1 for x, and no matter what your value of
I don't know what any of these things areI am not sure exactly if there are ordered fields out there like that, all finite fields in the algebraic sense are of the form for a prime p in terms of isomorphism class, but I have no clue what kinds of order topologies could be put on them. I am not sure how one would put a proper ordering on fields like that where something like that could happen.
I think it may be best to do this one by contradiction. Try this on for size.
Say suppose there exists which is an upper bound and which means at least one of the things in parentheses is positive so without loss of generality suppose or in other words, and . But then by your definition of LUB, there exists such that .
Now we consider the point and see that contradicting the fact that was in fact an upper bound for A+B.