Categorifying Cardinal Arithmetic PDF

Emily Riehl
Johns Hopkins University
Categorifying cardinal arithmetic
MAA MathFest, August 4, 2018

Plan
Goal: prove 𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) for any natural numbers

𝑎, 𝑏, and 𝑐 .
Plan

𝑎, 𝑏, and 𝑐 by taking a tour of some deep ideas from category theory.
Plan

• Step 1: categorification
• Step 2: the Yoneda lemma
• Step 3: representability
• Step 4: the proof

Plan

• Step 1: categorification
• Step 2: the Yoneda lemma
• Step 3: representability
• Step 4: the proof
• Epilogue: what was the point of that?

1
Step 1: categorification
The idea of categorification
The first step is to understand the equation
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐)
as expressing some deeper truth about mathematical structures.

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐)
Q: What is the deeper meaning of the equation
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐)
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
Q: What is the role of the natural numbers 𝑎, 𝑏, and 𝑐 ?

Categorifying natural numbers

A: Natural numbers define the cardinalities, or sizes, of finite sets.

A: Natural numbers define the cardinalities, or sizes, of finite sets.
Natural numbers 𝑎, 𝑏, and 𝑐 encode the sizes of finite sets 𝐴, 𝐵, and 𝐶.
𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.

Categorifying equality
𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.

𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.
Q: What is true of 𝐴 and 𝐵 if 𝑎 = 𝑏 ?

𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.

A: The sets 𝐴 and 𝐵 are isomorphic, in which case we write 𝐴 ≅ 𝐵, if
and only if 𝑎 = 𝑏.
𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.

For 𝑎 ≔ |𝐴| and 𝑏 ≔ |𝐵|, the equation 𝑎 = 𝑏 asserts the existence of

an isomorphism 𝐴 ≅ 𝐵.
𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.


Eugenia Cheng: “All equations are lies.”

𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.


Eugenia Cheng: “All equations are lies.”

Categorification: the truth behind 𝑎 = 𝑏 is 𝐴 ≅ 𝐵.
Categorification progress report
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
The story so far:

• The natural numbers 𝑎, 𝑏, and 𝑐 encode the sizes of finite sets 𝐴, 𝐵,
and 𝐶:
𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
The story so far:

and 𝐶:
𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.
• The equation “=” asserts the existence of an isomorphism “≅”.
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
The story so far:

and 𝐶:
𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.
• The equation “=” asserts the existence of an isomorphism “≅”.
Q: What is the deeper meaning of the symbols “+” and “×”?

Categorifying +
Q: If 𝑏 ≔ |𝐵| and 𝑐 ≔ |𝐶| what set has 𝑏 + 𝑐 elements?

Categorifying +
A: The disjoint union 𝐵 + 𝐶 is a set with 𝑏 + 𝑐 elements.
⎧ ♯
{ ⎫ } ♠ ♡ ♯ ♭ ♠ ♡
𝐵=⎨ ♭ ⎬, 𝐶={ }, 𝐵+𝐶={ }
{ ♢ ♣ ♮ ♢ ♣
⎩ ♮ }
⎭
Categorifying +
A: The disjoint union 𝐵 + 𝐶 is a set with 𝑏 + 𝑐 elements.
⎧ ♯
{ ⎫ } ♠ ♡ ♯ ♭ ♠ ♡
𝐵=⎨ ♭ ⎬, 𝐶={ }, 𝐵+𝐶={ }
{ ♢ ♣ ♮ ♢ ♣
⎩ ♮ }
⎭
𝑏 + 𝑐 ≔ |𝐵 + 𝐶|
Categorifying ×
Q: If 𝑎 ≔ |𝐴| and 𝑏 ≔ |𝐵| what set has 𝑎 × 𝑏 elements?

