Skip to main content
Mathematics LibreTexts

3.3: Relations between a set and itself

  • Page ID
    95638
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    In the above example, the two sets contained different kinds of things: people, and drinks. But many relations are defined in which the left and right elements are actually drawn from the same set. Such a relation is called (don’t laugh) an endorelation.

    Consider the relation “hasACrushOn" between \(X\) and \(X\), whose intensional meaning is that if \((x,y)\in \text{hasACrushOn}\), then in real life \(x\) is romantically attracted to \(y\). The extension is probably only { (Ron, Hermione), (Hermione, Ron) }, although who knows what goes through teenagers’ minds.

    Another example would be the relation “hasMoreCaloriesThan" between \(Y\) and \(Y\): this relation’s extension is { (Mt. Dew, Dr. Pepper) }. (Fun fact: Dr. Pepper has only 150 calories per can, whereas Mt. Dew has 170.)

    Note that just because a relation’s two sets are the same, that doesn’t necessarily imply that the two elements are the same for any of its ordered pairs. Harry clearly doesn’t have a crush on himself, nor does anyone else have a self-crush. And no soda has more calories than itself, either — that’s impossible. That being said, though, an ordered pair can have the same two elements. Consider the relation “hasSeen" between \(X\) and \(X\). Surely all three wizards have looked in a mirror at some point in their lives, so in addition to ordered pairs like (Ron, Harry) the hasSeen relation also contains ordered pairs like (Ron, Ron) and (Hermione, Hermione).


    This page titled 3.3: Relations between a set and itself is shared under a CC BY-SA 4.0 license and was authored, remixed, and/or curated by Stephen Davies (allthemath.org) via source content that was edited to the style and standards of the LibreTexts platform; a detailed edit history is available upon request.

    • Was this article helpful?