14.08.2013 Views

Frobenius monads and pseudomonoids Introduction - ResearchGate

Frobenius monads and pseudomonoids Introduction - ResearchGate

Frobenius monads and pseudomonoids Introduction - ResearchGate

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

SH ƒ SH<br />

1<br />

D *<br />

›<br />

counit<br />

SH ƒ SH<br />

SH<br />

D<br />

D<br />

›<br />

f<br />

1 ƒD<br />

D ƒ1<br />

SH ƒ SH<br />

1<br />

SH ƒ SH ƒ SH<br />

E ƒ 1<br />

1ƒSƒ1 ›<br />

a ƒ1<br />

SH<br />

op<br />

SH ƒ( SH) ƒ SH<br />

Similarly, b is used to define a 2-cell in the opposite direction; the further conditions on<br />

a , b <strong>and</strong> f say that this really is the inverse of p . Further details can be found in the<br />

general results of [DMS]. This ends our example.<br />

e ƒ 1<br />

In Section 9 of [DS2], a form for a pseudomonoid A in a monoidal bicategory B is<br />

defined to be a morphism s :A ƒA æ æÆItogether with an invertible 2-cell g as below.<br />

1A A<br />

ƒ p<br />

A ƒ3 p A<br />

A ƒ2<br />

Then the authors define the pseudomonoid to be *-autonomous when s is a biexact<br />

pairing 2 .<br />

ƒ A1<br />

Proposition 3.2 A pseudomonoid is *-autonomous if <strong>and</strong> only if it is <strong>Frobenius</strong>.<br />

Proof Suppose s <strong>and</strong> g is a form on the pseudomonoid A with s a biexact pairing.<br />

j ƒA<br />

s<br />

( )<br />

Put l = A æææÆA ƒA æ æÆI<br />

so that<br />

g<br />

@<br />

s<br />

A ƒ2<br />

( ) ( ƒ ) @ ( ƒ ) ( ƒ ) @ ( ƒ ) @<br />

s @ so p ƒA<br />

o j A so A p o j A so<br />

j A op lop<br />

where the second isomorphism involves g . So A equipped with l is <strong>Frobenius</strong>.<br />

Conversely, put s = lop which is a biexact pairing by definition of <strong>Frobenius</strong>; the<br />

isomorphism g is obtained by composing the associativity constraint<br />

on the left with l . QED<br />

( ) @ ( ƒ )<br />

po p A po A p<br />

ƒ<br />

Corollary 3.3 For any object X of B <strong>and</strong> any equivalence u :X æÆ æ X<br />

oo , the<br />

p s e u d o m o n o i d<br />

X<br />

o<br />

ƒ X i s F r o b e n i u s w h e n e q u i p p e d w i t h<br />

l<br />

o 1ƒ u<br />

:X X X<br />

o<br />

X<br />

oo e<br />

ƒ æææÆ ƒ æ æÆI.<br />

2 There was an extra condition in [DS2] requiring s to be "representable"; however, this is automatic under a<br />

mild completeness condition on the pseudomonoid.<br />

20<br />

I<br />

s

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!