Takashi's Notes

Home

❯

books

❯

category theory for programmers

❯

Free/Forgetful Adjunctions

Free/Forgetful Adjunctions

Apr 24, 20261 min read

Free/Forgetful Adjunctions

Prev: Adjunctions Next: Monads: Programmer’s Definition

Prev: Adjunctions Next: Monads: Programmer’s Definition

Exercises

  1. Consider a free monoid built from a singleton set as its generator. Show that there is a one-to-one correspondence between morphisms from this free monoid to any monoid m, and functions from the singleton set to the underlying set of m.

Graph View

  • Free/Forgetful Adjunctions
  • Exercises

Backlinks

  • Adjunctions
  • Monads: Programmer’s Definition

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Discord Community