Estimating Lebesgue measure via discrete points











up vote
3
down vote

favorite
1












I am faced with the following problem, I need to estimate the Lebesgue measure of the level set ${f>alpha}$ within a program. The function $f$ is approximated by a vector of arguments $(t_i)_{i=1}^n$ and a vector of corresponding values $(y_i)_{i=1}^n$. The only solution that comes to mind is to approximate the measure by $hat{lambda}=frac{1}{n}|{t_i:y_i>alpha}|$. This raised an interesting question for me. Given a measurable set $Asubset [0,1]$ and an equidistant partition $t_i=frac{i}{n}$ with $i=0,ldots,n$, I define the estimator $hatlambda_n(A):=frac{1}{n}|{t_i:t_iin A}|$. What conditions must I impose on $A$ such that
$$
lim_{ntoinfty}hatlambda_n(A)=lambda(A),, ?
$$



Also, if anyone has a suggestion on how to better approximate the measure of a level set given a discrete approximation, I would be very glad to hear from you. Thank you in advance










share|cite|improve this question






















  • I don't think you can do anything for arbitrary sets. You need to consider level sets of functions with some regularity. Otherwise, you will always run into sets such as $mathbb Qcap [0, 1]$, which has measure $0$, but is detected as a set of measure $1$ by your discrete estimator.
    – Giuseppe Negro
    Nov 15 at 15:34










  • Would a condition be that $A$ is a union of open intervals?
    – Elsa
    Nov 15 at 16:31










  • It would suffice to assume that the topological boundary of $A$ has measure $0$. As to the approximation of the measure of the level set, you may do some interpolation first and then compute or estimate the measure of the level set of the result. How to interpolate depends on what kind of function you expect $f$ to be.
    – fedja
    Nov 19 at 16:41















up vote
3
down vote

favorite
1












I am faced with the following problem, I need to estimate the Lebesgue measure of the level set ${f>alpha}$ within a program. The function $f$ is approximated by a vector of arguments $(t_i)_{i=1}^n$ and a vector of corresponding values $(y_i)_{i=1}^n$. The only solution that comes to mind is to approximate the measure by $hat{lambda}=frac{1}{n}|{t_i:y_i>alpha}|$. This raised an interesting question for me. Given a measurable set $Asubset [0,1]$ and an equidistant partition $t_i=frac{i}{n}$ with $i=0,ldots,n$, I define the estimator $hatlambda_n(A):=frac{1}{n}|{t_i:t_iin A}|$. What conditions must I impose on $A$ such that
$$
lim_{ntoinfty}hatlambda_n(A)=lambda(A),, ?
$$



Also, if anyone has a suggestion on how to better approximate the measure of a level set given a discrete approximation, I would be very glad to hear from you. Thank you in advance










share|cite|improve this question






















  • I don't think you can do anything for arbitrary sets. You need to consider level sets of functions with some regularity. Otherwise, you will always run into sets such as $mathbb Qcap [0, 1]$, which has measure $0$, but is detected as a set of measure $1$ by your discrete estimator.
    – Giuseppe Negro
    Nov 15 at 15:34










  • Would a condition be that $A$ is a union of open intervals?
    – Elsa
    Nov 15 at 16:31










  • It would suffice to assume that the topological boundary of $A$ has measure $0$. As to the approximation of the measure of the level set, you may do some interpolation first and then compute or estimate the measure of the level set of the result. How to interpolate depends on what kind of function you expect $f$ to be.
    – fedja
    Nov 19 at 16:41













up vote
3
down vote

favorite
1









up vote
3
down vote

favorite
1






1





I am faced with the following problem, I need to estimate the Lebesgue measure of the level set ${f>alpha}$ within a program. The function $f$ is approximated by a vector of arguments $(t_i)_{i=1}^n$ and a vector of corresponding values $(y_i)_{i=1}^n$. The only solution that comes to mind is to approximate the measure by $hat{lambda}=frac{1}{n}|{t_i:y_i>alpha}|$. This raised an interesting question for me. Given a measurable set $Asubset [0,1]$ and an equidistant partition $t_i=frac{i}{n}$ with $i=0,ldots,n$, I define the estimator $hatlambda_n(A):=frac{1}{n}|{t_i:t_iin A}|$. What conditions must I impose on $A$ such that
$$
lim_{ntoinfty}hatlambda_n(A)=lambda(A),, ?
$$



