\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Unordered Pairs ›
Needed by:
Multisets ›
Ordered Pair Pathologies ›
Product Sections ›
Set Products ›
Subset Systems ›
Links:
Sheet PDF ›
Graph PDF ›

Ordered Pairs

Why

We want to order two objects.

Definition

Let $a$ and $b$ denote objects. The ordered pair of $a$ and $b$ is the set $\set{\set{a}, \set{a, b}}$. The first coordinate of $\set{\set{a}, \set{a, b}}$ is the object denoted by $a$ and the second coordinate is the object denoted by $b$.

Notation

We denote the ordered pair $\set{\set{a},\set{a,b}}$ by $(a, b)$.

Equality

Our intuition of two objects in order dictates that if we have the same objects in the same order then we have the same ordered pair. Conversely, if we have two identical ordered pairs, they must consist of the same objects in the same location. In other words, two ordered pairs should be equal if and only if they consist of the same objects in the same order. Our definition agrees with this intuition. Indeed,

$(((a, b) = (x, y)) \iff (a = x \land b = y))$1


  1. The proof of this proposition will be found in future editions. ↩︎
Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc — About — Show the old page view