Eilenberg-Kelly Reloaded Tarmo Uustalu, Reykjavik U. Niccol` o - - PowerPoint PPT Presentation

eilenberg kelly reloaded
SMART_READER_LITE
LIVE PREVIEW

Eilenberg-Kelly Reloaded Tarmo Uustalu, Reykjavik U. Niccol` o - - PowerPoint PPT Presentation

Eilenberg-Kelly Reloaded Tarmo Uustalu, Reykjavik U. Niccol` o Veltri, Tallinn U. of Techn. Noam Zeilberger, Ecole Polytechnique MFPS 2020, online talk Closed categories Closed categories [Eilenberg & Kelly 1966] are categories


slide-1
SLIDE 1

Eilenberg-Kelly Reloaded

Tarmo Uustalu, Reykjavik U. Niccol`

  • Veltri, Tallinn U. of Techn.

Noam Zeilberger, ´ Ecole Polytechnique MFPS 2020, online talk

slide-2
SLIDE 2

Closed categories

◮ Closed categories [Eilenberg & Kelly 1966] are categories with a unit

  • bject I and an internal hom A ⊸ B for all objects A and B.

◮ Examples:

◮ Categories of structured sets, e.g. normal bands, posets ◮ Categories underlying deductive systems, e.g. STLC

◮ In many cases, the internal hom is determined by an adjunction with

the tensor product of a monoidal category, but monoidal structure was not required in Eilenberg & Kelly’s original definition.

slide-3
SLIDE 3

A theorem by Eilenberg & Kelly

◮ Theorem: Given a category C equipped with a unit I and two

functors ⊗ : C × C → C ⊸: Cop × C → C related by an adjunction − ⊗ B ⊣ B ⊸ − natural in B, then (C, I, ⊗) is monoidal iff (C, I, ⊸) is closed and the adjunction holds internally.

slide-4
SLIDE 4

A closer look at the theorem

◮ Internal adjunction: the natural transformation

pA,B,C : (A ⊗ B) ⊸ C → A ⊸ (B ⊸ C) has to be invertible.

◮ Needed to invert associator αA,B,C : (A ⊗ B) ⊗ C → A ⊗ (B ⊗ C). ◮ Invertibility of α not matched by anything in defn. of closed category.

slide-5
SLIDE 5

Recovering a perfect match

◮ [Street 2013] proposes a way to fix the mismatch: consider weak

variants of monoidal and closed categories:

◮ Left-skew monoidal categories [Szlach´

anyi 2012]

◮ Left-skew closed categories [Street 2013]

◮ Theorem: Given a category C equipped with a unit I and two

functors ⊗ : C × C → C ⊸: Cop × C → C related by an adjunction − ⊗ B ⊣ B ⊸ − natural in B, then (C, I, ⊗) is left-skew monoidal iff (C, I, ⊸) is left-skew closed.

◮ No internal adjunction requirement!

slide-6
SLIDE 6

Left-skew monoidal categories

◮ A left-skew monoidal category is a category C together with an

  • bject I, a functor ⊗ : C × C → C and three natural transformations

λ, ρ, α typed λA : I ⊗ A → A ρA : A → A ⊗ I αA,B,C : (A ⊗ B) ⊗ C → A ⊗ (B ⊗ C) satisfying the 5 Mac Lane equations.

◮ N.B. λ, ρ, α are not required to be invertible.

slide-7
SLIDE 7

Left-skew closed categories

◮ A left-skew closed category is a category C together with an object

I, a functor ⊸ : Cop × C → C, and three (extra)natural transformations j, i, and L typed jA : I → A ⊸ A iA : I ⊸ A → A LA,B,C : B ⊸ C → (A ⊸ B) ⊸ (A ⊸ C) satisfying 5 equations.

◮ In the original definition of closed category, i and

  • A,B : C(A, B) → C(I, A ⊸ B)
  • A,B(f ) = A ⊸ f ◦ jA

are required to be invertible.

