1

In the past, I came across a very elegant definition (below) of a function, which is based on the fundamental concepts of triples, pairs, and sets. However, I find it difficult to search the internet for any citations that I could refer to. One professor once told me that this definition could be over 200 years old, and it might be difficult to determine the author. But I would be satisfied with even citations from reliable sources where this definition was presented or used. Do any of you perhaps recognize any works of this type and could help me?

The function $f= (X,Y,G)$ is an ordered triple consisting of the following elements:

  • a domain $X$ that is any set
  • a codomain $Y$ that is also any set
  • a graph $G \subseteq X\times Y$ being a set of pairs, such that $\forall x \in X, \exists ! y\in Y : (x,y) \in G$

($\exists !$ means "There exists exactly one")

1 Answers1

1

I have seen this formulation quite a few times, though I myself am trying to think about from where altogether. If precisely what you want is a reference for validation, here's at least one located in the footnote of page 2 in the following document.

https://www.heldermann.de/SSPM/SSPM01/Chapter-2.pdf

You are right that this provides an elegant formulation of a function that allows you to unambiguously determine whether a function is surjective or not (as opposed to declaring that the identity function on the rationals is also a function into the reals). However, this doesn't really change how functions are used in practice in any manner.

Sprinkle
  • 1,166
  • And that is precisely another advantage of this definition that nothing needs to be changed regarding the use of the function in practice :) – Kamil Kiełczewski Feb 29 '24 at 09:17