Sigma-algebra

From Optimal Transport Wiki
Revision as of 21:40, 18 December 2020 by JiminLin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

A -algebra is an algebra that is closed under countable unions. Thus a -algebra is a nonempty collection A of subsets of a nonempty set X closed under countable unions and complements. [1]

-algebra Generation

The intersection of any number of -algebras on a set is a -algebra. The -algebra generated by a collection of subsets of is the smallest -algebra containing , which is unique by this property.

The -algebra generated by is denoted as .

If and are subsets of and then . This result is commonly used to simplify proofs of containment in -algebras.

An important common example is the Borel -algebra on , the -algebra generated by the open sets of .


Product -algebras

Let be an indexed collection of nonempty sets, , and the coordinate maps. If is a -algebra on for each , the product -algebra on X is generated be . [1]

Proposition. If A is countable, then is the -algebra generated by .

Proposition. Suppose that is generated by . Then is generated by . If A is countable and for all , then is generated by .

Other Examples of -algebras

  • Given a set , then and are -algebras, called the indiscrete and discrete -algebras respectively.
  • If is uncountable, the set of countable and co-countable subsets of is a -algebra.
  • By Carathéodory's Theorem, if is an outer measure on , the collection of -measurable sets is a -algebra. [2]
  • Let be a map. If is a -algebra on , then is a -algebra in .

Non-examples

  • The algebra of finite and cofinite subsets of a nonempty set may no longer be a -algebra. Let , then every set of the form for is finite, but their countable union is neither finite nor cofinite.

References

  1. 1.0 1.1 Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, Second Edition, §1.2
  2. Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, Second Edition, §1.4