Is this well-defined in the rational numbers

  • Thread starter Thread starter iNCREDiBLE
  • Start date Start date
  • Tags Tags
    Numbers Rational
AI Thread Summary
The discussion focuses on proving that the operation (a,b) + (c,d) = (a+c, b+d) is not well-defined in the rational numbers. Participants emphasize the importance of providing a counter-example to demonstrate that the operation fails to maintain equivalence under certain conditions. The equivalence relation for rational numbers is defined by the condition ab' = a'b, which partitions ordered pairs into equivalence classes. A suggested counter-example involves pairs (1,2) and (1,3) being equivalent to (1,2) and (2,6), respectively, but their sums do not yield equivalent results. The conversation underscores the necessity of finding specific examples to illustrate the failure of the operation's well-defined nature.
iNCREDiBLE
Messages
128
Reaction score
0
Need help with proving:

Show that (a,b) + (c,d) = (a+c, b+d) is not well-defined in the rational numbers.
[Note: (a,b) + (c,d) = (ad+bc, bd) is well-defined because (a,b) is related to (c,d) when ad = bc.)]
 
Physics news on Phys.org
Have you tried at all? Do you know what it means to fail to be well-defined?
 
Hurkyl said:
Have you tried at all? Do you know what it means to fail to be well-defined?

I know what it means. But is it enough with just stating an example?
 
When proving a general statement is not true, yes, it is sufficient to give a "counter-example": one case showing for which the statement is not true, thus proving it is not always true.

What you need to do is find an example of rational numbers (a,b),(a',b'),(c,d),(c',d') such that (a,b) and (a', b') are equivalent, (c,d) and (c',d') are equivalent, but (a+c,b+d) is not equivalent to (a'+c', b'+d').

(For those who are not clear on this, this is using a method of defining rational number from the integers by saying that two ordered pairs of integers, (a,b) and (a',b') (with second integer non-zero) are equivalent if and only if ab'= a'b. That is an equivalence relation and so partitions the set of all such pairs into equivalence classes. A rational number is such an equivalence class.)
 
HallsofIvy said:
When proving a general statement is not true, yes, it is sufficient to give a "counter-example": one case showing for which the statement is not true, thus proving it is not always true.

What you need to do is find an example of rational numbers (a,b),(a',b'),(c,d),(c',d') such that (a,b) and (a', b') are equivalent, (c,d) and (c',d') are equivalent, but (a+c,b+d) is not equivalent to (a'+c', b'+d').

(For those who are not clear on this, this is using a method of defining rational number from the integers by saying that two ordered pairs of integers, (a,b) and (a',b') (with second integer non-zero) are equivalent if and only if ab'= a'b. That is an equivalence relation and so partitions the set of all such pairs into equivalence classes. A rational number is such an equivalence class.)

That's just what I did, I wasn't just sure if that was enough.. :bugeye:
 
Out of curiosity then, what was your counter-example?
 
HallsofIvy said:
Out of curiosity then, what was your counter-example?
(1,2) ~ (1,2) and (1,3) ~ (2,6).
 
Back
Top