Other Ring Structures on $\mathbb{Q}$

Question

This is a question I've had for a while and really don't know how to go about finding an answer:

Does there exist a pair of binary operations, $\boxplus$ and $\boxtimes$, other than the usual $+$ and $\times$, such that $(\mathbb{Q}, \boxplus, \boxtimes)$ forms a ring?

I realize that there's probably some "axiom of choice" proof that constructs unintelligible binary operations or even a construction using some other countably infinite ring and a bijection to the rationals. So more importantly I ask:

Does there exist such a $\boxplus$ and $\boxtimes$ such that $a \boxplus b$ and $a \boxtimes b$ can be computed from (closed?) formulas that only involve $+$ and $\times$ (or other related properties of $a$ and $b$ such as prime factors, divisors, gcd, partitions, etc.)?

My apologies if there's some sort of easy example out there that I'm missing. (Though in that case I'll push further and ask if it can be generalized to a larger class of examples.)

Thanks.

Answer 1

Given any bijection $f : \mathbb{Q} \to R$ where $(R,\oplus,\otimes)$ is some (necessarily countable) ring, you'll be able to get a new ring structure $(\mathbb{Q},\boxplus,\boxtimes)$ isomorphic to $(R,\oplus,\otimes)$, by setting:

$a \boxplus b = f^{-1}(f(a)\oplus f(b))$
$a \boxtimes b = f^{-1}(f(a)\otimes f(b))$

The nicer $f$ is, the nicer the expressions for $\boxplus$ and $\boxtimes$ will be. Perhaps the simplest examples are if $p \in \mathbb{Q}^\times,\ q\in \mathbb{Q}$, $R = \mathbb{Q}$, then $f(x) = px+q$ will work. This generalizes Neil's and Pace's answers.

The "converse" is trivially true, in that if $f : (\mathbb{Q},\boxplus,\boxtimes) \to (R,\oplus,\otimes)$ is an isomorphism from some ring structure on $\mathbb{Q}$ to a ring $R$, then $f$ is a bijection $\mathbb{Q} \to R$ and

$a \boxplus b = f^{-1}(f(a)\oplus f(b))$
$a \boxtimes b = f^{-1}(f(a)\otimes f(b))$

So in some sense, the above method for getting a ring structure on $\mathbb{Q}$ is the only way to do it. The question (more or less) boils down to, "for which rings $(R,\oplus,\otimes)$ is there a 'nice' bijection $\mathbb{Q} \to R$?" It depends, of course, on what you think "nice" means.

Answer 2

The simplest example is just $x\boxplus y=x+y$ and $x\boxtimes y=-xy$. This gives a ring structure with $-1$ as the multiplicative identity. The map $x\mapsto -x$ gives an isomorphism $(\mathbb{Q},\boxplus,\boxtimes)\simeq(\mathbb{Q},+,\times)$.

Answer 3

$x\oplus y=\mathrm{min}(x,y)$, $x \otimes y=x+y$ gives a semiring. The direct sum of a countable collection of finite rings gives a ring. Or lots of other things. There is certainly no classification of the countable rings.

Answer 4

The answer is yes (unless I made a mistake somewhere).

For example, you can replace addition with the operation $a\oplus b=a+b-1$. This is a commutative, associative binary operation with identity $1$ and the inverse of $a$ is given by $2-a$.

You replace multiplication by $a\odot b= a+b-ab$. This is a commutative, associative binary operation with identity $0$.

All that remains is to show that the distributive laws hold.

Answer 5

Since the question is somewhat fuzzy, I am not 100% sure what would satisfy you as an answer. Based on nothing, I am guessing you want something a little stranger than the examples Neil and Pace have provided, but a little simpler or more concrete than Joel's family of examples.

There is a somewhat cute, if useless, ring structure for $\mathbb{Q_+}$ (the positive rationals) which might still be of interest to you. I haven't thought of whether it can be extended to $\mathbb{Q}$ in a nice way.

The idea is that the fundamental theorem of arithmetic (existence and uniqueness of factorization in $\mathbb{N}$) gives a bijection between $\mathbb{Q}_+$ and sequences of integers with finitely many nonzero elements. Namely each number is mapped to the sequence of powers of primes in its factorization, i.e., $\frac{3}{4} = 2^{-2}\cdot 3^1 \mapsto (-2,1,0,0,\ldots)$.

The set of sequences of integers with finitely many nonzero elements already has a familiar ring structure, namely that of $\mathbb{Z}[x]$. We can use the map above to transfer this ring structure to $\mathbb{Q}_+$, in which case $\boxplus$ is what we usually call multiplication (the cute part) and $\boxtimes$ is defined by the ring axioms and the condition that $p_i \boxtimes p_j = p_{i+j}$ where $p_0=2,p_1=3, p_2 = 5,\ldots $ is the sequence of primes. For example, you can check that $\frac{3}{4}\boxtimes 6 = \frac{5}{12}$. Computationally the downside is that you need to be able to factor into primes to be able to do $\boxtimes$ (as far as I know).

Answer 6

A more general formulation may be as follows, and close to what you desire. Given the set Q of rational numbers and a (necessarily finite) set of basic operations of finite arity, consider the set T of all term operations formed through composition from the basic operations. (Some of the operations can have arity 0, so they look like constants or constant functions.) How many pairs (a,m) of terms from T can one form so that the structure < Q, a, m > is a ring?

I do not know where in the general algebra literature this is covered. Search terms that come to mind are cryptomorphism, term equivalent or polynomially equivalent algebras, and interpreting one structure inside another. I hope this helps. If I had to guess, I would guess to the above that there are infinitely many pairs of terms making Q into infinitely many distinct rings, given + , *, 0 and 1.

Gerhard "Ask Me About System Design" Paseman, 2011.08.31