Question about a minor recasting of Dedekind cuts.
|
|
Thread rating:  |
riderofgiraffes - 20 Jul 2007 11:17 GMT I've been explaining various constructions to a maths club. I've constructed the integers as equivalence classes of pairs of natural numbers, where (a,b) == (c,d) if a+d=b+c, and I've constructed the rationals similarly with ad=bc. Now I'm constructing the reals in two ways.
Firstly I've used Cauchy sequences, equivalent if their difference goes to zero. Easy enough. With Cauchy sequences the limit doesn't have to exist in the set from which the elements are drawn - easy to prove.
Then I've used Dedekind cuts, but it's proving really, really messy. I want to define the negative, and subtraction, but having the limit point (if it exists) in only one set means all sorts of nasty conditions. Try it. Try to define the quotient of two Dedekind cuts.
Why not simply say this:
A D-cut of the rationals is a pair of sets A,B such that:
(using u for union, n for intersection, e for element ) a in A, b in B => a<=b AuB = Q (q e AnQ) & (a e A => a<=q) => q in B (q e BnQ) & (b e B => q<=b) => q in A
Using shorter notation:
A <= B AuB = Q A<=q & q e A => q e B q e B & q<=B => q e A
Now everything follows simply from the concept that if A and B intersect then the intersection is the rational they define, and if not, then the irrational they define is "between" them. Now all the arithmetic operations go through without messy case analyses.
Thoughts?
Brian M. Scott - 20 Jul 2007 23:10 GMT On Fri, 20 Jul 2007 06:17:01 EDT, riderofgiraffes <mathforum.org_am@solipsys.co.uk> wrote in <news:27572844.1184926651954.JavaMail.jakarta@nitrogen.mathforum.org> in alt.math.undergrad:
[...]
> Then I've used Dedekind cuts, but it's proving > really, really messy. I want to define the > negative, and subtraction, You don't need to define subtraction; just define addition and the negative.
> but having the limit point (if it exists) in only one set > means all sorts of nasty conditions. Try it. I've taught it; it's not *that* bad. Define a Dedekind cut in Q to be a non-empty, proper subset C of Q with the following properties:
(1) if p < q in C, then p in C (i.e., C is downward closed), and (2) C has no maximum element. At some point you have to show that for any cut C and any positive rational e there are p in C and q in Q\C such that q - p <= e, but this is easy. If it failed for some e > 0, then for every p in C we'd have p + e in C, and it would follow from the Archimedean property of Q and the downward closure of C that C = Q, which is impossible. For cuts C and D let S(C, D) = {c + d : c in C, d in D}. Clearly S(C, D) is non-empty. Choose p in Q\C and q in Q\D; clearly c + d < p + q for all c in C and d in D, so p + q is not in S(C, D), which is therefore a proper subset of Q.
Now fix c in C and d in D, and suppose that p in Q satisfies p < c + d. Let q = c + d - p; q is a positive rational, so d - q is in D, and p = c + (d - q) is in S(C, D), which is therefore downward closed.
It's possible that S(C, D) has a maximum element m. If so, let C + D = S(C, D)\{m}; this is clearly a cut. If not, just let C + D = S(C, D).
Let Z = {q in Q : q < 0}; this is clearly a but, and for any cut C we have C + Z = S(C, Z) = C, so Z is the zero cut.
For any cut C let M(C) = {-q : q in Q\C}. If M(C) has a maximum element m, let -C = M(C)\{m}, and otherwise let -C = M(C); it's easy to check that -C is a cut. If -C = M(C), then S(C, -C) = {c + d : c in C, -d in Q\C} = {c - d : c in C, d in Q\C}; this is clearly a subset of the negative rationals, and the result mentioned immediately after the definition of cut above easily implies that it is precisely the set of negative rationals, so that C + (-C) = S(C, -C) = Z. Otherwise M(C) = {-q : q in Q\C} has a maximum element m, and it's not hard to see that C + (-C) = S(C, -C) = S(C, M(C)) = {c + m : c in C} = Z.
> Try to define the quotient of two Dedekind cuts. Unnecessary: you need only define multiplication and the reciprocal. (Admittedly this is a bit messier than addition and the negative, but the mess has more to do with the nature of multiplication than with any endpoint problems.)
> Why not simply say this:
> A D-cut of the rationals is a pair of sets A,B > such that:
> (using > u for union, [quoted text clipped - 5 lines] > (q e AnQ) & (a e A => a<=q) => q in B > (q e BnQ) & (b e B => q<=b) => q in A
> Using shorter notation:
> A <= B > AuB = Q > A<=q & q e A => q e B > q e B & q<=B => q e A
> Now everything follows simply from the concept > that if A and B intersect then the intersection > is the rational they define, and if not, then > the irrational they define is "between" them. > Now all the arithmetic operations go through > without messy case analyses.
> Thoughts? It's no improvement. Suppose that (A, B) and (C, D) are cuts in this new sense. At some point you'll have to define (A, B) + (C, D). Let (L, R) be this cut; how will you define L and R? It doesn't work simply to let L = {a + c : a in A, c in C} and R = {b + d : b in B, d in D}: if x is an irrational number, (A, B) corresponds to x, and (C, D) corresponds to -x, this definition will give you L = {q in Q : q < 0} and R = {q in Q : q > 0}, and (L, R) won't be a cut. More generally, this attempted definition of the sum will fail whenever (A, B) and (C, D) correspond to irrational numbers whose sum is rational. You'd actually have to define (A, B) + (C, D) as follows.
First define L and R as I did in the previous paragraph. If L U R = Q, set (A, B) + (C, D) = (L, R); otherwise set (A, B) + (C, D) = (Q\R, Q\L). Then you'll have to prove that in each case you actually do get a cut, which isn't entirely trivial.
Brian
riderofgiraffes - 21 Jul 2007 20:37 GMT > On Fri, 20 Jul 2007 06:17:01 EDT, riderofgiraffes > <mathforum.org_am@solipsys.co.uk> wrote in [quoted text clipped - 128 lines] > (C, D) are cuts in this new sense. At some > point you'll have to define (A, B) + (C, D).
> Let (L, R) be this cut; how will you define > L and R? It doesn't work simply to let [quoted text clipped - 5 lines] > sum is rational. You'd actually have to > define (A, B) + (C, D) as follows. (snip)
I don't think I do.
What I was thinking of is this. Let's think about addition. This will also work with multiplication if we restrict ourselves to the positives.
For each of our cuts (A,B) and (C,D) take a range (a,b) and (c,d) that in each case spans the "gap" and doesn't include 0 (if you can't then the "gap" is 0, and that's an easy case).
Let A' = A n (a,oo) B' = (oo,b) n B etc
We're taking a small neighbourhood of the "number" being represented.
Compute the sums (or products) L'=A'+C' (in the obvious way) and R'=B'+D'.
Extend L' to L and R' to R in the obvious ways.
L = L' u (oo,l) for any l e L' R = R' u (r,oo) for and r e R'
Our only problem is if LuR is not all of Q. If not, just add Q/L/R to both of L and R. Now we're done.
That seems cleaner and more intuitive to me. The fact that I can say "in the obvious way" so often suggests to me that this is more "natural". The proofs of the necessary properties follow simply, although there is, as will all these things, a lot of detail.
Further (sensible) thoughts welcome.
(The above is copied/reworked from sci.math. Although I originally intended the discussion to happen here, I accidently posted there first. Perhaps we should go there. I'm willing to work in both if it helps - it was my mistake. )
Brian M. Scott - 21 Jul 2007 22:08 GMT On Sat, 21 Jul 2007 15:37:39 EDT, riderofgiraffes <mathforum.org_am@solipsys.co.uk> wrote in <news:23809795.1185046690166.JavaMail.jakarta@nitrogen.mathforum.org> in alt.math.undergrad:
>> On Fri, 20 Jul 2007 06:17:01 EDT, riderofgiraffes >> <mathforum.org_am@solipsys.co.uk> wrote in >> <news:27572844.1184926651954.JavaMail.jakarta@nitrogen >> .mathforum.org> >> in alt.math.undergrad: [...]
>>> Why not simply say this:
>>> A D-cut of the rationals is a pair of sets A,B >>> such that:
>>> (using >>> u for union, [quoted text clipped - 5 lines] >>> (q e AnQ) & (a e A => a<=q) => q in B >>> (q e BnQ) & (b e B => q<=b) => q in A
>>> Using shorter notation:
>>> A <= B >>> AuB = Q >>> A<=q & q e A => q e B >>> q e B & q<=B => q e A
>>> Now everything follows simply from the concept >>> that if A and B intersect then the intersection >>> is the rational they define, and if not, then >>> the irrational they define is "between" them. >>> Now all the arithmetic operations go through >>> without messy case analyses.
>> It's no improvement. Suppose that (A, B) and >> (C, D) are cuts in this new sense. At some >> point you'll have to define (A, B) + (C, D).
>> Let (L, R) be this cut; how will you define >> L and R? It doesn't work simply to let >> L = {a + c : a in A, c in C} and >> R = {b + d : b in B, d in D}:
>> ... this attempted definition of the >> sum will fail whenever (A, B) and (C, D) >> correspond to irrational numbers whose >> sum is rational. You'd actually have to >> define (A, B) + (C, D) as follows.
> (snip)
> I don't think I do.
> What I was thinking of is this. Let's think > about addition. This will also work with > multiplication if we restrict ourselves to > the positives.
> For each of our cuts (A,B) and (C,D) take a > range (a,b) and (c,d) that in each case spans > the "gap" and doesn't include 0 (if you can't > then the "gap" is 0, and that's an easy case).
> Let > A' = A n (a,oo) > B' = (oo,b) n B > etc
> We're taking a small neighbourhood of the > "number" being represented.
> Compute the sums (or products) L'=A'+C' > (in the obvious way) and R'=B'+D'. By 'in the obvious way' I assume that you mean X + Y = {x + y : x in X & y in Y}; note that while there is nothing more obvious than this, I have found that undergraduates don't always find it particularly obvious.
> Extend L' to L and R' to R in the obvious ways.
> L = L' u (oo,l) for any l e L' > R = R' u (r,oo) for and r e R'
> Our only problem is if LuR is not all of Q. > If not, just add Q/L/R to both of L and R. Q/L/R? I assume that this is an error for (Q\L)\R, which in this setting is probably more perspicuously written Q\(L U R).
> Now we're done. But you're not: you have to prove that it all makes sense. In particular, you have to show that the result doesn't depend on the choice of a, b, etc., and you have to show that if (L, R) isn't a cut, then
(L U Q\(L U R), R U Q\(L U R)) is one. Alternatively, and possibly slightly easier -- I haven't bothered to think it through -- you have to show that if (L, R) isn't a cut, then (Q\R, Q\L) is.
What you have here is in fact exactly what I described above, except that you've introduced the additional complication of restricting the cuts to (a, b) and (c, d) before adding and then having to extend the (partial) sum to a cut, thereby considerably increasing the amount of detail to be checked.
> That seems cleaner and more intuitive to me. And to me it seems both messier and less intuitive, even without the extraneous intervals (a, b), etc. You've not eliminated the need to consider more than one case, and the reason for the extra case is a bit less obvious.
[...]
> (The above is copied/reworked from sci.math. > Although I originally intended the discussion > to happen here, I accidently posted there first. > Perhaps we should go there. I'm willing to > work in both if it helps - it was my mistake. ) I've not read sci.math in years and really prefer to keep it that way.
Brian
riderofgiraffes - 21 Jul 2007 23:10 GMT >>>> A D-cut of the rationals is a pair of sets A,B >>>> such that:
>>>> A <= B >>>> AuB = Q [quoted text clipped - 50 lines] > By 'in the obvious way' I assume that you > mean X + Y = {x + y : x in X & y in Y}; Yes.
> note that while there is nothing more > obvious than this, I have found that > undergraduates don't always find it > particularly obvious. Hmm. That surprises me. Perhaps I'm dealing with people who have met this sort of idea before. Passing operations to sets by taking sets of results is well-known to them. I note your comment.
Moving on ...
>> Extend L' to L and R' to R in the obvious ways. > [quoted text clipped - 7 lines] > (Q\L)\R, which in this setting is probably > more perspicuously written Q\(L U R). Noted, and agreed. Sorry.
>> Now we're done. > > But you're not: you have to prove that it > all makes sense. We're done for the definitions. The problem I find with the usual approach is that the definitions are messy. The aim here is to create a definition that's fairly simple to understand, intuitively clear, and then the construction of the required proofs is quite straight-forward.
Maybe messy is the wrong word. Asymmetric, with a hint of the arbitrary.
> In particular, you have to show that the > result doesn't depend on the choice of > a, b, etc., That's trivial.
> ... and you have to show that if (L, R) > isn't a cut, then > > (L U Q\(L U R), R U Q\(L U R)) > > is one. I think that's also pretty simple.
I note that there are many more details to check, and that these are just the first examples you've mentioned. Others may be more difficult, but I don't think they are. Like you, I'm not at the stage checking all the details.
> Alternatively, and possibly slightly > easier -- I haven't bothered to think > it through -- you have to show that if > (L, R) isn't a cut, then (Q\R, Q\L) is. That's an interesting idea. Perhaps even proving it's equivalent is useful.
> What you have here is in fact exactly > what I described above, except that you've [quoted text clipped - 4 lines] > considerably increasing the amount of > detail to be checked. For addition and positive multiplication it's not actually necessary to make the restriction. It's useful when defining division directly, something that's possible in this formulation, and which is exactly like the obviously simpler cases of addition and multiplication.
To my mind the details to check are based on simpler definitions, and therefore easier to accomplish.
>> That seems cleaner and more intuitive to me. > [quoted text clipped - 4 lines] > than one case, and the reason for the > extra case is a bit less obvious. I note and accept that you don't find it easier.
I like the symmetry of this formulation. The fact that one doesn't arbitrarily decide that the cuts corresponding to the rationals have an end-point in one of the sets. Everything is a single case, except for the one extra case where irrationals combine to make a rational. By its very nature that's always going to be a "special" case.
I wonder if perhaps you find this alternative formulation less intuitive because you are familiar with the other, and I dislike the other because of the asymmetry, which I think is unnecessary.
>> ... sci.math ... > > I've not read sci.math in years and really > prefer to keep it that way. It's not bad with strong filtering, but I take your point, and will continue to "chat" here. I'm finding your comments useful and helpful.
Thank you.
Brian M. Scott - 24 Jul 2007 01:42 GMT On Sat, 21 Jul 2007 18:10:52 EDT, riderofgiraffes <mathforum.org_am@solipsys.co.uk> wrote in <news:26515937.1185055882622.JavaMail.jakarta@nitrogen.mathforum.org> in alt.math.undergrad:
[...]
>> In particular, you have to show that the >> result doesn't depend on the choice of >> a, b, etc.,
> That's trivial. But it's still one more step, a complication that's not present in the usual approach. (In passing I note that when I teach our undergraduate abstract algebra course, one of the hardest ideas to get across is the necessity of checking that things are well-defined.)
>> ... and you have to show that if (L, R) >> isn't a cut, then
>> (L U Q\(L U R), R U Q\(L U R))
>> is one.
> I think that's also pretty simple. But it's again a complication that isn't present at all in the usual treatment. And there's so much detail to be checked in *any* rigorous version that it seems highly desirable not to introduce any unnecessary complications.
[...]
>> What you have here is in fact exactly >> what I described above, except that you've [quoted text clipped - 4 lines] >> considerably increasing the amount of >> detail to be checked.
> For addition and positive multiplication it's > not actually necessary to make the restriction. > It's useful when defining division directly, > something that's possible in this formulation, > and which is exactly like the obviously simpler > cases of addition and multiplication. On the whole I consider defining division and subtraction directly to be extravagances, extras that just aren't worth the time (except perhaps as homework exercises). But direct definition of division in the traditional approach isn't bad anyway. If A and B are positive cuts, then A/B = {a/b : a in A & b not in B & a > 0}; the cases in which at least one of A and B is not positive can be defined from this and the negative.
> To my mind the details to check are based on > simpler definitions, and therefore easier to > accomplish. I don't see that your definitions are simpler. Your definition of cut is at least as complicated as the traditional one, and your definition of addition is more complicated than the usual one. I made it too complicated in my original post; it works perfectly well to define A + B in the obvious way for cuts A and B as I defined them, and no adjustment is ever necessary. Multiplication of positive cuts also requires no adjustments.
>>> That seems cleaner and more intuitive to me.
>> And to me it seems both messier and less >> intuitive, even without the extraneous >> intervals (a, b), etc. You've not >> eliminated the need to consider more >> than one case, and the reason for the >> extra case is a bit less obvious.
> I note and accept that you don't find it easier.
> I like the symmetry of this formulation. The > fact that one doesn't arbitrarily decide that [quoted text clipped - 4 lines] > rational. By its very nature that's always > going to be a "special" case. In the traditional approach as I outlined it earlier, this *isn't* a special case.
> I wonder if perhaps you find this alternative > formulation less intuitive because you are > familiar with the other, I don't think that either is significantly more intuitive, though I do think that your version does a little violence to the intuition behind the word 'cut'. My objections to yours are paedagogical and practical: I think that it would be harder to teach at an elementary level, and I think that it's messier in that it requires checking more details.
> and I dislike the other because of the asymmetry, which I > think is unnecessary. I will take simpler over more symmetric any day!
[...]
Brian
riderofgiraffes - 22 Jul 2007 11:50 GMT > What you have here is in fact exactly > what I described above, except that [quoted text clipped - 5 lines] > increasing the amount of detail to be > checked. I've re-re-read what you've written, and it is becoming clearer. I think what you're doing is not thinking of these things as pairs of sets, but simply thinking of the left hand side of the disjoint union, and letting the right hand side pretty much always be implicit.
In short, I think that in what you do, the term "cut" is misleading.
However, I agree that what you're doing is pretty much the same as what I'm doing, and setting up an equivalance is fairly simple. Thinking of "Lower Sets" or "Down Sets" or "Lefties" or whatever name you give them, seems to allow the intuition to work better. Thinking of them as "cuts" seems to create the asymmetry, and the work.
I'll think about this some more.
Thank you.
Brian M. Scott - 22 Jul 2007 22:02 GMT On Sun, 22 Jul 2007 06:50:17 EDT, riderofgiraffes <mathforum.org_am@solipsys.co.uk> wrote in <news:32831785.1185101447708.JavaMail.jakarta@nitrogen.mathforum.org> in alt.math.undergrad:
>> What you have here is in fact exactly >> what I described above, except that [quoted text clipped - 5 lines] >> increasing the amount of detail to be >> checked.
> I've re-re-read what you've written, and it > is becoming clearer. I think what you're [quoted text clipped - 3 lines] > letting the right hand side pretty much > always be implicit. That's the way I prefer to present (and think about) the standard approach; since the right side is always the complement of the left side, it's pretty much excess baggage. I was not taking that view, however, when I was thinking about your symmetric version.
> In short, I think that in what you do, the > term "cut" is misleading. As with a lot of mathematics, it depends on whether you look at the finished product or at the intuition that led to it. In presenting the material to students I would certainly start with the intuitive notions of 'holes' and (two-sided) cuts. Then I'd point out that the 'non-holes' are actually a bit awkward to deal with, because one has to decide what to do with the existing point. If one thinks of cutting as producing a partition, there are just two reasonable choices: one can agree always to put it into the left side or always to put it into the right side. (Here I'd probably point out the analogy with the obvious conventions for making decimal representations unique: allowing terminal 9999... but not terminal 0000... corresponds to putting each rational into its left side, and the opposite convention corresponds to putting each rational into its right half.) Whichever convention we adopt, it's clear a cut is completely determined by either side, so we might as well simplify the notation by keeping track of only one side. Finally, I'd suggest to the students that we might as well keep track of the side that always looks 'the same', i.e., the one that never has an endpoint.
If one is willing to relax one's intuitive notion of cut enough to allow it to produce not-quite-partitions, two further possibilities suggest themselves. One is your version; the other would omit the rational from *both* sides. (I suppose that informally these correspond respectively to using a knife so fine that it cuts right through the middle of the rational and splits it into two pieces, one in each side, and to using a slightly dull knife that just obliterates the rational!) In these versions it's still true that either side determines the other, but the relationship is a bit messier, so there's more reason to keep both.
> However, I agree that what you're doing is > pretty much the same as what I'm doing, and > setting up an equivalance is fairly simple. Indeed, if my left sides are defined so that they never have a maximum element, they're just the complements of the right sides of your symmetric version.
[...]
I'll look at your other post later.
Brian
David W. Cantrell - 25 Jul 2007 04:20 GMT > I've been explaining various constructions to a maths club. [snip]
> Then I've used Dedekind cuts, but it's proving really, really messy. [snip]
> Thoughts? Sorry to have joined this thread late. You've already gotten good replies from Dik Winter in sci.math and Brian Scott in alt.math.undergrad. But I think you'd be interested in what John Horton Conway had to say, and so I quote a passage from his "The Surreals and the Reals". Of course I agree with most of what he says; otherwise I won't have taken the trouble to quote it. I've inserted one comment in brackets; my other two comments are given below the quotation. Conway's article appears on pp. 93-103 of _Real Numbers, Generalizations of the Reals, and Theories of Continua_, P. Ehrlich, ed. (Kluwer, 1994). From page 95:
---------------------------------------------------------------------
| About the step form rationals to reals I have only a few things | to say.The first is that it seems simplest in practice to define a [quoted text clipped - 10 lines] | My final comment is that there is a really big problem with signs | here, that actually makes it quite hard to define multiplication. [One solution to that problem is given in my " Multiplying Dedekind cuts "naturally" " <http://groups.google.com/group/sci.math/msg/ecc01c35f7d1d54a>. But I think that a better solution is what Conway gives in the next paragraph.]
| Most authors split the argument into cases, which I think is | morally wrong -- why did we take the trouble to adjoin signs [quoted text clipped - 10 lines] | I think that this is in fact the simplest way to construct the | real numbers along traditional lines. ... ----------------------------------------------------------------
Comment 1:
The unorthodoxy (A) mentioned by Conway has a counterpart unorthodoxy (B) in which, in the event that the cut corresponds to a rational number q, _neither_ L nor R contains q itself. (Brian has already mentioned both of those unorthodoxies in this thread.) Of course, then L and R do not necessarily partition Q+.
Which is preferable, A or B?
From a philosophical standpoint, I can see arguments both ways. With A, rational cuts are structural different from irrational cuts. One might perceive this as an advantage, saying that "rational" real numbers are _special_ reals and the different structure of the rational cut properly reflects that special status. On the other hand, from an egalitarian viewpoint, one could argue that all real numbers should be structurally the same and so B is preferred.
From a mechanical standpoint, there is also a difference. Suppose we multiply the cut for sqrt(2) with itself. Using A, the product is not "naturally" a cut at all because neither L nor R contain 2, and so we must go in surgically and attach 2 to both L and R. Using B, however, no surgery is needed, the product is naturally what is needed.
I hope my presentation of the arguments was unbiased. But I'm not neutral -- I prefer B.
Comment 2:
I also favor another unorthodoxy: dropping the requirements that L and R, as subsets of Q+, be nonempty and proper. I consider those requirements to be artificial. Once they are dropped, we construct the nonnegative extended reals, [0, +oo], with no more trouble than we would have had in constructing just the positive reals, had the requirements not been dropped. And of course, having constructed [0, +oo], you have also constructed (0, +oo). My point is that, by dropping artificial restrictions, you have also gotten something extra which is useful, and without any additional effort.
David W. Cantrell
Brian M. Scott - 25 Jul 2007 04:36 GMT On 25 Jul 2007 03:20:48 GMT, "David W. Cantrell" <DWCantrell@sigmaxi.net> wrote in <news:20070724232052.646$D0@newsreader.com> in alt.math.undergrad,sci.math:
[...]
> I also favor another unorthodoxy: dropping the > requirements that L and R, as subsets of Q+, be nonempty [quoted text clipped - 7 lines] > artificial restrictions, you have also gotten something > extra which is useful, and without any additional effort. I agree: if you're going to construct the completion of a linear order, you might as well fill the end-gaps as well as the internal gaps. But two of my favorite kinds of object are linearly ordered topological spaces (LOTS's) and generalized ordered spaces (GO-spaces -- which turn out to be just the subspaces of the LOTS's).
Brian
|
|
|