Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
1 to 12 of 12
Suppose we have a simplicial set X and a m-truncated Kan simplicial set Y. Then how is it possible to construct as a subset ?
Since Severa used this in his work on the n-jet functor (for X the nerve of the pair groupoid over an arbitrary set), it should be possible. Nevertheless I can’t find an explicit construction including a proof that what he constructed is indeed .
By an explicit construction I mean something like: Let be given, then the appropriate simplicial morphism is given by as follows : ??? where the commutation with the face and degeneracy maps is seen as follows ??? … On the other side we that any simplicial morphism is given that way, because ???
….
So if someone could give me a proof (I think it will be an induction on something like or ) it would be great.
Likely this doesn’t work for arbitrary simplicial sets X, so another topic is to find the appropriate conditions on X .
Moreover this should be put into the nLab, too…
If nobody knows a proof it would be nice, if we could work it out together. At the end I will take the time to put in the nLab. Unfortunately my skills on simplicial sets are not good enough, to do it by myself.
Have a look at simplicial skeleton. If is -coskeletal then and (boldface) is the composition of chopping off the higher cells by a truncation map and then re-embedding by a right adjoint (non-boldface). Being a right adjoint, you can throw it over to and find that is the same as the hom between the truncations. Now it only remains to observe that every -simplex can be regarded as a degenerate -simplex (in several ways, but at least in one way). Use the simplicial identities to deduce that known the map on -simplices defines it also on all lower dimensional simplices.
I think this discussion should be classified into section Mathematics, Physics and Philosophy of Forum – general discussions on Lab where it is classified now is about general policies and issues about Lab, if I understood the scheme correctly.
Yes, I have moved it.
I observe a lot of trouble with the expression of the Latex-Like expressions in my browser (Using Chromium on a Linux OS) All of them are typesetted wrong in a way. Mostly because they are written ’to high’ relative to the text-line. Moreover in the last comment of Urs there are no expressions at all. I just see a repeated abstract icon ..
If you want I could send you a screen shot.
Unfortunately this way your comment is unreadable to me.
So what Urs said just describes how to construct the simplicial map from but of course not every map extends to a simplicial morphism. In particular it must map degenerated simplices to degenerated simplices “of the same level of degeneration” and maps common faces to common faces.
Ok but that’s just tells us that there is a way.
So HOW TO construct this subset? Because this is a finite recursion there must be some kind of algorithmic process starting at and terminating at
(Maybe this is just a philosophical disput on what a solution to such a problem means. Just to say that there is a solution is in my mind just a prestep to giving a solution, at least if a solution is constructable)
So HOW TO construct this subset?
First consider the adjunction isomorphism
and then the defining inclusion .
Is that not what you are after?
Finally yes… But the question is more than that. Suppose I have then because has only degenerated simplices in dimension we have
Ok. That’s the beginning of the induction.
Now suppose we have is it possible and if yes HOW, to get from this data?
Then this would be the induction step.
After doing this times we could stop since we have what Urs wrote in his last post.
Maybe it is a bit imprecise to call this constructive, but because I assume we don’t know in the first place, it is surely more easy (from a technical point of view) to describe first and then recursively construct the full-fledged set from this data in a finite recursive process. Especially if there is additional structure on it, like being a manifold and one wants to construct charts or things like that.
Maybe I can’t make myself clear here.
Is it not the case that there will be an obstruction theoretic argument needed to get from one level to the next? You have to be able to say where any non-degenerate k+1 simplices in X are to be sent and if their boundaries are sent to empty k-spheres in Y there is no extension of the construction so far. (Am I understanding your problem?) The inclusion of into is a cofibration so there is an induced fibration on the homs into Y. You need to be able to analyse that fibration.
Tim can you tell a little more about the induced fibration on the ’Homs”. Do you mean that something like with is a fbration?
If I remember rightly if is a cofibration, then for any , is a fibration (provided is fibrant i.e. Kan). (I have not the source in front of me, so may be forgetting some conditions or, as I have not had that much coffee this morning I may be misremembering! So do check.) Now apply it to the inclusion of the k-skel into the k+1-skel. (I find that SLN 100 by Artin and Mazur has a good short summary of this sort of thing and the relation with coskels as well. Again I find that the basic inductive ‘up the skeleton’ constructions have greater intuitive use when in a geometric context, even if after understanding that approach a neat adjointness argument is the one I eventually write down and type up! In this case I think they have great value for giving additional depth to the categorical arguents.)
If I remember rightly
Yes. I have added more dicussion of this point to simplicial model category in the section Properties – Enrichment, tensoring and cotensoring
1 to 12 of 12