Also, if anyone has a suggestion on how to better approximate the measure of a level set given a discrete approximation, I would be very glad to hear from you. Thank you in advance










share|cite|improve this question













I am faced with the following problem, I need to estimate the Lebesgue measure of the level set ${f>alpha}$ within a program. The function $f$ is approximated by a vector of arguments $(t_i)_{i=1}^n$ and a vector of corresponding values $(y_i)_{i=1}^n$. The only solution that comes to mind is to approximate the measure by $hat{lambda}=frac{1}{n}|{t_i:y_i>alpha}|$. This raised an interesting question for me. Given a measurable set $Asubset [0,1]$ and an equidistant partition $t_i=frac{i}{n}$ with $i=0,ldots,n$, I define the estimator $hatlambda_n(A):=frac{1}{n}|{t_i:t_iin A}|$. What conditions must I impose on $A$ such that
$$
lim_{ntoinfty}hatlambda_n(A)=lambda(A),, ?
$$



Also, if anyone has a suggestion on how to better approximate the measure of a level set given a discrete approximation, I would be very glad to hear from you. Thank you in advance







measure-theory lebesgue-measure programming






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 8 at 12:07









Nicolas Bourbaki

7511612




7511612












  • I don't think you can do anything for arbitrary sets. You need to consider level sets of functions with some regularity. Otherwise, you will always run into sets such as $mathbb Qcap [0, 1]$, which has measure $0$, but is detected as a set of measure $1$ by your discrete estimator.
    – Giuseppe Negro
    Nov 15 at 15:34










  • Would a condition be that $A$ is a union of open intervals?
    – Elsa
    Nov 15 at 16:31










  • It would suffice to assume that the topological boundary of $A$ has measure $0$. As to the approximation of the measure of the level set, you may do some interpolation first and then compute or estimate the measure of the level set of the result. How to interpolate depends on what kind of function you expect $f$ to be.
    – fedja
    Nov 19 at 16:41


















  • I don't think you can do anything for arbitrary sets. You need to consider level sets of functions with some regularity. Otherwise, you will always run into sets such as $mathbb Qcap [0, 1]$, which has measure $0$, but is detected as a set of measure $1$ by your discrete estimator.
    – Giuseppe Negro
    Nov 15 at 15:34










  • Would a condition be that $A$ is a union of open intervals?
    – Elsa
    Nov 15 at 16:31










  • It would suffice to assume that the topological boundary of $A$ has measure $0$. As to the approximation of the measure of the level set, you may do some interpolation first and then compute or estimate the measure of the level set of the result. How to interpolate depends on what kind of function you expect $f$ to be.
    – fedja
    Nov 19 at 16:41
















I don't think you can do anything for arbitrary sets. You need to consider level sets of functions with some regularity. Otherwise, you will always run into sets such as $mathbb Qcap [0, 1]$, which has measure $0$, but is detected as a set of measure $1$ by your discrete estimator.
– Giuseppe Negro
Nov 15 at 15:34




I don't think you can do anything for arbitrary sets. You need to consider level sets of functions with some regularity. Otherwise, you will always run into sets such as $mathbb Qcap [0, 1]$, which has measure $0$, but is detected as a set of measure $1$ by your discrete estimator.
– Giuseppe Negro
Nov 15 at 15:34












Would a condition be that $A$ is a union of open intervals?
– Elsa
Nov 15 at 16:31




Would a condition be that $A$ is a union of open intervals?
– Elsa
Nov 15 at 16:31












It would suffice to assume that the topological boundary of $A$ has measure $0$. As to the approximation of the measure of the level set, you may do some interpolation first and then compute or estimate the measure of the level set of the result. How to interpolate depends on what kind of function you expect $f$ to be.
– fedja
Nov 19 at 16:41




It would suffice to assume that the topological boundary of $A$ has measure $0$. As to the approximation of the measure of the level set, you may do some interpolation first and then compute or estimate the measure of the level set of the result. How to interpolate depends on what kind of function you expect $f$ to be.
– fedja
Nov 19 at 16:41















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',
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
});


}
});














 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2989882%2festimating-lebesgue-measure-via-discrete-points%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2989882%2festimating-lebesgue-measure-via-discrete-points%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Probability when a professor distributes a quiz and homework assignment to a class of n students.

Aardman Animations

Are they similar matrix