Proving the Addition of Dedekind Cuts

  • Thread starter Thread starter hitmeoff
  • Start date Start date
  • Tags Tags
    Addition
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
9 replies · 5K views
hitmeoff
Messages
260
Reaction score
1

Homework Statement


Show that if [tex]\alpha[/tex] and [tex]\beta[/tex] are Dedekind cuts then so is [tex]\alpha[/tex] + [tex]\beta[/tex]={r1+r2: r1 [tex]\epsilon[/tex] [tex]\alpha[/tex] and r2[tex]\epsilon[/tex][tex]\beta[/tex]


Homework Equations





The Attempt at a Solution


If a dedekind cut is a cut whereby the sets on the left side of the cut and the right side of the cut would contain all the rational numbers then the cut itself is an irrational number right? If you add to irrationals don't you get another irrational number, thereby having another cut where the LH U RH still contains all the rationals?
 
Physics news on Phys.org
Have you checked the three properties (non-empty, closed below, and has no greatest rational element)?
 
Not sure, the question was stated as I wrote it.

And this part: [tex]\alpha[/tex] + [tex]\beta[/tex]={r1+r2: r1 [tex]\epsilon[/tex] [tex]\alpha[/tex] and r2[tex]\epsilon[/tex][tex]\beta[/tex]

throws me off... is this to say that alpha is the left hand set and beta the right hand set (or vice-versa) else I am not sure what they mean by r1 in Alpha and r2 in Beta. I thought the alpha and beta's were the actual cuts?
 
Its a "cut" that separates all rationals into two sets and has the props:

1. The sets are non-empty
2. Every rational is in one set or the other
3. Every number in the Left set is less than every number in the Right set.

So is the question stating that Alpha is on set and beta is the other set? If so then I don't know what the mean by Alpha + Beta?
 
Oh, FYI, there is another commonly used definition of Dedekind cut. As compared to your definition, this other definition defines a Dedekind cut as being the left-hand set.

I.E. if (L,R) is a your-Dedekind cut, then L is an other-Dedekind cut. Conversely, if L is an other-Dedekind cut, then (L, Q-L) is a your-Dedekind cut.


Your originally stated problem makes sense with this definition.
 
Hurkyl said:
Oh, FYI, there is another commonly used definition of Dedekind cut. As compared to your definition, this other definition defines a Dedekind cut as being the left-hand set.

I.E. if (L,R) is a your-Dedekind cut, then L is an other-Dedekind cut. Conversely, if L is an other-Dedekind cut, then (L, Q-L) is a your-Dedekind cut.Your originally stated problem makes sense with this definition.

ok, now the problem makes all kinds of sense.

So let [tex]\alpha[/tex] and [tex]\beta[/tex] be dedekind cuts.

WLG [tex]\alpha[/tex] [tex]\subseteq[/tex] [tex]\beta[/tex]

[tex]\forall[/tex]r1 [tex]\epsilon[/tex] [tex]\alpha[/tex] and r2 [tex]\epsilon[/tex] [tex]\beta[/tex] r1+r2[tex]\epsilon[/tex][tex]\beta[/tex] which, by definition has no largest rational?

Note: Damn it, this only works if we are talking about the righ-hand set. Then I don't get how r1 + r2 [tex]\epsilon[/tex] beta and be guaranteed not to have a largest rational since r1 and r2 could be rational elements and this set is bounded above
 
Last edited:
hitmeoff said:
ok, now the problem makes all kinds of sense.

So let [tex]\alpha[/tex] and [tex]\beta[/tex] be dedekind cuts.

WLG [tex]\alpha[/tex] [tex]\subseteq[/tex] [tex]\beta[/tex]

[tex]\forall[/tex]r1 [tex]\epsilon[/tex] [tex]\alpha[/tex] and r2 [tex]\epsilon[/tex] [tex]\beta[/tex] r1+r2[tex]\epsilon[/tex][tex]\beta[/tex] which, by definition has no largest rational?

Note: Damn it, this only works if we are talking about the righ-hand set. Then I don't get how r1 + r2 [tex]\epsilon[/tex] beta and be guaranteed not to have a largest rational since r1 and r2 could be rational elements and this set is bounded above
You don't need to get "r1 + r2 [tex]\epsilon[/tex] beta " and that is not necessarily true. All you need to do is show that [itex]\{ r_1+ r_2| r_\in \alpha, r_2\in \beta\}[/itex] is a cut.

You need to prove:
1) It is non-empty.
2) There is some rational number that is not in it.
3) If x is in the cut and y is not then x< y.
4) It contains no largest number.

The first three are pretty simple. To prove the fourth, by contradiction, suppose it were not true. That is, suppose there exist r which is the largest member of this set. Then there exist [itex]r_1\in \alpha[/itex] and [itex]r_2\in \beta[/itex] such that [itex]r_1+ r_2= r[/itex]. Now use the fact that [itex]\alpha[/itex] and [itex]\beta[/itex] have no largest member.

(I apologize for my first response. I misread the question and didn't realize that you were defining "[itex]\alpha+ \beta[/itex]".)