Mathematical modeling / English

Category Theory: Adjoint Functors Part 1

AbstractNonsense · YouTube · 10:15

YouTube · AbstractNonsenseOriginal video

Selected moment · 5:20 · Chapter markers are time references, not playback progress.

IN THIS VIDEO

01Adjoint functors: basic definition
02Why the isomorphism is a bijection
03Adjunction as a chosen natural isomorphism

FROM THE LEARNING NOTES

F \dashv G \quad \text{if} \quad \mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B)) \text{ naturally in } A,B

Adjoint functors: basic definition

SELECTED MOMENT

Transition to a simple example

SUGGESTED PREPARATION

Functors between categories
Hom-sets
Category of sets
Natural transformation / natural isomorphism
Opposite category
Product category
Basic category theory: categories, functors, objects, and morphisms
Hom-sets $\mathcal{C}(X,Y)$ of morphisms between objects
Composition of morphisms in a category
Notion of natural transformation or naturality of a family of bijections
Basic category theory: categories, functors, and morphisms
Order relations and the notion of a poset viewed as a category
The floor function from real numbers to integers
Basic category theory: categories, functors, natural isomorphism
Order relations and the floor function on real numbers

READ & KEEP

The explanation, unpacked.

Saves 0

Reviewed learning material · Video analysis · English

Read the full overview

This 160-second whiteboard lecture segment introduces adjoint functors in category theory. The lecturer begins with Mac Lane’s remark that “adjoint functors arise everywhere,” then explains the pre-written definition: for oppositely directed functors F:\mathcal{A} $\to\mathcal{B}$ and G:\mathcal{B} $\to\mathcal{A}$ , one writes $F \dashv G$ when there is a natural isomorphism $\mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B))$ in A and B. He clarifies that these are hom-sets, so the isomorphism is a bijection of sets, and that an adjunction is a chosen natural isomorphism. To resolve the apparent mismatch that natural isomorphisms compare same-direction functors, he rewrites the condition equivalently as a natural isomorphism between the curried functors $\mathcal{B}$ (F(-),-) and $\mathcal{A}$ (-,G(-)) from $\mathcal{A}^{op}\times\mathcal{B}$ to SET. The segment ends as he starts a new diagram with $\mathcal{A}$ and $\mathcal{B}$ , but no further completed mathematics appears before the cutoff. This clip introduces adjoint functors through the hom-set isomorphism $\mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))$ , emphasizing that the correspondence must be natural in both variables. The lecturer first explains the object-level action of $F$ and $G$ , then translates the adjunction into the statement that a morphism $A\to G(B)$ is equivalent to a morphism $F(A)\to B$ . In the second half, he unpacks "naturally in $A$ ": for every morphism $h:A'\to A$ , precomposing on the $\mathcal{A}$ -side corresponds to precomposing with $F(h)$ on the $\mathcal{B}$ -side. The main conceptual point is that adjunction is not just a bare bijection of hom-sets but a bijection compatible with composition. This clip gives a concrete example of adjoint functors using the order-categories of integers and real numbers. The lecturer defines $\mathbb{R}$ as the category whose objects are real numbers and whose morphisms $x\to y$ exist exactly when $x\le y$ , then says $\mathbb{Z}$ is defined the same way. He introduces the inclusion functor $I:\mathbb{Z}\to\mathbb{R}$ and the floor functor $F:\mathbb{R}\to\mathbb{Z}$ , states that $I$ is left adjoint to $F$ , and begins writing the hom-set formulation $\mathbb{R}(I(a),b)\cong \mathbb{Z}(a,F(b))$ . This 134-second whiteboard segment gives a concrete example of adjoint functors using the inclusion functor from the integers to the reals and the floor functor from the reals back to the integers. After recalling the general definition of an adjunction already written on the board, the lecturer instantiates it with $a = 2$ and $b = π$ , computes $F(2)=2$ and $G(π)=3$ , and then states the resulting order-theoretic equivalence: for $a \in Z$ and $b \in R$ , a ≤ ⌊b⌋ if and only if $a \le b$ . The clip emphasizes how an abstract categorical adjunction translates into a familiar inequality fact.

Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.

Chapters

0:00Mac Lane quotation and topic introduction 0:06Definition of adjoint functors on the board 0:30Hom-sets, bijections, and chosen natural isomorphisms 0:53Same-direction issue for natural isomorphism 1:05Equivalent functorial formulation using

\mathcal{A}^{op}\times\mathcal{B}\to

SET 2:20Beginning a new diagram with

\mathcal{A}

and

\mathcal{B}

2:40Definition of adjoint functors 3:12Hom-set correspondence

A\to G(B)

vs.

F(A)\to B

3:40What naturality in

A

means 5:20Transition to a simple example 5:50Defining the category of real numbers 6:35Defining the category of integers 6:50Introducing the inclusion and floor functors 7:20Claiming

I\dashv F

and starting the hom-set formula 8:00Prewritten adjunction definition and setup 8:22Choosing the example categories Z and R 8:39Inclusion functor applied to 2 8:51Floor functor applied to π 9:14Adjunction as correspondence of maps 9:30Deriving a ≤ ⌊b⌋ ⇔

a \le b

10:05Closing remark on simplicity of adjoint functors

Learning script

Generated from the video's visuals and explanation; not verbatim speech.

The segment opens with the lecturer invoking Mac Lane’s line that adjoint functors arise everywhere, setting up a formal definition rather than an example.

He turns to the pre-written board statement and introduces two functors $F$ and $G$ between categories $\mathcal{A}$ and $\mathcal{B}$ , explicitly drawing attention to the fact that their arrows point in opposite directions.

The definition is then stated in symbolic form: $F \dashv G$ means that for objects $A \in \mathcal{A}$ and $B \in \mathcal{B}$ there is an isomorphism $\mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B))$ , natural in both variables.

To make the notation concrete, he explains that the two sides are hom-sets, hence sets, so the symbol $\cong$ here means a bijection of sets.

He adds a structural point: an adjunction is not merely the existence of such a correspondence but a chosen natural isomorphism.

Next he anticipates a common confusion. Since natural isomorphism is normally discussed for functors with the same direction, he asks how that can apply when $F$ and $G$ go opposite ways.

The answer is to curry the hom-set expressions. He writes the equivalent condition that $F$ and $G$ are adjoint if and only if the two functors $\mathcal{B}(F(-),-)$ and $\mathcal{A}(-,G(-))$ , both from $\mathcal{A}^{op} \times \mathcal{B}$ to $SET$ , are naturally isomorphic.

He briefly steps back from the notation and emphasizes the purpose of the rewrite: now the objects being compared really are same-direction functors, so “natural isomorphism” is being used in its standard setting.

In the final seconds he begins a new diagrammatic setup by drawing $\mathcal{A}$ and $\mathcal{B}$ again lower on the board, but the clip ends before any further mathematical structure is completed.

The lecture begins from the already-written definition on the board: for categories $\mathcal{A}$ and $\mathcal{B}$ , functors $F:\mathcal{A}\to\mathcal{B}$ and $G:\mathcal{B}\to\mathcal{A}$ are adjoint, written $F\dashv G$ , when $\mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))$ naturally in both variables.

To make the notation concrete, the lecturer points to an object $A$ in $\mathcal{A}$ and says that $F$ sends it to $F(A)$ in $\mathcal{B}$ , while an object $B$ in $\mathcal{B}$ is sent by $G$ to $G(B)$ in $\mathcal{A}$ .

At the morphism level, the adjunction is then paraphrased as a translation rule: a morphism $A\to G(B)$ in $\mathcal{A}$ corresponds to a morphism $F(A)\to B$ in $\mathcal{B}$ . This is the content of the displayed isomorphism of hom-sets.

The lecturer next isolates the word "naturally" and asks what it means for the correspondence to be natural in $A$ .

Naturality in $A$ is explained by testing the correspondence against an arbitrary morphism $h:A'\to A$ . On the $\mathcal{A}$ -side, one may first compose $h$ with a map $A\to G(B)$ , producing a map $A'\to G(B)$ .

On the $\mathcal{B}$ -side, the matching operation is to apply $F$ to $h$ , obtaining $F(h):F(A')\to F(A)$ , and then compose with the corresponding map $F(A)\to B$ .

The condition written on the board is that these two procedures agree under the adjunction bijection: $(A'\xrightarrow{h}A\to G(B))$ in $\mathcal{A}$ corresponds to $(F(A')\xrightarrow{F(h)}F(A)\to B)$ in $\mathcal{B}$ .

Thus, in this clip, "naturally in $A$ " is presented as compatibility with precomposition: the adjunction is not merely a set bijection but one that respects composition in the first variable. The lecturer begins to mention naturality in $B$ at the end, but the clip stops before that case is developed.

The lecturer leaves the general discussion and announces a very simple example meant to make adjoint functors concrete.

He defines a category $\mathbb{R}$ whose objects are real numbers. The morphisms are dictated by the usual order: there is a morphism $x\to y$ exactly when $x\le y$ .

To illustrate the asymmetry, he compares 3 and 4: since $3\le 4$ , there is a morphism $3\to 4$ , but since $4\nleq 3$ , there is no morphism $4\to 3$ .

He then says the category $\mathbb{Z}$ of integers is defined in the same way, again using the order relation to determine morphisms.

Between these two categories he introduces two functors. One is $I:\mathbb{Z}\to\mathbb{R}$ , called the inclusion functor, and the other is $F:\mathbb{R}\to\mathbb{Z}$ , identified with the floor function.

