Example of algebra which is not σ-algebra.
$begingroup$
I have troubles with constructing of an example of algebra of sets which is not σ-algebra. Could you please help me with this?
measure-theory
$endgroup$
add a comment |
$begingroup$
I have troubles with constructing of an example of algebra of sets which is not σ-algebra. Could you please help me with this?
measure-theory
$endgroup$
add a comment |
$begingroup$
I have troubles with constructing of an example of algebra of sets which is not σ-algebra. Could you please help me with this?
measure-theory
$endgroup$
I have troubles with constructing of an example of algebra of sets which is not σ-algebra. Could you please help me with this?
measure-theory
measure-theory
asked Nov 9 '12 at 17:18
Mihran HovsepyanMihran Hovsepyan
224127
224127
add a comment |
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
Let $X$ be an infinite set, and $mathcal A$ be the collection of all subsets of $X$ which are finite or have finite complement. Then $mathcal A$ is an algebra of sets which is not a $sigma$-algebra.
$endgroup$
$begingroup$
But proving this is not sigma algebra would require that every infinite set has a countable subset(as much I know proof) but which require Axiom of Countable choice(CC). Or is there proof without using CC
$endgroup$
– Sushil
Oct 5 '14 at 15:26
$begingroup$
Let $X$ be the set of natural numbers. Let $A_n$ be the set of even numbers up to and including $2n$. Then the countable union of the $A_n$ is the set of all even numbers, which is infinite and has an infinite complement: the set of all odd numbers. Cool :)
$endgroup$
– Michael
Oct 15 '15 at 15:39
add a comment |
$begingroup$
Let $L$ be the collection of all finite disjoint unions of all intervals of the form:
$(−infty, a], (a, b], (b, infty), emptyset, mathbf{R}$.
Then $L$ is an algebra over $mathbf{R}$, but not a σ-algebra because
union of sets $left{(0,frac{i-1}{i}]right}$ for all $i ge 1 = (0, 1) notin L $.
$endgroup$
add a comment |
$begingroup$
For example, let $mathbb{R}^{[0,+infty)}$ denote the set of all the real value functions on $[0,+infty)$. Consider the so called n-dimensional cylinder set, defined as
begin{equation*}
C_{t_1,t_2,ldots, t_n,B}={fin mathbb{R}^{[0,+infty)}:(f(t_1),f(t_2),ldots, f(t_n))in B},
end{equation*}
where $Binmathcal{B}^d$ is a Borel set and $Csubseteq mathbb{R}^{[0,+infty)}$. Then the set $mathcal{C}'$ of all the cylinders $C$, that is,
begin{equation*}
mathcal{C}'={C_{t_1,t_2,ldots t_n,B}, forall ngeq 1, forall (t,t_1,t_2,ldots,t_n), forall Bin mathcal{B}^n }
end{equation*}
is an algebra but not $sigma$ - algebra.
Anyway it is well known that there exists the smallest $sigma$ - algebra containing $mathcal{C}'$, but this is another story.
$endgroup$
add a comment |
$begingroup$
As another example which supports the first answer above, let $Omega $ $=$ $(0,1]$, and let $mathcal{F}$
contain $varnothing $, all $(a,b]$ with $a,b$ $in $ $mathbb{Q}$, $a,b in [0,1]$ $a$ $<$ $b$, and all finite unions of $(a,b]$. Let $[z]$ round $z$ to the nearest integer. Then $mathcal{F}$ is a
field by straightforward verification. It is not a $sigma $-field: let $A_{n}=(a_{n},1]$ with $a_{n}$ $=$ $%
10^{n}/[10^{n}pi ]$, hence $A_{n}$ $in $ $mathcal{F}$ but $cup
_{n=1}^{infty }A_{n}$ $=$ $(pi ,1]$ $notin $ $mathcal{F}$.
$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: "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%2f233702%2fexample-of-algebra-which-is-not-%25cf%2583-algebra%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let $X$ be an infinite set, and $mathcal A$ be the collection of all subsets of $X$ which are finite or have finite complement. Then $mathcal A$ is an algebra of sets which is not a $sigma$-algebra.
$endgroup$
$begingroup$
But proving this is not sigma algebra would require that every infinite set has a countable subset(as much I know proof) but which require Axiom of Countable choice(CC). Or is there proof without using CC
$endgroup$
– Sushil
Oct 5 '14 at 15:26
$begingroup$
Let $X$ be the set of natural numbers. Let $A_n$ be the set of even numbers up to and including $2n$. Then the countable union of the $A_n$ is the set of all even numbers, which is infinite and has an infinite complement: the set of all odd numbers. Cool :)
$endgroup$
– Michael
Oct 15 '15 at 15:39
add a comment |
$begingroup$
Let $X$ be an infinite set, and $mathcal A$ be the collection of all subsets of $X$ which are finite or have finite complement. Then $mathcal A$ is an algebra of sets which is not a $sigma$-algebra.
$endgroup$
$begingroup$
But proving this is not sigma algebra would require that every infinite set has a countable subset(as much I know proof) but which require Axiom of Countable choice(CC). Or is there proof without using CC
$endgroup$
– Sushil
Oct 5 '14 at 15:26
$begingroup$
Let $X$ be the set of natural numbers. Let $A_n$ be the set of even numbers up to and including $2n$. Then the countable union of the $A_n$ is the set of all even numbers, which is infinite and has an infinite complement: the set of all odd numbers. Cool :)
$endgroup$
– Michael
Oct 15 '15 at 15:39
add a comment |
$begingroup$
Let $X$ be an infinite set, and $mathcal A$ be the collection of all subsets of $X$ which are finite or have finite complement. Then $mathcal A$ is an algebra of sets which is not a $sigma$-algebra.
$endgroup$
Let $X$ be an infinite set, and $mathcal A$ be the collection of all subsets of $X$ which are finite or have finite complement. Then $mathcal A$ is an algebra of sets which is not a $sigma$-algebra.
answered Nov 9 '12 at 17:33
AndrewAndrew
9,28311931
9,28311931
$begingroup$
But proving this is not sigma algebra would require that every infinite set has a countable subset(as much I know proof) but which require Axiom of Countable choice(CC). Or is there proof without using CC
$endgroup$
– Sushil
Oct 5 '14 at 15:26
$begingroup$
Let $X$ be the set of natural numbers. Let $A_n$ be the set of even numbers up to and including $2n$. Then the countable union of the $A_n$ is the set of all even numbers, which is infinite and has an infinite complement: the set of all odd numbers. Cool :)
$endgroup$
– Michael
Oct 15 '15 at 15:39
add a comment |
$begingroup$
But proving this is not sigma algebra would require that every infinite set has a countable subset(as much I know proof) but which require Axiom of Countable choice(CC). Or is there proof without using CC
$endgroup$
– Sushil
Oct 5 '14 at 15:26
$begingroup$
Let $X$ be the set of natural numbers. Let $A_n$ be the set of even numbers up to and including $2n$. Then the countable union of the $A_n$ is the set of all even numbers, which is infinite and has an infinite complement: the set of all odd numbers. Cool :)
$endgroup$
– Michael
Oct 15 '15 at 15:39
$begingroup$
But proving this is not sigma algebra would require that every infinite set has a countable subset(as much I know proof) but which require Axiom of Countable choice(CC). Or is there proof without using CC
$endgroup$
– Sushil
Oct 5 '14 at 15:26
$begingroup$
But proving this is not sigma algebra would require that every infinite set has a countable subset(as much I know proof) but which require Axiom of Countable choice(CC). Or is there proof without using CC
$endgroup$
– Sushil
Oct 5 '14 at 15:26
$begingroup$
Let $X$ be the set of natural numbers. Let $A_n$ be the set of even numbers up to and including $2n$. Then the countable union of the $A_n$ is the set of all even numbers, which is infinite and has an infinite complement: the set of all odd numbers. Cool :)
$endgroup$
– Michael
Oct 15 '15 at 15:39
$begingroup$
Let $X$ be the set of natural numbers. Let $A_n$ be the set of even numbers up to and including $2n$. Then the countable union of the $A_n$ is the set of all even numbers, which is infinite and has an infinite complement: the set of all odd numbers. Cool :)
$endgroup$
– Michael
Oct 15 '15 at 15:39
add a comment |
$begingroup$
Let $L$ be the collection of all finite disjoint unions of all intervals of the form:
$(−infty, a], (a, b], (b, infty), emptyset, mathbf{R}$.
Then $L$ is an algebra over $mathbf{R}$, but not a σ-algebra because
union of sets $left{(0,frac{i-1}{i}]right}$ for all $i ge 1 = (0, 1) notin L $.
$endgroup$
add a comment |
$begingroup$
Let $L$ be the collection of all finite disjoint unions of all intervals of the form:
$(−infty, a], (a, b], (b, infty), emptyset, mathbf{R}$.
Then $L$ is an algebra over $mathbf{R}$, but not a σ-algebra because
union of sets $left{(0,frac{i-1}{i}]right}$ for all $i ge 1 = (0, 1) notin L $.
$endgroup$
add a comment |
$begingroup$
Let $L$ be the collection of all finite disjoint unions of all intervals of the form:
$(−infty, a], (a, b], (b, infty), emptyset, mathbf{R}$.
Then $L$ is an algebra over $mathbf{R}$, but not a σ-algebra because
union of sets $left{(0,frac{i-1}{i}]right}$ for all $i ge 1 = (0, 1) notin L $.
$endgroup$
Let $L$ be the collection of all finite disjoint unions of all intervals of the form:
$(−infty, a], (a, b], (b, infty), emptyset, mathbf{R}$.
Then $L$ is an algebra over $mathbf{R}$, but not a σ-algebra because
union of sets $left{(0,frac{i-1}{i}]right}$ for all $i ge 1 = (0, 1) notin L $.
edited Jan 20 at 14:48
pointguard0
1,50211021
1,50211021
answered Oct 5 '14 at 15:23
SushilSushil
1,035927
1,035927
add a comment |
add a comment |
$begingroup$
For example, let $mathbb{R}^{[0,+infty)}$ denote the set of all the real value functions on $[0,+infty)$. Consider the so called n-dimensional cylinder set, defined as
begin{equation*}
C_{t_1,t_2,ldots, t_n,B}={fin mathbb{R}^{[0,+infty)}:(f(t_1),f(t_2),ldots, f(t_n))in B},
end{equation*}
where $Binmathcal{B}^d$ is a Borel set and $Csubseteq mathbb{R}^{[0,+infty)}$. Then the set $mathcal{C}'$ of all the cylinders $C$, that is,
begin{equation*}
mathcal{C}'={C_{t_1,t_2,ldots t_n,B}, forall ngeq 1, forall (t,t_1,t_2,ldots,t_n), forall Bin mathcal{B}^n }
end{equation*}
is an algebra but not $sigma$ - algebra.
Anyway it is well known that there exists the smallest $sigma$ - algebra containing $mathcal{C}'$, but this is another story.
$endgroup$
add a comment |
$begingroup$
For example, let $mathbb{R}^{[0,+infty)}$ denote the set of all the real value functions on $[0,+infty)$. Consider the so called n-dimensional cylinder set, defined as
begin{equation*}
C_{t_1,t_2,ldots, t_n,B}={fin mathbb{R}^{[0,+infty)}:(f(t_1),f(t_2),ldots, f(t_n))in B},
end{equation*}
where $Binmathcal{B}^d$ is a Borel set and $Csubseteq mathbb{R}^{[0,+infty)}$. Then the set $mathcal{C}'$ of all the cylinders $C$, that is,
begin{equation*}
mathcal{C}'={C_{t_1,t_2,ldots t_n,B}, forall ngeq 1, forall (t,t_1,t_2,ldots,t_n), forall Bin mathcal{B}^n }
end{equation*}
is an algebra but not $sigma$ - algebra.
Anyway it is well known that there exists the smallest $sigma$ - algebra containing $mathcal{C}'$, but this is another story.
$endgroup$
add a comment |
$begingroup$
For example, let $mathbb{R}^{[0,+infty)}$ denote the set of all the real value functions on $[0,+infty)$. Consider the so called n-dimensional cylinder set, defined as
begin{equation*}
C_{t_1,t_2,ldots, t_n,B}={fin mathbb{R}^{[0,+infty)}:(f(t_1),f(t_2),ldots, f(t_n))in B},
end{equation*}
where $Binmathcal{B}^d$ is a Borel set and $Csubseteq mathbb{R}^{[0,+infty)}$. Then the set $mathcal{C}'$ of all the cylinders $C$, that is,
begin{equation*}
mathcal{C}'={C_{t_1,t_2,ldots t_n,B}, forall ngeq 1, forall (t,t_1,t_2,ldots,t_n), forall Bin mathcal{B}^n }
end{equation*}
is an algebra but not $sigma$ - algebra.
Anyway it is well known that there exists the smallest $sigma$ - algebra containing $mathcal{C}'$, but this is another story.
$endgroup$
For example, let $mathbb{R}^{[0,+infty)}$ denote the set of all the real value functions on $[0,+infty)$. Consider the so called n-dimensional cylinder set, defined as
begin{equation*}
C_{t_1,t_2,ldots, t_n,B}={fin mathbb{R}^{[0,+infty)}:(f(t_1),f(t_2),ldots, f(t_n))in B},
end{equation*}
where $Binmathcal{B}^d$ is a Borel set and $Csubseteq mathbb{R}^{[0,+infty)}$. Then the set $mathcal{C}'$ of all the cylinders $C$, that is,
begin{equation*}
mathcal{C}'={C_{t_1,t_2,ldots t_n,B}, forall ngeq 1, forall (t,t_1,t_2,ldots,t_n), forall Bin mathcal{B}^n }
end{equation*}
is an algebra but not $sigma$ - algebra.
Anyway it is well known that there exists the smallest $sigma$ - algebra containing $mathcal{C}'$, but this is another story.
answered Nov 15 '12 at 21:33
the_elderthe_elder
1048
1048
add a comment |
add a comment |
$begingroup$
As another example which supports the first answer above, let $Omega $ $=$ $(0,1]$, and let $mathcal{F}$
contain $varnothing $, all $(a,b]$ with $a,b$ $in $ $mathbb{Q}$, $a,b in [0,1]$ $a$ $<$ $b$, and all finite unions of $(a,b]$. Let $[z]$ round $z$ to the nearest integer. Then $mathcal{F}$ is a
field by straightforward verification. It is not a $sigma $-field: let $A_{n}=(a_{n},1]$ with $a_{n}$ $=$ $%
10^{n}/[10^{n}pi ]$, hence $A_{n}$ $in $ $mathcal{F}$ but $cup
_{n=1}^{infty }A_{n}$ $=$ $(pi ,1]$ $notin $ $mathcal{F}$.
$endgroup$
add a comment |
$begingroup$
As another example which supports the first answer above, let $Omega $ $=$ $(0,1]$, and let $mathcal{F}$
contain $varnothing $, all $(a,b]$ with $a,b$ $in $ $mathbb{Q}$, $a,b in [0,1]$ $a$ $<$ $b$, and all finite unions of $(a,b]$. Let $[z]$ round $z$ to the nearest integer. Then $mathcal{F}$ is a
field by straightforward verification. It is not a $sigma $-field: let $A_{n}=(a_{n},1]$ with $a_{n}$ $=$ $%
10^{n}/[10^{n}pi ]$, hence $A_{n}$ $in $ $mathcal{F}$ but $cup
_{n=1}^{infty }A_{n}$ $=$ $(pi ,1]$ $notin $ $mathcal{F}$.
$endgroup$
add a comment |
$begingroup$
As another example which supports the first answer above, let $Omega $ $=$ $(0,1]$, and let $mathcal{F}$
contain $varnothing $, all $(a,b]$ with $a,b$ $in $ $mathbb{Q}$, $a,b in [0,1]$ $a$ $<$ $b$, and all finite unions of $(a,b]$. Let $[z]$ round $z$ to the nearest integer. Then $mathcal{F}$ is a
field by straightforward verification. It is not a $sigma $-field: let $A_{n}=(a_{n},1]$ with $a_{n}$ $=$ $%
10^{n}/[10^{n}pi ]$, hence $A_{n}$ $in $ $mathcal{F}$ but $cup
_{n=1}^{infty }A_{n}$ $=$ $(pi ,1]$ $notin $ $mathcal{F}$.
$endgroup$
As another example which supports the first answer above, let $Omega $ $=$ $(0,1]$, and let $mathcal{F}$
contain $varnothing $, all $(a,b]$ with $a,b$ $in $ $mathbb{Q}$, $a,b in [0,1]$ $a$ $<$ $b$, and all finite unions of $(a,b]$. Let $[z]$ round $z$ to the nearest integer. Then $mathcal{F}$ is a
field by straightforward verification. It is not a $sigma $-field: let $A_{n}=(a_{n},1]$ with $a_{n}$ $=$ $%
10^{n}/[10^{n}pi ]$, hence $A_{n}$ $in $ $mathcal{F}$ but $cup
_{n=1}^{infty }A_{n}$ $=$ $(pi ,1]$ $notin $ $mathcal{F}$.
answered Aug 22 '13 at 13:18
JBHJBH
212
212
add a comment |
add a comment |
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%2f233702%2fexample-of-algebra-which-is-not-%25cf%2583-algebra%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