Stochastic Fubini (Da Prato & Zabcyzk)
I've been studying Da Prato & Zabcyzk's text on SPDE, and there's a part of their proof of the stochastic Fubini theorem that I don't quite get. The setting is that $Phi: (Omega_Ttimes E, mathcal{P}_T times mathcal{B}(E))to (L_2^0, mathcal{B}(L_2^0))$, such that
$$
int_E |Phi(cdot, cdot,x)|_Tmu(dx)< infty
$$
where $mu$ is a finite positive measure and the $T$ norm corresponds to
$$
|Phi|_T^2 = mathbb{E}int_0^T|Phi(s)|_{L_2^0}^2 ds
$$
The authors have an intermediate result, Prop 4.34 in the 2014 edition, that $Phi$ can be approximated by a sequence $Phi_n$ of analogously measurable processes that can be written as simple processes and converge in the sense of
$$
int_E |Phi(cdot, cdot,x)-Phi_n(cdot, cdot,x)|_Tmu(dx) to 0.
$$
I find myself unsure of the proof of this intermediate result in that the authors first assert the existence of a sequence $Psi_n$ (not neccessarily simple) which are bounded and converge in the above sense. It is clear from the above assumption that $mu$-a.e., there are processes $Psi_n(cdot,cdot,x)$ which converge in the $T$ norm. This follows from a Prop 4.22 of the text, and it is clear that they can be taken such that
$$
|Psi_n(cdot,cdot,x)|_T leq 2|Phi(cdot,cdot,x)|_T.
$$
How can I infer that this sequence ${Psi_n}$ is then bounded as a mapping over all three arguments $(x,t,omega)$?
functional-analysis measure-theory stochastic-processes stochastic-pde
add a comment |
I've been studying Da Prato & Zabcyzk's text on SPDE, and there's a part of their proof of the stochastic Fubini theorem that I don't quite get. The setting is that $Phi: (Omega_Ttimes E, mathcal{P}_T times mathcal{B}(E))to (L_2^0, mathcal{B}(L_2^0))$, such that
$$
int_E |Phi(cdot, cdot,x)|_Tmu(dx)< infty
$$
where $mu$ is a finite positive measure and the $T$ norm corresponds to
$$
|Phi|_T^2 = mathbb{E}int_0^T|Phi(s)|_{L_2^0}^2 ds
$$
The authors have an intermediate result, Prop 4.34 in the 2014 edition, that $Phi$ can be approximated by a sequence $Phi_n$ of analogously measurable processes that can be written as simple processes and converge in the sense of
$$
int_E |Phi(cdot, cdot,x)-Phi_n(cdot, cdot,x)|_Tmu(dx) to 0.
$$
I find myself unsure of the proof of this intermediate result in that the authors first assert the existence of a sequence $Psi_n$ (not neccessarily simple) which are bounded and converge in the above sense. It is clear from the above assumption that $mu$-a.e., there are processes $Psi_n(cdot,cdot,x)$ which converge in the $T$ norm. This follows from a Prop 4.22 of the text, and it is clear that they can be taken such that
$$
|Psi_n(cdot,cdot,x)|_T leq 2|Phi(cdot,cdot,x)|_T.
$$
How can I infer that this sequence ${Psi_n}$ is then bounded as a mapping over all three arguments $(x,t,omega)$?
functional-analysis measure-theory stochastic-processes stochastic-pde
add a comment |
I've been studying Da Prato & Zabcyzk's text on SPDE, and there's a part of their proof of the stochastic Fubini theorem that I don't quite get. The setting is that $Phi: (Omega_Ttimes E, mathcal{P}_T times mathcal{B}(E))to (L_2^0, mathcal{B}(L_2^0))$, such that
$$
int_E |Phi(cdot, cdot,x)|_Tmu(dx)< infty
$$
where $mu$ is a finite positive measure and the $T$ norm corresponds to
$$
|Phi|_T^2 = mathbb{E}int_0^T|Phi(s)|_{L_2^0}^2 ds
$$
The authors have an intermediate result, Prop 4.34 in the 2014 edition, that $Phi$ can be approximated by a sequence $Phi_n$ of analogously measurable processes that can be written as simple processes and converge in the sense of
$$
int_E |Phi(cdot, cdot,x)-Phi_n(cdot, cdot,x)|_Tmu(dx) to 0.
$$
I find myself unsure of the proof of this intermediate result in that the authors first assert the existence of a sequence $Psi_n$ (not neccessarily simple) which are bounded and converge in the above sense. It is clear from the above assumption that $mu$-a.e., there are processes $Psi_n(cdot,cdot,x)$ which converge in the $T$ norm. This follows from a Prop 4.22 of the text, and it is clear that they can be taken such that
$$
|Psi_n(cdot,cdot,x)|_T leq 2|Phi(cdot,cdot,x)|_T.
$$
How can I infer that this sequence ${Psi_n}$ is then bounded as a mapping over all three arguments $(x,t,omega)$?
functional-analysis measure-theory stochastic-processes stochastic-pde
I've been studying Da Prato & Zabcyzk's text on SPDE, and there's a part of their proof of the stochastic Fubini theorem that I don't quite get. The setting is that $Phi: (Omega_Ttimes E, mathcal{P}_T times mathcal{B}(E))to (L_2^0, mathcal{B}(L_2^0))$, such that
$$
int_E |Phi(cdot, cdot,x)|_Tmu(dx)< infty
$$
where $mu$ is a finite positive measure and the $T$ norm corresponds to
$$
|Phi|_T^2 = mathbb{E}int_0^T|Phi(s)|_{L_2^0}^2 ds
$$
The authors have an intermediate result, Prop 4.34 in the 2014 edition, that $Phi$ can be approximated by a sequence $Phi_n$ of analogously measurable processes that can be written as simple processes and converge in the sense of
$$
int_E |Phi(cdot, cdot,x)-Phi_n(cdot, cdot,x)|_Tmu(dx) to 0.
$$
I find myself unsure of the proof of this intermediate result in that the authors first assert the existence of a sequence $Psi_n$ (not neccessarily simple) which are bounded and converge in the above sense. It is clear from the above assumption that $mu$-a.e., there are processes $Psi_n(cdot,cdot,x)$ which converge in the $T$ norm. This follows from a Prop 4.22 of the text, and it is clear that they can be taken such that
$$
|Psi_n(cdot,cdot,x)|_T leq 2|Phi(cdot,cdot,x)|_T.
$$
How can I infer that this sequence ${Psi_n}$ is then bounded as a mapping over all three arguments $(x,t,omega)$?
functional-analysis measure-theory stochastic-processes stochastic-pde
functional-analysis measure-theory stochastic-processes stochastic-pde
asked Dec 2 at 2:39
user2379888
23719
23719
add a comment |
add a comment |
active
oldest
votes
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: "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%2f3022151%2fstochastic-fubini-da-prato-zabcyzk%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3022151%2fstochastic-fubini-da-prato-zabcyzk%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