Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion chapter1.tex
Original file line number Diff line number Diff line change
Expand Up @@ -200,7 +200,7 @@ \subsection{\textsection2. Functions between sets}
exists an $a = g(b)$ such that $f(a) = b$. Hence $f$ is surjective.

($\impliedby$) Suppose that $f$ is surjective. We want to construct a function
$g:B\to A$ such that $f(g(a)) = a$ for all $a\in A$. Since $f$ is surjective,
$g:B\to A$ such that $f(g(b)) = b$ for all $b\in B$. Since $f$ is surjective,
for all $b\in B$ there is an $a\in A$ such that $f(a) = b$. For each $b\in B$
construct a set $\Lambda_b$ of such pairs:
%
Expand Down