|
4 |
edited tags
|
||
|
3 | added 3 characters in body | ||
|
This is a re-post on a previous question I asked. My first question was too vague to warrant detailed responses. Really, I have two specific questions to ask. 1) Let $\sigma = (A; {0,1}; +, \times)$ be a signature. Form the language $L(\sigma)$ over $\sigma$. Let $T$ be the theory of commutative rings and let $M$ be a model of this theory. We can realize localization in the model $M$ by specifying a class of formulas in our language $$K = {s_x \ \mid \ x \in A - (0)}, \quad \mbox{where}\ s_x = [\exists x, \ x = x]$$ and then for each $x$ defining a formula $s_{x}^{-1} = \exists y, xy = 1$. Adding $s_{x}^{-1}$ to our theory $T$, call it $T_x$ and then taking a model $N$ of $T_x$ with the property that there is a monomorphism $M \rightarrow N$ will realize $N$ as a localization of $M$. My first question is whether or not this is right way, for a logician to think about localization of a commutative ring? 2) It seems to me that it should be possible to extend this construction to other languages by specifying an appropriate class $K$ and formula's $s_{x}^{-1}$. In particular, this should work for non-commutative rings. In summary, what can be said about localization in a first order language? Edit Actually, in 1), I still have a problem. Specifying a monomorphism $M \rightarrow N$ is not accurate because $M$ may not be integral. Actually, I need to specify a map $M \rightarrow N$ by a universal property. |
||||
|
2 | added 223 characters in body | ||
|
This is a re-post on a previous question I asked. My first question was too vague to warrant detailed responses. Really, I have two specific questions to ask. 1) Let $\sigma = (A; {0,1}; +, \times)$ be a signature. Form the language $L(\sigma)$ over $\sigma$. Let $T$ be the theory of commutative rings and let $M$ be a model of this theory. We can realize localization in the model $M$ by specifying a class of formulas in our language $$K = {s_x \ \mid \ x \in A - (0)}, \quad \mbox{where}\ s_x = [\exists \ x = x]$$ and then for each $x$ defining a formula $s_{x}^{-1} = \exists y, xy = 1$. Adding $s_{x}^{-1}$ to our theory $T$, call it $T_x$ and then taking a model $N$ of $T_x$ with the property that there is a monomorphism $M \rightarrow N$ will realize $N$ as a localization of $M$. My first question is whether or not this is right way, for a logician to think about localization of a commutative ring? 2) It seems to me that it should be possible to extend this construction to other languages by specifying an appropriate class $K$ and formula's $s_{x}^{-1}$. In particular, this should work for non-commutative rings. In summary, what can be said about localization in a first order language? Edit Actually, in 1), I still have a problem. Specifying a monomorphism $M \rightarrow N$ is not accurate because $M$ may not be integral. Actually, I need to specify a map $M \rightarrow N$ by a universal property. |
||||
|
1 |
|
||

