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.
In something I am writing I needed the notion of a (n+1)-tuple and thought ’how can that be done elegantly?’ I then realised that there is not actually a definition in the lab. As this is probably most useful in the logical, type theoretic and constructive settings I will write just a stub and leave the experts in those areas to add in suitable commentary and details. I needed the idea that I call the support of a tuple, that is its set of component elements. Does anyone know of a better term for that?
Gee, I’m not sure what you want! An (n+1)-tuple is a section of a map X→[n+1]? Or, if all the components of the tuple are understood as belonging to the same set Y, a section of the projection π:Y×[n+1]→[n+1], which can in turn be identified with a map [n+1]→Y.
The support of an (n+1)-tuple f:[n+1]→Y is the image i(f)↪Y?
Sorry if I’m saying something dumb…
I was just wondering if someone had met the idea elsewhere. I looks as if support is quite a good term for it so I will leave it at that. The construct is just needed to construct the functor from the category of simplicial complexers to that of simplicial sets.
wondering if someone had met the idea elsewhere
What is “the idea” that you have in mind here? Is it the term “support” as indicated in the entry tuple?
I am not fully sure what you mean by it.
the term I used was support for a n-tuple of entries from a set X, as being the underlying set of elements or the set of components of the ’tuple’. It is a convenience for handling the functor from Simp.Comp to SSet given by sending a simplicial complex K to the simplcial set, Ksimp with σ=⟨v0,…,vn⟩ being an n-simplex of Ksimp if the ’support’ of σ, thus the actual vertices used, forms a simplex of K. Thus if K is the simplicial complex 1-simplex, then Ksimp has a 2-simplex that looks like ⟨1,0,1⟩, which is not degenerate. It is a simplex because its support is the set {0,1} which is a simplex of K.
I can’t help feeling that this notion must have a name (other than the overused ’underlying set’).
This occurs in the paper by Abels and Holz that I mentioned in another thread, but their description is not 100% to my liking, so …. . (This leads on to orbihedra and triangulable orbifolds.)
Since I usually think of an n-tuple as a function from [n]≔{0,…,n−1}, I often call the support the range.
I expanded the discussion of formalisation of tuples, which is not always an obvious generalisation of the fomalisation of ordered pairs. (Try to generalise (a,b)≔{{a},{a,b}} to triples, for example.) Actually, I expanded all of it.
Great. I was hoping someone in the know would do that. Thanks.
1 to 7 of 7