Bourbaki

Proposition 6

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

Theory of Sets, chapter II, § 3. Correspondences

If f is a mapping of A into B, and g is a mapping of B into C, then g∘fg \circ f is a mapping of A into C.

Let F, G be the graphs of ff, gg, respectively, and let us show that G∘F\mathrm{G} \circ \mathrm{F} is a functional graph. Let xx, zz, z′z' be objects such that (x,z)∈G∘F(x, z) \in \mathrm{G} \circ \mathrm{F}, (x,z′)∈G∘F(x, z') \in \mathrm{G} \circ \mathrm{F}. There exist objects yy, y′y' such that

(x,y)∈F,(x,y′)∈F,(y,z)∈G,(y′,z′)∈G.(x, y) \in \mathrm{F}, \qquad (x, y') \in \mathrm{F}, \qquad (y, z) \in \mathrm{G}, \qquad (y', z') \in \mathrm{G}.

Since F is a functional graph, we have y=y′y = y' and hence (y,z′)∈G(y, z') \in \mathrm{G}. Since G is a functional graph, it follows that z=z′z = z', which proves our assertion. Furthermore, the domain of g∘fg \circ f is evidently A, and the proof is complete.

¶ The function g∘fg \circ f may also be written as x→g(f(x))x \to g(f(x)), or as gfgf when there is no risk of confusion.

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

Nothing.

Cites

Nothing.

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