From this setup he states the key claim: $I$ is left adjoint to $F$ , written $I\dashv F$ .

He begins translating that adjunction into hom-set language and writes $\mathbb{R}(I(a),b)\cong \mathbb{Z}(a,F(b))$ , specifying that $a$ is an integer and $b$ is a real number.

The segment begins with the general definition of adjoint functors already written on the left side of the board: functors F and G are adjoint, written F ⊣ G, when there is a natural isomorphism between the relevant hom-sets. The lecturer immediately shifts from that abstract statement to a concrete example meant to build intuition.

He identifies the two categories in the example. On the left is the category of integers, Z, and on the right is the category of real numbers, R. The board also records that in R a morphism $x \to y$ exists exactly when $x \le y$ , so the discussion is being framed in order-theoretic terms.

To make the functors tangible, he chooses specific objects: $A = 2$ in Z and $B = π$ in R. The inclusion functor F : $Z \to R$ is then applied to 2, giving $I(2) = 2$ . In other words, the integer 2 is viewed as the real number 2.

Next he applies the other functor, G : $R \to Z$ , which is the floor-function functor. Taking $B = π$ , he computes $G(π)$ = ⌊π⌋ = 3. This pair of computations shows how the two functors move between the integer and real categories.

With the example in place, the lecturer invokes the meaning of the adjunction itself: a map on one side corresponds to a map on the other side. Visually, he points between the two halves of the diagram, indicating that the adjunction is not just notation but a precise matching of morphisms.

He then writes the concrete consequence of that matching for this example. For an integer a and a real number b, the adjunction between inclusion and floor is equivalent to the statement a ≤ ⌊b⌋ ⇔ $a \le b$ . This is the main formula of the clip and the point toward which the earlier example was building.

The closing remark stresses why the example is useful: an apparently abstract categorical relationship reduces to a very simple and familiar inequality fact about integers, reals, and the floor function.

Knowledge cards

Adjoint functors: basic definition

For functors $F:\mathcal{A}\to\mathcal{B}$ and $G:\mathcal{B}\to\mathcal{A}$ , the video defines $F$ to be left adjoint to $G$ by a natural isomorphism of hom-sets $\mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))$ for all $A\in\mathcal{A}$ and $B\in\mathcal{B}$ . The lecturer stresses that $F$ and $G$ point in opposite directions.

F \dashv G \quad \text{if} \quad \mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B)) \text{ naturally in } A,B

Why the isomorphism is a bijection

Because $\mathcal{B}(F(A),B)$ and $\mathcal{A}(A,G(B))$ are hom-sets, they live in the category of sets. Thus the displayed $\cong$ means an isomorphism in SET, i.e. a bijection of sets.

\mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B)) \text{ as sets}

Adjunction as a chosen natural isomorphism

The board states that an adjunction between $F$ and $G$ is a choice of natural isomorphism. This means the adjunction includes the specific natural correspondence, not just an abstract existence claim.

Equivalent functorial formulation

To avoid the confusion that natural isomorphisms compare same-direction functors, the lecturer rewrites the definition as an equivalence: $F$ and $G$ are adjoint iff the curried functors $\mathcal{B}(F(-),-)$ and $\mathcal{A}(-,G(-))$ from $\mathcal{A}^{op}\times\mathcal{B}$ to SET are naturally isomorphic.

F \dashv G \iff \mathcal{B}(F(-),-) \cong \mathcal{A}(-,G(-)) : \mathcal{A}^{op}\times\mathcal{B}\to SET

Common pitfall in reading the definition

A learner may mistakenly think the natural isomorphism is directly between $F$ and $G$ . The video corrects this by showing that the actual natural isomorphism is between the two derived hom-functors, which have the same domain and codomain.

Adjoint functors via hom-set isomorphism

The video defines $F\dashv G$ for functors $F:\mathcal{A}\to\mathcal{B}$ and $G:\mathcal{B}\to\mathcal{A}$ by requiring a natural isomorphism $\mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))$ for all objects $A\in\mathcal{A}$ and $B\in\mathcal{B}$ . Informally, giving a morphism $A\to G(B)$ is equivalent to giving a morphism $F(A)\to B$ .

F\dashv G\iff \mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))\text{ naturally in }A,B

Object action of the adjoint pair

The lecturer makes the notation concrete by tracking objects across the two categories: $F$ sends $A$ to $F(A)$ , and $G$ sends $B$ to $G(B)$ . These object mappings set up the hom-set comparison used in the definition of adjunction.

Morphism correspondence under adjunction

Under the adjunction, a morphism $A\to G(B)$ in $\mathcal{A}$ corresponds to a morphism $F(A)\to B$ in $\mathcal{B}$ . This is the central intuitive reformulation of the hom-set isomorphism written on the board.

A\to G(B)\quad\longleftrightarrow\quad F(A)\to B

Naturality in the first variable $A$

Naturality in $A$ means the adjunction correspondence is compatible with precomposition by any morphism $h:A'\to A$ . The board states that $A'\xrightarrow{h}A\to G(B)$ in $\mathcal{A}$ corresponds to $F(A')\xrightarrow{F(h)}F(A)\to B$ in $\mathcal{B}$ .

\forall h:A'\to A,\ (A'\xrightarrow{h}A\to G(B))\leftrightarrow(F(A')\xrightarrow{F(h)}F(A)\to B)

Adjunction is not just a bare bijection

The clip warns implicitly against reading $\mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))$ as only a set-theoretic bijection. The lecturer spends the second half explaining that the bijection must also respect composition, i.e. it must be natural in the variables.

Order-category $\mathbb{R}$

A category whose objects are real numbers and whose morphisms encode the usual order relation. A morphism $x\to y$ exists exactly when $x\le y$ .

x\to y \text{ iff } x\le y

Asymmetric morphisms

Because the morphism rule uses $\le$ , direction matters. There is a morphism $3\to 4$ , but not $4\to 3$ .

Order-category $\mathbb{Z}$

The integers form a category in the same way as the reals: objects are integers and morphisms are determined by $x\le y$ .

Inclusion functor $I$

The functor $I:\mathbb{Z}\to\mathbb{R}$ is introduced as the inclusion of integers into reals.

I:\mathbb{Z}\to\mathbb{R}

Floor functor $F$

The opposite functor $F:\mathbb{R}\to\mathbb{Z}$ is identified with the floor function.

F:\mathbb{R}\to\mathbb{Z},\quad F(x)=\lfloor x\rfloor

Adjunction claim $I\dashv F$

The lecturer states that inclusion is left adjoint to floor in this example.

I\dashv F

Hom-set form of the adjunction

The beginning of the adjunction is written as a natural bijection between hom-sets, with $a\in\mathbb{Z}$ and $b\in\mathbb{R}$ .

\mathbb{R}(I(a),b)\cong \mathbb{Z}(a,F(b))

General definition of adjoint functors

The board states that functors F and G are adjoint, written F ⊣ G, when there is a natural isomorphism between the appropriate hom-sets. This prewritten definition frames the rest of the clip as a concrete example of that abstract notion.

F \dashv G \quad\text{with}\quad \mathcal{S}(F(A),B) \cong A(G(B)) \text{ naturally in } A,B

Example categories: integers and reals

The example uses Z, the category of integers, and R, the category of real numbers. The board explicitly notes that in R, morphisms are given by the order relation: $x \to y$ exactly when $x \le y$ .

\mathbb{Z} \rightleftarrows \mathbb{R}, \qquad x \to y \text{ in } \mathbb{R} \iff x \le y

Inclusion functor F : $Z \to R$

F is the inclusion functor from integers into reals. In the worked example, it sends the integer 2 to the real number 2, written $I(2)=2$ .

F(2)=I(2)=2

Floor functor G : $R \to Z$

G is the floor-function functor from reals to integers. Applied to π, it gives the integer 3, since ⌊π⌋ = 3.

G(\pi)=\lfloor \pi \rfloor = 3

Adjunction as correspondence of maps

The lecturer explains that the adjunction means a map on one side of the diagram corresponds to a map on the other side. This is the operational meaning of the abstract definition in the example.

\mathbb{R}(i(a),b) \cong \mathbb{Z}(a,i(b))

Concrete equivalence from the adjunction

Specializing the adjunction to the inclusion and floor functors yields the familiar order statement: for any integer a and real number b, a ≤ ⌊b if and only if $a \le b$ .

a \le \lfloor b \rfloor \iff a \le b \qquad (a \in \mathbb{Z},\; b \in \mathbb{R})

Detailed learning notes

Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.

Symbols · 45

$\mathcal{A}$

Clear evidence

Shown in the video

Evidence

Formula
Observation
Whiteboard definition line reads “Let A ⇄ B be functors,” with A written as a calligraphic category symbol.

Symbol

$\mathcal{A}$

Meaning

Source category for the functor F and target category for the functor G.

Domain

A category

$\mathcal{B}$

Clear evidence

Shown in the video

Evidence

Formula
Observation
Whiteboard definition line reads “Let A ⇄ B be functors,” with B written as a calligraphic category symbol.

Symbol

$\mathcal{B}$

Meaning

Target category for the functor F and source category for the functor G.

Domain

A category

F

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board shows an arrow labeled F from $\mathcal{A}$ to $\mathcal{B}$ .
Audio
Observation
The lecturer says, “Let F and G be functors. Notice the direction they’re going; they’re going in opposite directions.”

Symbol

Meaning