Categorifying ×
A: The cartesian product 𝐴 × 𝐵 is a set with 𝑎 × 𝑏 elements.
⎧ ♯ (∗, ♯) (⋆, ♯)
{ ⎫ } ⎧
{ ⎫
}
𝐴={ ∗ ⋆ }, 𝐵=⎨ ♭ ⎬, 𝐴 × 𝐵 = ⎨ (∗, ♭) (⋆, ♭) ⎬
{
⎩ ♮ }
⎭ {
⎩ (∗, ♮) (⋆, ♮) }
⎭
Categorifying ×
A: The cartesian product 𝐴 × 𝐵 is a set with 𝑎 × 𝑏 elements.
⎧ ♯ (∗, ♯) (⋆, ♯)
{ ⎫ } ⎧
{ ⎫
}
𝐴={ ∗ ⋆ }, 𝐵=⎨ ♭ ⎬, 𝐴 × 𝐵 = ⎨ (∗, ♭) (⋆, ♭) ⎬
{
⎩ ♮ }
⎭ {
⎩ (∗, ♮) (⋆, ♮) }
⎭
𝑎 × 𝑏 ≔ |𝐴 × 𝐵|
In summary:
In summary:
• Natural numbers define cardinalities: there are sets 𝐴, 𝐵, and 𝐶 so
that 𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, and 𝑐 ≔ |𝐶|.
In summary:
that 𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, and 𝑐 ≔ |𝐶|.
• The equation 𝑎 = 𝑏 encodes an isomorphism 𝐴 ≅ 𝐵.
In summary:
that 𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, and 𝑐 ≔ |𝐶|.
• The disjoint union 𝐵 + 𝐶 is a set with 𝑏 + 𝑐 elements.
In summary:
that 𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, and 𝑐 ≔ |𝐶|.
• The cartesian product 𝐴 × 𝐵 is a set with 𝑎 × 𝑏 elements.
In summary:
that 𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, and 𝑐 ≔ |𝐶|.
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
In summary:
that 𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, and 𝑐 ≔ |𝐶|.
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
A: It means that the sets 𝐴 × (𝐵 + 𝐶) and (𝐴 × 𝐵) + (𝐴 × 𝐶) are

isomorphic!
𝐴 × (𝐵 + 𝐶) ≅ (𝐴 × 𝐵) + (𝐴 × 𝐶)
Summary of Step 1
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
A: The sets 𝐴 × (𝐵 + 𝐶) and (𝐴 × 𝐵) + (𝐴 × 𝐶) are isomorphic!
Summary of Step 1
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
⎧ (∗, ♯) (⋆, ♯) ⎫
{ (∗, ♭) (⋆, ♭) }
{ } (∗, ♯) (∗, ♭) (∗, ♠) (∗, ♡)
{ (∗, ♮) (⋆, ♮) } ⎧ ⎫
{ } { { (∗, ♮) (∗, ♢) (∗, ♣)
}
}
(∗, ♠) (⋆, ♠) ≅
⎨ ⎬ ⎨ (⋆, ♯) (⋆, ♭) (⋆, ♠) (⋆, ♡) ⎬
{ (∗, ♡) (⋆, ♡) } { }
{ } { ⎩ (⋆, ♮) (⋆, ♢) (⋆, ♣) }
⎭
{ (∗, ♢) (⋆, ♢) }
{ }
⎩ (∗, ♣) (⋆, ♣) ⎭
𝐴 × (𝐵 + 𝐶) ≅ (𝐴 × 𝐵) + (𝐴 × 𝐶)
Summary of Step 1
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
⎧ (∗, ♯) (⋆, ♯) ⎫
{ (∗, ♭) (⋆, ♭) }
{ } (∗, ♯) (∗, ♭) (∗, ♠) (∗, ♡)
{ (∗, ♮) (⋆, ♮) } ⎧ ⎫
{ } { { (∗, ♮) (∗, ♢) (∗, ♣)
}
}
(∗, ♠) (⋆, ♠) ≅
⎨ ⎬ ⎨ (⋆, ♯) (⋆, ♭) (⋆, ♠) (⋆, ♡) ⎬
{ (∗, ♡) (⋆, ♡) } { }
{ } { ⎩ (⋆, ♮) (⋆, ♢) (⋆, ♣) }
⎭
{ (∗, ♢) (⋆, ♢) }
{ }
⎩ (∗, ♣) (⋆, ♣) ⎭
𝐴 × (𝐵 + 𝐶) ≅ (𝐴 × 𝐵) + (𝐴 × 𝐶)
By categorification:
Step 1 summary: To prove 𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐)

