And what are those reasons? The main one I can think of is that the complex primitive n-th root of unity is an integer for n = 2, but not for higher n (and whatever consequences this has). Are there others?
Admittedly what I said doesn't apply to automorphism groups of objects in non-concrete categories. I think of these as "things that work in much the same way that sets with structure do".
-
-
Alright, now the 2 comes from your focus on "functions"; that is, on particular 2-ary relations. But we might also look at 3-ary correspondence relations. E.g., R(x, y, z), such that for any choice of x, y, or z, there are designated corresponding values for the other arguments.
-
Once you focus on the relations that are like functions in that they satisfy conditions like "for any value of _ there is unqiue _", there is something 2-ish going on, because the places in the relation are being partitioned into 2 pieces, the domain piece and the codomain piece.
-
Even if you try to generalize bijections by using a condition that the relation must be function-like for multiple domain/codomain partitions (e.g. for any values of any k places, there are designated values for other n-k), each partition is into 2 parts.
-
A ternary correspondence is a subset of X x Y x Z such that each element of X, Y, or Z appears in precisely one element of the subset.
-
You can alternatively phrase this in 2-ish ways if you like, but you can phrase anything in lots of ways. It's not fundamentally a 2-ish notion, except in that each 3-point simplex contains within it 2-simplices for its sides, and so on.
-
As I said, you can express all the higher n-ary structure from 2-ary structure, yes, but this needn't be considered the primary presentation.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.