grammar
All checks were successful
ci/woodpecker/push/woodpecker Pipeline was successful

This commit is contained in:
Michael Zhang 2024-09-19 17:31:38 -05:00
parent 2d92966043
commit bc92b2184b

View file

@ -202,7 +202,7 @@ In Agda, we can write it like this:
</div>
Now, the fun part is to show the extra requirements that is needed to show that these two functions indeed form an isomorphisms:
Now, the fun part is to show the extra requirements that are needed to show that these two functions indeed form an isomorphism:
* $f(g(s)) \equiv s$
* $g(f(b)) \equiv b$