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.
Here is another puzzle on rigs. I don't know how to solve it or make a program to solve it but maybe some will be entertained to try.
Define the characteristic of a rig as the smallest integer such that if there exists such a and if there doesn't exist such a . The characteristic of a finite ring is always . But it is not the case for a finite rig. For instance with is finite and of characteristic , the only other rig of cardinal is and it is a ring so it is of characteristic (it is ). The zero rig is also a ring of characteristic (it is ).
Question: Do we have a rig of cardinal of characteristic ? of cardinal ?... Can you list them?
Taking min and max as the addition and multiplication on gives us an example for any .
Excellent!
And it gives you for
Just a little thing: it doesn't work for since the zero ring is of characteristic
But it's really funny examples
You can also start with and quotient it by the relation . This gives etc, so all numbers are identified, while otherwise addition and multiplication work as usual. This is a finite semiring with four elements, and which has characteristic in your sense. Of course you can replace by any other number.
Hmm, that's interesting because it gives examples which are not additively idempotents (all of them are of characteristic except the zero ring) such as the ones of Aaron or more generally such that (which also works when ).
Thank you. I like your rigs.
So, maybe a challenge is to find one such that we don't have for all for some
Jean-Baptiste Vienney said:
So, maybe a challenge is to find one such that we don't have for all for some
You can try to quotient e.g. by . Then all even numbers are identified, and all odd numbers are identified, but are still distinct.
Thanks, finally now I wonder if not most the rigs are of characteristic in this sense, positive characteristic seems to be related to the abelian group structure of rings more than something about rigs and I guess that most rigs are not rings. So I would not be surprised that the proportion of rigs of cardinal less than which are of characteristic tends to when tends to ...
Sounds like a good candidate for a pair of related OEIS entries: the number of rigs of size n, and the number of characteristic 0 rigs of size n.
Any rig has a canonical map from that sends to ( times). The image of this map is a quotient rig of . The possible quotients of are all of the form 'quotient together and for all ' for some and . I think it makes more sense to define the characteristic to be this , rather than setting it to be whenever .
In other words, take in your rig and start repeatedly adding . If the values you get start to repeat then the characteristic is the period with which they repeat, and otherwise it's 0.
For example, this would make have characteristic rather than .
David Michael Roberts said:
Sounds like a good candidate for a pair of related OEIS entries: the number of rigs of size n, and the number of characteristic 0 rigs of size n.
That’s a good idea. We just need to find a good technique to compute these numbers. Finding the isomorphism classes of finite rigs with a brute force approach is very very quickly absolutely intractable. To see it, try to compute the number of possibilities for the operations and then the number of functions to check for potential isomorphisms. The first thing to do is to find isomorphism classes of finite commutative monoids for the little sizes. For rings, you can use all the classical stuff on groups to do that. But here, what to use? I don’t know such classical stuff for commutative monoids.
Oscar Cunningham said:
Any rig has a canonical map from that sends to ( times). The image of this map is a quotient rig of . The possible quotients of are all of the form 'quotient together and for all ' for some and . I think it makes more sense to define the characteristic to be this , rather than setting it to be whenever .
In other words, take in your rig and start repeatedly adding . If the values you get start to repeat then the characteristic is the period with which they repeat, and otherwise it's 0.
That´s wonderful. It means that the positive characteristic phenomemon is not something restricted to rings and abelian groups, but also somewhat exists for rigs and commutative monoids. Now, I’m wondering if we can adapt some stuff to the situation without negatives. The abelian groups play a fundamental role when you have negatives, as you can see in the classification of finitely generated abelian groups and with the notion of order of an element in a group. Maybe could we define a kind of notion of order for an element of a monoid or maybe only for an element of a commutative monoid by using somewhat the rigs obtain from by quotienting and for for some and . Or maybe not. Maybe we could exercise by first choosing a notation for these rigs and compute the characteristic for a cartesian product of such rigs.
I have only just seen this, but I wish I had gotten here sooner: in my opinion the correct generalization of characteristic for rigs is the pair of numbers determining the subrig generated by 1, which is necessarily a quotient of . A nice indexing is for characteristic with and to denote , with addition and multiplication reduced modulo into the range . This is nice because it means that the existence of a rig homomorphism from a rig of characteristic to one of characteristic forces and . We can extend this with characteristic for the case of the natural numbers embedding into the rig.
Note that this is not really consistent with the definition of characteristic 0 you gave earlier @Jean-Baptiste Vienney , but I don't think that definition gives you particularly detailed information about the rig.
Okay, no problem. It's a better definition.
(Not to criticize the puzzle, though, it's fun to figure out how rigs can differ from rings and building intuition about them)
No problem ahah. I'm interested by how you can find analogues of the without negatives. So, here are precise questions:
You need ; can take the extreme values but consider the infinite case separately. Consider the congruence on generated by the relation . This produces the rig I described above, so every characteristic is possible.
Notice that any congruence on is principal, so adding the case gives all possibilities. Also note that this is true whether we consider as a rig or as an additive monoid, which I think gives some indication of the answer to your third question.
I've just understood something by reading the nlab entry characteristic. If a rig has characteristic with my first definition, then is invertible in and so every element of the rig also and so it is a ring. So every rig which is not a ring verifies that for every and is of characteristic with this first definition. Now a ring can also be of characteristic so it doesn't separate rigs which are rings and those which are not.
But restricting to finite rigs...?
Right! Finite rings are always of positive characteristic so yes, finite rigs which are not rings are exactly the ones of characteristic in this sense!
I agree with @Morgan Rogers (he/him), but would tentatively go further and define the characteristic to be the sub-rig additively generated by 1, since it is uniquely determined up to isomorphism (if I haven't made a mistake) by the pair of numbers, much as the characteristic of a field is equivalent to knowing the prime field it contains, or similarly for the characteristic of a ring.
And we should have a nice notation for these rigs. For instance, a cumbersome and silly notation is , and that doesn't quite capture the case of (??). But it indicates a little of what is going on. More streamlined yet opaque notations like are of course possible.
Morgan Rogers (he/him) said:
You need ; can take the extreme values but consider the infinite case separately. Consider the congruence on generated by the relation . This produces the rig I described above, so every characteristic is possible.
Notice that any congruence on is principal, so adding the case gives all possibilities.
Should that last sentence have , given the first sentence?
These rigs make me think to the Pollards's rho algorithm.
If you take any function where is a finite set, then , for any fixed makes a rho like when you do in these rigs.
I never understood well this algorithm but it makes the same rhos and works with numbers modulo so who knows.
David Michael Roberts said:
And we should have a nice notation for these rigs. For instance, a cumbersome and silly notation is , and that doesn't quite capture the case of (??). But it indicates a little of what is going on. More streamlined yet opaque notations like are of course possible.
I've mentioned in the topic on my work that I'm writing a paper on multiplicatively idempotent rigs (I've decided to call these mirigs), where I indeed introduce the notation similar to what you suggest, since is the free mirig on 0 generators (and I observe that is the free rig on zero generators satisfying ). It's coming soon, I'm in the process of computing the size of the free mirig on three generators so that I have a concrete original result to lay claim to. (In writing this I realise that I used the opposite convention on the ordering of the indices in my paper, though)