Do Positive Numbers Necessitate the Existence of Their Negative Counterparts?

Click For Summary
The discussion explores whether the existence of positive counting numbers necessitates the existence of their negative counterparts. Participants argue that a bijection can map positive numbers to negative numbers, suggesting a dual relationship. While one participant proposes a construction method for negative integers through permutations, another clarifies that the standard construction is the Grothendieck construction, which involves more complexities. The conversation also touches on the broader applications of permutations in mathematics, particularly in group theory. Overall, the relationship between positive and negative integers is framed as a reflection of ordered sets.
JanEnClaesen
Messages
59
Reaction score
4
If counting/positive numbers exist, do they imply the existence of negative numbers?

I'd say yes, because there's always a bijection that maps the lowest counting number of the set to the highest, then the second lowest to the second highest, etc. This reversal of order/mirroring is possible for any set with a strict order. The negative numbers are then some sort of dual space of the positive numbers. This bijection is a mirror permutation, can the idea of permutation groups be applied more generally to integers/sets?

I apologize for the borderline vague statements.
 
Mathematics news on Phys.org
JanEnClaesen said:
If counting/positive numbers exist, do they imply the existence of negative numbers?

What do you mean with "exists"? Do you somehow want to construct the negative numbers from the positive counting numbers?
 
They certainly exist in any mathematical sense and, yes, they can be constructed from the positive counting numbers- so the negative integers exist in then same sense that the positive integers do.
 
"exists" as in constructing: mapping the highest to the lowest, second highest to the second lowest, etc.
This construction is a permutation, do permutations have a more general use for ordered sets?
 
JanEnClaesen said:
"exists" as in constructing: mapping the highest to the lowest, second highest to the second lowest, etc.
This construction is a permutation, do permutations have a more general use for ordered sets?

That's not the usual construction of the integers. The usual construction is called the Grothendieck construction. It's not that your proposal of constructing the negatives is wrong, but there are annoying details such as defining addition and multiplication and checking the properties.

And yes, permutations are useful outside constructing the integers too. For example, in group theory.
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 11 ·
Replies
11
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
1
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 33 ·
2
Replies
33
Views
6K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 24 ·
Replies
24
Views
6K