Not signed in (Sign In)

Start a new discussion

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-categories 2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry beauty bundles calculus categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex-geometry computable-mathematics computer-science connection constructive constructive-mathematics cosmology definitions deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry differential-topology digraphs duality education elliptic-cohomology enriched fibration foundations functional-analysis functor galois-theory gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck 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 infinity integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic manifolds mathematics measure-theory modal-logic model model-category-theory monad monoidal monoidal-category-theory morphism motives motivic-cohomology multicategories noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pasting philosophy physics planar 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-theory subobject superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory 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.
    • CommentAuthorMike Shulman
    • CommentTimeJan 6th 2010

    How would people feel about renaming distributor to profunctor? I seem to recall that when this came up on the Cafe, I was the main proponent of the former over the latter, and I've since changed my mind.

    • CommentRowNumber2.
    • CommentAuthorUrs
    • CommentTimeJan 6th 2010

    sure, fine with me

    • CommentRowNumber3.
    • CommentAuthorTodd_Trimble
    • CommentTimeJan 6th 2010

    I rather prefer profunctor to distributor, and I have a slight preference for bimodule over profunctor.

    • CommentRowNumber4.
    • CommentAuthorTobyBartels
    • CommentTimeJan 6th 2010

    I'm moderately in favour of the proposed move.

    • CommentRowNumber5.
    • CommentAuthorMike Shulman
    • CommentTimeJan 9th 2010

    I made the change moving distributor to profunctor. If you want, Todd, we could discuss whether to use bimodule instead, but I think that term is too confusing for most mathematicians, and/or not specific enough.

    • CommentRowNumber6.
    • CommentAuthorEric
    • CommentTimeJan 10th 2010

    I think I know a little bit about bimodules (not much) and I know I don't know anything about profunctors (I even struggle with functors). I remember when Urs had his first Eureka moment about bimodules. I wish I could reproduce that feeling. Is there a way to understand it for someone who thinks of bimodules as "kind of like vectors"? In what way is a profunctor "kind of like a vector space"?

    When I look at profunctor, it is completely intimidating and I do not understand a word.

    • CommentRowNumber7.
    • CommentAuthorUrs
    • CommentTimeJan 10th 2010
    • (edited Jan 10th 2010)

    Eric,

    the basic kind of module that you are familiar with is a vector space: an additive group (vectors and their addition) on which you can act with a number field, say with the real numbers.

    A bimodule is like a vector space, only that there are two possibly different actions of the real numbers on it. A way to multiply a vector by a number from the left -- or from the right.

    Every vector space is hence also a bimodule over the ground field, where we take the left and the right multiplication by a number on a vector to be the same.

    You know the tensor product of vector spaces. That's "tensoring over the field" that acts on them. If we think of vector spaces as bimodules over te ground field (multiplication by real numbers on vectors from left and right) then the tensor product of V with W is to be thought of cancelling the right action on V with the left action on W, leaving  V \otimes W with the left action on V remaining and the right action on W.

    In this way tensoring with W gives an assignment V \mapsto V \otimes W .

    This perspective generalizes. There is a way to replace in the above picture vector spaces regarded as one-sided modules with presheaves (one-sided modules) and vector spaces regarded as bimodules with profunctors (= 2-sided modules).

    • CommentRowNumber8.
    • CommentAuthorEric
    • CommentTimeJan 10th 2010

    .. and don't forget my favorite example of bimodules, i.e. discrete differential forms :)

    The key is the last paragraph of course. I'll have to try to understand that. Thanks!

    • CommentRowNumber9.
    • CommentAuthorzskoda
    • CommentTimeJan 10th 2010

    Profunctoris far more suggestive than distributor for outsiders, which does not even remind of functor...

    • CommentRowNumber10.
    • CommentAuthorTobyBartels
    • CommentTimeJan 10th 2010

    The term ‘bimodule’ is so general, encompassing the case that Urs describes in #7 above as well, that I would want to keep bimodule what it is, and make profunctor (or distributor, but we've already discussed that) the page that focusses on the case at hand.

    • CommentRowNumber11.
    • CommentAuthorTodd_Trimble
    • CommentTimeJan 12th 2010

    Okay, that's fine. Profunctor it is, then, for this case.

    • CommentRowNumber12.
    • CommentAuthorMike Shulman
    • CommentTimeApr 2nd 2010

    I did some reorganizing of profunctor, and also added the two ways to describe them as fibrations or cofibrations.

    @Toby #10, bimodule is currently actually about profunctors. I would prefer that bimodule be more general, as you seem to be suggesting, since for many/most mathematicians it is used restricted to the one-object case; with anything there that is specifically about profunctors moved to profunctor. In any case, bimodule should not duplicate profunctor, so if we decide that bimodule should be mostly about profunctors, then I think it should instead just redirect to profunctor.

    • CommentRowNumber13.
    • CommentAuthorTim_Porter
    • CommentTimeApr 3rd 2010

    Given recent remarks on the cat list, perhaps a separate entry on distributors with references to Benabou's work would be a good thing to include, of course, with a clear link to the profunctor page.

    • CommentRowNumber14.
    • CommentAuthorMike Shulman
    • CommentTimeApr 3rd 2010

    In general, I disagree with the idea of having multiple pages about the same thing, regardless of how many names that thing might have. I think it's better to pick a particular name, explain up-front that there are others in use, and use redirects. Of course, adding any additional references to Benabou's work on the profunctor page would be a great idea.

    • CommentRowNumber15.
    • CommentAuthorHurkyl
    • CommentTimeOct 1st 2018

    I know that I’m rather late to the party, but the name “profunctor” seems to conflict with the choice of convention that Prof(C,D) to be a functor D^op x C -> Set.

    I understand that the motivation for the convention is based on the idea of generalizing the codomain of a functor to be the colimit-completion: i.e. a functor C -> PSh(D). But from the prefix “pro” I would have expected instead generalizing to the limit-completion, and thus to the alternate convention C^op x D -> Set. The given convention might be better named “indfunctor”.

    Is the given choices just that profunctor is everyone’s favorite name and the colimit completion is everyone’s favorite concept, and so the two are paired? Or is there some other motivation that I’m missing?

    • CommentRowNumber16.
    • CommentAuthorTodd_Trimble
    • CommentTimeOct 1st 2018

    The naming conflict with the ’pro-’ as in ’profinite’ is well-known. ’Profunctor’ is not “everyone’s favorite name”, but the problem is that the name is ancient and entrenched, and we have no plans to change it. (I’m pretty sure we discussed this in another thread.) I don’t know of any case where the conflict led to real confusion.

    • CommentRowNumber17.
    • CommentAuthorMike Shulman
    • CommentTimeOct 1st 2018

    None of the existing terms for these objects — profunctor, distributor, (bi)module — is ideal. If we could (1) find a term that is completely unproblematic and (2) instantly convince all mathematicians to start using it, and retroactively edit all mathematical papers from the past to use it as well, then I think that would be a good thing. But in practice, even if we could do (1) (note that “ind-functor” is not perfect either, as it has the problem of suggesting a cocompletion under directed colimits only), what would actually happen is that instead of 3 competing terms there would be 4 competing terms, and even more confusion would be produced. As Jaap van Oosten said, “the only thing worse than bad terminology is continually changing terminology”. If a particular terminology is really bad, and nearly everyone agrees that it is bad and can be convinced to switch to the same alternative, then it is sometimes worth trying to change an established term (e.g. triple \mapsto monad); but that case is extremely rare. As Todd says, this particular conflict rarely if ever leads to any actual confusion.

    • CommentRowNumber18.
    • CommentAuthortimhosgood
    • CommentTimeJul 14th 2019

    profunctors in terms of Cauchy completion and Mealy morphisms — created page for Mealy morphisms also had to remove LaTeX code for arrows to get page to save, no idea how to add it back in…

    Tim H

    diff, v65, current

  1. [Administrative note: I have merged an old thread, comments #1-#17, into this one. There is also this old thread, but I’ll not merge that one, since it covers both anafunctors and profunctors, and could fit into either latest changes thread.]

  2. Putting back the removed LaTeX code.

    diff, v66, current

    • CommentRowNumber21.
    • CommentAuthorMike Shulman
    • CommentTimeJul 17th 2019

    I don’t quite understand what the paragraph is saying, but it doesn’t look right to me. Firstly, the profunctors having right adjoints are actually the ones that appear in the Cauchy completion; if the codomain is not Cauchy complete then they may not all be representable. Secondly, not all profunctors are Mealy morphisms either; I forget exactly what the characterization is in profunctorial terms but it’s not all of them (otherwise the term “Mealy morphism” wouldn’t have been introduced).

    • CommentRowNumber22.
    • CommentAuthorRichard Williamson
    • CommentTimeJul 17th 2019
    • (edited Jul 17th 2019)

    (In case it is not clear, Mike in #21 is replying to #18). In case it helps, Mike’s first point more directly is I think that it is not necessarily true in the non-Cauchy complete case that profunctors corresponding to functors are exactly those with a right adjoint. It would be nice with an explicit counterexample!

    MIke’s second point is I think that the correct statement is that Mealy morphisms determine profunctors, and that a profunctor can be obtained in this way if and only if it is ’discrete valued’. It comes from a functor if and only if it is total and discrete valued. See these slides of Paré. Thus we have ’inclusions’

    Functors -> Mealy morphisms -> Profunctors

    where the difference between Functors and Mealy morphisms is totality, and the difference between Mealy morphisms and Profunctors is discrete valuedness. In the Cauchy complete case, totality and discrete valuedness must be equivalent to having a right adjoint.

    It would be great to improve the nLab entries on this, and in particular as I say with explicit counterexamples to show that the inclusions are strict, etc. I am no expert, but hopefully somebody else can do it. Great that you have begun on this, Tim!

    • CommentRowNumber23.
    • CommentAuthorMike Shulman
    • CommentTime4 days ago

    Clarified the situation with Cauchy completeness, and moved the link to Mealy morphism down to related pages since I wasn’t sure what to say correctly about it or where.

    diff, v67, current

Add your comments
  • Please log in or leave your comment as a "guest post". If commenting as a "guest", please include your name in the message as a courtesy. Note: only certain categories allow guest posts.
  • To produce a hyperlink to an nLab entry, simply put double square brackets around its name, e.g. [[category]]. To use (La)TeX mathematics in your post, make sure Markdown+Itex is selected below and put your mathematics between dollar signs as usual. Only a subset of the usual TeX math commands are accepted: see here for a list.

  • (Help)