Smallest Sigma-algebra (and algebra)

  • Thread starter Thread starter tharindra
  • Start date Start date
  • Tags Tags
    Algebra
tharindra
Messages
2
Reaction score
0
  1. what is the difference between algebra and sigma algebra?
  2. How to construct the smallest algebra generated by a given collection of sets?
  3. How to check that a given collection of sets is an algebra?
  4. How to check that a given collection is the smallest algebra containing a collection of sets?
  5. How to construct the smallest sigma-algebra generated by a given collection of sets, especially a collection of singletons?
  6. How to check that a given collection of sets is a sigma-algebra?
  7. How to prove that the sigma-algebra generated by two different collections of sets is the same. sigma-algebra?
  8. How to check that a given collection is the smallest sigma-algebra containing a collection of sets?

Could you please give me some hints, for solve these kind of problems?
Thanks
 
Physics news on Phys.org
The questions are rather straight-forward, once you have the definition of an algebra and of a sigma-algebra right. Can you look them up and perhaps write them here?

Then notice the differences (from the name "sigma algebra" you already suspect that a sigma algebra is just an algebra, but a special one - i.e. it satisfies all the requirements of any algebra but with some more axioms).
 
If you want the smallest sigma-algebra on a collection of sets, then make a set of all the sigma algebras containing this collection (this is non empty as the powerset will contain them), then just intersect everything you got.

Most of the other questions are of no concern really. You never actually know what the sigma algebra is, it is enough to know it is just a sigma algebra. The smallest sigma algebra comes into play in Borel sets which are the smallest sigma-algebra on a topology, containing all the open sets.

If you want to show that two generated sigma-algebras are the same then you try to obtain one from the other. As an example, you can generate the Borel sigma-algebra on R with sets of the form (a,b) or (a,b]. If you want to see they are the same then from (a,b) you obtain (a,b] by intersecting (a,b+1/n), and you obtain (a,b) from (a,b] by union of (a,b-1/n].

Hope this helps.
 
I just need to know what is the difference between getting finite unions and countable unions. According to definition of sigma-algebra we can't produce a sigma-algebra A s.t.;
  • {{2},{3},{4},...} is a subset of A
  • {1} is not an element of A

But we can generate an algebra which satisfies above requirements because we just considering finite unions.

Am I correct?
 
I'm guessing your set is the naturals. If you have all but {1} in the sigma algebra, then by countable union you have {2,3,4,...} in the sigma algebra. Use the complement property to deduce that {1} is in the sigma algebra too.

Algebra can satisfy that as you do not have the set {2,3,4,...} in the algebra.
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
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...
Back
Top