Edit: this structure is not a field as proved by just_browsing.
Here is a wacky idea I've had forever.
There are a bunch of areas in math where you get expressions of the form 00 and they resolve to some number, but it's not always the same number. I've heard some people say that 00 "can be any number". Can we formalize this? The formalism would have to include 4⋅0 as something different than 3⋅0, so that if you divide the first by 0, you get 4, but the second gets 3.
Here is a way to turn this into what may be a field or ring. Each element is a function f:Z→R, where a function of the form (⋯0,4,3,5,1,2,0⋯) reads as 4⋅02+3⋅0+5+10+202. Addition is component-wise (3⋅0+6⋅0=9⋅0; this makes sense), i.e., (f+g)(z):=f(z)+g(z), and multiplication is, well, 30⋅20=602, so we get the rule
(f⋅g)(z)=∑k+ℓ=zf(k)g(ℓ)
This becomes a problem once elements with infinite support are considered, i.e., functions f that are nonzero at infinitely many values, since then the sum may not converge. But it's well defined for numbers with finite support. This is all similar to how polynomials are handled formally, except that polynomials only go in one direction (i.e., they're functions from N rather than Z), and that also solves the non-convergence problem. Even if infinite polynomials are allowed, multiplication is well-defined since for any n∈N, there are only finitely many pairs of natural numbers k,ℓ such that k+ℓ=n.
The additively neutral element in this setting is 0:=(⋯0,0,0,0,0⋯) and the multiplicatively neutral element is 1:=(⋯0,0,1,0,0⋯). Additive inverses are easy; (−f)(z)=−f(z)∀z∈Z. The interesting part is multiplicative inverses. Of course, there is no inverse of 0, so we still can't divide by the 'real' zero. But I believe all elements with finite support do have a multicative inverse (there should be a straight-forward inductive proof for this). Interestingly, those inverses are not finite anymore, but they are periodical. For example, the inverse of 1⋅0 is just 10, but the inverse of 1+1⋅0 is actually
1−1⋅0+1⋅02−1⋅03+1⋅04⋯
I think this becomes a field with well-defined operations if one considers only the elements with finite support and elements with inverses of finite support. (The product of two elements-whose-inverses-have-finite-support should itself have an inverse of finite support because (fg)−1=g−1f−1). I wonder if this structure has been studied somewhere... probably without anyone thinking of the interpretation considered here.
If you allow series that are infinite in both directions, then you have a new problem which is that multiplication may no longer be possible: the sums involved need not converge. And there's also the issue already noted, that some things that don't look like they equal zero may in some sense have to be zero. (Meaning "absolute" zero = (...,0,0,0,...) rather than the thing you originally called zero which should maybe be called something like ε instead.)
What's the best we could hope for? Something like this. Write R for RZ, i.e., all formal p... (read more)