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 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 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 internal-categories k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure 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.
    • CommentAuthorporton
    • CommentTimeSep 10th 2013

    I recently have proved that my category Fcd\mathbf{Fcd} (of continuous maps between endofuncoids) has both all small products and all small coproducts.

    See this draft article.

    Now I try to prove that it has exponential objects (and so is cartesian closed). With this I encountered a difficulty.

    Let GG is a digraph that is an endomorphisms of the category Rel\mathbf{Rel}. I denote ObG\operatorname{Ob} G the set of the vertexes and GRG\operatorname{GR} G the set of edges.

    It is not hard to prove that the definition 2.3 in this arXiv article of exponential object MOR(G;H)\operatorname{MOR} ( G ; H) from a graph GG to a graph HH in the category of graphs can be written as:

    (f;g)GRMOR(G;H)g 1(GRG)fGRH( f ; g) \in \operatorname{GR} \operatorname{MOR} ( G ; H) \Leftrightarrow g^{- 1} \circ (\operatorname{GR} G) \circ f \subseteq \operatorname{GR} H.

    (However, it may be different for digraph than for simple graphs, I haven’t checked details here.)

    Now when I attempt to “transfer” this result from the theory of graphs to the theory of endofuncoids, I encounter this difficulty:

    If now GG, HH are endofuncoids, then MOR(G;H)\operatorname{MOR} ( G ; H) is an endofuncoid, not a pair of functions. I don’t know how to deal with this.

    Could you help?

    Even a simple proof for the special case of graphs may be probably helpful. However the real research is about endofuncoids not graphs.

    • CommentRowNumber2.
    • CommentAuthorTodd_Trimble
    • CommentTimeSep 10th 2013

    Even a simple proof of what for the special case of graphs? That the category of such is cartesian closed?

    I’ll remark that categories of graphs (of whatever flavor) tend to be quasitoposes, which is even nicer than just being cartesian closed.

    Let me also remark that some of the the terminology can be confusing here; for a category theorist, “digraph” could mean “directed graph” (where the function EdgesVertices×VerticesEdges \to Vertices \times Vertices can be any function, not necessarily an inclusion, which is what you seem to be referring to). It’s just something to be aware of.

    I’m probably not understanding what the difficulty is (I’ve only just now looked at the definition of “funcoid”, without much understanding), but: don’t you want MOR(G;H)MOR(G; H) to be an endofuncoid? In other words, to get cartesian closure of the category of endofuncoids and endofuncoid maps, you’d want a universal endofuncoid map of the form MOR(G;H)×GHMOR(G; H) \times G \to H, where GG, HH, and MOR(G;H)MOR(G; H) are endofuncoids.

    Final comment: I don’t know how it is for others, but the word “funcoid” just doesn’t sound right to my ears, both because of the funky associations, and because it doesn’t seem right from a linguistic standpoint. If it were me, I’d much prefer functoid. This is a small matter, perhaps, but little things like that can unfortunately get in the way.

    • CommentRowNumber3.
    • CommentAuthorporton
    • CommentTimeSep 10th 2013

    Even a simple proof of what for the special case of graphs? That the category of such is cartesian closed?

    Yes. But I need only to prove existence of exponential objects, because I know how to prove existence of all small products.

    I’ll remark that categories of graphs (of whatever flavor) tend to be quasitoposes, which is even nicer than just being cartesian closed.

    I am going to investigate this for my category Fcd\mathbf{Fcd}, but the time to check whether is is a topos has not yet come.

    but: don’t you want MOR(G;H)\operatorname{MOR}(G;H) to be an endofuncoid?

    Yes, I want it to be an endofuncoid.

    Final comment: I don’t know how it is for others, but the word “funcoid” just doesn’t sound right to my ears, both because of the funky associations, and because it doesn’t seem right from a linguistic standpoint. If it were me, I’d much prefer functoid. This is a small matter, perhaps, but little things like that can unfortunately get in the way.

    I’d better leave the term as is “funcoid”:

    1. It is in several draft articles on my site.

    2. It is in my preprint book which is now in review, and also in an article which is in peer review.

    3. It rhythms well with my other term “reloid”: function -> funcoid, relation -> reloid.

    But if others will ask me to rename funcoid -> functoid, I may consider renaming. My writings about funcoids are not yet published, and in principle renaming is possible.

    P.S. It seems I have found a way to construct exponential objects in my category. Now I am going to start investigation.

    • CommentRowNumber4.
    • CommentAuthorTodd_Trimble
    • CommentTimeSep 10th 2013
    • (edited Sep 10th 2013)

    but the time to check whether is is a topos has not yet come.

    Right; I understand. BTW: I very much doubt it’s a topos. I have a vague hunch (or at least I wouldn’t be very surprised if) it is a quasitopos. But anyway I think you are right to proceed as you are doing.

    but: don’t you want MOR(G;H)\operatorname{MOR}(G;H) to be an endofuncoid?

    Yes, I want it to be an endofuncoid.

    The reason I asked was because you said this in #1:

    If now GG, HH are endofuncoids, then MOR(G;H)MOR(G;H) is an endofuncoid, not a pair of functions. I don’t know how to deal with this.

    • CommentRowNumber5.
    • CommentAuthorTobyBartels
    • CommentTimeSep 13th 2013

    My response to the real mathematical question is the same as Todd's, so I'll make a linguistic comment. The infix ‘‑at‑’ is something of a null-op; think of words like ‘causation’, which is derived from ‘cause’ (rather than ‘causate’), when we could just as easily have used ‘causion’ (analogously to ‘fusion’). So ‘relation’ ~ ‘relion’ > ‘reloid’; analogously, ‘function’ > ‘functoid’.

    If funcoids haven't been formally published yet, then it's not too late to change it; and if they already under review, then it may be your last chance! You may have more important things to worry about, but all of the appearances of ‘funcoid’ are still under your control so far. You just have to edit your files and tell your reviewers!

    • CommentRowNumber6.
    • CommentAuthorporton
    • CommentTimeSep 13th 2013

    I refer the word “funcoid” in a published article (remark 9). The word “funcoid” is used as a forward reference (a reference to a draft of not yet published article).

    If I rename it now, that article could become an article with a grammar error.

    So I am yet unsure whether to rename.

    I’d like to hear more opinions, whether to rename or not to rename.

    • CommentRowNumber7.
    • CommentAuthorporton
    • CommentTimeSep 13th 2013

    Also the word “funcoid” is used at a few wiki and wiki-like sites such as Open Problem Garden, and I would need some work to rename all of it.

    • CommentRowNumber8.
    • CommentAuthorporton
    • CommentTimeSep 13th 2013

    One side comment: I’ve invented the term “foonkoid” in some deep past when I yet wrote in Russian language not English.

    “Functoid” (with t) would sound very bad in Russian. I realize we speak about English not Russian but may probably take this in the consideration, how it is transferred to other languages.

    • CommentRowNumber9.
    • CommentAuthorporton
    • CommentTimeSep 13th 2013
    • (edited Sep 14th 2013)

    Oh well, also the word “funcoid” is used in my blog posts.

    Now I feel it’s better to leave the term as is, but I’m open to hear more proposals to replace it.

    • CommentRowNumber10.
    • CommentAuthorporton
    • CommentTimeSep 14th 2013

    Oh, well, now I have almost finally decided not to rename “funcoid” -> “functoid”.

    This rename would not agree with denoting categories related with funcoids in three letter f.c.d. such as FCDFCD and Fcd\mathbf{Fcd}.