Summary of Step 1
𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) ?
⎧ (∗, ♯) (⋆, ♯) ⎫
{ (∗, ♭) (⋆, ♭) }
{ } (∗, ♯) (∗, ♭) (∗, ♠) (∗, ♡)
{ (∗, ♮) (⋆, ♮) } ⎧ ⎫
{ } { { (∗, ♮) (∗, ♢) (∗, ♣)
}
}
(∗, ♠) (⋆, ♠) ≅
⎨ ⎬ ⎨ (⋆, ♯) (⋆, ♭) (⋆, ♠) (⋆, ♡) ⎬
{ (∗, ♡) (⋆, ♡) } { }
{ } { ⎩ (⋆, ♮) (⋆, ♢) (⋆, ♣) }
⎭
{ (∗, ♢) (⋆, ♢) }
{ }
⎩ (∗, ♣) (⋆, ♣) ⎭
𝐴 × (𝐵 + 𝐶) ≅ (𝐴 × 𝐵) + (𝐴 × 𝐶)

⇝ we’ll instead show that 𝐴 × (𝐵 + 𝐶) ≅ (𝐴 × 𝐵) + (𝐴 × 𝐶).
2
Step 2: the Yoneda lemma

The Yoneda lemma
The Yoneda lemma. Two sets 𝐴 and 𝐵 are isomorphic if and only if
The Yoneda lemma
• for all sets 𝑋, the sets of functions
Fun(𝐴, 𝑋) ≔ {𝜙 ∶ 𝐴 → 𝑋} and Fun(𝐵, 𝑋) ≔ {𝜓 ∶ 𝐵 → 𝑋}
are isomorphic
The Yoneda lemma
are isomorphic and moreover

• the isomorphisms Fun(𝐴, 𝑋) ≅ Fun(𝐵, 𝑋) are “natural” in the
sense of commuting with composition with any function 𝑓 ∶ 𝑋 → 𝑌.
The Yoneda lemma
are isomorphic and moreover

• the isomorphisms Fun(𝐴, 𝑋) ≅ Fun(𝐵, 𝑋) are “natural” in the
sense of commuting with composition with any function 𝑓 ∶ 𝑋 → 𝑌.
???
Proof of the Yoneda lemma
The Yoneda lemma. 𝐴 and 𝐵 are isomorphic if and only if for any 𝑋 the
sets of functions Fun(𝐴, 𝑋) and Fun(𝐵, 𝑋) are “naturally” isomorphic.
Proof (⇐):
Proof (⇐): Suppose Fun(𝐴, 𝑋) ≅ Fun(𝐵, 𝑋) for all 𝑋.

Proof (⇐): Suppose Fun(𝐴, 𝑋) ≅ Fun(𝐵, 𝑋) for all 𝑋. Taking 𝑋 = 𝐴

and 𝑋 = 𝐵, we use the bijections:
Fun(𝐴, 𝐴) ≅ Fun(𝐵, 𝐴) Fun(𝐴, 𝐵) ≅ Fun(𝐵, 𝐵)
𝐴


∈
∈
id𝐴 id𝐵


∈
∈
∈
∈
id𝐴 𝜓 𝜙 id𝐵
to define functions 𝜓 ∶ 𝐵 → 𝐴 and 𝜙 ∶ 𝐴 → 𝐵.



∈
∈
∈
∈
to define functions 𝜓 ∶ 𝐵 → 𝐴 and 𝜙 ∶ 𝐴 → 𝐵. In fact, they’re

inverses!


∈
∈
∈
∈
to define functions 𝜓 ∶ 𝐵 → 𝐴 and 𝜙 ∶ 𝐴 → 𝐵. In fact, they’re

inverses!
Exercise: Use the “naturality” of Fun(𝐴, 𝑋) ≅ Fun(𝐵, 𝑋) to prove that

𝜓 ∘ 𝜙 = id𝐴 and 𝜙 ∘ 𝜓 = id𝐵 .
Summary of Steps 1 and 2



By the Yoneda lemma:
Step 2 summary: To prove 𝐴 × (𝐵 + 𝐶) ≅ (𝐴 × 𝐵) + (𝐴 × 𝐶)



⇝ we’ll instead define a “natural” isomorphism
Fun(𝐴 × (𝐵 + 𝐶), 𝑋) ≅ Fun((𝐴 × 𝐵) + (𝐴 × 𝐶), 𝑋).
3
Step 3: representability
The universal property of the disjoint union
Q: For sets 𝐵, 𝐶, and 𝑋, what is Fun(𝐵 + 𝐶, 𝑋)?

