Lambda system
   HOME

TheInfoList



OR:

A Dynkin system, named after
Eugene Dynkin Eugene Borisovich Dynkin (russian: link=no, Евгений Борисович Дынкин; 11 May 1924 – 14 November 2014) was a Soviet and American mathematician. He made contributions to the fields of probability and algebra, especially sem ...
is a collection of subsets of another universal
set Set, The Set, SET or SETS may refer to: Science, technology, and mathematics Mathematics *Set (mathematics), a collection of elements *Category of sets, the category whose objects and morphisms are sets and total functions, respectively Electro ...
\Omega satisfying a set of axioms weaker than those of -algebra. Dynkin systems are sometimes referred to as -systems (Dynkin himself used this term) or d-system. These set families have applications in measure theory and
probability Probability is the branch of mathematics concerning numerical descriptions of how likely an event is to occur, or how likely it is that a proposition is true. The probability of an event is a number between 0 and 1, where, roughly speakin ...
. A major application of -systems is the - theorem, see below.


Definition

Let \Omega be a
nonempty In mathematics, the empty set is the unique set having no elements; its size or cardinality (count of elements in a set) is zero. Some axiomatic set theories ensure that the empty set exists by including an axiom of empty set, while in other ...
set, and let D be a collection of subsets of \Omega (that is, D is a subset of the
power set In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is post ...
of \Omega). Then D is a Dynkin system if # \Omega \in D, # D is closed under complements of subsets in supersets: if A, B \in D and A \subseteq B, then B \setminus A \in D, # D is closed under countable increasing
union Union commonly refers to: * Trade union, an organization of workers * Union (set theory), in mathematics, a fundamental operation on sets Union may also refer to: Arts and entertainment Music * Union (band), an American rock group ** ''Un ...
s: if A_1 \subseteq A_2 \subseteq A_3 \subseteq \ldots is an increasing sequenceA sequence of sets A_1, A_2, A_3, \ldots is called if A_n \subseteq A_ for all n \geq 1. of sets in D then \bigcup_^\infty A_n \in D. It is easy to check that any Dynkin system D satisfies:
  1. \Omega \in D,
  2. D is closed under complements in \Omega: if A \in D, then \Omega \setminus A \in D, * Taking A := \Omega shows that \varnothing \in D.
  3. D is closed under countable unions of
    pairwise disjoint In mathematics, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set.. For example, and are ''disjoint sets,'' while and are not disjoint. A c ...
    sets: if A_1, A_2, A_3, \ldots is a sequence of
    pairwise disjoint In mathematics, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set.. For example, and are ''disjoint sets,'' while and are not disjoint. A c ...
    subsets in D (meaning that A_i \cap A_j = \varnothing for all i \neq j) then \bigcup_^\infty A_n \in D. * To be clear, this property also holds for finite sequences A_1, \ldots, A_n of pairwise disjoint sets (by letting A_i := \varnothing for all i > n).
Conversely, it is easy to check that a family of sets that satisfy (4-6) is a Dynkin class. For this reason, a small group of authors have adopted conditions 4-6 to define a Dynkin system as they are easier to verify. An important fact is that a Dynkin system which is also a -system (that is, closed under finite intersections) is a -algebra. This can be verified by noting that conditions 2 and 3 together with closure under finite intersections imply closure under countable unions. Given any collection \mathcal of subsets of \Omega, there exists a unique Dynkin system denoted D\ which is minimal with respect to containing \mathcal J. That is, if \tilde D is any Dynkin system containing \mathcal, then D\ \subseteq \tilde. D\ is called the For instance, D\ = \. For another example, let \Omega = \ and \mathcal = \; then D\ = \.


Sierpiński-Dynkin's π-λ theorem

If P is a -system and D is a Dynkin system with P\subseteq D, then \sigma\\subseteq D. In other words, the -algebra generated by P is contained in D. Thus a Dynkin system contains a -system if and only if it contains the -algebra generated by that -system. One application of Sierpiński-Dynkin's - theorem is the uniqueness of a measure that evaluates the length of an interval (known as the Lebesgue measure): Let (\Omega, B, \lambda) be the
unit interval In mathematics, the unit interval is the closed interval , that is, the set of all real numbers that are greater than or equal to 0 and less than or equal to 1. It is often denoted ' (capital letter ). In addition to its role in real analysis ...
,1with the Lebesgue measure on
Borel sets In mathematics, a Borel set is any set in a topological space that can be formed from open sets (or, equivalently, from closed sets) through the operations of countable union, countable intersection, and relative complement. Borel sets are named ...
. Let \mu be another measure on \Omega satisfying \mu a, b)= b - a, and let D be the family of sets S such that \mu = \lambda Let I := \, and observe that I is closed under finite intersections, that I \subseteq D, and that B is the -algebra generated by I. It may be shown that D satisfies the above conditions for a Dynkin-system. From Sierpiński-Dynkin's - Theorem it follows that D in fact includes all of B, which is equivalent to showing that the Lebesgue measure is unique on B.


Application to probability distributions


See also

* * * * * * * * *


Notes

Proofs


References

* * * {{Measure theory Families of sets Lemmas Probability theory