Not signed in (Sign In)

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics comma complex complex-geometry computable-mathematics computer-science constructive cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration finite foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorUrs
    • CommentTimeAug 29th 2012

    I noticed that an entry bifunctor was still missing, though requested by some existing entries. So I briefly added something.

    • CommentRowNumber2.
    • CommentAuthorTobyBartels
    • CommentTimeAug 29th 2012

    I linked some related concepts whose pages don’t exist but should. (I might make those pages tomorrow if I’m reminded, but I don’t have time now.)

    I also added a Disambiguation section. I’ve put up two of these sections now, which I think are more visible than anything outside the contents, even though we’d expect people to ignore them the second time through the page. I’m undecided on whether it also needs a sentence like ‘This article is about functors of two variables.’ at the beginning.

    • CommentRowNumber3.
    • CommentAuthorUrs
    • CommentTimeAug 29th 2012
    • (edited Aug 29th 2012)

    Good points, thanks!

    In similar ambiguous cases in several other entries we have a disambiguation line at the very top, even before the table of contents. Not sure how you feel about that, but I think it works well, as it seperates the disambiguation from the entry itself.

    So I have re-edited bifunctor accordingly. Check out if you can live with that, I won’t be dogmatic about it, so let me know if you absolutely don’t like it. But if not, we should do something to various other entries where the same kind of thing happens.

    • CommentRowNumber4.
    • CommentAuthorMike Shulman
    • CommentTimeAug 30th 2012

    Is there really anyone who uses “bifunctor” to mean “pseudofunctor”? I’m pretty sure I’ve never encountered that.

    • CommentRowNumber5.
    • CommentAuthorTim_Porter
    • CommentTimeAug 30th 2012

    You may find it in some early work on ’bicategories”.

    • CommentRowNumber6.
    • CommentAuthorUrs
    • CommentTimeAug 30th 2012

    The pointer to “2-functor” will be sufficient in either case.

    • CommentRowNumber7.
    • CommentAuthorUrs
    • CommentTimeAug 31st 2012

    just to make things look nice I killed some grey links by creating what Toby was anticipating: binary function and binary morphism

    • CommentRowNumber8.
    • CommentAuthorTobyBartels
    • CommentTimeSep 1st 2012

    In similar ambiguous cases in several other entries …

    Yes, I’ve seen those (and written them a couple of times). But I wanted to try a different way and see how it worked.

    • CommentRowNumber9.
    • CommentAuthorTim_Porter
    • CommentTimeSep 1st 2012

    At binary function should that be ’out of a product’ or ’out of a product of two objects’. There is otherwise ambiguity.

    • CommentRowNumber10.
    • CommentAuthorUrs
    • CommentTimeSep 1st 2012

    Okay, so you did like the different way better? Feel free to roll back my changes, in this case.

    • CommentRowNumber11.
    • CommentAuthorTobyBartels
    • CommentTimeSep 1st 2012

    @Tim: fixed, and another point corrected (or made more specific).

    • CommentRowNumber12.
    • CommentAuthorTobyBartels
    • CommentTimeSep 1st 2012

    @Urs: I did like it better, at least for now, partly because it allows for more discussion if needed. I put it back so people can decide if they like it, but if not, we can also put it back how you had it.

    • CommentRowNumber13.
    • CommentAuthorTim_Porter
    • CommentTimeSep 1st 2012

    @Toby :-)

    • CommentRowNumber14.
    • CommentAuthorUrs
    • CommentTimeSep 1st 2012

    I did like it better, at least for now, partly because it allows for more discussion if needed. I put it back so people can decide if they like it, but if not, we can also put it back how you had it.

    Okay. We should just try to agree on how to handle this globally.

    • CommentRowNumber15.
    • CommentAuthorTobyBartels
    • CommentTimeSep 1st 2012

    I don’t think that we need everything to look the same. It’s good if people have a chance to see different things and decide how they like them. Even in the long run, our different ways of heading up the tables of contents doesn’t cause problems.

    • CommentRowNumber16.
    • CommentAuthorMike Shulman
    • CommentTimeSep 1st 2012

    @Tim #5: Really? Benabou used “homomorphism” (and “morphism”) and nowadays I think category theorists generally say “pseudo functor” (or “lax functor”) or just “functor” if it is clear that the domain and codomain are bicategories. I’ve never seen “bifunctor” used for this, and I assumed it was because even to people with the (IMHO execrable) habit of using the prefix “bi-” to mean “bicategorical”, it was clear that “bifunctor” was already in common usage for a functor of two variables. I am happy with what the page bifunctor says now, but I’m curious: do you have references where it was actually used that way?

    Also, I added links between bifunctor and two-variable adjunction.

    • CommentRowNumber17.
    • CommentAuthorTodd_Trimble
    • CommentTimeSep 1st 2012

    Do people even say “bifunctor” a whole lot anymore? It sounds slightly old-fashioned to my ears, being merely a certain kind of functor. Sort of putting a hat on a horse.

    Similarly, do people really say ’binary function’ much? Binary operation, sure, but ’binary function’? I can’t recall ever seeing it.

    • CommentRowNumber18.
    • CommentAuthorTobyBartels
    • CommentTimeSep 1st 2012

    The real point of binary function, for me, is to make foundational comments that I would like to put there but haven’t. As for ‘bifunctor’, I thought that it meant functor between bicategories when I first saw it, but I don’t know if anybody has really used it.

    • CommentRowNumber19.
    • CommentAuthorTodd_Trimble
    • CommentTimeSep 1st 2012
    • (edited Sep 1st 2012)

    Okay, that’s fine. I’ve still never seen ’binary function’ – my first thought was to contrast it with ’decimal function’. Can you give me a citation? (It’s not important if you can’t.)

    ’Bifunctor’ I’ve seen, in the sense of functor with two arguments. I’m not sure I’ve seen the bicategorical sense (it would have to be a distant memory).

    • CommentRowNumber20.
    • CommentAuthorTom Leinster
    • CommentTimeSep 1st 2012

    I agree with Todd’s hat-horse comment. I don’t see the point of saying “bifunctor” for “functor whose domain is a product of two categories”. You can always just say “functor” instead (and I do).

    It would be more justifiable if it were analogous to the situation with bilinearity. “Bilinear map V×WXV \times W \to X” means something different from “linear map V×WXV \times W \to X”. So we really do need the word “bilinear”. But a bifunctor A×BCA \times B \to C is the same thing as a functor A×BCA \times B \to C. I don’t think we need the word “bifunctor” at all.

    What would actually make more sense would be if category theorists used “bifunctor A×BCA \times B \to C” to mean “functor from the funny tensor product of AA and BB to CC”. That would make a better analogy with “bilinear”. But I’m not advocating that!

    I’ll join the others in saying that I don’t remember having heard “bifunctor” to mean some kind of map of bicategories.

    • CommentRowNumber21.
    • CommentAuthorUrs
    • CommentTimeSep 1st 2012

    The Encyclopedia of Mathematics and PlanetMath know “bifunctor” the way we have it in the entry, the references at Quillen bifunctor know it, too. For instance.

    I remember that certainly In the math department of Hamburg people would speak of bifunctors. I did, too, complain that it’s just a functor out of a product, but if people say this word nevertheless, there is no harm in explaining what it means.

    • CommentRowNumber22.
    • CommentAuthorTodd_Trimble
    • CommentTimeSep 2nd 2012

    Of course there’s no harm! I’m just idly wondering if I’m right in thinking it’s slightly dated terminology. If it is, I wouldn’t mind inserting a note that says as much!

    • CommentRowNumber23.
    • CommentAuthorMike Shulman
    • CommentTimeSep 2nd 2012
    • (edited Sep 2nd 2012)

    Ditto ditto for me about hats and horses. Note, though, that a Quillen bifunctor is not the same as a Quillen functor whose domain is a cartesian product. And it would be worth having the page bifunctor if for no other reason than to explain that it doesn’t mean functor between bicategories.

    • CommentRowNumber24.
    • CommentAuthorTobyBartels
    • CommentTimeSep 2nd 2012
    • (edited Sep 2nd 2012)

    Can you give me a citation [ETA: for ‘binary function’]?

    It’s used in computer science; otherwise, I’ve only seen ‘function of two variables’. If you Google it, you should find a Wikipedia page that was originally named by a computer scientist (even though the discussion is purely mathematical) and then a bunch of CS pages. I in fact learnt the term from the Wikipedia page, much of which is still what I wrote in it in 2003.

    we really do need the word “bilinear”.

    Maybe, maybe not. A bilinear map from AA and BB to CC may be thought of as a map from A×BA \times B to CC, in which case it is not linear (except in degenerate cases); but it may also be thought of as a map from ABA \otimes B to CC, in which case it is linear. (Note that there is no such thing as a bilinear map from A×BA \times B to CC as such; you must specify the data AA and BB, not just the datum A×BA \times B. Of course, its clear what you mean when you write ‘A×BA \times B’, but if AA and BB are themselves something complicated, then it’s not clear … although the usage of ‘\oplus’ instead of ‘×\times’ can clarify.)

    On the other hand, when working in an arbitrary multicategory (which may not have a tensor product), then we do need a word for a binary morphism … although we could just discuss a multimorphism from AA and BB to CC without the special term ‘binary morphism’.

    • CommentRowNumber25.
    • CommentAuthorTodd_Trimble
    • CommentTimeSep 2nd 2012

    I slightly reworded things at bifunctor, based on some of this discussion. I think what I wrote is factual.

    • CommentRowNumber26.
    • CommentAuthorTobyBartels
    • CommentTimeSep 2nd 2012
    • (edited Sep 2nd 2012)

    The computer science context that I cited is for ‘binary function’, not for ‘bifunctor’. (It was @#19, first paragraph.)

    • CommentRowNumber27.
    • CommentAuthorTodd_Trimble
    • CommentTimeSep 2nd 2012

    I know, Toby – but I took it on myself to do a quick google on ’bifunctor’, and the first hits I saw involved some computer science context, so I went with that. (That could be a misleading impression, I suppose.)

    • CommentRowNumber28.
    • CommentAuthorTobyBartels
    • CommentTimeSep 2nd 2012
    • (edited Sep 2nd 2012)

    OK. I was afraid that my comment (before I edited it) was rather ambiguous.

    • CommentRowNumber29.
    • CommentAuthorMike Shulman
    • CommentTimeSep 2nd 2012

    A bilinear map from AA and BB to CC may be thought of as a map from A×BA \times B to CC, in which case it is not linear (except in degenerate cases); but it may also be thought of as a map from ABA \otimes B to CC, in which case it is linear.

    Speaking of horses, that suggestion feels like it has the cart in the wrong place. Even if one prefers an explicit construction of ABA\otimes B to a definition-by-universal-property, the reason we construct it that way is to make it be a representing object for bilinear maps!

    • CommentRowNumber30.
    • CommentAuthorTobyBartels
    • CommentTimeSep 2nd 2012
    • (edited Sep 2nd 2012)

    Yes, just as the reason that we construct cartesian products is to represent functions of two variables as simply functions.

    • CommentRowNumber31.
    • CommentAuthorUrs
    • CommentTimeSep 17th 2012

    Just a propos, another example re

    Do people even say “bifunctor” a whole lot anymore?

    In

    • Pierre Shapira, Categories and homological algebra (2011) (pdf)

    there is a planned section “7.5 Bifunctors” and the term appears throughout the text .

    (Notice that I am not arguing any case about how terminology should be used. )

  1. typo: “For for…”—>”For…”

    Anonymous

    diff, v11, current

    • CommentRowNumber33.
    • CommentAuthorKeith Harbaugh
    • CommentTimeMar 5th 2021
    • (edited Mar 5th 2021)
    Comment 17 asked:
    'Do people even say “bifunctor” a whole lot anymore?'

    One example, right here at the nLab, is in Section 1, Idea, of premonoidal category:

    "Recall that a bifunctor from C and D to E (for C,D,E categories) is simply a functor to E from the product category C×D."
    • CommentRowNumber34.
    • CommentAuthorMike Shulman
    • CommentTimeMar 5th 2021

    I generally avoid it, due to the potential confusion from the use of “bi-” to mean “co- and contra-” (e.g. biproduct) and also to mean “weak 2-” (e.g., um, “biproduct”?). It’s just as easy to say “a functor C×DEC\times D \to E”.

    • CommentRowNumber35.
    • CommentAuthorMike Shulman
    • CommentTimeMar 5th 2021

    But I can see the point of it on that page, since it’s about to consider a weaker sort of two-variable functor.

    • CommentRowNumber36.
    • CommentAuthorUrs
    • CommentTimeMay 18th 2023
    • (edited May 18th 2023)

    tried to streamline the wording and formatting of the disambiguation paragraph.

    Added the remark that “bifunctor” is not uncommon in model category theory (in “Quillen bifunctor”)

    diff, v14, current

    • CommentRowNumber37.
    • CommentAuthorUrs
    • CommentTimeAug 23rd 2023