Q: What is needed to define a function 𝑓 ∶ 𝐵 + 𝐶 → 𝑋?

A: For each 𝑏 ∈ 𝐵, we need to specify 𝑓(𝑏) ∈ 𝑋, and for each 𝑐 ∈ 𝐶,

we need to specify 𝑓(𝑐) ∈ 𝑋.

we need to specify 𝑓(𝑐) ∈ 𝑋. So the function 𝑓 ∶ 𝐵 + 𝐶 → 𝑋 is
determined by two functions 𝑓𝐵 ∶ 𝐵 → 𝑋 and 𝑓𝐶 ∶ 𝐶 → 𝑋.

we need to specify 𝑓(𝑐) ∈ 𝑋. So the function 𝑓 ∶ 𝐵 + 𝐶 → 𝑋 is
determined by two functions 𝑓𝐵 ∶ 𝐵 → 𝑋 and 𝑓𝐶 ∶ 𝐶 → 𝑋.
By “pairing”
Fun(𝐵 + 𝐶, 𝑋) ≅ Fun(𝐵, 𝑋) × Fun(𝐶, 𝑋)
∈
∈
𝑓 ↭ (𝑓𝐵 , 𝑓𝐶 )
The university property of the cartesian product
Q: For sets 𝐴, 𝐵, and 𝑋, what is Fun(𝐴 × 𝐵, 𝑋)?

Q: What is needed to define a function 𝑓 ∶ 𝐴 × 𝐵 → 𝑋?

A: For each 𝑏 ∈ 𝐵 and 𝑎 ∈ 𝐴, we need to specify an element

𝑓(𝑎, 𝑏) ∈ 𝑋.

𝑓(𝑎, 𝑏) ∈ 𝑋. Thus, for each 𝑏 ∈ 𝐵, we need to specify a function
𝑓(−, 𝑏) ∶ 𝐴 → 𝑋 sending 𝑎 to 𝑓(𝑎, 𝑏).

𝑓(−, 𝑏) ∶ 𝐴 → 𝑋 sending 𝑎 to 𝑓(𝑎, 𝑏). So, altogether we need to
define a function 𝑓 ∶ 𝐵 → Fun(𝐴, 𝑋).

𝑓(−, 𝑏) ∶ 𝐴 → 𝑋 sending 𝑎 to 𝑓(𝑎, 𝑏). So, altogether we need to
define a function 𝑓 ∶ 𝐵 → Fun(𝐴, 𝑋).
By “currying”
Fun(𝐴 × 𝐵, 𝑋) ≅ Fun(𝐵, Fun(𝐴, 𝑋))
∈
∈
𝑓∶ 𝐴 × 𝐵 → 𝑋 ↭ 𝑓 ∶ 𝐵 → Fun(𝐴, 𝑋)
Summary of Steps 1, 2, and 3








By representability:
Step 3 summary:


Step 3 summary:
• Fun(𝐵 + 𝐶, 𝑋) ≅ Fun(𝐵, 𝑋) × Fun(𝐶, 𝑋) by “pairing”


Step 3 summary:
• Fun(𝐵 + 𝐶, 𝑋) ≅ Fun(𝐵, 𝑋) × Fun(𝐶, 𝑋) by “pairing” and
• Fun(𝐴 × 𝐵, 𝑋) ≅ Fun(𝐵, Fun(𝐴, 𝑋)) by “currying.”
4
Step 4: the proof

The proof
Theorem. For any natural numbers 𝑎, 𝑏, and 𝑐,

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐).
Proof:
The proof

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐).
Proof: To prove 𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐):

The proof

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐).

• pick sets 𝐴, 𝐵, and 𝐶 so that 𝑎 ≔ |𝐴|, and 𝑏 ≔ |𝐵|, and 𝑐 ≔ |𝐶|
The proof

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐).

• and show that 𝐴 × (𝐵 + 𝐶) ≅ (𝐴 × 𝐵) + (𝐴 × 𝐶).
The proof

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐).

• By the Yoneda lemma, this holds if and only if, “naturally,”
The proof

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐).

• Now
Fun(𝐴 × (𝐵+𝐶), 𝑋) ≅
The proof

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐).

