Bourbaki

Theorem 1

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

Theory of Sets, chapter II, § 3. Correspondences

Let ff be a mapping of A into B, let f′f' be a mapping of B into C, and let f′′=f′∘ff'' = f' \circ f. Then :

(a) If ff and f′f' are injections, then f′′f'' is an injection. If rr, r′r' are retractions of ff, f′f', respectively, then r∘r′r \circ r' is a retraction of f′′f''.

(b) If ff and f′f' are surjections, then f′′f'' is a surjection. If ss, s′s' are sections of ff, f′f', respectively, then s∘s′s \circ s' is a section of f′′f''.

(c) If f′′f'' is an injection, then ff is an injection. If r′′r'' is a retraction of f′′f'', then r′′∘f′r'' \circ f' is a retraction of ff.

(d) If f′′f'' is a surjection, then f′f' is a surjection. If s′′s'' is a section of f′′f'', then f∘s′′f \circ s'' is a section of f′f'.

(e) If f′′f'' is a surjection and f′f' an injection, then ff is a surjection. If s′′s'' is a section of f′′f'', then s′′∘f′s'' \circ f' is a section of ff.

(f) If f′′f'' is an injection and ff a surjection, then f′f' is an injection. If r′′r'' is a retraction of f′′f'', then f∘r′′f \circ r'' is a retraction of f′f'.

For every set E let IE\mathrm{I_E} denote the identity mapping of E.

(a) We have r∘f=IAr \circ f = \mathrm{I_A} and r′∘f′=IBr' \circ f' = \mathrm{I_B}, hence

(r∘r′)∘(f′∘f)=r∘IB∘f=r∘f=IA.(r \circ r') \circ (f' \circ f) = r \circ \mathrm{I_B} \circ f = r \circ f = \mathrm{I_A}.

If ff and f′f' are injections, then f′′f'' is an injection, by Proposition 8 if A≠∅\mathrm{A} \neq \emptyset, and trivially if A=∅\mathrm{A} = \emptyset.

(b) We have f∘s=IBf \circ s = \mathrm{I_B} and f′∘s′=ICf' \circ s' = \mathrm{I_C}, hence

(f′∘f)(s∘s′)=f′∘IB∘s′=f′∘s′=IC.(f' \circ f)(s \circ s') = f' \circ \mathrm{I_B} \circ s' = f' \circ s' = \mathrm{I_C}.

If ff and f′f' are surjections, f′′f'' is then a surjection by Proposition 8.

(c) We have r′′∘f′′=IAr'' \circ f'' = \mathrm{I_A}, hence (r′′∘f′)∘f=r′′∘f′′=IA(r'' \circ f') \circ f = r'' \circ f'' = \mathrm{I_A}. If f′′f'' is an injection, then ff is an injection, by Proposition 8 if A≠∅\mathrm{A} \neq \emptyset, and trivially if A=∅\mathrm{A} = \emptyset.

(d) We have f′′∘s′′=ICf'' \circ s'' = \mathrm{I_C}, hence f′∘(f∘s′′)=f′′∘s′′=ICf' \circ (f \circ s'') = f'' \circ s'' = \mathrm{I_C}. If f′′f'' is a surjection, then f′f' is a surjection by Proposition 8.

(e) We have f′′∘s′′=ICf'' \circ s'' = \mathrm{I_C}, and f′f' is a bijection by (d). Hence

f∘(s′′∘f′)  =  (f−1′∘f′)∘f∘(s′′∘f′)  =  f−1′∘(f′′∘s′′)∘f′f \circ (s'' \circ f') \;=\; (\overset{-1}{f}{}' \circ f') \circ f \circ (s'' \circ f') \;=\; \overset{-1}{f}{}' \circ (f'' \circ s'') \circ f'
=f−1′∘IC∘f′=f−1′∘f′=IB.= \overset{-1}{f}{}' \circ \mathrm{I_C} \circ f' = \overset{-1}{f}{}' \circ f' = \mathrm{I_B}.

If f′′f'' is a surjection and f′f' an injection, ff is then a surjection by Proposition 8.

(f) We have r′′∘f′′=IAr'' \circ f'' = \mathrm{I_A}, and ff is a bijection by (c). Hence

(f∘r′′)∘f′=(f∘r′′)∘f′∘(f∘f−1)=f∘(r′′∘f′′)∘f−1=f∘IA∘f−1(f \circ r'') \circ f' = (f \circ r'') \circ f' \circ (f \circ \overset{-1}{f}) = f \circ (r'' \circ f'') \circ \overset{-1}{f} = f \circ \mathrm{I_A} \circ \overset{-1}{f}
=f∘f−1=IB.= f \circ \overset{-1}{f} = \mathrm{I_B}.

If f′′f'' is an injection and ff a surjection, then f′f' is an injection, by Proposition 8 if A≠∅\mathrm{A} \neq \emptyset, and trivially if A=∅\mathrm{A} = \emptyset (for then we have B=f⟨A⟩=∅\mathrm{B} = f\langle \mathrm{A}\rangle = \emptyset).

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.