So there is a way of extending the set $N$ of natural numbers with 0, equipped with ordinary multiplication, to its Grothendieck group, the group of integers with respect to addition.
This group, $Z$, is the best extension of $N$ in the sense that ...? (question)
So, here are my questions:
- I know the field of fractions $F$ of a commutative ring $R$ (without a zero divisor) is the best extension of $R$ into a field in the sense that given a natural inclusion map $\iota:R\to F$ (by sending $r\in R$ to $r/1\in F$), and any other field $K$ and an in injective homomorphism $\phi:R\to K$, there exists a (unique?) injective homomorphism $\overline{\phi}:F\to K$ such that the diagram commutes. So in a sense $F$, the field of fraction $F$ is the smallest extension of $R$.
How does this idea then apply to $Z$, the Grothendieck group of $N$? Wikipedia has something like what I said, but slightly different (in that the homomorphisms are not necessarily injective, so one cannot talk about "inclusion relation").
- Okay, the integers are not only a group with respect to addition, but it is also a ring with respect to addition and multiplication. How do you then extend a commutative monoid (such as $N$) to a commutative ring (such as $Z$)? Do we do so simply by defining one more binary operation on $(Z,+)$? If s0, how do we guarantee that it is indeed a very special structure (in the sense that it is the smallest ring extension of $N$)?
Much appreciated in advance!
Okay, bear with me, because this is going to be rather informal and some details might be off, but I think the general idea should be right:
Concerning 2.: "Free constructions" give rise to functors, for example there is a functor $F : \mathsf{Set}\rightarrow \mathsf{Grp}$ mapping a set $A$ to the free group $F(A)$ on this set and a function $f : A\rightarrow B$ to a group morphism $F(f) : F(A) \rightarrow F(B)$. Of course, you would need to figure out, how the actual construction of a free group works, but to prove, that $F$ is a functor (preserves identities and composition) you can use the UMP (universal mapping property) of the free group on a set:
where $U : \mathsf{Grp} \rightarrow \mathsf{Set}$ is the forgetful functor, mapping groups to their underlying set of elements and group morphisms $f$ to $f$ ("forgetting", that they are group morphisms and not just maps). Strictly speaking, we should also write: "s.t. $f = U(f^*)\circ i$".
The same kind of property holds for all the "free constructions", including the field of fractions, except we have functors $F : \mathsf{CRing} \rightarrow \mathsf{Fld}$ and $U : \mathsf{Fld} \rightarrow \mathsf{CRing}$, a commutative ring $A$ and a ring morphism $i : A \rightarrow U(F(A))$ and so on and so forth.
We observe in all these cases, that there is an adjunction: $F$ is left adjoint to $U$. Observe, that adjoints are unique up to natural isomorphism, so they are in some sense special and $F$ really gives you the most efficient way to turn something into something with more structure or more properties. To prove, that you can not "efficiently" turn a commutative monoid into a commutative ring, you would need to show, that the corresponding forgetful functor $U$ has no left adjoint. I don't know, how to do that though and I only suspect, that this is really true.
Concerning 1.:
I informally determined (that is I think), that you can turn an additively cancellative commutative rig $A$ (that's like a commutative ring with identity, except addition need not be a group operation, but still cancellative) into a commutative ring $F(A)$, by the usual construction, that turns natural numbers into integers (equivalence classes of $\mathbb{N}^2$). Given such a rig $A$, we have a rig monomorphism: $i : A \rightarrow U(F(A)), a \mapsto [(a,0)]$ and of course the UMP:
For all commutative rings $B$ and rig morphisms $f : A \rightarrow U(B)$ there is a unique ring morphism $f^* : F(A) \rightarrow B$, s.t. $f=f^*\circ i$.
This morphism is defined by $f^* : F(A) \rightarrow B, [(a,b)]\mapsto f(a-b)$, I believe. You of course need to check everything carefully (including, that $f^*$ is well-defined).
Note: A rig morphism preserves addition, multiplication as well as $0$ and $1$. (It's a monoid morphism for both addition and multiplication)