A wheel is an algebraic concept similar to a field but in which division is always defined, even division by zero. This naturally requires modifications to the usual axioms. Every commutative ring gives rise to a wheel using a simple modification of the construction of the field of fractions, although there are other examples.
The terminology ‘wheel’ comes from the example of the wheel of real numbers, which geometrically consists of a circle (the circle of extended real numbers) together with an additional point (thought of as the hub of the wheel), thus looking like .
In elementary algebra, it's traditional to write for the opposite (or additive inverse) of , although one could write (or perhaps , meaning ) instead. This overloads the symbol , with one meaning as a unary operator and another as a binary operator, related since . However, it is not common to write for the reciprocal (or multiplicative inverse) of , but only to write (or perhaps ) instead. But it would work just as well to overload the symbol , again with one meaning as a unary operator and another as a binary operator, related since .
In a wheel, the unary operator is a fundamental part of the structure, and the binary is only defined using it. Although it remains true that , so that we could reasonably write instead of , this puts the emphasis the wrong way. And while we could probably write instead of , this is dangerous, since it's not true that is always the multiplicative inverse of in a wheel. (But for that matter, is not always the additive inverse of in a wheel, even though we can still write it, and indeed define it, as , when this makes sense.)
If we write multiplication as juxtaposition, then is naturally interpreted as , and so rather than think explicitly of the derived binary operation , it's best to think of as always meaning . So only the unary version of really matters. But notice that means , not (which is different, and in fact equal to , or for short). So we are coming down on the side of in the great PEMDAS debate.
A wheel consists of an underlying set equipped with two binary operations written with any common notation for addition and multiplication, a unary operation written with as a prefix (called the reciprocal), and two constants and , such that:
Although these rules are somewhat odd, we need some unusual behaviour to prevent a wheel from collapsing to a triviality via . In fact, only the last step is generally valid in a wheel. The paradigmatic example is the wheel of fractions of a commutative ring, for which all of the axioms are easily checked, but for which simpler (invalid) statements have counterexamples.
We can generalize the quasi-distributive rule beyond two terms as
That is, to multiply by the sum of terms, you need to add in copies of as well, and then the result is the sum of products.
Wheels are like rigs in that there is generally no notion of subtraction. However, if the wheel happens to have a (necessarily unique) additive inverse of , we may write it as , define as , and define as . But notice that is not in general an additive inverse of ; rather, we have (using the modified general form of distributivity).
It is common to write as and as .
The original example is the wheel of real numbers, denoted . An element of is an equivalence class of pairs of real numbers under a certain equivalence relation. Morally, and are set equivalent iff ; however, this is not quite right, because it makes equivalent to every other pair (and so it's not even transitive). So we additionally require that iff , so that is actually equivalent only to itself. We may write the equivalence class of as , but let's write it as instead until we've established what means in . Now, we can define addition and multiplication in the usual way for fractions: and . Reciprocals are immediate: . The identities and in are and respectively. More generally, any real number gives us an element of . This function from to is one-to-one and respects addition and multiplication; it also respects reciprocals in that if . Now we're justified in writing for . We also write for and for ; these are the only elements of that don't come from . We have whenever , while and always; and whenever , while and always. In particular, , and . Of course, and , while . Then whenever , while ; and whenever , while . Fortunately, and remain true always. One way to think of all of this is that we are using the usual arithmetic on the version of the extended real numbers in which (the projective line), but whenever the result is undefined, we take it to be (and any calculation involving stays , as in domain theory).
Last revised on April 6, 2023 at 16:28:23. See the history of this page for a list of all contributions to it.