• Now
Fun(𝐴 × (𝐵+𝐶), 𝑋) ≅ Fun(𝐵 + 𝐶, Fun(𝐴, 𝑋)) by “currying”
The proof

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐).

• Now
≅ Fun(𝐵, Fun(𝐴, 𝑋)) × Fun(𝐶, Fun(𝐴, 𝑋)) by “pairing”
The proof

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐).

• Now
≅ Fun(𝐴 × 𝐵, 𝑋) × Fun(𝐴 × 𝐶, 𝑋) by “currying”
The proof

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐).

• Now
≅ Fun((𝐴 × 𝐵) + (𝐴 × 𝐶), 𝑋) by “pairing.”
The proof

𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐).

• Now
≅ Fun((𝐴 × 𝐵) + (𝐴 × 𝐶), 𝑋) by “pairing.”
5
Epilogue: what was the point of that?

Generalization to infinite cardinals
Note we didn’t actually need the sets 𝐴, 𝐵, and 𝐶 to be finite.

Theorem. For any cardinals 𝛼, 𝛽, 𝛾,

𝛼 × (𝛽 + 𝛾) = (𝛼 × 𝛽) + (𝛼 × 𝛾).

𝛼 × (𝛽 + 𝛾) = (𝛼 × 𝛽) + (𝛼 × 𝛾).
Proof: The one we just gave.


𝛼 × (𝛽 + 𝛾) = (𝛼 × 𝛽) + (𝛼 × 𝛾).
Exercise: Find a similar proof for other identities of cardinal arithmetic:
𝛼𝛽+𝛾 = 𝛼𝛽 × 𝛼𝛾 and (𝛼𝛽 )𝛾 = 𝛼𝛽×𝛾 = (𝛼𝛾 )𝛽 .

Generalization to other mathematical contexts
In the discussion of representability or the Yoneda lemma, we didn’t
need 𝐴, 𝐵, and 𝐶 to be sets at all!
Theorem.
• For vector spaces 𝑈, 𝑉, 𝑊,
𝑈 ⊗ (𝑉 ⊕ 𝑊 ) ≅ (𝑈 ⊗ 𝑉 ) ⊕ (𝑈 ⊗ 𝑊 ).
• For nice topological spaces 𝑋, 𝑌, 𝑍,

𝑋 × (𝑌 ⊔ 𝑍) = (𝑋 × 𝑌 ) ⊔ (𝑋 × 𝑍).
• For abelian groups 𝐴, 𝐵, 𝐶,

𝐴 ⊗ℤ (𝐵 ⊕ 𝐶) ≅ (𝐴 ⊗ℤ 𝐵) ⊕ (𝐴 ⊗ℤ 𝐶).
Theorem.
• For vector spaces 𝑈, 𝑉, 𝑊,
𝑈 ⊗ (𝑉 ⊕ 𝑊 ) ≅ (𝑈 ⊗ 𝑉 ) ⊕ (𝑈 ⊗ 𝑊 ).
• For nice topological spaces 𝑋, 𝑌, 𝑍,

𝑋 × (𝑌 ⊔ 𝑍) = (𝑋 × 𝑌 ) ⊔ (𝑋 × 𝑍).
• For abelian groups 𝐴, 𝐵, 𝐶,

𝐴 ⊗ℤ (𝐵 ⊕ 𝐶) ≅ (𝐴 ⊗ℤ 𝐵) ⊕ (𝐴 ⊗ℤ 𝐶).

The real point
The ideas of
The real point
The ideas of
• categorification (replacing equality by isomorphism),
The real point
The ideas of
• the Yoneda lemma (replacing isomorphism by natural
isomorphism),
The real point
The ideas of
isomorphism),
• representability (characterizing maps to or from an object),
The real point
The ideas of
isomorphism),
• limits and colimits (like cartesian product and disjoint union),
The real point
The ideas of
isomorphism),
• limits and colimits (like cartesian product and disjoint union), and
• adjunctions (such as currying)
The real point
The ideas of
isomorphism),
are all over mathematics
The real point
The ideas of
isomorphism),
are all over mathematics — so keep a look out!
The real point
The ideas of
isomorphism),
are all over mathematics — so keep a look out!
Thank you!

Categorifying Cardinal Arithmetic PDF

Încărcat de

Informații document

Descriere originală:

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Categorifying Cardinal Arithmetic PDF

Încărcat de

