Bourbaki

Definition 9

Tag 03HN, permanent. Cite it as [Bourbaki, Tag 03HN].

Theory of Sets, chapter II, § 3. Correspondences

A graph F is said to be a functional graph if for each x there is at most one object which corresponds to x under F (Chapter I, § 5, no. 3). A correspondence f=(F,A,B)f = (\mathrm{F}, \mathrm{A}, \mathrm{B}) is said to be a function if its graph F is a functional graph and if its source A is equal to its domain pr1F\mathrm{pr}_1\mathrm{F}. In other words, a correspondence f=(F,A,B)f = (\mathrm{F}, \mathrm{A}, \mathrm{B}) is a function if for every x belonging to the source A of f the relation (x,y)∈F(x, y) \in \mathrm{F} is functional in y (Chapter I, § 5, no. 3); the unique object which corresponds to x under f is called the value of f at the element x of A, and is denoted by f(x)f(x) (or fxf_x, or F(x)\mathrm{F}(x), or Fx\mathrm{F}_x).

If ff is a function, F its graph, and xx an element of the domain of ff, the relation y=f(x)y = f(x) is then equivalent to (x,y)∈F(x, y) \in \mathrm{F} (Chapter I, § 5, no. 3, criterion C46).

Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.

Cited by

Cites

Transcribed from the printed edition, 2004, Springer. Not translated.