Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
4
votes
How to distinguish between natural and unnatural equivalences of categories
On the other hand to Tom's answer, the distinction between strong and weak equivalences disappears if you use anafunctors instead of functors, which is arguably the "right" way to do category theory i …
3
votes
Accepted
Action of a strict 2-group on a category gives autoequivalences?
I could be wrong (it's hard to be sure since the phrase "preserves inverses" is a bit vague), but I think that's why they said they were defining only a strict action. A weak action would only preser …
2
votes
Functoriality of the adjoint functor construction?
Yes. The map $G_{A'} \to F_f \circ G_A$ is called the mate of $T_f : F_A \to F_{A'} \circ F_f$. It's the composite
$$ G_{A'} \to G_{A'} F_A G_A \to G_{A'} F_{A'} F_f G_A \to F_f G_A$$
of $T_f$ wit …
7
votes
What structure do natural isomorphisms preserve?
The simplest case is that for a fixed (small) category $C$, there is a (multi-sorted) first-order theory whose models are functors $C\to \rm Set$: it has one sort for every object of $C$, and one func …