A functor from $\mathcal{A}$ to $\mathcal{B}$ ; in the adjunction it is the left adjoint.

Domain

Functor $\mathcal{A} \to \mathcal{B}$

G

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board shows an arrow labeled G from $\mathcal{B}$ to $\mathcal{A}$ .
Audio
Observation
The lecturer says that F is left adjoint to G and G is right adjoint to F.

Symbol

Meaning

A functor from $\mathcal{B}$ to $\mathcal{A}$ ; in the adjunction it is the right adjoint.

Domain

Functor $\mathcal{B} \to \mathcal{A}$

$F \dashv G$

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board writes “write F ⊣ G if …”.
Audio
Observation
The lecturer says, “We say that F is left adjoint to G and G is right adjoint to F, and we’re going to write that like this.”

Symbol

$F \dashv G$

Meaning

Notation asserting that F is left adjoint to G and G is right adjoint to F.

Domain

Relation between two oppositely directed functors

$\mathcal{B}(F(A),B)$

Clear evidence

Shown in the video

Evidence

Formula
Observation
The displayed isomorphism uses $\mathcal{B}(F(A),B)$ .
Audio
Observation
The lecturer explains, “Well, these are hom sets. They live in the category of sets.”

Symbol

$\mathcal{B}(F(A),B)$

Meaning

Hom-set in $\mathcal{B}$ from the object $F(A)$ to the object B.

Domain

A set

$\mathcal{A}(A,G(B))$

Clear evidence

Shown in the video

Evidence

Formula
Observation
The displayed isomorphism uses $\mathcal{A}(A,G(B))$ .
Audio
Observation
The lecturer explains that the two sides are hom sets living in the category of sets.

Symbol

$\mathcal{A}(A,G(B))$

Meaning

Hom-set in $\mathcal{A}$ from the object A to the object $G(B)$ .

Domain

A set

$\cong$

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board shows $\mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B))$ .
Audio
Observation
The lecturer asks what the isomorphism means and answers that in the category of sets an isomorphism is just a bijection.

Symbol

$\cong$

Meaning

Isomorphism in the category of sets, i.e. a bijection between the two hom-sets.

Domain

Morphism of sets

A

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board writes “naturally in $A \in \mathcal{A}$ and $B \in \mathcal{B}$ ”.
Audio
Observation
The lecturer says the isomorphism is natural “in A and in B.”

Symbol

Meaning

An object of the category $\mathcal{A}$ .

Domain

$A \in \mathcal{A}$

B

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board writes “naturally in $A \in \mathcal{A}$ and $B \in \mathcal{B}$ ”.
Audio
Observation
The lecturer says the isomorphism is natural “in A and in B.”

Symbol

Meaning

An object of the category $\mathcal{B}$ .

Domain

$B \in \mathcal{B}$

SET

Clear evidence

Shown in the video

Evidence

Formula
Observation
The added equivalence line ends with “ $\mathcal{A}^{op} \times \mathcal{B} \to$ SET”.
Audio
Observation
The lecturer says the two functors go “into the category of sets.”

Uncertainties

formula；The board uses uppercase SET while the spoken phrase is “category of sets”; the intended target category is clear but the exact capitalization convention is not explained.

Symbol

SET

Meaning

The category of sets, used as the common codomain of the two curried hom-functors.

Domain

$\mathcal{A}^{op}$

Clear evidence

Shown in the video

Evidence

Formula
Observation
The added line contains $\mathcal{A}^{op} \times \mathcal{B}$ .
Audio
Observation
The lecturer says the functors are “going from dual of A cross B into the category of sets.”

Symbol

$\mathcal{A}^{op}$

Meaning

Opposite category of $\mathcal{A}$ .

Domain

Definition of adjoint functors via a natural isomorphism of hom-sets

Clear evidence

Shown in the video

Evidence

Formula
Observation
Pre-written board text defines adjoint functors using F ⊣ G and the isomorphism $\mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B))$ naturally in A and B.
Audio
Observation
The lecturer reads the definition and states that an adjunction between F and G is a choice of natural isomorphism.

Definition

Explanation

For functors F:\mathcal{A} $\to\mathcal{B}$ and G:\mathcal{B} $\to\mathcal{A}$ , the video defines F to be left adjoint to G, and G to be right adjoint to F, by requiring a natural isomorphism between the hom-set $\mathcal{B}(F(A),B)$ and the hom-set $\mathcal{A}(A,G(B))$ for objects A in $\mathcal{A}$ and B in $\mathcal{B}$ . The lecturer also notes that the functors point in opposite directions.

Formula

F \dashv G \quad \text{if} \quad \mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B)) \text{ naturally in } A \in \mathcal{A},\; B \in \mathcal{B}

Conditions

F is a functor $\mathcal{A} \to \mathcal{B}$
G is a functor $\mathcal{B} \to \mathcal{A}$
A is an object of $\mathcal{A}$
B is an object of $\mathcal{B}$
The isomorphism is natural in both A and B
An adjunction is a chosen natural isomorphism

Prerequisites

Meaning of isomorphism between the two hom-sets

Meaning of isomorphism between the two hom-sets

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer says, “Well, these are hom sets. They live in the category of sets. What is an isomorphism in this category? It’s just a bijection.”

Definition

Explanation

The two expressions $\mathcal{B}(F(A),B)$ and $\mathcal{A}(A,G(B))$ are hom-sets, hence objects of the category of sets. Therefore the symbol $\cong$ between them means a bijection of sets, not merely an abstract categorical isomorphism in some unspecified category.

Formula

\mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B)) \text{ means a bijection of sets}

Conditions

The compared objects are hom-sets
The ambient category for the isomorphism is the category of sets

Adjunction as a chosen natural isomorphism

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board states “An adjunction between F and G is a choice of natural isomorphism.”
Audio
Observation
The lecturer repeats that an adjunction between F and G is a choice of natural isomorphism.

Definition

Explanation

The video emphasizes that saying F and G are adjoint is not just asserting existence abstractly; an adjunction is the data of a selected natural isomorphism between the corresponding hom-set functors.

Formula

Conditions

F and G are the two oppositely directed functors in the definition

Prerequisites

Definition of adjoint functors via a natural isomorphism of hom-sets

Equivalent formulation of adjointness using curried hom-functors

Clear evidence

Shown in the video

Evidence

Formula
Observation
The lecturer writes “i.e. F and G are adjoint iff $\mathcal{B}$ (F(-),-), $\mathcal{A}$ (-,G(-)): $\mathcal{A}^{op} \times \mathcal{B} \to$ SET are naturally isomorphic.”
Audio
Observation
The lecturer explains that the two curried expressions are functors from the product of the opposite category and $\mathcal{B}$ into the category of sets, and that they must be naturally isomorphic.

Formula

Explanation

The video rewrites the objectwise natural isomorphism as an isomorphism of functors. Instead of comparing individual sets $\mathcal{B}(F(A),B)$ and $\mathcal{A}(A,G(B))$ , one views both sides as functors $\mathcal{A}^{op}\times\mathcal{B}\to$ SET and requires those functors to be naturally isomorphic.

Formula

F \dashv G \iff \big(\mathcal{B}(F(-),-) \cong \mathcal{A}(-,G(-)) \text{ as functors } \mathcal{A}^{op}\times\mathcal{B}\to SET\big)

Conditions

F:\mathcal{A} $\to\mathcal{B}$
G:\mathcal{B} $\to\mathcal{A}$
Both sides are regarded as functors out of $\mathcal{A}^{op}\times\mathcal{B}$
The natural isomorphism is now between functors with the same domain and codomain

Prerequisites

Definition of adjoint functors via a natural isomorphism of hom-sets

Definition of adjoint functors via natural isomorphism of hom-sets

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board states: "Let $\mathcal{A},\mathcal{B}$ be categories. We say that $F$ is left adjoint to $G$ , and $G$ is right adjoint to $F$ , and write $F\dashv G$ if $\mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))$ naturally in $A\in\mathcal{A}$ and $B\in\mathcal{B}$ ."
Audio
Observation
The lecturer explains the object mappings $F(A)$ and $G(B)$ , then says a map $A\to G(B)$ is the same as a map $F(A)\to B$ .

Definition

Explanation

Two functors $F:\mathcal{A}\to\mathcal{B}$ and $G:\mathcal{B}\to\mathcal{A}$ are called adjoint, written $F\dashv G$ , when for every object $A$ of $\mathcal{A}$ and every object $B$ of $\mathcal{B}$ there is a bijection between the hom-sets $\mathcal{B}(F(A),B)$ and $\mathcal{A}(A,G(B))$ . The video emphasizes that this bijection must be natural in both variables, not merely a set-theoretic identification.

Formula

F:\mathcal{A}\to\mathcal{B},\quad G:\mathcal{B}\to\mathcal{A},\quad F\dashv G\iff \mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))\text{ naturally in }A\in\mathcal{A},\ B\in\mathcal{B}

Conditions

$\mathcal{A}$ and $\mathcal{B}$ are categories.
$F$ is a functor $\mathcal{A}\to\mathcal{B}$ .
$G$ is a functor $\mathcal{B}\to\mathcal{A}$ .
The isomorphism is required to be natural in both $A$ and $B$ .

Meaning of naturality in the first variable $A$

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer asks, "What do we mean by naturally in A?" and answers that it means the correspondence works well with composition.
Formula
Observation
The board writes: "Naturally in $A$ : for any $h:A'\to A$ , $A'\xrightarrow{h}A\to G(B)$ in $\mathcal{A}$ is the same as $F(A')\xrightarrow{F(h)}F(A)\to B$ in $\mathcal{B}$ ."

