You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
Is there anything in the observation that for species the derivative is defined as ? So here we have .
Just to say it out loud, this says a list of lists of elements in X is either a list containing only the empty list, or a list of elements of X and 'markers': copies of .
But one thing it implies, when taken with other observations here, is that the function
obeys the differential equation
One thing that's intrigued me for a long time - I've probably discussed it with @David Corfield on the n-Category Cafe - is that
This always makes me wonder if there's some weak sense in which
I don't think
say as endofunctors on . This would be saying a list of lists of lists of elements of is the same as an element of !
But let's see what we can do with @Vincent Moreau/@Oscar Cunningham's nice fact that
This implies that
where we leave the outer star alone, and also that
where we leave the inner star alone. Can we do anything with this other than annoying our friends by asking them to show there's a natural isomorphism
John Baez said:
I don't think
say as endofunctors on . This would be saying a list of lists of lists of elements of is the same as an element of !
Indeed, there is no such bijection when is a finite set, because the left hand side is then infinite.
John Baez said:
Can we do anything with this other than annoying our friends
The reason I wanted another formula for was to represent words of words as simply typed -terms of a certain type (with just and , no coproducts) -- as described in the second message of the thread -- and to see if this yields an interesting viewpoint on the Kleene star of regular languages. Well, at the end of the day I can still represent non-empty words of words, which is not exactly what I wanted but still better than nothing I guess, and along the way I eventually got interested in the formula itself.
John Baez said:
This implies that
To help intuitions, we might consider Morse code, with . Then contains a representative of each letter of the alphabet (and each numeral). contains each word and contains each sentence.
But to send sentences unambiguously we use spaces. So, contains all words of a language with the , a silence lasting 3 units, marking the boundary of a letter. Then contains all sentences with the final , a silence lasting 7 units, marking the boundary of a word.
This is indeed a nice example of lists of lists of lists. Is this how the silences are actually used in Morse code?
Yes, that's how they use silences. To end a sentence they seem to use a special combination of dots and dashes, rather than go for an even longer silence.
Marking the trace of via a new symbol. :grinning: