<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Yoneda on stau.space</title><link>https://stau.space/tags/yoneda/</link><description>Recent content in Yoneda on stau.space</description><generator>Hugo</generator><language>en-US</language><managingEditor>sona@stau.space (Sona Tau Estrada Rivera)</managingEditor><webMaster>sona@stau.space (Sona Tau Estrada Rivera)</webMaster><lastBuildDate>Wed, 12 Aug 2026 09:08:13 -0400</lastBuildDate><atom:link href="https://stau.space/tags/yoneda/index.xml" rel="self" type="application/rss+xml"/><item><title>Functional equality</title><link>https://stau.space/posts/func-eq/</link><pubDate>Tue, 11 Aug 2026 10:07:36 +0000</pubDate><author>sona@stau.space (Sona Tau Estrada Rivera)</author><guid>https://stau.space/posts/func-eq/</guid><description>&lt;p&gt;While learning about basic category theory a reocurring question kept coming up again and again:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;How do I know whether two morphisms are equal?&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;This is the question this essay explores.&lt;/p&gt;
&lt;!-- more --&gt;
&lt;p&gt;Let&amp;rsquo;s start somewhere familiar, $\mathbf{Set}$.
We know the morphisms in this category very well, they are just functions.
And we have a very good notion of equality of functions.
Two functions $f : A \to B$ and $g : A \to B$ are equal when for all $x \in A$ we have that $f(x) = g(x)$.
In other words, if when evaluated at every point of $A$ they are equal then we know that $f$ and $g$ are equal.
We don&amp;rsquo;t want equality of functions though, we want to define equality of morphisms.
So, we need to abstract this using categorical terms.&lt;/p&gt;</description></item></channel></rss>