Definition

Explanation

Naturality in $A$ says that the adjunction correspondence is compatible with precomposition by morphisms into $A$ . If $h:A'\to A$ is any morphism in $\mathcal{A}$ , then taking a morphism $A\to G(B)$ , precomposing with $h$ , and then translating across the adjunction gives the same result as first translating $A\to G(B)$ to $F(A)\to B$ and then precomposing with $F(h):F(A')\to F(A)$ . In short, the bijection respects composition on the $A$ -side.

Formula

\forall h:A'\to A,\quad (A'\xrightarrow{h}A\to G(B))\leftrightarrow (F(A')\xrightarrow{F(h)}F(A)\to B)

Conditions

Fix an object $B\in\mathcal{B}$ .
The statement quantifies over all morphisms $h:A'\to A$ in $\mathcal{A}$ .
The correspondence is between morphisms in $\mathcal{A}$ and morphisms in $\mathcal{B}$ .

Prerequisites

Definition of adjoint functors via natural isomorphism of hom-sets

Poset category built from the usual order on real numbers

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board defines $\mathbb{R}$ with objects the reals and morphisms $x \to y$ when $x \le y$ .
Audio
Observation
The lecturer explains that there is a morphism from 3 to 4 because $3 \le 4$ , but no morphism from 4 to 3.

Definition

Explanation

The video introduces a simple example category $\mathbb{R}$ whose objects are real numbers and whose morphisms encode the ordinary order relation: there is a morphism $x \to y$ exactly when $x \le y$ . The same construction is then stated for $\mathbb{Z}$ . This is a concrete example of viewing an ordered set as a category.

Formula

\operatorname{Hom}(x,y)=\varnothing \text{ if } x\nleq y,\quad \operatorname{Hom}(x,y)\neq\varnothing \text{ if } x\le y

Conditions

Objects are real numbers in the first example.
A morphism $x\to y$ exists precisely when $x\le y$ .
The integer version is defined the same way.

Inclusion functor from integers to reals

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board draws $\mathbb{Z} \xrightarrow{I} \mathbb{R}$ and labels $I$ as "inclusion".
Audio
Observation
The lecturer says, "We're going to have a functor call it I for inclusion."

Definition

Explanation

The lecturer defines a functor $I$ going from the integer category $\mathbb{Z}$ to the real-number category $\mathbb{R}$ . In this example it is described as the inclusion functor, reflecting the fact that every integer is also a real number.

Formula

I:\mathbb{Z}\to\mathbb{R}

Conditions

Defined between the two order-categories just introduced.
Named "inclusion" in the lecture.

Prerequisites

Poset category built from the usual order on real numbers

Floor-function functor from reals to integers

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board draws $\mathbb{R} \xrightarrow{F} \mathbb{Z}$ and labels $F$ as "floor function".
Audio
Observation
The lecturer says, "And in the opposite direction we're going to have a functor call it F for the floor function."

Definition

Explanation

The lecturer defines a functor $F$ in the opposite direction, from $\mathbb{R}$ to $\mathbb{Z}$ , and identifies it with the floor function. In the categorical setting, this means the real-number category is mapped back to the integer category by taking each real to its greatest integer below it.

Formula

F:\mathbb{R}\to\mathbb{Z},\quad F(x)=\lfloor x\rfloor

Conditions

Domain is the category $\mathbb{R}$ .
Codomain is the category $\mathbb{Z}$ .
The lecturer explicitly names it the floor function.

Prerequisites

Poset category built from the usual order on real numbers

Adjunction statement $I \dashv F$

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer states, "we have that I is left adjoint to F."
Formula
Observation
The board writes $I \dashv F$ and then begins the hom-set adjunction formula.

Formula

Explanation

From the example, the lecturer asserts that the inclusion functor $I$ is left adjoint to the floor functor $F$ . He then starts writing the corresponding hom-set formulation of the adjunction.

Formula

I \dashv F

Conditions

Applies to the specific pair of functors $I:\mathbb{Z}\to\mathbb{R}$ and $F:\mathbb{R}\to\mathbb{Z}$ introduced in this example.

Prerequisites

Inclusion functor from integers to reals
Floor-function functor from reals to integers

Prewritten definition of adjoint functors

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board already contains: 'Defn: Let A ⇄ B be functors. We say that F is left adjoint to G, and G is right adjoint to F, and write F ⊣ G if $S(F(A),B)$ ≅ $A(G(B))$ naturally in $A \in X$ and $B \in Y$ . An adjunction between F and G is a choice of natural isomorphism.'
Audio
Observation
No new spoken definition is given in this clip; the lecturer uses the prewritten setup while introducing the example.

Uncertainties

The exact handwritten symbols for the hom-functor notation are partially hard to read, but the displayed formula is consistently visible as an adjunction definition.

Definition

Explanation

The whiteboard presents the general definition of an adjunction before the example begins. It states that functors F and G are adjoint when there is a natural isomorphism between the relevant hom-sets, written F ⊣ G, and that an adjunction is a choice of such a natural isomorphism.

Formula

F \dashv G \quad\text{with}\quad \mathcal{S}(F(A),B) \cong A(G(B)) \text{ naturally in } A \in X,\; B \in Y

Conditions

F and G are functors.
The isomorphism is natural in both variables.
The statement is taken from the prewritten board rather than newly spoken in this clip.

Example categories Z and R

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board shows Z ⇄ R with F : $Z \to R$ and G : $R \to Z$ , and separately lists 'R (object are the reals, morphisms $x \to y$ iff $x \le y$ )'.
Audio
Observation
The lecturer says, "here's our category of integers" and "Here's the reals."

Definition

Explanation

The worked example uses two categories: Z, the category of integers, and R, the category of real numbers. The board explicitly describes R as having morphisms $x \to y$ exactly when $x \le y$ , so the example is being treated in ordered-set style categories.

Formula

\mathbb{Z} \rightleftarrows \mathbb{R}, \qquad x \to y \text{ in } \mathbb{R} \iff x \le y

Conditions

The example is set in the categories Z and R.
For R, morphisms are determined by the order relation ≤.

Prerequisites

Prewritten definition of adjoint functors

Claims and conditions · 5

Adjointness is equivalent to natural isomorphism of the two curried hom-functors

Clear evidence

Shown in the video

Evidence

Formula
Observation
The newly written line explicitly says “F and G are adjoint iff … are naturally isomorphic.”
Audio
Observation
The lecturer says, “F and G are adjoints, and this is if and only if the following functors … are naturally isomorphic.”

Proposition

Statement

For functors F:\mathcal{A} $\to\mathcal{B}$ and G:\mathcal{B} $\to\mathcal{A}$ , F and G are adjoint if and only if the functors $\mathcal{B}$ (F(-),-) and $\mathcal{A}$ (-,G(-)) from $\mathcal{A}^{op}\times\mathcal{B}$ to SET are naturally isomorphic.

Hypotheses

F is a functor $\mathcal{A} \to \mathcal{B}$
G is a functor $\mathcal{B} \to \mathcal{A}$
The two displayed expressions are interpreted as functors $\mathcal{A}^{op}\times\mathcal{B}\to$ SET

Quantifiers

For all such functors F and G, adjointness holds exactly when the stated natural isomorphism of functors holds.

Adjunction identifies morphisms $A\to G(B)$ with morphisms $F(A)\to B$

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer says, "with an adjunction what we're really saying is a map from A to G of B is the same as a map from F of A to B."
Formula
Observation
The board displays $\mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))$ .

Proposition

Statement

For adjoint functors $F\dashv G$ , giving a morphism $A\to G(B)$ in $\mathcal{A}$ is equivalent to giving a morphism $F(A)\to B$ in $\mathcal{B}$ .

Hypotheses

$F:\mathcal{A}\to\mathcal{B}$ and $G:\mathcal{B}\to\mathcal{A}$ are functors.
$F\dashv G$ in the sense of the displayed natural isomorphism of hom-sets.

Quantifiers

For all objects $A\in\mathcal{A}$ and $B\in\mathcal{B}$ .

The inclusion functor is left adjoint to the floor functor

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer says, "So from this example, we have that I is left adjoint to F."
Formula
Observation
The board shows $I \dashv F$ .

Uncertainties

The proof is not completed within this clip; only the claim and the beginning of the hom-set expression are shown.

Proposition

Statement

For the order-categories $\mathbb{Z}$ and $\mathbb{R}$ defined above, the inclusion functor $I:\mathbb{Z}\to\mathbb{R}$ is left adjoint to the floor functor $F:\mathbb{R}\to\mathbb{Z}$ .

Hypotheses

$\mathbb{R}$ is the category with objects the real numbers and morphisms $x\to y$ when $x\le y$ .
$\mathbb{Z}$ is defined the same way using integers.
$I$ is the inclusion functor $\mathbb{Z}\to\mathbb{R}$ .
$F$ is the floor-function functor $\mathbb{R}\to\mathbb{Z}$ .

Quantifiers

For all integers $a$ and real numbers $b$ , the adjunction is expressed by a natural bijection of hom-sets.

Adjunction gives a correspondence of maps

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer says, "So this adjunction says that a map here is the same as a map there."
Diagram
Observation
He gestures between the two sides of the example diagram relating Z and R.

Proposition

Statement

In the example, the adjunction between the inclusion functor and the floor functor means that a map on one side corresponds to a map on the other side.

