ordered pairs/n-tuples as collections of sets
- From: Elotemuygrande <john@xxxxxxxxxxxxxx>
- Date: Sun, 03 Jul 2005 10:37:21 GMT
Suppose you define a 2-tuple this way, which I just found in a book.
T=(a,b)={{a}, {a,b}}Is there a way to express T_1 and T_2, the first and second elements of the tuple in terms of standard operations on sets like intersection and union and such instead of the gibberish found on http://en.wikipedia.org/wiki/Ordered_pair ? Yes, the gibberish makes sense to me, but it doesn't feel right saying it that way. The ideas I've come up with so far break down, especially when a=b. The book I'm looking through just says thank God we're not doing it this way in this book and no detailed explanation. I'm also thinking about how to define n-tuples without nasty nested pairs.
Any links or ideas appreciated, this is just arm-chair math thinking. .
- Follow-Ups:
- Re: ordered pairs/n-tuples as collections of sets
- From: Stephen J. Herschkorn
- Re: ordered pairs/n-tuples as collections of sets
- From: The Qurqirish Dragon
- Re: ordered pairs/n-tuples as collections of sets
- From: William Elliot
- Re: ordered pairs/n-tuples as collections of sets
- From: David C . Ullrich
- Re: ordered pairs/n-tuples as collections of sets
- Prev by Date: Re: Cantor and the binary tree
- Next by Date: Re: Distribution for the derivative of a normally distributed rv
- Previous by thread: Re: Inconsistent sets
- Next by thread: Re: ordered pairs/n-tuples as collections of sets
- Index(es):