slide-8
SLIDE 8

Contribution 1: Normality conditions

◮ In a left-skew monoidal category, the invertibility of a structural law

(λ, ρ or α) is called a normality condition.

◮ We identify analogous normality conditions in a left-skew closed

category and prove a refined version of Street’s left-skew variant of Eilenbeg-Kelly theorem.

◮ Theorem: In the presence of an adjunction − ⊗ B ⊣ B ⊸ −, not

  • nly there exists an isomorphism between left-skew monoidal (I, ⊗)

and left-skew closed (I, ⊸) structures, but the skew-monoidal and skew-closed normality conditions are in one-to-one correspondence.

slide-9
SLIDE 9

Normality conditions (ctd.)

◮ The precise correspondence:

ρ nat. iso. iff i nat. iso. λ nat. iso. iff

  •  nat. iso.

α nat. iso. iff

  • L nat. iso.

iff p nat. iso. with

  • A,B : C(A, B) → C(I, A ⊸ B)
  • LA,B,C,D :

X C(A, X ⊸ D) × C(B, C ⊸ X) → C(A, B ⊸ (C ⊸ D)) interdefinable with j and L respectively.

◮ In the original Eilenberg-Kelly theorem, the internal adjunction

requirement can be substituted with the invertibility of L (a condition identified first in [Day 1974; Day & Laplaza 1978]).

slide-10
SLIDE 10

Contribution 2: Skewing to the right

◮ Changing the orientation of the structural laws ρ, λ, α of left-skew

monoidal categories, we obtain right-skew monoidal categories. ρR

A : A ⊗ I → A

λR

A : A → I ⊗ A

αR

A,B,C : A ⊗ (B ⊗ C) → (A ⊗ B) ⊗ C ◮ Similarly, changing the orientation of the structural laws i,

, L of left-skew closed categories, we obtain the new notion of right-skew closed category. iRA : A → I ⊸ A jR

A,B : C(I, A ⊸ B) → C(A, B)

LRA,B,C,D : C(A, B ⊸ C ⊸ D) → X C(A, X ⊸ D) × C(B, C ⊸ X)

slide-11
SLIDE 11

Skewing to the right (ctd.)

◮ We prove a right-skew variant of Street’s theorem connecting adjoint

right-skew monoidal and right-skew closed structures on a category, and similar relationships between their normality conditions.

◮ More interestingly, we prove a new theorem connecting left-skew

closed and right-skew closed structures on a category.

◮ Theorem: Let C be a category with an object I and functors

⊸L, ⊸R : Cop × C → C together with what we call the external Lambek condition, viz., a bijection σA,B,C : C(A, B ⊸R C) → C(B, A ⊸L C) natural in A, B and C. Then (C, I, ⊸L) is left-skew closed iff (C, I, ⊸R) is right-skew closed.

slide-12
SLIDE 12

Skewing to the right (ctd.)

◮ The normality conditions on ⊸L and ⊸R also correspond:

i nat. iso. iff jR nat. iso.

  •  nat. iso.

iff iR nat. iso.

  • L nat. iso.

iff LR nat. iso. iff s nat. iso. with sA,B,C : A ⊸L (B ⊸R C) → B ⊸R (A ⊸L C) internal version of Lambek condition.

slide-13
SLIDE 13

Contribution 3: Examples

◮ We discuss a large number of examples, in particular for motivating

the different normality conditions and the new notion of right-skew closed category.

◮ In this talk we discuss:

◮ Skewing a left-(right-)skew closed structure further to the left

(right) using a comonad (monad).

◮ Lifting left- and right-skew closed structure to a Kleisli category. ◮ The non-commutative linear typed λ-calculus with unit type.

slide-14
SLIDE 14

Ex 1: Skewing a skew closed structure further

◮ Let (C, I, ⊸) be a left-skew closed category with a comonad D on it. ◮ Suppose D lax closed, i.e., coming with a map e : I → D I and a nat.

  • trans. cB,C : D (B ⊸ C) → D B ⊸ D C cohering with j, i, L, ε, δ.

