Sigma Algebras on [0,1]: Understanding Measures and Sub-Intervals

  • Thread starter Thread starter Old Monk
  • Start date Start date
  • Tags Tags
    Sigma
Old Monk
Messages
8
Reaction score
0
This topic came up while studying measures on sub-intervals of [0,1]. The collection of all intervals in [0,1] is a semi-algebra, say J. Now from finite disjoint union of members of J let's say we form a set A.

I was able to prove that A is an algebra, since for any C,D ε A, C\capD and C^{c} belong to A.

I'm not able to understand why A isn't a σ-algebra. Can anyone please outline a proof or give me a counter-argument.
 
Physics news on Phys.org
Are singletons in A?? Is \mathbb{Q} in A?
 
Yeah singletons are in A. Since singletons of the form (a,a) exist in J, the single union of such elements should exist in A. That I assume implies, all the rationals in [0,1] are also in A.
 
Old Monk said:
Yeah singletons are in A. Since singletons of the form (a,a) exist in J, the single union of such elements should exist in A.

Isn't (a,a)=\emptyset?? Singletons would rather come from [a,a]=\{a\}. But ok, let's assume that the singletons are in A.


That I assume implies, all the rationals in [0,1] are also in A.

Why??
 
Yeah sorry, that's [a,a].

We have [0,r)\cup(r,1] in A, if r is any rational in [0,1]. Therefore the element {r} ε A. So I think we could generalize this to all r ε Q\cap[0,1].
 
Old Monk said:
Yeah sorry, that's [a,a].

We have [0,r)\cup(r,1] in A, if r is any rational in [0,1]. Therefore the element {r} ε A. So I think we could generalize this to all r ε Q\cap[0,1].

Yeah, I agree that every {r} is in A. But why does that imply that \mathbb{Q}\in A. Is it even true??
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top