Writing down an explicit bijection

[threeder]

Homework Statement

Let X= \{a,b,c\} and Y= \{d,e\}. Write down and explicit bijection N_{|X×Y|} → X×Y

The Attempt at a Solution

Well I came up with the easiest method, just giving one value to each member of N_{|X×Y|} so I was just wondering whether there is another way of doing it not by brute force? :)

 

[HallsofIvy]

Is N_{|X\times Y|} the set of positive integers from 1 to |X\times Y|. Sounds like what you did is the simplest thing to do. X\times Y contains 6 members so, write them in some order assign 1 to the first, 2 to the second, etc.

 

[SteveL27]

Homework Statement

Let X= \{a,b,c\} and Y= \{d,e\}. Write down and explicit bijection N_{|X×Y|} → X×Y

The Attempt at a Solution

Well I came up with the easiest method, just giving one value to each member of N_{|X×Y|} so I was just wondering whether there is another way of doing it not by brute force? :)

One natural way to do this that generalizes to larger sets and Cartesian products with more than two factors is to use the lexicographic order. That's like alphabetical order using whatever order relations happen to be defined on the factors, going left to right in the Cartesian product.

In the above case we'd have:

(a, d)
(a, e)
(b, d)
(b, e)
(c, d)
(c, e)