Surcomplex Numbers 2026-07-25

By Max Woerner Chase

All right, apparently the secret to getting stuff done was to have no expectations about what or whether I was going to work on. Shortly-ish after posting the last entry, I worked out that a hopefully-equivalent means of comparison to the stuff I was talking about at the end there was to define comparators that involve an ordered pair of distinct indices. For surreal numbers, this means there are two relations, one for each order. For these attempted surcomplex numbers, there are six relations. I'm choosing to define the relations so that if all relations hold for a pair of numbers, they're considered equal. And to determine whether a triple actually corresponds to a number, we need to take three of these relations, and apply them to the sets corresponding to the relation's indices; if none of the pairs of members from two sets satisfy the corresponding relation, then the triple is a number.

That's the conjecture, anyway. I haven't put in the legwork to verify it yet, but first, a few more implications:

One question I have is, as far as representing this stuff in code, how do I want to distinguish between structural equality and numerical equality? For now, I'm going to sleep on this.

Good night.