# Wheel theory

Wheels are a type of algebra where division is always defined. In particular, division by zero is meaningful. The real numbers can be extended to a wheel, as can any commutative ring.

The Riemann sphere can also be extended to a wheel by adjoining an element ${\displaystyle \bot }$, where ${\displaystyle 0/0=\bot }$. The Riemann sphere is an extension of the complex plane by an element ${\displaystyle \infty }$, where ${\displaystyle z/0=\infty }$ for any complex ${\displaystyle z\neq 0}$. However, ${\displaystyle 0/0}$ is still undefined on the Riemann sphere, but is defined in its extension to a wheel.

The term wheel is inspired by the topological picture ${\displaystyle \odot }$ of the projective line together with an extra point ${\displaystyle \bot =0/0}$.[1]

## Definition

A wheel is an algebraic structure ${\displaystyle (W,0,1,+,\cdot ,/)}$, satisfying:

• Addition and multiplication are commutative and associative, with ${\displaystyle 0}$ and ${\displaystyle 1}$ as their respective identities.
• ${\displaystyle //x=x}$
• ${\displaystyle /(xy)=/y/x}$
• ${\displaystyle xz+yz=(x+y)z+0z}$
• ${\displaystyle (x+yz)/y=x/y+z+0y}$
• ${\displaystyle 0\cdot 0=0}$
• ${\displaystyle (x+0y)z=xz+0y}$
• ${\displaystyle /(x+0y)=/x+0y}$
• ${\displaystyle 0/0+x=0/0}$

## Algebra of wheels

Wheels replace the usual division as a binary operator with multiplication, with a unary operator applied to one argument ${\displaystyle /x}$ similar (but not identical) to the multiplicative inverse ${\displaystyle x^{-1}}$, such that ${\displaystyle a/b}$ becomes shorthand for ${\displaystyle a\cdot /b=/b\cdot a}$, and modifies the rules of algebra such that

• ${\displaystyle 0x\neq 0}$ in the general case
• ${\displaystyle x-x\neq 0}$ in the general case
• ${\displaystyle x/x\neq 1}$ in the general case, as ${\displaystyle /x}$ is not the same as the multiplicative inverse of ${\displaystyle x}$.

If there is an element ${\displaystyle a}$ such that ${\displaystyle 1+a=0}$, then we may define negation by ${\displaystyle -x=ax}$ and ${\displaystyle x-y=x+(-y)}$.

Other identities that may be derived are

• ${\displaystyle 0x+0y=0xy}$
• ${\displaystyle x-x=0x^{2}}$
• ${\displaystyle x/x=1+0x/x}$

And, for ${\displaystyle x}$ with ${\displaystyle 0x=0}$ and ${\displaystyle 0/x=0}$, we get the usual

• ${\displaystyle x-x=0}$
• ${\displaystyle x/x=1}$

If negation can be defined as above then the subset ${\displaystyle \{x\mid 0x=0\}}$ is a commutative ring, and every commutative ring is such a subset of a wheel. If ${\displaystyle x}$ is an invertible element of the commutative ring, then ${\displaystyle x^{-1}=/x}$. Thus, whenever ${\displaystyle x^{-1}}$ makes sense, it is equal to ${\displaystyle /x}$, but the latter is always defined, even when ${\displaystyle x=0}$.

## Wheel of fractions

Let ${\displaystyle A}$ be a commutative ring, and let ${\displaystyle S}$ be a multiplicative submonoid of ${\displaystyle A}$. Define the congruence relation ${\displaystyle \sim _{S}}$ on ${\displaystyle A\times A}$ via

${\displaystyle (x_{1},x_{2})\sim _{S}(y_{1},y_{2})}$ means that there exist ${\displaystyle s_{x},s_{y}\in S}$ such that ${\displaystyle (s_{x}x_{1},s_{x}x_{2})=(s_{y}y_{1},s_{y}y_{2})}$.

Define the wheel of fractions of ${\displaystyle A}$ with respect to ${\displaystyle S}$ as the quotient ${\displaystyle A\times A~/\sim _{S}}$ (and denoting the equivalence class containing ${\displaystyle (x_{1},x_{2})}$ as ${\displaystyle [x_{1},x_{2}]}$) with the operations

${\displaystyle 0=[0_{A},1_{A}]}$           (additive identity)
${\displaystyle 1=[1_{A},1_{A}]}$           (multiplicative identity)
${\displaystyle /[x_{1},x_{2}]=[x_{2},x_{1}]}$           (reciprocal operation)
${\displaystyle [x_{1},x_{2}]+[y_{1},y_{2}]=[x_{1}y_{2}+x_{2}y_{1},x_{2}y_{2}]}$           (addition operation)
${\displaystyle [x_{1},x_{2}]\cdot [y_{1},y_{2}]=[x_{1}y_{1},x_{2}y_{2}]}$           (multiplication operation)

## References

• Setzer, Anton (1997), Wheels (PDF) (a draft)
• Carlström, Jesper (2004), "Wheels – On Division by Zero", Mathematical Structures in Computer Science, Cambridge University Press, 14 (1): 143–184, doi:10.1017/S0960129503004110 (also available online here).