◮ Then C has another left-skew closed structure (I, D⊸) where

B D⊸ C = D B ⊸ C and, e.g.,

DiA = D I ⊸ A e⊸A

I ⊸ A

iA

A

◮ If both i and e are invertible, then Di is invertible. ◮ Instead, given (C, I, ⊸) right-skew closed and an oplax closed

monad T on it, then C has another right-skew closed structure (I, T⊸) where B T⊸ C = T B ⊸ C.

slide-15
SLIDE 15

Ex 2: Lifting skew closed structure to Kleisli category

◮ Let (C, I, ⊸) be a left-skew closed category with a monad T on it. ◮ Suppose T left-strong (or internally functorial), i.e., endowed with a

  • nat. trans. cstA,B : B ⊸ C → T B ⊸ T C cohering with j, L, η, µ.

◮ Then Kl(T) has a left-skew closed structure (I, ⊸T) where

B ⊸T C = B ⊸ T C and, e.g., jT

A = J ( I jA

A ⊸ A

A⊸ηA A ⊸ TA )

iT

A = I ⊸ T A iTA

T A

◮ If, instead, (C, I, ⊸) is right-skew closed and T is lax closed

(so both left-strong and right-strong), then (I, ⊸T) is a right-skew closed structure on Kl(T).

slide-16
SLIDE 16

Ex 3: Non-commutative linear typed λ-calculus with unit

◮ Types A, B ::= X | I | A ⊸ B, where X is an atomic type. ◮ Contexts are lists of types. ◮ Well-formed terms:

x : A ⊢ x : A ⊢ ⋆ : I Γ ⊢ t : I ∆ ⊢ u : A Γ, ∆ ⊢ let ⋆ = t in u : A

Γ, x : A ⊢ t : B Γ ⊢ λx. t : A ⊸ B Γ ⊢ t : A ⊸ B ∆ ⊢ u : A Γ, ∆ ⊢ t u : B

◮ Definitional equality of terms is βη-equality. ◮ It is a left-skew closed category. Derivation tree of L:

x : B ⊸ C ⊢ x : B ⊸ C y : A ⊸ B ⊢ y : A ⊸ B z : A ⊢ z : A y : A ⊸ B, z : A ⊢ y z : B x : B ⊸ C, y : A ⊸ B, z : A ⊢ x (y z) : C x : B ⊸ C ⊢ LA,B,C = λy. λz. x (y z) : (A ⊸ B) ⊸ (A ⊸ C)

slide-17
SLIDE 17

Ex 3: Non-commutative linear typed λ-calculus with unit

◮ This calculus is a concrete presentation of the free left-skew closed

category generated by the set of atomic types.

◮ Fact:

 is invertible, i.e., there is a bijection between closed terms ⊢ t : A ⊸ B and open terms with one free variable x : A ⊢ u : B.

◮ i becomes invertible if we replace the elimination rule for I with the

following more permissive rule:

Γ ⊢ t : I ∆0, ∆1 ⊢ u : A ∆0, Γ, ∆1 ⊢ let ⋆ = t in u : A

slide-18
SLIDE 18

Conclusions

◮ Continuing work initiated by Street on a “cleaner” Eilenberg-Kelly

thm., we proved a relation between left-skew monoidal and left-skew closed categories with partial normality conditions.

◮ We showed that closed categories (in the sense of the standard

terminology) correspond to monoidal categories that are left-skew in regards to associativity.

◮ We also demonstrated that there is a well-justified notion of

right-skew closed category with nontrivial examples.

◮ Future work:

◮ Find more examples relevant to mathematical semantics of

programming.

◮ In continuation to our prior work [UVZ 2018], develop the proof

theory (sequent calculus, natural deduction) of left-skew/partially-normal monoidal, closed, monoidal closed, bi-closed and symmetric monoidal categories.