Neha Patil (Editor)

Pi system

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In mathematics, a π-system (or pi-system) on a set Ω is a collection P of certain subsets of Ω, such that

Contents

  • P is non-empty.
  • A ∩ B ∈ P whenever A and B are in P.

    • That is, P is a non-empty family of subsets of Ω that is closed under finite intersections. The importance of π-systems arise from the fact that if two probability measures agree on a π-system, then they agree on the σ-algebra generated by that π-system. Moreover, if other properties, such as equality of integrals, hold for the π-system, then they hold for the generated σ-algebra as well. This is the case whenever the collection of subsets for which the property holds is a λ-system. π-systems are also useful for checking independence of random variables.

    This is desirable because in practice, π-systems are often simpler to work with than σ-algebras. For example, it may be awkward to work with σ-algebras generated by infinitely many sets σ ( E 1 , E 2 , … ) . So instead we may examine the union of all σ-algebras generated by finitely many sets ⋃ n σ ( E 1 , … , E n ) . This forms a π-system that generates the desired σ-algebra. Another example is the collection of all interval subsets of the real line, along with the empty set, which is a π-system that generates the very important Borel σ-algebra of subsets of the real line.

    Examples

  • ∀ a , b ∈ R , the intervals ( − ∞ , a ] form a π-system, and the intervals ( a , b ] form a π-system, if the empty set is also included.
  • The topology (collection of open subsets) of any topological space is a π-system.
  • For any collection Σ of subsets of Ω, there exists a π-system I Σ which is the unique smallest π-system of Ω to contain every element of Σ, and is called the π-system generated by Σ.
  • For any measurable function f : Ω → R , the set I f = { f − 1 ( ( − ∞ , x ] ) : x ∈ R } defines a π-system, and is called the π-system generated by f. (Alternatively, { f − 1 ( ( a , b ] ) : a , b ∈ R , a < b } ∪ { ∅ } defines a π-system generated by f .)
  • If P1 and P2 are π-systems for Ω1 and Ω2, respectively, then { A 1 × A 2 : A 1 ∈ P 1 , A 2 ∈ P 2 } is a π-system for the product space Ω1×Ω2.
  • Any σ-algebra is a π-system.

    • Relationship to λ-Systems

    A λ-system on Ω is a set D of subsets of Ω, satisfying

  • Ω ∈ D ,
  • if A ∈ D then A c ∈ D ,
  • if A 1 , A 2 , A 3 , … is a sequence of disjoint subsets in D then ∪ n = 1 ∞ A n ∈ D .

    • Whilst it is true that any σ-algebra satisfies the properties of being both a π-system and a λ-system, it is not true that any π-system is a λ-system, and moreover it is not true that any π-system is a σ-algebra. However, a useful classification is that any set system which is both a λ-system and a π-system is a σ-algebra. This is used as a step in proving the π-λ theorem.

    The π-λ Theorem

    Let D be a λ-system, and let I ⊆ D be a π-system contained in D . The π-λ Theorem states that the σ-algebra σ ( I ) generated by I is contained in D : σ ( I ) ⊂ D .

    The π-λ theorem can be used to prove many elementary measure theoretic results. For instance, it is used in proving the uniqueness claim of the Carathéodory extension theorem for σ-finite measures.

    The π-λ theorem is closely related to the monotone class theorem, which provides a similar relationship between monotone classes and algebras, and can be used to derive many of the same results. Since π-systems are simpler classes than algebras, it can be easier to identify the sets that are in them while, on the other hand, checking whether the property under consideration determines a λ-system is often relatively easy. Despite the difference between the two theorems, the π-λ theorem is sometimes referred to as the monotone class theorem.

    Example

    Let μ1 , μ2 : F → R be two measures on the σ-algebra F, and suppose that F = σ(I) is generated by a π-system I. If

    1. μ1(A) = μ2(A), ∀ A ∈ I, and
    2. μ1(Ω) = μ2(Ω) < ∞,

    then μ1 = μ2. This is the uniqueness statement of the Carathéodory extension theorem for finite measures. If this result does not seem very remarkable, consider the fact that it usually is very difficult or even impossible to fully describe every set in the σ-algebra, and so the problem of equating measures would be completely hopeless without such a tool.

    Idea of Proof Define the collection of sets

    D = { A ∈ σ ( I ) : μ 1 ( A ) = μ 2 ( A ) } .

    By the first assumption, μ1 and μ2 agree on I and thus I ⊆ D. By the second assumption, Ω ∈ D, and it can further be shown that D is a λ-system. It follows from the π-λ theorem that σ(I) ⊆ D ⊆ σ(I), and so D = σ(I). That is to say, the measures agree on σ(I).

    π-Systems in Probability

    π-systems are more commonly used in the study of probability theory than in the general field of measure theory. This is primarily due to probabilistic notions such as independence, though it may also be a consequence of the fact that the π-λ theorem was proven by the probabilist Eugene Dynkin. Standard measure theory texts typically prove the same results via monotone classes, rather than π-systems.

    Equality in Distribution

    The π-λ theorem motivates the common definition of the probability distribution of a random variable X : ( Ω , F , P ) → R in terms of its cumulative distribution function. Recall that the cumulative distribution of a random variable is defined as

    F X ( a ) = P [ X ≤ a ] , a ∈ R ,

    whereas the seemingly more general law of the variable is the probability measure

    L X ( B ) = P [ X − 1 ( B ) ] , B ∈ B ( R ) ,

    where B ( R ) is the Borel σ-algebra. We say that the random variables X : ( Ω , F , P ) , and Y : ( Ω ~ , F ~ , P ~ ) → R (on two possibly different probability spaces) are equal in distribution (or law), X = D Y , if they have the same cumulative distribution functions, FX = FY. The motivation for the definition stems from the observation that if FX = FY, then that is exactly to say that L X and L Y agree on the π-system { ( − ∞ , a ] : a ∈ R } which generates B ( R ) , and so by the example above: L X = L Y .

    A similar result holds for the joint distribution of a random vector. For example, suppose X and Y are two random variables defined on the same probability space ( Ω , F , P ) , with respectively generated π-systems I X and I Y . The joint cumulative distribution function of (X,Y) is

    F X , Y ( a , b ) = P [ X ≤ a , Y ≤ b ] = P [ X − 1 ( ( − ∞ , a ] ) ∩ Y − 1 ( ( − ∞ , b ] ) ] , a , b ∈ R .

    However, A = X − 1 ( ( − ∞ , a ] ) ∈ I X and B = Y − 1 ( ( − ∞ , b ] ) ∈ I Y . Since

    I X , Y = { A ∩ B : A ∈ I X , B ∈ I Y }

    is a π-system generated by the random pair (X,Y), the π-λ theorem is used to show that the joint cumulative distribution function suffices to determine the joint law of (X,Y). In other words, (X,Y) and (W,Z) have the same distribution if and only if they have the same joint cumulative distribution function.

    In the theory of stochastic processes, two processes ( X t ) t ∈ T , ( Y t ) t ∈ T are known to be equal in distribution if and only if they agree on all finite-dimensional distributions. i.e. for all t 1 , … , t n ∈ T , n ∈ N .

    ( X t 1 , … , X t n ) = D ( Y t 1 , … , Y t n ) .

    The proof of this is another application of the π-λ theorem.

    Independent Random Variables

    The theory of π-system plays an important role in the probabilistic notion of independence. If X and Y are two random variables defined on the same probability space ( Ω , F , P ) then the random variables are independent if and only if their π-systems I X , I Y satisfy

    P [ A ∩ B ] = P [ A ] P [ B ] , ∀ A ∈ I X , B ∈ I Y ,

    which is to say that I X , I Y are independent. This actually is a special case of the use of π-systems for determining the distribution of (X,Y).

    Example

    Let Z = ( Z 1 , Z 2 ) , where Z 1 , Z 2 ∼ N ( 0 , 1 ) are iid standard normal random variables. Define the radius and argument (arctan) variables

    R = Z 1 2 + Z 2 2 , Θ = tan − 1 ⁡ ( Z 2 / Z 1 ) .

    Then R and Θ are independent random variables.

    To prove this, it is sufficient to show that the π-systems I R , I Θ are independent: i.e.

    P [ R ≤ ρ , Θ ≤ θ ] = P [ R ≤ ρ ] P [ Θ ≤ θ ] ∀ ρ ∈ [ 0 , ∞ ) , θ ∈ [ 0 , 2 π ] .

    Confirming that this is the case is an exercise in changing variables. Fix ρ ∈ [ 0 , ∞ ) , θ ∈ [ 0 , 2 π ] , then the probability can be expressed as an integral of the probability density function of Z .

    P [ R ≤ ρ , Θ ≤ θ ] = ∫ R ≤ ρ , Θ ≤ θ 1 2 π exp ⁡ ( − 1 2 ( z 1 2 + z 2 2 ) ) d z 1 d z 2 = ∫ 0 θ ∫ 0 ρ 1 2 π e − r 2 2 r d r d θ ~ = ( ∫ 0 θ 1 2 π d θ ~ ) ( ∫ 0 ρ e − r 2 2 r d r ) = P [ Θ ≤ θ ] P [ R ≤ ρ ] .

    References

    Pi system Wikipedia
    (Text) CC BY-SA