Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix Typos in categories.tex #1152

Merged
merged 2 commits into from
Jan 11, 2024
Merged

Fix Typos in categories.tex #1152

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
48626d2
Fix Typos in categories.tex
niyoushanajmaei Jan 2, 2024
fd00fe5
more consistent punctuation
niyoushanajmaei Jan 4, 2024
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
8 changes: 4 additions & 4 deletions categories.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -339,7 +339,7 @@ \section{Functors and transformations}
\end{lem}
\begin{proof}
If $\gamma$ is an isomorphism, then we have $\delta:G\to F$ that is its inverse.
By definition of composition in $B^A$, $(\delta\gamma)_a\jdeq \delta_a\gamma_a$ and similarly.
By definition of composition in $B^A$, $(\delta\gamma)_a\jdeq \delta_a\gamma_a$ and similarly $(\gamma\delta)_a\jdeq \gamma_a\delta_a$.
Thus, $\id{\delta\gamma}{1_F}$ and $\id{\gamma\delta}{1_G}$ imply $\id{\delta_a\gamma_a}{1_{Fa}}$ and $\id{\gamma_a\delta_a}{1_{Ga}}$, so $\gamma_a$ is an isomorphism.

Conversely, suppose each $\gamma_a$ is an isomorphism, with inverse called $\delta_a$, say.
Expand Down Expand Up @@ -453,7 +453,7 @@ \section{Functors and transformations}
\cref{ct:functor-assoc} is coherent, i.e.\ the following pentagon\index{pentagon, Mac Lane} of equalities commutes:
\[ \xymatrix{ & K(H(GF)) \ar@{=}[dl] \ar@{=}[dr]\\
(KH)(GF) \ar@{=}[d] && K((HG)F) \ar@{=}[d]\\
((KH)G)F && (K(HG))F \ar@{=}[ll] }
((KH)G)F && (K(HG))F \ar@{=}[ll].}
\]
\end{lem}
\begin{proof}
Expand All @@ -468,7 +468,7 @@ \section{Functors and transformations}
\[ \xymatrix{
G\circ (1_B \circ F) \ar@{=}[rr] \ar@{=}[dr] &&
(G\circ 1_B)\circ F \ar@{=}[dl] \\
& G \circ F.}
& G \circ F}
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Wouldn't it be more consistent to keep the period here also, but change the preceding phrase to end with a colon?

\]
\end{lem}

Expand Down Expand Up @@ -551,7 +551,7 @@ \section{Equivalences}
\indexdef{precategory!equivalence of}%
\index{functor!equivalence}%
if it is a left adjoint for which $\eta$ and $\epsilon$ are isomorphisms.
We write $\cteqv A B$ for the type of equivalences of categories from $A$ to $B$.
We write $\cteqv A B$ for the type of equivalences of (pre)categories from $A$ to $B$.
\end{defn}

By \cref{ct:adjprop,ct:isoprop}, if $A$ is a category, then the type ``$F$ is an equivalence of precategories'' is a mere proposition.
Expand Down