Hypotheses

The functors F and G form an adjunction.
The objects are taken from the example categories Z and R.

Quantifiers

For the chosen example objects and, by the board’s general definition, naturally in the variables.

Concrete equivalence for floor and inclusion

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board displays: 'This says that for $a \in Z$ and $b \in R$ , a ≤ ⌊b⌋ ⇔ $a \le b$ '.
Audio
Observation
The lecturer states the same equivalence verbally.

Proposition

Statement

For every integer a and real number b, a ≤ ⌊b⌋ if and only if $a \le b$ .

Hypotheses

$a \in Z$
$b \in R$
F is the inclusion functor $Z \to R$
G is the floor functor $R \to Z$
F ⊣ G in the example

Quantifiers

For all $a \in Z$ and $b \in R$ .

Derivations and proofs · 4

Reformulating the hom-set isomorphism as a natural isomorphism of same-direction functors

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer raises the concern that natural isomorphism is usually discussed for functors going in the same direction.
Formula
Observation
He then writes the equivalent condition using $\mathcal{B}$ (F(-),-) and $\mathcal{A}$ (-,G(-)) as functors $\mathcal{A}^{op}\times\mathcal{B}\to$ SET.

Intuitive argument

Steps

Expression
$\mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B)) \text{ naturally in } A,B$
Explanation
Start from the original definition of adjointness written on the board.
Justification
This is the definition already displayed before the lecturer begins adding the new line.
Shown in the video
Expression
$\text{Natural isomorphism is normally stated for functors with the same direction.}$
Explanation
The lecturer points out a possible confusion: F and G themselves go in opposite directions, so one should not think the natural isomorphism is directly between F and G.
Justification
Spoken clarification immediately before writing the equivalent formulation.
Shown in the video
Expression
$\mathcal{B}(F(-),-):\mathcal{A}^{op}\times\mathcal{B}\to SET$
Explanation
Curry the first hom-set expression so that A and B become inputs of a single functor.
Justification
Written on the board as part of the new equivalence line.
Shown in the video
Expression
$\mathcal{A}(-,G(-)):\mathcal{A}^{op}\times\mathcal{B}\to SET$
Explanation
Curry the second hom-set expression in the same way.
Justification
Written on the board as part of the new equivalence line.
Shown in the video
Expression
$F \dashv G \iff \mathcal{B}(F(-),-) \cong \mathcal{A}(-,G(-))$
Explanation
Conclude that adjointness is equivalent to these two newly formed functors being naturally isomorphic.
Justification
The lecturer explicitly writes “iff” and says the two functors are naturally isomorphic.
Shown in the video

Conclusion

The objectwise natural isomorphism in the definition can be repackaged as a natural isomorphism between two functors with the same domain $\mathcal{A}^{op}\times\mathcal{B}$ and codomain SET.

Derivation of the naturality-in- $A$ condition from the adjunction isomorphism

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer introduces the question "What do we mean by naturally in A?" and then explains the condition using an arbitrary map $h:A'\to A$ .
Formula
Observation
The board writes the two composed arrows and explicitly labels one side as being in $\mathcal{A}$ and the other as being in $\mathcal{B}$ .

Intuitive argument

Steps

