Is this well-defined in the rational numbers

  • Thread starter Thread starter iNCREDiBLE
  • Start date Start date
  • Tags Tags
    Numbers Rational
Click For Summary

Homework Help Overview

The discussion revolves around the concept of well-defined operations in the context of rational numbers, specifically examining the addition of ordered pairs representing rational numbers.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants explore the definition of well-defined operations and the necessity of providing counter-examples to demonstrate that a proposed operation does not hold universally.

Discussion Status

Some participants have suggested that providing a counter-example is sufficient to prove the operation is not well-defined. Others are seeking clarification on the adequacy of their examples and the underlying definitions involved.

Contextual Notes

There is an emphasis on the equivalence relation used to define rational numbers from ordered pairs of integers, which is central to the discussion of whether the addition operation is well-defined.

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).
 

Similar threads

Replies
2
Views
1K
Replies
5
Views
1K
  • · Replies 23 ·
Replies
23
Views
2K
Replies
2
Views
1K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
Replies
8
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K