nLab
pseudonatural transformation
Context
2-Category theory
2-category theory
Definitions
Transfors between 2-categories
Morphisms in 2-categories
Structures in 2-categories
Limits in 2-categories
Structures on 2-categories
Contents
Idea
A pseudonatural transformation is a lax natural transformation whose 2 -cell components are all invertible .
Definition
Definition
Given two 2-functors U , V : S → → C between 2-categories , a pseudonatural transformation ϕ : U → V is a rule that assigns to each object s of S a morphism ϕ ( s ) : U ( s ) → V ( s ) of C , and to each morphism f : r → s of S an invertible 2-morphism ϕ ( f ) of C :
U ( r ) → U ( f ) U ( s ) ϕ ( r ) ↓ ϕ ( f ) ⇙ ↓ ϕ ( s ) V ( r ) → V ( f ) V ( s ) \array{
U(r) & \stackrel{U(f)}{\to} & U(s) \\
\phi(r) \downarrow & \phi(f) \swArrow & \downarrow \phi(s) \\
V(r) & \underset{V(f)}{\to} & V(s)
}
such that the following coherence law s are satisfied in C (throughout we leave the associator s and unitor s in C implicit):
respect for composition: for all composable morphisms r → f s → g t in S we have an equality
U ( s ) U ( f ) ↗ ↓ ϕ ( s ) ↘ U ( g ) U ( r ) ⇙ ϕ ( f ) V ( s ) ⇙ ϕ ( g ) U ( t ) ϕ ( r ) ↓ V ( f ) ↗ ⇓ V ( f , g ) ↘ V ( g ) ↓ ϕ ( t ) V ( r ) → V ( g ∘ f ) V ( s ) = U ( s ) U ( f ) ↗ ⇓ U ( f , g ) ↘ U ( g ) U ( r ) → U ( g ∘ f ) U ( t ) ϕ ( r ) ↓ ⇙ ϕ ( g ∘ f ) ↓ ϕ ( t ) V ( r ) → V ( g ∘ f ) V ( t ) , \array{
&& U(s)
\\
& {}^{\mathllap{U(f)}}\nearrow &\downarrow^{\phi(s)}& \searrow^{\mathrlap{U(g)}}
\\
U(r) &\swArrow_{\phi(f)}&V(s) &\swArrow_{\phi(g)}& U(t)
\\
{}^{\mathllap{\phi(r)}}\downarrow &{}^{V(f)}\nearrow&
\Downarrow^{V(f,g)}
&\searrow^{V(g)}& \downarrow^{\mathrlap{\phi(t)}}
\\
V(r) &&\underset{V( g\circ f)}{\to}&& V(s)
}
\;\;\;
=
\;\;\;
\array{
&& U(s)
\\
& {}^{\mathllap{U(f)}}\nearrow &\Downarrow^{U(f,g)}& \searrow^{\mathrlap{U(g)}}
\\
U(r) &&\stackrel{U(g \circ f)}{\to}&& U(t)
\\
{}^{\mathllap{\phi(r)}}\downarrow &&
\swArrow_{\phi(g \circ f )}
&& \downarrow^{\mathrlap{\phi(t)}}
\\
V(r) &&\underset{V(g \circ f)}{\to}&& V(t)
}
\,,
of pasting 2-morphisms as indicated, where U ( f , g ) and V ( f , g ) denote the compositors of the 2-functor s U and V ,
respect for units, (…)
naturality
for every 2-morphism
→ f ↗ ↘ r ⇓ F s ↘ ↗ → g \array{
&& \stackrel{f}{\to}
\\
& \nearrow && \searrow
\\
r &&\Downarrow^{F}&& s
\\
& \searrow && \nearrow
\\
&& \underset{g}{\to}
}
in S an equality
→ U ( f ) ↗ ⇓ U ( F ) ↘ U ( r ) → U ( g ) U ( s ) ϕ ( r ) ↓ ⇙ ϕ ( g ) ↓ ϕ ( s ) V ( r ) → V ( g ) V ( s ) = U ( r ) → U ( f ) U ( s ) ϕ ( r ) ↓ ⇙ ϕ ( f ) ↓ ϕ ( s ) V ( r ) → V ( f ) V ( s ) ↘ ⇓ V ( F ) ↗ → V ( g ) \array{
&& \stackrel{U(f)}{\to}
\\
& \nearrow &\Downarrow^{U(F)}& \searrow
\\
U(r) &&\stackrel{U(g)}{\to}&& U(s)
\\
{}^{\mathllap{\phi(r)}}\downarrow &&\swArrow_{\phi(g)}&& \downarrow^{\mathrlap{\phi(s)}}
\\
V(r) &&\underset{V(g)}{\to}&& V(s)
}
\;\;\;
=
\;\;\;
\array{
U(r) &&\stackrel{U(f)}{\to}&& U(s)
\\
{}^{\mathllap{\phi(r)}}\downarrow &&\swArrow_{\phi(f)}&& \downarrow^{\mathrlap{\phi(s)}}
\\
V(r) &&\stackrel{V(f)}{\to}&& V(s)
\\
& \searrow &\Downarrow^{V(F)}& \nearrow
\\
&& \underset{V(g)}{\to}
}
in C .
A pseudonatural transformation is called a pseudonatural equivalence if each component ϕ ( s ) is an equivalence in the 2-category C . This is equivalent to ϕ itself being an equivalence in the 2-category [ S , C ] of 2-functors, pseudonatural transformations, and modifications .
Revised on March 12, 2013 01:41:15
by
Mike Shulman
(108.247.159.128)