Expression
Explanation
Start from the adjunction bijection $\mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))$ for fixed $A$ and $B$ .
Justification
This is the definition written on the board.
Shown in the video
Expression
$h:A'\to A$
Explanation
Introduce an arbitrary morphism $h$ in $\mathcal{A}$ with target $A$ .
Justification
Naturality in $A$ must hold for every such morphism.
Shown in the video
Expression
$A'\xrightarrow{h}A\to G(B)$
Explanation
Compose $h$ with a morphism $A\to G(B)$ to obtain a morphism $A'\to G(B)$ in $\mathcal{A}$ .
Justification
This is ordinary composition in the category $\mathcal{A}$ .
Shown in the video
Expression
$F(A')\xrightarrow{F(h)}F(A)\to B$
Explanation
Apply the functor $F$ to $h$ , obtaining $F(h):F(A')\to F(A)$ , and compose with the corresponding morphism $F(A)\to B$ in $\mathcal{B}$ .
Justification
Functors send morphisms to morphisms, and composition is taken in $\mathcal{B}$ .
Shown in the video
Expression
Explanation
The adjunction is natural in $A$ exactly when these two procedures correspond to each other under the bijection of hom-sets.
Justification
This is the content of the board statement labeled "Naturally in $A$ ".
Shown in the video

Conclusion

Naturality in $A$ means the adjunction correspondence commutes with precomposition by any $h:A'\to A$ , equivalently $(A'\xrightarrow{h}A\to G(B))$ corresponds to $(F(A')\xrightarrow{F(h)}F(A)\to B)$ .

Beginning of the hom-set formulation of the adjunction

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board writes the beginning of the adjunction formula $\mathbb{R}(I(a),b)\cong \mathbb{Z}(a,F(b))$ .
Audio
Observation
The lecturer says, "So writing it down like this, isomorphism, we have this such a thing. This is for A an integer and B a real."

Uncertainties

The derivation stops before the full justification is given in this clip.

Proof

Steps

Expression
$I \dashv F$
Explanation
The lecturer first records the adjunction statement itself.
Justification
Stated directly in the lecture after introducing $I$ and $F$ .
Shown in the video
Expression
$\mathbb{R}(I(a),b)\cong \mathbb{Z}(a,F(b))$
Explanation
He then translates the adjunction into a bijection between hom-sets, with $a$ an integer and $b$ a real number.
Justification
This is the standard hom-set form of an adjunction, and the lecturer explicitly writes it on the board.
Shown in the video

Conclusion

The clip establishes the claimed adjunction notation and begins its hom-set expression, but does not finish the proof within the provided duration.

Deriving the floor inequality from the adjunction example

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer introduces $a = 2$ and $b = π$ , applies F and G, then states the adjunction correspondence and finally writes the general equivalence a ≤ ⌊b⌋ ⇔ $a \le b$ .
Formula
Observation
The board accumulates the example values 2, π, $I(2)=2$ , ⌊π⌋=3, and the final equivalence.

Uncertainties

The intermediate categorical translation from the hom-set correspondence to the order relation is not fully spelled out step by step on the board; the clip presents the conclusion directly after the example.

Intuitive argument

Steps

Expression
$a = 2,\; b = \pi$
Explanation
Choose a concrete integer object and a concrete real object to build intuition for the adjunction.
Justification
Stated verbally and written on the board.
Shown in the video
Expression
$F(2)=I(2)=2$
Explanation
Apply the inclusion functor to the integer 2, viewing it inside the reals.
Justification
The lecturer explicitly says the inclusion functor maps 2 to $I(2)$ , which is just 2.
Shown in the video
Expression
$G(\pi)=\lfloor \pi \rfloor = 3$
Explanation
Apply the floor functor to the real number π, producing the integer 3.
Justification
The lecturer explicitly says the floor function functor maps π to the floor of π, which is 3.
Shown in the video
Expression
$\mathbb{R}(i(a),b) \cong \mathbb{Z}(a,i(b))$
Explanation
Use the adjunction principle to relate maps in the real category to maps in the integer category.
Justification
This is the prewritten adjunction formula on the board, invoked verbally as 'a map here is the same as a map there'.
Shown in the video
Expression
$a \le \lfloor b \rfloor \iff a \le b$
Explanation
Specialize the correspondence to the order-based categories and state the resulting equivalence for integers a and reals b.
Justification
Written explicitly on the board and spoken by the lecturer as the conclusion of the example.
Shown in the video

Conclusion

The adjunction between inclusion and floor yields the concrete order equivalence a ≤ ⌊b⌋ ⇔ $a \le b$ for $a \in Z$ and $b \in R$ .

Worked examples · 2

Concrete morphism example in the real-number category

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer says, "So there's a morphism from three to four because three is less than or equal to four, but there's no morphism from four to three."

Problem

Illustrate how morphisms work in the category $\mathbb{R}$ using the numbers 3 and 4.

Given

Objects are real numbers.
A morphism $x\to y$ exists exactly when $x\le y$ .
Compare the pairs $(3,4)$ and $(4,3)$ .

Goal

Determine which directed morphisms exist between 3 and 4.

Steps

Expression
$3 \le 4$
Explanation
Check the defining order condition for a morphism from 3 to 4.
Justification
By the definition of the category $\mathbb{R}$ , a morphism exists exactly under this condition.
Shown in the video
Expression
$4 \nleq 3$
Explanation
Check the reverse pair.
Justification
Again by the same definition, the reverse morphism does not exist.
Shown in the video

Answer

There is a morphism $3\to 4$ , but no morphism $4\to 3$ .

Verification

This matches the lecturer's spoken example immediately after defining the morphism rule.

Worked example with $a = 2$ and $b = π$

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer says, "if A were to be two ... and B were to be something like pi ... The inclusion functor is going to map two to I of two, which is just two ... the floor function functor is going to map pi to the floor of pi, which is just three."
Formula
Observation
The board writes $a = 2$ , $b = π$ , $I(2)=2$ , and ⌊π⌋=3 in the example layout.

Problem

Illustrate the adjunction example by choosing a specific integer and a specific real number and applying the two functors.

Given

$A = 2 \in Z$
$B = π \in R$
F is the inclusion functor $Z \to R$
G is the floor functor $R \to Z$

Goal

Compute the images of the chosen objects under F and G to build intuition for the adjunction.

Steps

Expression
$F(2)=I(2)=2$
Explanation
The inclusion functor sends the integer 2 to the real number 2.
Justification
Explicitly stated by the lecturer and written on the board.
Shown in the video
Expression
$G(\pi)=\lfloor \pi \rfloor = 3$
Explanation
The floor functor sends π to the integer 3.
Justification
Explicitly stated by the lecturer and written on the board.
Shown in the video

Answer

The example gives $F(2)=2$ and $G(π)=3$ .

Verification

The values match the standard meanings of inclusion and floor, and they are written directly on the board.

Visual events · 9

Opening quotation and title overlay

Clear evidence

Shown in the video

Evidence

Diagram
Observation
Large overlay text appears reading “ABSTRACT NONSENSE” over the whiteboard scene.
Audio
Observation
The lecturer says, “So a famous quote by Mac Lane: ‘Adjoint functors arise everywhere.’”

Objects

Overlay text “ABSTRACT NONSENSE”
Whiteboard with pre-written definition

Changes

Overlay text appears at the start and then disappears by about 6 seconds.

Invariants

The underlying whiteboard definition remains visible behind the overlay.

Interpretation

The opening visually frames the topic as part of a category-theory lecture and pairs the humorous overlay with the quoted Mac Lane line about adjoint functors.

Pointing out that F and G go in opposite directions

Clear evidence

Shown in the video

Evidence

Animation
Observation
The lecturer turns to the board and points at the arrows labeled F and G between $\mathcal{A}$ and $\mathcal{B}$ .
Audio
Observation
He says, “Notice the direction they’re going; they’re going in opposite directions.”

Objects

Arrow labeled F from $\mathcal{A}$ to $\mathcal{B}$
Arrow labeled G from $\mathcal{B}$ to $\mathcal{A}$
Lecturer’s hand

Changes

The lecturer’s gesture shifts attention from the text to the two arrows.

Invariants

The categories $\mathcal{A}$ and $\mathcal{B}$ stay fixed on the board.

Interpretation

The visual emphasis supports the definitional setup that adjoint functors are oppositely directed functors.

Writing the equivalent functorial formulation

Clear evidence

Shown in the video

Evidence

Animation
Observation
The lecturer writes a new line to the right of the pre-existing definition: “i.e. F and G are adjoint iff $\mathcal{B}$ (F(-),-), $\mathcal{A}$ (-,G(-)): $\mathcal{A}^{op} \times \mathcal{B} \to$ SET are naturally isomorphic.”

Uncertainties

animation；Some intermediate handwriting strokes are partially occluded by the lecturer’s body while he writes.

Objects

New handwritten line on the whiteboard
Marker
Previously written definition

Changes

A new equivalence statement is added to the right of the original definition.
The symbols $\mathcal{A}^{op}$ , $\times \mathcal{B}$ , and SET appear for the first time in this segment.

Invariants

The original definition on the left remains visible and unchanged.

Interpretation

The animation records the transition from an objectwise natural isomorphism to a statement about two same-direction functors.

Gestural contrast between old and new formulations

Clear evidence

Shown in the video

Evidence

Animation
Observation
After finishing the line, the lecturer steps back and points toward the newly written functor expressions.
Audio
Observation
He says, “these are two functors. They’re going in the same direction, and that’s where it makes more sense that we’re talking about a natural isomorphism right here.”

Objects

The two curried functor expressions
Lecturer’s pointing hand

Changes

Attention moves from the written line to the conceptual role of the two functors.

Invariants

The board content itself does not change during this interval.

Interpretation

The gesture highlights why the reformulation matters: natural isomorphism is being applied to functors with matching domain and codomain.

Beginning a new picture with categories A and B

Approximate timing

Shown in the video

Evidence

Animation
Observation
The lecturer begins drawing a fresh diagram lower on the board, placing $\mathcal{A}$ on the left and $\mathcal{B}$ on the right.
Audio
Observation
He says, “Say we had our category A and our category B over here. Say that A lives in here.”

Uncertainties

animation；The clip ends before the diagram is completed, so the intended next arrows or objects are not fully shown.

Objects

Handwritten $\mathcal{A}$
Handwritten $\mathcal{B}$
Marker

Changes

A new spatial layout is started below the earlier text.
The lecturer shifts from writing formulas to drawing a diagrammatic setup.

Invariants

The earlier definition and equivalence line remain above on the board.

Interpretation

This appears to set up a more visual explanation of the adjunction data, but the segment stops before the construction is finished.

Whiteboard layout of the adjunction picture

Clear evidence

Shown in the video

Evidence

Diagram
Observation
The whiteboard shows two columns headed $\mathcal{A}$ and $\mathcal{B}$ , with $A$ mapped to $F(A)$ and $B$ mapped to $G(B)$ , plus dashed arrows indicating the hom-set correspondence.
Animation
Observation
As the lecturer speaks, he adds the arrows $A\to G(B)$ , $F(A)\to B$ , and later the naturality condition involving $h:A'\to A$ .

Objects

Categories $\mathcal{A}$ and $\mathcal{B}$
Objects $A$ , $B$ , $A'$
Functors $F$ and $G$
Morphisms $h:A'\to A$ , $A\to G(B)$ , $F(A)\to B$

Changes

The lecturer first writes the object mappings $A\mapsto F(A)$ and $B\mapsto G(B)$ .
He then adds the morphism-level correspondence between $A\to G(B)$ and $F(A)\to B$ .
Finally he writes the naturality-in- $A$ condition using an arbitrary $h:A'\to A$ .

Invariants

$F$ always goes from $\mathcal{A}$ to $\mathcal{B}$ .
$G$ always goes from $\mathcal{B}$ to $\mathcal{A}$ .
The hom-set correspondence is between $\mathcal{A}(A,G(B))$ and $\mathcal{B}(F(A),B)$ .

Interpretation

The diagram visually encodes the adjunction $F\dashv G$ as a two-way translation between morphisms out of $A$ into $G(B)$ and morphisms out of $F(A)$ into $B$ , with naturality expressed by compatibility with precomposition.

Progressive whiteboard construction of the $\mathbb{Z}$ - $\mathbb{R}$ adjunction example

Clear evidence

Shown in the video

Evidence

Diagram
Observation
The right side of the board is used to write the new example: first $\mathbb{R}$ with its object and morphism description, then $\mathbb{Z}$ , then arrows labeled $I$ and $F$ , then $I\dashv F$ , and finally the hom-set formula.
Animation
Observation
The lecturer erases part of the previous material and progressively writes the new example from top to bottom.

Objects

The category symbol $\mathbb{R}$ .
The sentence describing objects and morphisms of $\mathbb{R}$ .
The category symbol $\mathbb{Z}$ .
Arrows $\mathbb{Z}\xrightarrow{I}\mathbb{R}$ and $\mathbb{R}\xrightarrow{F}\mathbb{Z}$ .
The notation $I\dashv F$ .
The formula $\mathbb{R}(I(a),b)\cong \mathbb{Z}(a,F(b))$ .

Changes

The board shifts from general adjoint-functor notes to a concrete example.
The lecturer adds the definition of $\mathbb{R}$ , then $\mathbb{Z}$ , then the two functors, then the adjunction notation, then the hom-set expression.

Invariants

The lecture remains focused on adjoint functors throughout.
The example is built entirely from the order relation $\le$ on numbers.

Interpretation

The visual sequence shows how an abstract adjunction is instantiated on a very simple pair of poset categories, using inclusion and floor as the two functors.

Whiteboard organization of the example

Clear evidence

Shown in the video

Evidence

Diagram
Observation
The whiteboard is divided into a left prewritten definition block, a middle adjunction diagram Z ⇄ R with F and G, and a right area where the lecturer adds the example and final equivalence.
Animation
Observation
The lecturer writes progressively on the right half of the board while pointing back to the middle diagram.

Objects

Prewritten definition of adjoint functors
Diagram Z ⇄ R with F and G
Example values $a = 2$ , $b = π$
Final equivalence a ≤ ⌊b⌋ ⇔ $a \le b$

Changes

The lecturer adds the example values under Z and R.
He writes $I(2)=2$ and ⌊π⌋=3.
He then writes the general equivalence on the far right.

Invariants

The left-side definition remains visible throughout.
The middle adjunction diagram remains the reference structure for the example.

Interpretation

The visual layout separates the general definition, the concrete functor diagram, and the derived order-theoretic conclusion, making the example a specialization of the adjunction framework.

Gesture expressing the adjunction correspondence

Clear evidence

Shown in the video

Evidence

Animation
Observation
The lecturer gestures between the two sides of the example diagram while saying that a map here is the same as a map there.
Audio
Observation
The spoken line directly accompanies the gesture.

Objects

Left side of the example diagram
Right side of the example diagram
Lecturer’s hand and marker

Changes

His attention shifts from one side of the diagram to the other as he explains the correspondence.

Invariants

The underlying adjunction diagram Z ⇄ R stays fixed on the board.

Interpretation

The gesture visually encodes the bijection/correspondence of morphisms that the adjunction provides.

Misconceptions · 5

Thinking the natural isomorphism is directly between F and G

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer anticipates the question: “natural isomorphism, that’s just natural transformation too, but isn’t that for functors that are going in the same direction? And you’d be right.”

Misconception

One might incorrectly think that saying F and G are naturally isomorphic refers to the original functors F and G themselves, even though they go in opposite directions.

Clarification

The video corrects this by reformulating the condition as a natural isomorphism between the two derived functors $\mathcal{B}$ (F(-),-) and $\mathcal{A}$ (-,G(-)), which do have the same domain and codomain.

Overinterpreting the symbol $\cong$ in the hom-set formula

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer asks what the isomorphism means and answers that the objects are hom sets living in the category of sets, so the isomorphism is a bijection.

Misconception

A learner may wonder whether the $\cong$ in $\mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B))$ refers to some exotic categorical isomorphism.

Clarification

Because both sides are hom-sets, the relevant ambient category is SET, and the isomorphism is simply a bijection of sets.

Adjunction is more than a bare bijection of hom-sets

Clear evidence

Shown in the video

Evidence

Audio
Observation
After stating the hom-set bijection, the lecturer immediately asks, "What do we mean by naturally in A?" and spends the rest of the clip explaining composition compatibility.
Formula
Observation
The board explicitly appends "naturally in $A\in\mathcal{A}$ and $B\in\mathcal{B}$ " to the isomorphism $\mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))$ .

