We've already introduced the notion of a pair of sets . This object is symmetric insofar that it doesn't give a precedence to either or . One way to formally state this is to observe that
This follows simply from Extensionality: both sets have same elements! On the other hand, it will be of no surprise to you that sometimes we need an object which pairs together and , while keeping the information which one comes first. Let us denote this ordered pair by . According to our guiding principles, this should be another set, just another object in . This means that, even though we have a clear idea what the object is, we need to pick a concrete way to code it within the universe. I say "pick" because there is more than one way to do so and giving the precedence to one over another is basically arbitrary.
So, let us make our choice and define the ordered pair of sets and to be the set
Of course, at first this is just some random definition and we need to check that it behaves the way we would like it to. More precisely, we would like to have that for all sets , it is true that
Compare this with the situation with ordinary (unordered) pairs: if and are two distinct sets, it holds that
I'm not going to write down here the proof of this desired behavior of ordered pairs. The proof is just a tedious application of Extensionality and it would start like the following. We have that and that , so we must have that . Since the only elements of are and , we get that either or . In the first case we get , while in the second we have . This provides us with the fact that , but it still leaves us to struggle to get . You can now struggle on your own if you wish to. 😄
Comments
Post a Comment