The Lumenary · First-year graduate
Monoidal categories
Name: ______________________
Date: ______________________
You will learn to
- Verify that , and are symmetric monoidal categories
- State Mac Lane's coherence theorem, compute with string diagrams, and prove that is commutative
- Prove the Eckmann–Hilton argument and use it to explain why braidings exist only "one dimension up"
- Distinguish braided from symmetric monoidal categories, with the braid groups and quantum-group representations as examples
- Define monoid objects and identify them in examples — monoids, rings, -algebras, and monads as monoids of endofunctors
- 1.
In the monoidal category whose tensor product is disjoint union, what must the unit object be (up to isomorphism)?
- A.The empty set
- B.A one-element set
- C.A two-element set
- D.There is no unit; is only a semigroup operation
- 2.
How many different full bracketings are there of the word (keeping the order of the letters)? These are the vertices of the 3-dimensional associahedron.
- 3.
The proof that is commutative uses that and commute, for . Which fact gives this?
- A.Functoriality of (the interchange law): both composites equal
- B.The braiding
- C.The pentagon axiom
- D.Naturality of the unitors
- 4.
What is a monoid object in ?
- A.A ring (with identity, not necessarily commutative)
- B.A commutative ring
- C.Just an abelian group: every abelian group has a unique such structure
- D.A monoid whose underlying set is an abelian group, with no relation between the two
- 5.
Which of these braided monoidal categories is not symmetric?
- A.The braid category, with as the braiding on
- B. with
- C.Super vector spaces with the Koszul sign rule
- D. with
- 6.
A monoid object in is a monoid together with a multiplication and unit that are monoid homomorphisms. What can you conclude?
- A., and is commutative
- B.Nothing more: can be any second associative operation
- C. must be a group
- D. must be trivial
- 7.
Which Lean statement (in Mathlib's notation,
≫= composition in diagrammatic order) formalises " is commutative"?- A.
∀ f g : 𝟙_ C ⟶ 𝟙_ C, f ≫ g = g ≫ f - B.
∀ (X : C) (f g : X ⟶ X), f ≫ g = g ≫ f - C.
(λ_ (𝟙_ C)).hom = (ρ_ (𝟙_ C)).hom - D.
∀ f g : 𝟙_ C ⟶ 𝟙_ C, f ⊗ₘ g = g ⊗ₘ f
- A.
- 8.
An associator on -graded vector spaces is given by exponents of . Write
is_cocycle(w, n)that returnsTrueexactly when the pentagon (3-cocycle) conditionholds for all (sums of grades taken mod ).
Computational — Practice