I missed this class, so the notes were borrowed from a friend and converted to markdown using ai, and then I added remarks and thoughts;

1. Universal Arrows

Definition

Let  and  be two categories,  a functor, and . A universal arrow from  to  is a pair , where:

  •  is a morphism in 

such that for any object  and any morphism , there exists a unique morphism  in  such that:

“it factors through ” The interesting bit here is that we need a functor from to . Why do we need that? Whenever we have a function from to some “good” object, and by good we mean that it is an image under the functor, then we can factor that function through . Again, why do we need a functor for this definition? What does it add?

2. Construction of Adjoint Functors via Universal Arrows

Proposition

Let  be a functor. If for every object , there exists a universal arrow  from  to , then:

  1.  uniquely extends to a functor .
  2.  is a natural transformation.

What it means is that, for all self loops in , under the natural transformation, they might get mapped to some different object but it remains a self loop?

Proof Outline

  1. Defining Action on Morphisms : Given a morphism  in , consider the composite morphism . By the universal property of , there exists a unique morphism  in  such that:

  2. Functoriality:

    • Identity:  follows from uniqueness applied to .
    • Composition:  follows from the uniqueness of the induced universal arrow.
  3. Naturality of : The defining equation  guarantees that forms a natural transformation .

  4. Uniqueness: If  is another functor agreeing on objects () with natural transformation , then  by uniqueness of universal factorization.

3. Concrete Example: Free Vector Space Functor

Consider the forgetful functor .

  • Left Adjoint (): The Free Vector Space functor .

  • For a set ,  is defined as the set of functions with finite support:

  • Operations are defined pointwise:

  • Basis / Canonical Embedding: Define  for each  as:

    The assignment  defines the universal arrow  in .

4. Formal Definition of Adjunctions

Definition

Let  and  be two categories. An adjunction from  to  is a triple , where:

  •  and  are functors.

  •  is a collection of bijection maps indexed by  and 

  •  is natural in both variables  and . Namely, for any  in  and  in :

Notation

  •  is called the left adjoint to  ().

  •  is called the right adjoint to .

5. Equivalence of Universal Arrows and Hom-Set Adjunctions

Proposition

Let  and  be functors. The existence of a family of universal arrows  for each  is equivalent to specifying an adjunction .

Proof Key Steps

  1. Constructing the Hom-Bijection : Given , define , where  is the unique morphism given by universal property satisfying:

  2. Bijectivity: The inverse map  is given by:

  3. Naturality Verification: To show , apply and precompose with :

    Using the definition of  ():

    By uniqueness of the universal arrow, naturality holds.