Valuation Rings and Ultrafilters
$begingroup$
I notice there is a certain similarity between the definition of a valuation ring and the definition of an ultrafilter.
To begin, take a field $K$ and let $mathcal{A}$ be the set of subrings of $K$. Let $mathcal{B}'$ be the class of pairs $(nu, Lambda)$, where $Lambda$ is a partially ordered abelian group, and $nu : K^times rightarrow Lambda$ is a surjective map of abelian groups such that $nu(a),nu (b) geq 0 implies nu(a+b) geq 0$. Note that $nu$ does necessarily respect the partial order of $Lambda$. We form the set $mathcal{B}$ of equivalence classes of elements in $mathcal{B}'$, where $(nu, Lambda) sim (nu', Lambda')$ when $nu$ factors through $nu'$ by an isomorphism of partially ordered abelian groups.
There is a $1$-to-$1$ correspondence between $mathcal{A}$ and $mathcal{B}$. We send a subring $R$ of $K$ to the abelian group $K^times / R^times$, with the smallest admissible partial order generated by declaring elements $r R^times$ to be non-negative, paried with the natural map $K^times rightarrow K^times /R^times$. We send a pair $(nu, Lambda)$ in $mathcal{B}$ to ${ r in K : nu(r) geq 0 }$.
To see the similarity, take a boolean algebra $A$ with filter $F$ and a field $K$ with subring $R$ inducing a pair $(nu, Lambda)$. To make the similarity more clear, I want to change the notation a bit for the field $K$: for $a, b in K$, write $a leq b$ when $nu(a) leq nu(b)$. Write $a wedge b$ for $a + b$. Write $a^c$ for $a^{-1}$ ($c$ for complement). Then we have
1) $a, b in R implies a wedge b in R forall a,b in K^times$, just as $a, b in F implies a wedge b in F forall a, b in A$.
2) $1 in R$, just as $1 in F$.
3) $a in R, a leq b implies b in R$, just as $a in F, a leq b implies b in F$.
4) $R$ is a valuation ring when $a in R$ or $a^c in R$ for all $a in K^times$, just as $F$ is an ultrafilter when $a in F$ or $a^c in F$ forall $a in A$.
Can anyone illuminate the similarity going on here? How is $K^times$ formally like a boolean algebra?
ultrafilters valuation-rings
$endgroup$
add a comment |
$begingroup$
I notice there is a certain similarity between the definition of a valuation ring and the definition of an ultrafilter.
To begin, take a field $K$ and let $mathcal{A}$ be the set of subrings of $K$. Let $mathcal{B}'$ be the class of pairs $(nu, Lambda)$, where $Lambda$ is a partially ordered abelian group, and $nu : K^times rightarrow Lambda$ is a surjective map of abelian groups such that $nu(a),nu (b) geq 0 implies nu(a+b) geq 0$. Note that $nu$ does necessarily respect the partial order of $Lambda$. We form the set $mathcal{B}$ of equivalence classes of elements in $mathcal{B}'$, where $(nu, Lambda) sim (nu', Lambda')$ when $nu$ factors through $nu'$ by an isomorphism of partially ordered abelian groups.
There is a $1$-to-$1$ correspondence between $mathcal{A}$ and $mathcal{B}$. We send a subring $R$ of $K$ to the abelian group $K^times / R^times$, with the smallest admissible partial order generated by declaring elements $r R^times$ to be non-negative, paried with the natural map $K^times rightarrow K^times /R^times$. We send a pair $(nu, Lambda)$ in $mathcal{B}$ to ${ r in K : nu(r) geq 0 }$.
To see the similarity, take a boolean algebra $A$ with filter $F$ and a field $K$ with subring $R$ inducing a pair $(nu, Lambda)$. To make the similarity more clear, I want to change the notation a bit for the field $K$: for $a, b in K$, write $a leq b$ when $nu(a) leq nu(b)$. Write $a wedge b$ for $a + b$. Write $a^c$ for $a^{-1}$ ($c$ for complement). Then we have
1) $a, b in R implies a wedge b in R forall a,b in K^times$, just as $a, b in F implies a wedge b in F forall a, b in A$.
2) $1 in R$, just as $1 in F$.
3) $a in R, a leq b implies b in R$, just as $a in F, a leq b implies b in F$.
4) $R$ is a valuation ring when $a in R$ or $a^c in R$ for all $a in K^times$, just as $F$ is an ultrafilter when $a in F$ or $a^c in F$ forall $a in A$.
Can anyone illuminate the similarity going on here? How is $K^times$ formally like a boolean algebra?
ultrafilters valuation-rings
$endgroup$
$begingroup$
$mathcal{B}$ is not a set. You want to mod out by some equivalence relation.
$endgroup$
– YCor
5 hours ago
$begingroup$
Good point. I fixed it.
$endgroup$
– Dean Young
4 hours ago
add a comment |
$begingroup$
I notice there is a certain similarity between the definition of a valuation ring and the definition of an ultrafilter.
To begin, take a field $K$ and let $mathcal{A}$ be the set of subrings of $K$. Let $mathcal{B}'$ be the class of pairs $(nu, Lambda)$, where $Lambda$ is a partially ordered abelian group, and $nu : K^times rightarrow Lambda$ is a surjective map of abelian groups such that $nu(a),nu (b) geq 0 implies nu(a+b) geq 0$. Note that $nu$ does necessarily respect the partial order of $Lambda$. We form the set $mathcal{B}$ of equivalence classes of elements in $mathcal{B}'$, where $(nu, Lambda) sim (nu', Lambda')$ when $nu$ factors through $nu'$ by an isomorphism of partially ordered abelian groups.
There is a $1$-to-$1$ correspondence between $mathcal{A}$ and $mathcal{B}$. We send a subring $R$ of $K$ to the abelian group $K^times / R^times$, with the smallest admissible partial order generated by declaring elements $r R^times$ to be non-negative, paried with the natural map $K^times rightarrow K^times /R^times$. We send a pair $(nu, Lambda)$ in $mathcal{B}$ to ${ r in K : nu(r) geq 0 }$.
To see the similarity, take a boolean algebra $A$ with filter $F$ and a field $K$ with subring $R$ inducing a pair $(nu, Lambda)$. To make the similarity more clear, I want to change the notation a bit for the field $K$: for $a, b in K$, write $a leq b$ when $nu(a) leq nu(b)$. Write $a wedge b$ for $a + b$. Write $a^c$ for $a^{-1}$ ($c$ for complement). Then we have
1) $a, b in R implies a wedge b in R forall a,b in K^times$, just as $a, b in F implies a wedge b in F forall a, b in A$.
2) $1 in R$, just as $1 in F$.
3) $a in R, a leq b implies b in R$, just as $a in F, a leq b implies b in F$.
4) $R$ is a valuation ring when $a in R$ or $a^c in R$ for all $a in K^times$, just as $F$ is an ultrafilter when $a in F$ or $a^c in F$ forall $a in A$.
Can anyone illuminate the similarity going on here? How is $K^times$ formally like a boolean algebra?
ultrafilters valuation-rings
$endgroup$
I notice there is a certain similarity between the definition of a valuation ring and the definition of an ultrafilter.
To begin, take a field $K$ and let $mathcal{A}$ be the set of subrings of $K$. Let $mathcal{B}'$ be the class of pairs $(nu, Lambda)$, where $Lambda$ is a partially ordered abelian group, and $nu : K^times rightarrow Lambda$ is a surjective map of abelian groups such that $nu(a),nu (b) geq 0 implies nu(a+b) geq 0$. Note that $nu$ does necessarily respect the partial order of $Lambda$. We form the set $mathcal{B}$ of equivalence classes of elements in $mathcal{B}'$, where $(nu, Lambda) sim (nu', Lambda')$ when $nu$ factors through $nu'$ by an isomorphism of partially ordered abelian groups.
There is a $1$-to-$1$ correspondence between $mathcal{A}$ and $mathcal{B}$. We send a subring $R$ of $K$ to the abelian group $K^times / R^times$, with the smallest admissible partial order generated by declaring elements $r R^times$ to be non-negative, paried with the natural map $K^times rightarrow K^times /R^times$. We send a pair $(nu, Lambda)$ in $mathcal{B}$ to ${ r in K : nu(r) geq 0 }$.
To see the similarity, take a boolean algebra $A$ with filter $F$ and a field $K$ with subring $R$ inducing a pair $(nu, Lambda)$. To make the similarity more clear, I want to change the notation a bit for the field $K$: for $a, b in K$, write $a leq b$ when $nu(a) leq nu(b)$. Write $a wedge b$ for $a + b$. Write $a^c$ for $a^{-1}$ ($c$ for complement). Then we have
1) $a, b in R implies a wedge b in R forall a,b in K^times$, just as $a, b in F implies a wedge b in F forall a, b in A$.
2) $1 in R$, just as $1 in F$.
3) $a in R, a leq b implies b in R$, just as $a in F, a leq b implies b in F$.
4) $R$ is a valuation ring when $a in R$ or $a^c in R$ for all $a in K^times$, just as $F$ is an ultrafilter when $a in F$ or $a^c in F$ forall $a in A$.
Can anyone illuminate the similarity going on here? How is $K^times$ formally like a boolean algebra?
ultrafilters valuation-rings
ultrafilters valuation-rings
edited 4 hours ago
Dean Young
asked 6 hours ago
Dean YoungDean Young
583210
583210
$begingroup$
$mathcal{B}$ is not a set. You want to mod out by some equivalence relation.
$endgroup$
– YCor
5 hours ago
$begingroup$
Good point. I fixed it.
$endgroup$
– Dean Young
4 hours ago
add a comment |
$begingroup$
$mathcal{B}$ is not a set. You want to mod out by some equivalence relation.
$endgroup$
– YCor
5 hours ago
$begingroup$
Good point. I fixed it.
$endgroup$
– Dean Young
4 hours ago
$begingroup$
$mathcal{B}$ is not a set. You want to mod out by some equivalence relation.
$endgroup$
– YCor
5 hours ago
$begingroup$
$mathcal{B}$ is not a set. You want to mod out by some equivalence relation.
$endgroup$
– YCor
5 hours ago
$begingroup$
Good point. I fixed it.
$endgroup$
– Dean Young
4 hours ago
$begingroup$
Good point. I fixed it.
$endgroup$
– Dean Young
4 hours ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The similarity has nothing to do with boolean algebras, but with orders in general. Filters can be defined for every partial order: A subset $Phi$ of a poset $Lambda$ is a filter if
- $Phineqemptyset$
$forall a,binPhi exists cinPhi: cleq a wedge cleq b$.- $forall ain Phiforall binLambda: aleq b implies binPhi$
If $Lambda$ has a greatest element $infty$, then the first condition can be replaced by $inftyinPhi$. If $Lambda$ has meets, then the second condition can be replaced by $forall a,binPhi: awedge b in Phi$.
What you observe is simply that the order on $Lambda:=K^times / R^times$ is defined in such a way that $nu(R)$ is a filter in $Lambdasqcup{infty}$ (where we define $nu(0) := infty$ as usual), namely the filter of all elements which are greater or equal $0=nu(1)$.
In fact you can do this more generally find that $nu^{-1}(Phi)$ is an $R$-submodule of $K$ for every filter $PhisubseteqLambdasqcup{infty}$.
At least for some rings, say UFD rings $R$ and their quotient fields $K$, the reverse is also true and we get a bijection
$$begin{array}{rcl} {Lsubseteq K ;Rtext{-submodule}} & overset{cong}{leftrightarrow} & {Phi subseteq Lambdasqcup{infty} ;text{filter}} \
L &mapsto& nu(L) \
nu^{-1}(Phi) &leftarrow& Phi
end{array}$$
If the filter is also a submonoid of $(Lambda,+)$, then $nu^{-1}(Phi)$ is also multiplicatively closed, i.e. a $R$-algebra.
Now what a submonoid that is a filter must contain $0$ and therefore all larger elements, i.e. they contain all of $Lambda_{geq 0}$. They are also additively closed. In other words, they are a positive cone for an extension of the partial order on $Lambda$. The maximal submonoid-filters therefore correspond to maximal extensions of the partial order, i.e. total orders. And $K^times / R^times$ is totally ordered iff $R$ is a valuation ring.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "504"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f321848%2fvaluation-rings-and-ultrafilters%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The similarity has nothing to do with boolean algebras, but with orders in general. Filters can be defined for every partial order: A subset $Phi$ of a poset $Lambda$ is a filter if
- $Phineqemptyset$
$forall a,binPhi exists cinPhi: cleq a wedge cleq b$.- $forall ain Phiforall binLambda: aleq b implies binPhi$
If $Lambda$ has a greatest element $infty$, then the first condition can be replaced by $inftyinPhi$. If $Lambda$ has meets, then the second condition can be replaced by $forall a,binPhi: awedge b in Phi$.
What you observe is simply that the order on $Lambda:=K^times / R^times$ is defined in such a way that $nu(R)$ is a filter in $Lambdasqcup{infty}$ (where we define $nu(0) := infty$ as usual), namely the filter of all elements which are greater or equal $0=nu(1)$.
In fact you can do this more generally find that $nu^{-1}(Phi)$ is an $R$-submodule of $K$ for every filter $PhisubseteqLambdasqcup{infty}$.
At least for some rings, say UFD rings $R$ and their quotient fields $K$, the reverse is also true and we get a bijection
$$begin{array}{rcl} {Lsubseteq K ;Rtext{-submodule}} & overset{cong}{leftrightarrow} & {Phi subseteq Lambdasqcup{infty} ;text{filter}} \
L &mapsto& nu(L) \
nu^{-1}(Phi) &leftarrow& Phi
end{array}$$
If the filter is also a submonoid of $(Lambda,+)$, then $nu^{-1}(Phi)$ is also multiplicatively closed, i.e. a $R$-algebra.
Now what a submonoid that is a filter must contain $0$ and therefore all larger elements, i.e. they contain all of $Lambda_{geq 0}$. They are also additively closed. In other words, they are a positive cone for an extension of the partial order on $Lambda$. The maximal submonoid-filters therefore correspond to maximal extensions of the partial order, i.e. total orders. And $K^times / R^times$ is totally ordered iff $R$ is a valuation ring.
$endgroup$
add a comment |
$begingroup$
The similarity has nothing to do with boolean algebras, but with orders in general. Filters can be defined for every partial order: A subset $Phi$ of a poset $Lambda$ is a filter if
- $Phineqemptyset$
$forall a,binPhi exists cinPhi: cleq a wedge cleq b$.- $forall ain Phiforall binLambda: aleq b implies binPhi$
If $Lambda$ has a greatest element $infty$, then the first condition can be replaced by $inftyinPhi$. If $Lambda$ has meets, then the second condition can be replaced by $forall a,binPhi: awedge b in Phi$.
What you observe is simply that the order on $Lambda:=K^times / R^times$ is defined in such a way that $nu(R)$ is a filter in $Lambdasqcup{infty}$ (where we define $nu(0) := infty$ as usual), namely the filter of all elements which are greater or equal $0=nu(1)$.
In fact you can do this more generally find that $nu^{-1}(Phi)$ is an $R$-submodule of $K$ for every filter $PhisubseteqLambdasqcup{infty}$.
At least for some rings, say UFD rings $R$ and their quotient fields $K$, the reverse is also true and we get a bijection
$$begin{array}{rcl} {Lsubseteq K ;Rtext{-submodule}} & overset{cong}{leftrightarrow} & {Phi subseteq Lambdasqcup{infty} ;text{filter}} \
L &mapsto& nu(L) \
nu^{-1}(Phi) &leftarrow& Phi
end{array}$$
If the filter is also a submonoid of $(Lambda,+)$, then $nu^{-1}(Phi)$ is also multiplicatively closed, i.e. a $R$-algebra.
Now what a submonoid that is a filter must contain $0$ and therefore all larger elements, i.e. they contain all of $Lambda_{geq 0}$. They are also additively closed. In other words, they are a positive cone for an extension of the partial order on $Lambda$. The maximal submonoid-filters therefore correspond to maximal extensions of the partial order, i.e. total orders. And $K^times / R^times$ is totally ordered iff $R$ is a valuation ring.
$endgroup$
add a comment |
$begingroup$
The similarity has nothing to do with boolean algebras, but with orders in general. Filters can be defined for every partial order: A subset $Phi$ of a poset $Lambda$ is a filter if
- $Phineqemptyset$
$forall a,binPhi exists cinPhi: cleq a wedge cleq b$.- $forall ain Phiforall binLambda: aleq b implies binPhi$
If $Lambda$ has a greatest element $infty$, then the first condition can be replaced by $inftyinPhi$. If $Lambda$ has meets, then the second condition can be replaced by $forall a,binPhi: awedge b in Phi$.
What you observe is simply that the order on $Lambda:=K^times / R^times$ is defined in such a way that $nu(R)$ is a filter in $Lambdasqcup{infty}$ (where we define $nu(0) := infty$ as usual), namely the filter of all elements which are greater or equal $0=nu(1)$.
In fact you can do this more generally find that $nu^{-1}(Phi)$ is an $R$-submodule of $K$ for every filter $PhisubseteqLambdasqcup{infty}$.
At least for some rings, say UFD rings $R$ and their quotient fields $K$, the reverse is also true and we get a bijection
$$begin{array}{rcl} {Lsubseteq K ;Rtext{-submodule}} & overset{cong}{leftrightarrow} & {Phi subseteq Lambdasqcup{infty} ;text{filter}} \
L &mapsto& nu(L) \
nu^{-1}(Phi) &leftarrow& Phi
end{array}$$
If the filter is also a submonoid of $(Lambda,+)$, then $nu^{-1}(Phi)$ is also multiplicatively closed, i.e. a $R$-algebra.
Now what a submonoid that is a filter must contain $0$ and therefore all larger elements, i.e. they contain all of $Lambda_{geq 0}$. They are also additively closed. In other words, they are a positive cone for an extension of the partial order on $Lambda$. The maximal submonoid-filters therefore correspond to maximal extensions of the partial order, i.e. total orders. And $K^times / R^times$ is totally ordered iff $R$ is a valuation ring.
$endgroup$
The similarity has nothing to do with boolean algebras, but with orders in general. Filters can be defined for every partial order: A subset $Phi$ of a poset $Lambda$ is a filter if
- $Phineqemptyset$
$forall a,binPhi exists cinPhi: cleq a wedge cleq b$.- $forall ain Phiforall binLambda: aleq b implies binPhi$
If $Lambda$ has a greatest element $infty$, then the first condition can be replaced by $inftyinPhi$. If $Lambda$ has meets, then the second condition can be replaced by $forall a,binPhi: awedge b in Phi$.
What you observe is simply that the order on $Lambda:=K^times / R^times$ is defined in such a way that $nu(R)$ is a filter in $Lambdasqcup{infty}$ (where we define $nu(0) := infty$ as usual), namely the filter of all elements which are greater or equal $0=nu(1)$.
In fact you can do this more generally find that $nu^{-1}(Phi)$ is an $R$-submodule of $K$ for every filter $PhisubseteqLambdasqcup{infty}$.
At least for some rings, say UFD rings $R$ and their quotient fields $K$, the reverse is also true and we get a bijection
$$begin{array}{rcl} {Lsubseteq K ;Rtext{-submodule}} & overset{cong}{leftrightarrow} & {Phi subseteq Lambdasqcup{infty} ;text{filter}} \
L &mapsto& nu(L) \
nu^{-1}(Phi) &leftarrow& Phi
end{array}$$
If the filter is also a submonoid of $(Lambda,+)$, then $nu^{-1}(Phi)$ is also multiplicatively closed, i.e. a $R$-algebra.
Now what a submonoid that is a filter must contain $0$ and therefore all larger elements, i.e. they contain all of $Lambda_{geq 0}$. They are also additively closed. In other words, they are a positive cone for an extension of the partial order on $Lambda$. The maximal submonoid-filters therefore correspond to maximal extensions of the partial order, i.e. total orders. And $K^times / R^times$ is totally ordered iff $R$ is a valuation ring.
edited 59 mins ago
answered 3 hours ago
Johannes HahnJohannes Hahn
5,57822243
5,57822243
add a comment |
add a comment |
Thanks for contributing an answer to MathOverflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f321848%2fvaluation-rings-and-ultrafilters%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
$mathcal{B}$ is not a set. You want to mod out by some equivalence relation.
$endgroup$
– YCor
5 hours ago
$begingroup$
Good point. I fixed it.
$endgroup$
– Dean Young
4 hours ago