About the infimum of two operators in vector lattices
$begingroup$
A real vector space $E$ is said to be an ordered vector space whenever it is equipped with an order relation $ge$ that is compatible with the algebraic structure of $E$.
A Riesz space is an ordered vector space $E$ which for each pair of vectors $x,y in E$, the supremum and the infimum of the st ${x,y}$ both exist in $E$.
Following the classical notation, we shall write
$$x vee y := sup {x,y} quad , quad x wedge y := inf{x ,y } .$$
An example of Riesz space is function space $E$ of real valued functions on a set $Omega$ such that for each pair $f , g in E$ the functions $$[f vee g](w) := max {f(w),g(w)} quad, quad [f wedge g](w) := min{f(w) ,g(w) } $$ both belong to $E$.
A Riesz space is caled Dedekind complete whenever every nonempty bounded above subset has a supremum .
Here $mathcal{L}_b(E,F)$ is the vector space of all order bounded operators from $E$ to $F$.
By "postive operator" book of "Charalambos D.Aliprantis and Owen Burkinshow" we have the following theorem
Theorem(F.Riesz-Kantorovich)
. If $E$ and $F$ are Riesz spaces with $F$ Dedekind complete, thenthe ordered vector space $mathcal{L}_b(E,F)$ is a Dedekind complete Riesz space with the lattice operations $$|T| = sup{|Ty| : |y|le x },$$ $$ [S vee T](x)=sup{S(y)+T(z) : y,z in E^+ , y+z=x} ,$$ $$ [S wedge T](x)=sup{S(y)+T(z) : y,z in E^+ , y+z=x}$$ for all $S,T in mathcal{L}_b(E,F)$ and $x in E^+$.
I want to prove the following exercise
Let $E=C[0,1], F=mathbb{R}$, and let $S,T : E to F$ be defined by $S(f)=f(0)$ and $T(f)=f(1)$. Then $S wedge T = 0$.
I think since $F= mathbb{R}$ we have $(S wedge T)(f) = S(f) wedge T(f) = f(0) wedge f(1) $. Then can I conclude that $(S wedge T)(f) = f(0) wedge f(1) = f(0) = 0 $ ?
vector-lattices
$endgroup$
add a comment |
$begingroup$
A real vector space $E$ is said to be an ordered vector space whenever it is equipped with an order relation $ge$ that is compatible with the algebraic structure of $E$.
A Riesz space is an ordered vector space $E$ which for each pair of vectors $x,y in E$, the supremum and the infimum of the st ${x,y}$ both exist in $E$.
Following the classical notation, we shall write
$$x vee y := sup {x,y} quad , quad x wedge y := inf{x ,y } .$$
An example of Riesz space is function space $E$ of real valued functions on a set $Omega$ such that for each pair $f , g in E$ the functions $$[f vee g](w) := max {f(w),g(w)} quad, quad [f wedge g](w) := min{f(w) ,g(w) } $$ both belong to $E$.
A Riesz space is caled Dedekind complete whenever every nonempty bounded above subset has a supremum .
Here $mathcal{L}_b(E,F)$ is the vector space of all order bounded operators from $E$ to $F$.
By "postive operator" book of "Charalambos D.Aliprantis and Owen Burkinshow" we have the following theorem
Theorem(F.Riesz-Kantorovich)
. If $E$ and $F$ are Riesz spaces with $F$ Dedekind complete, thenthe ordered vector space $mathcal{L}_b(E,F)$ is a Dedekind complete Riesz space with the lattice operations $$|T| = sup{|Ty| : |y|le x },$$ $$ [S vee T](x)=sup{S(y)+T(z) : y,z in E^+ , y+z=x} ,$$ $$ [S wedge T](x)=sup{S(y)+T(z) : y,z in E^+ , y+z=x}$$ for all $S,T in mathcal{L}_b(E,F)$ and $x in E^+$.
I want to prove the following exercise
Let $E=C[0,1], F=mathbb{R}$, and let $S,T : E to F$ be defined by $S(f)=f(0)$ and $T(f)=f(1)$. Then $S wedge T = 0$.
I think since $F= mathbb{R}$ we have $(S wedge T)(f) = S(f) wedge T(f) = f(0) wedge f(1) $. Then can I conclude that $(S wedge T)(f) = f(0) wedge f(1) = f(0) = 0 $ ?
vector-lattices
$endgroup$
add a comment |
$begingroup$
A real vector space $E$ is said to be an ordered vector space whenever it is equipped with an order relation $ge$ that is compatible with the algebraic structure of $E$.
A Riesz space is an ordered vector space $E$ which for each pair of vectors $x,y in E$, the supremum and the infimum of the st ${x,y}$ both exist in $E$.
Following the classical notation, we shall write
$$x vee y := sup {x,y} quad , quad x wedge y := inf{x ,y } .$$
An example of Riesz space is function space $E$ of real valued functions on a set $Omega$ such that for each pair $f , g in E$ the functions $$[f vee g](w) := max {f(w),g(w)} quad, quad [f wedge g](w) := min{f(w) ,g(w) } $$ both belong to $E$.
A Riesz space is caled Dedekind complete whenever every nonempty bounded above subset has a supremum .
Here $mathcal{L}_b(E,F)$ is the vector space of all order bounded operators from $E$ to $F$.
By "postive operator" book of "Charalambos D.Aliprantis and Owen Burkinshow" we have the following theorem
Theorem(F.Riesz-Kantorovich)
. If $E$ and $F$ are Riesz spaces with $F$ Dedekind complete, thenthe ordered vector space $mathcal{L}_b(E,F)$ is a Dedekind complete Riesz space with the lattice operations $$|T| = sup{|Ty| : |y|le x },$$ $$ [S vee T](x)=sup{S(y)+T(z) : y,z in E^+ , y+z=x} ,$$ $$ [S wedge T](x)=sup{S(y)+T(z) : y,z in E^+ , y+z=x}$$ for all $S,T in mathcal{L}_b(E,F)$ and $x in E^+$.
I want to prove the following exercise
Let $E=C[0,1], F=mathbb{R}$, and let $S,T : E to F$ be defined by $S(f)=f(0)$ and $T(f)=f(1)$. Then $S wedge T = 0$.
I think since $F= mathbb{R}$ we have $(S wedge T)(f) = S(f) wedge T(f) = f(0) wedge f(1) $. Then can I conclude that $(S wedge T)(f) = f(0) wedge f(1) = f(0) = 0 $ ?
vector-lattices
$endgroup$
A real vector space $E$ is said to be an ordered vector space whenever it is equipped with an order relation $ge$ that is compatible with the algebraic structure of $E$.
A Riesz space is an ordered vector space $E$ which for each pair of vectors $x,y in E$, the supremum and the infimum of the st ${x,y}$ both exist in $E$.
Following the classical notation, we shall write
$$x vee y := sup {x,y} quad , quad x wedge y := inf{x ,y } .$$
An example of Riesz space is function space $E$ of real valued functions on a set $Omega$ such that for each pair $f , g in E$ the functions $$[f vee g](w) := max {f(w),g(w)} quad, quad [f wedge g](w) := min{f(w) ,g(w) } $$ both belong to $E$.
A Riesz space is caled Dedekind complete whenever every nonempty bounded above subset has a supremum .
Here $mathcal{L}_b(E,F)$ is the vector space of all order bounded operators from $E$ to $F$.
By "postive operator" book of "Charalambos D.Aliprantis and Owen Burkinshow" we have the following theorem
Theorem(F.Riesz-Kantorovich)
. If $E$ and $F$ are Riesz spaces with $F$ Dedekind complete, thenthe ordered vector space $mathcal{L}_b(E,F)$ is a Dedekind complete Riesz space with the lattice operations $$|T| = sup{|Ty| : |y|le x },$$ $$ [S vee T](x)=sup{S(y)+T(z) : y,z in E^+ , y+z=x} ,$$ $$ [S wedge T](x)=sup{S(y)+T(z) : y,z in E^+ , y+z=x}$$ for all $S,T in mathcal{L}_b(E,F)$ and $x in E^+$.
I want to prove the following exercise
Let $E=C[0,1], F=mathbb{R}$, and let $S,T : E to F$ be defined by $S(f)=f(0)$ and $T(f)=f(1)$. Then $S wedge T = 0$.
I think since $F= mathbb{R}$ we have $(S wedge T)(f) = S(f) wedge T(f) = f(0) wedge f(1) $. Then can I conclude that $(S wedge T)(f) = f(0) wedge f(1) = f(0) = 0 $ ?
vector-lattices
vector-lattices
asked Dec 30 '18 at 21:05
I-love-mathI-love-math
666
666
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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%2fmath.stackexchange.com%2fquestions%2f3057201%2fabout-the-infimum-of-two-operators-in-vector-lattices%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- 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%2fmath.stackexchange.com%2fquestions%2f3057201%2fabout-the-infimum-of-two-operators-in-vector-lattices%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