Drepturi de autor:

Formate disponibile

Emily Riehl

Johns Hopkins University

Categorifying cardinal arithmetic

MAA MathFest, August 4, 2018

Goal: prove 𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) for any natural numbers

Goal: prove 𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) for any natural numbers

Goal: prove 𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) for any natural numbers

• Step 2: the Yoneda lemma

• Step 4: the proof

Goal: prove 𝑎 × (𝑏 + 𝑐) = (𝑎 × 𝑏) + (𝑎 × 𝑐) for any natural numbers

• Step 2: the Yoneda lemma

• Step 4: the proof

• Epilogue: what was the point of that?

The first step is to understand the equation

as expressing some deeper truth about mathematical structures.

The first step is to understand the equation

as expressing some deeper truth about mathematical structures.

Q: What is the deeper meaning of the equation

The first step is to understand the equation

as expressing some deeper truth about mathematical structures.

Q: What is the deeper meaning of the equation

Q: What is the role of the natural numbers 𝑎, 𝑏, and 𝑐 ?

Q: What is the role of the natural numbers 𝑎, 𝑏, and 𝑐 ?

Q: What is the role of the natural numbers 𝑎, 𝑏, and 𝑐 ?

A: Natural numbers define the cardinalities, or sizes, of finite sets.

Q: What is the role of the natural numbers 𝑎, 𝑏, and 𝑐 ?

A: Natural numbers define the cardinalities, or sizes, of finite sets.

Natural numbers 𝑎, 𝑏, and 𝑐 encode the sizes of finite sets 𝐴, 𝐵, and 𝐶.

𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.

Natural numbers 𝑎, 𝑏, and 𝑐 encode the sizes of finite sets 𝐴, 𝐵, and 𝐶.

𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.

Natural numbers 𝑎, 𝑏, and 𝑐 encode the sizes of finite sets 𝐴, 𝐵, and 𝐶.

𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.

Q: What is true of 𝐴 and 𝐵 if 𝑎 = 𝑏 ?

Natural numbers 𝑎, 𝑏, and 𝑐 encode the sizes of finite sets 𝐴, 𝐵, and 𝐶.

𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.

Q: What is true of 𝐴 and 𝐵 if 𝑎 = 𝑏 ?

Natural numbers 𝑎, 𝑏, and 𝑐 encode the sizes of finite sets 𝐴, 𝐵, and 𝐶.

𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.

Q: What is true of 𝐴 and 𝐵 if 𝑎 = 𝑏 ?

For 𝑎 ≔ |𝐴| and 𝑏 ≔ |𝐵|, the equation 𝑎 = 𝑏 asserts the existence of

Natural numbers 𝑎, 𝑏, and 𝑐 encode the sizes of finite sets 𝐴, 𝐵, and 𝐶.

𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.

Q: What is true of 𝐴 and 𝐵 if 𝑎 = 𝑏 ?

For 𝑎 ≔ |𝐴| and 𝑏 ≔ |𝐵|, the equation 𝑎 = 𝑏 asserts the existence of

Eugenia Cheng: “All equations are lies.”

Natural numbers 𝑎, 𝑏, and 𝑐 encode the sizes of finite sets 𝐴, 𝐵, and 𝐶.

𝑎 ≔ |𝐴|, 𝑏 ≔ |𝐵|, 𝑐 ≔ |𝐶|.

Q: What is true of 𝐴 and 𝐵 if 𝑎 = 𝑏 ?

For 𝑎 ≔ |𝐴| and 𝑏 ≔ |𝐵|, the equation 𝑎 = 𝑏 asserts the existence of

Eugenia Cheng: “All equations are lies.”

Q: What is the deeper meaning of the equation

Q: What is the deeper meaning of the equation

The story so far:

Q: What is the deeper meaning of the equation

The story so far:

Q: What is the deeper meaning of the equation

The story so far:

Q: What is the deeper meaning of the symbols “+” and “×”?

Q: If 𝑏 ≔ |𝐵| and 𝑐 ≔ |𝐶| what set has 𝑏 + 𝑐 elements?

Q: If 𝑏 ≔ |𝐵| and 𝑐 ≔ |𝐶| what set has 𝑏 + 𝑐 elements?

A: The disjoint union 𝐵 + 𝐶 is a set with 𝑏 + 𝑐 elements.