Misconception

One might think that $F\dashv G$ only requires a set-theoretic bijection $\mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))$ for each pair $(A,B)$ .

Clarification

The video stresses that the bijection must be natural in both variables; in particular, naturality in $A$ requires compatibility with precomposition by every morphism $h:A'\to A$ .

Morphisms in this order-category are directional

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer contrasts a morphism from 3 to 4 with the absence of a morphism from 4 to 3.

Misconception

One might think that because 3 and 4 are comparable numbers, morphisms should exist in both directions.

Clarification

In the category being defined, a morphism $x\to y$ exists only when $x\le y$ . Thus $3\to 4$ exists, but $4\to 3$ does not.

Do not treat adjunctions as purely abstract notation

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer concludes, "So this is kind of a cool thing to see, and it's really simple using just these adjoint functors."
Formula
Observation
The board reduces the abstract adjunction to the familiar inequality equivalence a ≤ ⌊b⌋ ⇔ $a \le b$ .

Misconception

One might think adjoint functors are only an abstract formalism without concrete computational content.

Clarification

The clip shows that the adjunction between inclusion and floor translates directly into the familiar order fact a ≤ ⌊b⌋ ⇔ $a \le b$ .

Concept relations · 11

Definition of adjoint functors via a natural isomorphism of hom-sets → Equivalent formulation of adjointness using curried hom-functors

Clear evidence

Shown in the video

Evidence

Formula
Observation
The lecturer writes “i.e.” and then the functorial equivalence after the original definition.
Audio
Observation
He motivates the rewrite by noting that natural isomorphism makes sense for functors going in the same direction.

Equivalent

Explanation

The second formulation is presented as an “i.e.” restatement of the first: adjointness defined by a natural isomorphism of hom-sets is equivalent to natural isomorphism of the two curried hom-functors.

Meaning of isomorphism between the two hom-sets → Definition of adjoint functors via a natural isomorphism of hom-sets

Clear evidence

Shown in the video

Evidence

Audio
Observation
Before concluding that an adjunction is a choice of natural isomorphism, the lecturer explains that the compared objects are hom sets and that isomorphism there means bijection.

Prerequisite

Explanation

Understanding that the displayed $\cong$ is a bijection of hom-sets is needed to interpret the definition of adjoint functors given in the video.

Adjunction as a chosen natural isomorphism → Definition of adjoint functors via a natural isomorphism of hom-sets

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board sentence “An adjunction between F and G is a choice of natural isomorphism” directly follows the defining isomorphism.

Contains

Explanation

The idea of an adjunction as a chosen natural isomorphism is part of the full definition of adjoint functors presented on the board.

Adjointness is equivalent to natural isomorphism of the two curried hom-functors → Equivalent formulation of adjointness using curried hom-functors

Clear evidence

Shown in the video

Evidence

Formula
Observation
The claim line uses exactly the two functor expressions introduced in the equivalent formulation.

Proof dependency

Explanation

The proposition that F and G are adjoint iff the two curried functors are naturally isomorphic depends on the functorial reformulation written just before it.

Meaning of naturality in the first variable $A$ → Definition of adjoint functors via natural isomorphism of hom-sets

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board first defines $F\dashv G$ by $\mathcal{B}(F(A),B)\cong\mathcal{A}(A,G(B))$ naturally in $A$ and $B$ , then expands the meaning of "naturally in $A$ ".

Proof dependency

Explanation

The naturality-in- $A$ condition is a required part of the definition of adjoint functors given on the board; without it, the hom-set isomorphism alone does not define an adjunction.

Poset category built from the usual order on real numbers → Inclusion functor from integers to reals

Clear evidence

Shown in the video

Evidence

Audio
Observation
After defining $\mathbb{R}$ and saying $\mathbb{Z}$ is defined the same way, the lecturer introduces $I$ and $F$ between them.
Formula
Observation
The board places $I:\mathbb{Z}\to\mathbb{R}$ and $F:\mathbb{R}\to\mathbb{Z}$ directly under the two category definitions.

Prerequisite

Explanation

The inclusion functor is defined only after the two order-categories $\mathbb{Z}$ and $\mathbb{R}$ have been introduced.

Poset category built from the usual order on real numbers → Floor-function functor from reals to integers

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer defines the integer category the same way and then introduces the floor functor in the opposite direction.
Formula
Observation
The board shows $F:\mathbb{R}\to\mathbb{Z}$ beneath the category definitions.

Prerequisite

Explanation

The floor functor is also defined only after the source and target categories have been specified.

Inclusion functor from integers to reals → Adjunction statement $I \dashv F$

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer says, "So from this example, we have that I is left adjoint to F."
Formula
Observation
The board writes $I\dashv F$ after drawing the two functors.

Proof dependency

Explanation

The adjunction claim depends on having already defined the specific functors $I$ and $F$ .

Inclusion functor from integers to reals → Floor-function functor from reals to integers

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board shows opposite arrows $\mathbb{Z}\xrightarrow{I}\mathbb{R}$ and $\mathbb{R}\xrightarrow{F}\mathbb{Z}$ .
Audio
Observation
The lecturer explicitly says one functor goes in one direction and the other in the opposite direction.

Contrast

Explanation

The two functors go in opposite directions between the same pair of categories, and their contrast is what makes the adjunction example meaningful.

Prewritten definition of adjoint functors → Example categories Z and R

Clear evidence

Shown in the video

Evidence

Formula
Observation
The left side of the board contains the general definition F ⊣ G, while the middle and right sides instantiate it with Z, R, F, G, and the final equivalence.
Audio
Observation
The lecturer moves from the prewritten definition into the concrete example.

Application

Explanation

The general definition of adjoint functors is applied to the specific categories Z and R with the inclusion and floor functors.

Inclusion functor F : $Z \to R$ → Floor functor G : $R \to Z$

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board writes F ⊣ G beside the diagram Z ⇄ R.
Audio
Observation
The lecturer refers to F as the inclusion functor and G as the floor function functor within the same adjunction.

Contrast

Explanation

F and G are paired as left and right adjoints: F includes integers into reals, while G floors reals back to integers.

Find an answer · 17

What does it mean for F to be left adjoint to G in this lecture?

Clear evidence

Shown in the video

Evidence

Formula
Observation
The opening board text gives the definition of F ⊣ G via a natural isomorphism of hom-sets.
Audio
Observation
The lecturer reads and explains the definition.

Knowledge points

Definition of adjoint functors via a natural isomorphism of hom-sets
Adjunction as a chosen natural isomorphism

Why does the lecturer emphasize that F and G go in opposite directions?

Clear evidence

Shown in the video

Evidence

Animation
Observation
The lecturer points to the arrows F and G going in opposite directions.
Audio
Observation
He explicitly remarks that they are going in opposite directions.

Knowledge points

Definition of adjoint functors via a natural isomorphism of hom-sets

In the formula $\mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B))$ , what kind of isomorphism is meant?

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer says the hom-sets live in the category of sets and the isomorphism is a bijection.

Knowledge points

Meaning of isomorphism between the two hom-sets

How can we speak of a natural isomorphism if F and G themselves go in opposite directions?

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer raises the issue that natural isomorphism is for functors going in the same direction.
Formula
Observation
He then rewrites the condition using two functors $\mathcal{A}^{op}\times\mathcal{B}\to$ SET.

Knowledge points

Equivalent formulation of adjointness using curried hom-functors
Thinking the natural isomorphism is directly between F and G

What are the two functors $\mathcal{B}$ (F(-),-) and $\mathcal{A}$ (-,G(-)) used for in the definition of adjunction?

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board displays $\mathcal{B}$ (F(-),-) and $\mathcal{A}$ (-,G(-)) as functors from $\mathcal{A}^{op}\times\mathcal{B}$ to SET.

Knowledge points

Equivalent formulation of adjointness using curried hom-functors
Adjointness is equivalent to natural isomorphism of the two curried hom-functors

Why does the lecturer add an “iff” statement after the original definition?

Clear evidence

Shown in the video

Evidence

Formula
Observation
The added line begins “i.e. F and G are adjoint iff …”.
Audio
Observation
The lecturer says this is another way to view the same condition.

Knowledge points

Adjointness is equivalent to natural isomorphism of the two curried hom-functors
Reformulating the hom-set isomorphism as a natural isomorphism of same-direction functors

How is an adjunction $F\dashv G$ defined using hom-sets?

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board definition of $F\dashv G$ appears in the first minute.

Knowledge points

Definition of adjoint functors via natural isomorphism of hom-sets

What does it mean for the adjunction isomorphism to be natural in $A$ ?

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer explicitly asks what "naturally in A" means and then explains it.

