Questions: Ordered Pairs and Cartesian Products

Question 1

A student argues that the set {1, 2} already encodes 'first is 1, second is 2' since it tells you which elements are in the pair. What is wrong with this argument?

• A. Sets cannot contain integers — they can only contain other sets
• B. Sets are unordered: {1, 2} = {2, 1}, so the set alone cannot distinguish which element is first
• C. The Kuratowski definition requires three elements in the encoding, so {1, 2} is incomplete
• D. The set {1, 2} is a valid ordered pair; the Kuratowski definition is just a more formal alternative

Answer: (B)

The defining feature of a set is that membership is all that matters — {1, 2} and {2, 1} are identical. A set cannot encode order because sets have no inherent ordering of elements. To represent ordered pairs using only sets, you need a construction that makes the first and second elements play asymmetric roles. The Kuratowski definition {{a}, {a, b}} achieves this: the singleton {a} identifies the first element, and the pair {a, b} contains both. Given the outer set, you can always recover which is first.

Question 2

What is the Kuratowski set-theoretic encoding of the ordered pair (a, b)?

• A. {a, b}
• B. {{a, b}, b}
• C. {{a}, {a, b}}
• D. {{a}, {b}, {a, b}}

Answer: (C)

The Kuratowski definition is {{a}, {a, b}} — a set containing two sets: the singleton {a} (identifying the first element) and the unordered pair {a, b} (containing both elements). From this outer set you can always recover: the element that appears alone in the singleton is first; the other element is second. This asymmetry gives (a, b) ≠ (b, a) when a ≠ b, because the singleton component differs: {{a},{a,b}} vs. {{b},{b,a}}.

Question 3

The ordered pair (a, a) cannot be properly defined in set theory because both components are identical.

• T. True
• F. False

Answer: False

The Kuratowski definition handles reflexive pairs cleanly: (a, a) = {{a}, {a, a}} = {{a}, {a}} = {{a}} — a set containing just the singleton {a}. This is a perfectly well-defined set that correctly encodes the reflexive pair. Reflexive pairs are not only valid but essential — they appear in the identity relation, diagonal subsets of Cartesian products, and any reflexive relation. The coincidence of both components causes no problem for the set-theoretic encoding.

Question 4

The ordered pair (a, b) and the ordered pair (b, a) are equal as sets whenever a ≠ b, since both encode the same two elements.

• T. True
• F. False

Answer: False

When a ≠ b, (a, b) = {{a}, {a, b}} and (b, a) = {{b}, {b, a}} = {{b}, {a, b}}. These outer sets differ because the singleton components differ: one contains {a}, the other contains {b}. Since a ≠ b, {a} ≠ {b}, so the encodings are different sets — capturing the essential property that swapping elements produces a different pair. The Kuratowski definition succeeds precisely because the singleton breaks the symmetry between the two elements.

Question 5

Why can't a plain set like {a, b} represent an ordered pair, and what does the Kuratowski definition {{a}, {a, b}} accomplish that a plain set cannot?

Model answer: A plain set {a, b} equals {b, a} — sets have no inherent order, only membership. It cannot distinguish which element is first. The Kuratowski definition encodes order by giving a and b asymmetric roles: a appears alone in the singleton {a}, while b only appears alongside a in {a, b}. From the outer set {{a}, {a, b}}, you can always recover which is first (the element in the singleton) and which is second (the remaining element). This means {{a},{a,b}} ≠ {{b},{b,a}} when a ≠ b, capturing the essential property that (a, b) ≠ (b, a).

Order is not primitive in set theory — sets only have membership. To represent any ordered structure (pairs, tuples, functions, sequences) on a set-theoretic foundation, you must construct an encoding that makes order detectable from membership alone. The Kuratowski definition is the standard solution: it reduces the notion of 'first' and 'second' to a structural asymmetry that pure set theory can express.