Skip to content
The Lumenary

Practice · Research pathways

Higher categories

Higher categories

Warm-upHuman

A bicategory with exactly one object ⋆\star is the same thing as which of the following?

Choose one

Higher categories

Warm-upComputational

How many ways are there to fully bracket a composite of six composable 1-cells f6f5f4f3f2f1f_6 f_5 f_4 f_3 f_2 f_1? (These are the vertices of the associahedron K6K_6.)

Higher categories

CoreHuman

Let α:F⇒G\alpha : F \Rightarrow G (functors C→D\mathcal{C} \to \mathcal{D}) and γ:I⇒J\gamma : I \Rightarrow J (functors D→E\mathcal{D} \to \mathcal{E}). Which formulas give the component (γ∗α)X:IFX→JGX(\gamma \ast \alpha)_X : IFX \to JGX of the horizontal composite? (Choose all that apply.)

Choose all that apply

Higher categories

CoreHuman

In the proof of the interchange law (δ⋅γ)∗(β⋅α)=(δ∗β)⋅(γ∗α)(\delta \cdot \gamma) \ast (\beta \cdot \alpha) = (\delta \ast \beta) \cdot (\gamma \ast \alpha) in Cat\mathbf{Cat}, after expanding components the two sides are K(βX)K(αX)δFXγFXK(\beta_X) K(\alpha_X) \delta_{FX} \gamma_{FX} and K(βX) δGXJ(αX) γFXK(\beta_X)\, \delta_{GX} J(\alpha_X)\, \gamma_{FX}. Which fact finishes the proof?

Choose one

Higher categories

CoreHuman

The Eckmann–Hilton argument assumes that both operations are unital. Which pair of operations on a set with at least two elements satisfies the interchange law (a⋆b)⊙(c⋆d)=(a⊙c)⋆(b⊙d)(a \star b) \odot (c \star d) = (a \odot c) \star (b \odot d) but is not commutative, showing the unit hypothesis cannot be dropped?

Choose one

Higher categories

CoreFormal

Let B be a bicategory in Lean ([Bicategory B]) and a : B. Which statement formalises Corollary 3, 'the 2-endomorphisms of an identity 1-morphism commute'?

Choose one

Higher categories

CoreHuman

Which of these are strict 2-categories, with composition of 1-cells associative and unital on the nose? (Choose all that apply.)

Choose all that apply

Higher categories

StretchHuman

Which statement about coherence in dimension 3 is correct?

Choose one

Higher categories

StretchComputational

Write count_bracketings(n), the number of full bracketings of a word of n letters (use the recursion over the outermost bracket), and count_moves(n), the number of edges of the associahedron KnK_n: pairs of bracketings that differ by one associator. Use the fact that every bracketing of n≥2n \ge 2 letters has exactly n−2n - 2 internal brackets, each allowing exactly one associator move.

Runs entirely in your browser, in an isolated worker. Nothing is sent to a server.