Knowledge points

Meaning of naturality in the first variable $A$
Derivation of the naturality-in- $A$ condition from the adjunction isomorphism

Why can a morphism $A\to G(B)$ be replaced by a morphism $F(A)\to B$ under an adjunction?

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer says a map $A\to G(B)$ is the same as a map $F(A)\to B$ .

Knowledge points

Adjunction identifies morphisms $A\to G(B)$ with morphisms $F(A)\to B$
Definition of adjoint functors via natural isomorphism of hom-sets

How is the category of real numbers defined using the order relation $\le$ ?

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board defines $\mathbb{R}$ by objects and morphisms.
Audio
Observation
The lecturer explains the morphism rule and gives the 3-to-4 example.

Knowledge points

Poset category built from the usual order on real numbers

Why is there a morphism from 3 to 4 but not from 4 to 3 in this category?

Clear evidence

Shown in the video

Evidence

Audio
Observation
The lecturer says there is no morphism from 4 to 3.

Knowledge points

Poset category built from the usual order on real numbers
Morphisms in this order-category are directional

What are the functors $I$ and $F$ in the integer-real example?

Clear evidence

Shown in the video

Evidence

Formula
Observation
The board labels $I$ as inclusion and $F$ as floor function.
Audio
Observation
The lecturer names both functors and their directions.

Knowledge points

Inclusion functor from integers to reals
Floor-function functor from reals to integers

Coverage and review notes

Covered · Opening Mac Lane quotation and overlay title introduce the topic of adjoint functors.

Covered · The lecturer reads the pre-written definition, points out opposite directions of F and G, explains the hom-set isomorphism as a bijection, and states that an adjunction is a chosen natural isomorphism.

Covered · The lecturer addresses the same-direction issue for natural isomorphism and writes the equivalent formulation using $\mathcal{B}$ (F(-),-) and $\mathcal{A}$ (-,G(-)) as functors $\mathcal{A}^{op}\times\mathcal{B}\to$ SET.

Covered · He steps back and verbally contrasts the new functorial formulation with the original definition, emphasizing that the two displayed functors go in the same direction.

Covered · No new mathematical claim is completed in this closing portion; the lecturer begins drawing a fresh diagram with $\mathcal{A}$ and $\mathcal{B}$ , but the clip ends before the construction is developed further.

Covered · The lecturer states the definition of adjoint functors and explains the basic hom-set correspondence between $A\to G(B)$ and $F(A)\to B$ .

Covered · The lecturer defines what naturality in $A$ means by requiring compatibility with precomposition along any $h:A'\to A$ .

Covered · Opening transition and setup for a simple example; no new mathematical statement beyond preparing the example.

Covered · Definition of the category $\mathbb{R}$ and concrete morphism example.

Covered · The lecturer states that $\mathbb{Z}$ is defined the same way.

Covered · Introduction of the two functors $I$ and $F$ between $\mathbb{Z}$ and $\mathbb{R}$ .

Covered · Statement that $I$ is left adjoint to $F$ , followed by the beginning of the hom-set adjunction formula.

Covered · The clip opens on the prewritten adjunction definition and the lecturer introduces the concrete choices $a = 2$ and $b = π$ .

Covered · The lecturer identifies the categories Z and R and explains that the inclusion functor sends 2 to 2.

Covered · The floor functor is introduced and applied to π, giving 3.

Covered · The lecturer states that the adjunction means a map on one side corresponds to a map on the other side.

Covered · The general equivalence a ≤ ⌊b⌋ ⇔ $a \le b$ is written and explained as the consequence of the example.

Covered · The lecturer comments that the result is simple and illustrates the usefulness of adjoint functors.

Explore the knowledge in this video

Open video knowledge graph →

Categories ApplicationAt 8:22
Why this connection?
Reviewed English material v1: card "Example categories: integers and reals" at 8:22 — The example uses Z, the category of integers, and R, the category of real numbers. The board explicitly notes that in R, morphisms are given by the order relation: $x \to y$ exactly when $x \le y$ .

Questions this video answers

Find a method

Meet the concept

Meet the concept

Meet the concept

Meet the concept

Find a method

Meet the concept

Meet the concept

Category Theory: Adjoint Functors Part 1

The explanation, unpacked.

Chapters

Learning script

Knowledge cards

Adjoint functors: basic definition

Why the isomorphism is a bijection

Adjunction as a chosen natural isomorphism

Equivalent functorial formulation

Common pitfall in reading the definition

Adjoint functors via hom-set isomorphism

Object action of the adjoint pair

Morphism correspondence under adjunction

Naturality in the first variable AAA

Adjunction is not just a bare bijection

Order-category R\mathbb{R}R

Asymmetric morphisms

Order-category Z\mathbb{Z}Z

Inclusion functor III

Floor functor FFF

Adjunction claim I⊣FI\dashv FI⊣F

Hom-set form of the adjunction

General definition of adjoint functors

Example categories: integers and reals

Inclusion functor F : Z→RZ \to RZ→R

Floor functor G : R→ZR \to ZR→Z

Adjunction as correspondence of maps

Concrete equivalence from the adjunction

Detailed learning notes

A\mathcal{A}A

B\mathcal{B}B

F

G

F⊣GF \dashv GF⊣G

B(F(A),B)\mathcal{B}(F(A),B)B(F(A),B)

A(A,G(B))\mathcal{A}(A,G(B))A(A,G(B))

≅\cong≅

A

B

SET

Aop\mathcal{A}^{op}Aop

Definition of adjoint functors via a natural isomorphism of hom-sets

Meaning of isomorphism between the two hom-sets

Adjunction as a chosen natural isomorphism

Equivalent formulation of adjointness using curried hom-functors

Definition of adjoint functors via natural isomorphism of hom-sets

Meaning of naturality in the first variable AAA

Poset category built from the usual order on real numbers

Inclusion functor from integers to reals

Floor-function functor from reals to integers

Adjunction statement I⊣FI \dashv FI⊣F

Prewritten definition of adjoint functors

Example categories Z and R

Adjointness is equivalent to natural isomorphism of the two curried hom-functors

Adjunction identifies morphisms A→G(B)A\to G(B)A→G(B) with morphisms F(A)→BF(A)\to BF(A)→B

The inclusion functor is left adjoint to the floor functor

Adjunction gives a correspondence of maps

Concrete equivalence for floor and inclusion

Reformulating the hom-set isomorphism as a natural isomorphism of same-direction functors

Derivation of the naturality-in-AAA condition from the adjunction isomorphism

Beginning of the hom-set formulation of the adjunction

Deriving the floor inequality from the adjunction example

Concrete morphism example in the real-number category

Worked example with a=2a = 2a=2 and b=πb = πb=π

Opening quotation and title overlay

Pointing out that F and G go in opposite directions

Writing the equivalent functorial formulation

Gestural contrast between old and new formulations

Beginning a new picture with categories A and B

Whiteboard layout of the adjunction picture

Progressive whiteboard construction of the Z\mathbb{Z}Z-R\mathbb{R}R adjunction example

Whiteboard organization of the example

Gesture expressing the adjunction correspondence

Thinking the natural isomorphism is directly between F and G

Overinterpreting the symbol ≅\cong≅ in the hom-set formula

Adjunction is more than a bare bijection of hom-sets

Morphisms in this order-category are directional

Do not treat adjunctions as purely abstract notation

Definition of adjoint functors via a natural isomorphism of hom-sets → Equivalent formulation of adjointness using curried hom-functors

Meaning of isomorphism between the two hom-sets → Definition of adjoint functors via a natural isomorphism of hom-sets

Naturality in the first variable $A$

Order-category $\mathbb{R}$

Order-category $\mathbb{Z}$

Inclusion functor $I$

Floor functor $F$

Adjunction claim $I\dashv F$

Inclusion functor F : $Z \to R$

Floor functor G : $R \to Z$

$\mathcal{A}$

$\mathcal{B}$

$F \dashv G$

$\mathcal{B}(F(A),B)$

$\mathcal{A}(A,G(B))$

$\cong$

$\mathcal{A}^{op}$

Meaning of naturality in the first variable $A$

Adjunction statement $I \dashv F$

Adjunction identifies morphisms $A\to G(B)$ with morphisms $F(A)\to B$

Derivation of the naturality-in- $A$ condition from the adjunction isomorphism

Worked example with $a = 2$ and $b = π$

Progressive whiteboard construction of the $\mathbb{Z}$ - $\mathbb{R}$ adjunction example

Overinterpreting the symbol $\cong$ in the hom-set formula

Meaning of naturality in the first variable $A$ → Definition of adjoint functors via natural isomorphism of hom-sets

Inclusion functor from integers to reals → Adjunction statement $I \dashv F$

Inclusion functor F : $Z \to R$ → Floor functor G : $R \to Z$

In the formula $\mathcal{B}(F(A),B) \cong \mathcal{A}(A,G(B))$ , what kind of isomorphism is meant?

What are the two functors $\mathcal{B}$ (F(-),-) and $\mathcal{A}$ (-,G(-)) used for in the definition of adjunction?

How is an adjunction $F\dashv G$ defined using hom-sets?

What does it mean for the adjunction isomorphism to be natural in $A$ ?

Why can a morphism $A\to G(B)$ be replaced by a morphism $F(A)\to B$ under an adjunction?

How is the category of real numbers defined using the order relation $\le$ ?

What are the functors $I$ and $F$ in the integer-real example?