Pi-system

In mathematics, a -system (or pi-system) on a set \Omega is a collection P of certain subsets of \Omega, such that * P is non-empty. * If A, B \in P then A \cap B \in P.

Uses your system voice; voice and rate in settings.

≈ 14 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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

That is, P is a non-empty family of subsets of Ω that is closed under non-empty finite intersections.[nb 1] The importance of π-systems arises 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 σ(E1,E2,…). So instead we may examine the union of all 𝜎-algebras generated by finitely many sets ⋃nσ(E1,…,En). This forms a π-system that generates the desired 𝜎-algebra. Another example is the collection of all intervals 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.

Definitions

edit edit source

A π-system is a non-empty collection of sets P that is closed under non-empty finite intersections, which is equivalent to P containing the intersection of any two of its elements. If every set in this π-system is a subset of Ω then it is called a π-system on Ω.

For any non-empty family Σ of subsets of Ω, there exists a π-system ℐΣ, called the π-system generated by 𝛴, that is the unique smallest π-system of Ω containing every element of Σ. It is equal to the intersection of all π-systems containing Σ, and can be explicitly described as the set of all possible non-empty finite intersections of elements of Σ: {E1∩⋯∩En : 1≤n∈ℕ and E1,…,En∈Σ}.

A non-empty family of sets has the finite intersection property if and only if the π-system it generates does not contain the empty set as an element.

Examples

edit edit source
  • For any real numbers a and b, 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.
  • Every filter is a π-system. Every π-system that doesn't contain the empty set is a prefilter (also known as a filter base).
  • For any measurable function f:Ω→ℝ, the set  ℐf={f−1((−∞,x]):x∈ℝ} defines a π-system, and is called the π-system generated by f. (Alternatively, {f−1((a,b]):a,b∈ℝ,a<b}∪{∅} defines a π-system generated by f.)
  • If P1 and P2 are π-systems for Ω1 and Ω2, respectively, then {A1×A2:A1∈P1,A2∈P2} is a π-system for the Cartesian product Ω1×Ω2.
  • Every 𝜎-algebra is a π-system.

Relationship to 𝜆-systems

edit edit source

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

  • Ω∈D,
  • if A∈D then Ω∖A∈D,
  • if A1,A2,A3,… is a sequence of (pairwise) disjoint subsets in D then ⋃n=1∞An∈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

edit edit source

Let D be a 𝜆-system, and let  ℐ⊆D be a π-system contained in D. The π-𝜆 theorem[1] states that the 𝜎-algebra σ(ℐ) generated by ℐ is contained in D :  σ(ℐ)⊆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.[2]

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.[1]

Example

edit edit source

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

  1. μ1(A)=μ2(A) for all 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 the proof[2] 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

edit edit source

π-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

edit edit source

The π-𝜆 theorem motivates the common definition of the probability distribution of a random variable X:(Ω,ℱ,P⁡)→ℝ in terms of its cumulative distribution function. Recall that the cumulative distribution of a random variable is defined as FX(a)=P⁡[X≤a],a∈ℝ, whereas the seemingly more general law of the variable is the probability measure ℒX(B)=P⁡[X−1(B)] for all B∈ℬ(ℝ), where ℬ(ℝ) is the Borel 𝜎-algebra. The random variables X:(Ω,ℱ,P⁡)→ℝ and Y:(Ω~,ℱ~,P~)→ℝ (on two possibly different probability spaces) are equal in distribution (or law), denoted by X=𝒟Y, if they have the same cumulative distribution functions; that is, if FX=FY. The motivation for the definition stems from the observation that if FX=FY, then that is exactly to say that ℒX and ℒY agree on the π-system {(−∞,a]:a∈ℝ} which generates ℬ(ℝ), and so by the example above: ℒX=ℒ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 (Ω,ℱ,P⁡), with respectively generated π-systems ℐX and ℐY. The joint cumulative distribution function of (X,Y) is FX,Y(a,b)=P⁡[X≤a,Y≤b]=P⁡[X−1((−∞,a])∩Y−1((−∞,b])], for all a,b∈ℝ.

However, A=X−1((−∞,a])∈ℐX and B=Y−1((−∞,b])∈ℐY. Because ℐX,Y={A∩B:A∈ℐX, and B∈ℐ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 (Xt)t∈T,(Yt)t∈T are known to be equal in distribution if and only if they agree on all finite-dimensional distributions; that is, for all t1,…,tn∈T,n∈ℕ, (Xt1,…,Xtn)=𝒟(Yt1,…,Ytn).

The proof of this is another application of the π-𝜆 theorem.[3]

Independent random variables

edit edit source

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 (Ω,ℱ,P⁡) then the random variables are independent if and only if their π-systems ℐX,ℐY satisfy for all A∈ℐX and B∈ℐY, P⁡[A∩B] = P⁡[A]P⁡[B], which is to say that ℐX,ℐY are independent. This actually is a special case of the use of π-systems for determining the distribution of (X,Y).

Example

edit edit source

Let Z=(Z1,Z2), where Z1,Z2∼𝒩(0,1) are iid standard normal random variables. Define the radius and argument variables R=Z12+Z22,Θ=atan2(Z2,Z1)+π,

where atan2 is the two-argument arctangent, which takes values in the interval (−π,π]. (The ordinary arctangent function, on the other hand, would yield a value in the interval [−π/2,π/2), which corresponds to a half-circle.) Then R and Θ are independent random variables.

To prove this, it is sufficient to show that the π-systems ℐR,ℐΘ are independent: that is, for all ρ∈[0,∞) and θ∈[0,2π], P⁡[R≤ρ,Θ≤θ]=P⁡[R≤ρ]P⁡[Θ≤θ].

Confirming that this is the case is an exercise in changing variables. Fix ρ∈[0,∞) and θ∈[0,2π], then the probability can be expressed as an integral of the probability density function of Z. P⁡[R≤ρ,Θ≤θ]=∫R≤ρ,Θ≤θ12πexp⁡(−12(z12+z22))dz1dz2=∫0θ∫0ρ12πe−r22rdrdθ~=(∫0θ12πdθ~)(∫0ρe−r22rdr)=P⁡[Θ≤θ]P⁡[R≤ρ].

See also

edit edit source
Families ℱ of sets over Ω
Is necessarily true of ℱ:
or, is ℱ closed under:
Directed
by ⊇
A∩B A∪B B∖A Ω∖A A1∩A2∩⋯ A1∪A2∪⋯ Ω∈ℱ ∅∈ℱ F.I.P.
π-system
Semiring Never
Semialgebra (semifield) Never
Monotone class only if Ai↘ only if Ai↗
𝜆-system (Dynkin system) only if
A⊆B
only if Ai↗ or
they are disjoint
Never
Ring (order theory)
Ring (measure theory) Never
δ-ring Never
𝜎-ring Never
Algebra (field) Never
𝜎-algebra (𝜎-field) Never
Filter
Proper filter Never Never Never
Prefilter (filter base)
Filter subbase
Open topology
(even arbitrary ∪)
Never
Closed topology
(even arbitrary ∩)
Never
Is necessarily true of ℱ:
or, is ℱ closed under:
directed
downward
finite
intersections
finite
unions
relative
complements
complements
in Ω
countable
intersections
countable
unions
contains Ω contains ∅ Finite
intersection
property

Additionally, a semiring is a π-system where every complement B∖A is equal to a finite disjoint union of sets in ℱ.
A semialgebra is a semiring where every complement Ω∖A is equal to a finite disjoint union of sets in ℱ.
A,B,A1,A2,… are arbitrary elements of ℱ and it is assumed that ℱ≠∅.

Notes

edit edit source
  1. ^ The nullary (0-ary) intersection of subsets of Ω is by convention equal to Ω, which is not required to be an element of a π-system. Wikipedia revision 1378926218, retrieved 2026-11-19

Citations

edit edit source
  1. ^ a b Kallenberg, Foundations Of Modern Probability, p. 2 Wikipedia revision 1378926218, retrieved 2026-11-19
  2. ^ a b Durrett, Probability Theory and Examples, p. 404 Wikipedia revision 1378926218, retrieved 2026-11-19
  3. ^ Kallenberg, Foundations Of Modern Probability, p. 48 Wikipedia revision 1378926218, retrieved 2026-11-19

References

edit edit source Measure theoryBasic concepts Sets Types of measures Particular measures Maps Main results Other results Applications & related

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378926218 under CC BY-SA 4.0; modifications have been made.

Words in each sectionπ-Systems in probabilityπ-Systems in probabilityπ-Systems in probability: 691 words691Relationship to 𝜆-syste…Relationship to 𝜆-systemsRelationship to 𝜆-systems: 447 words447See alsoSee alsoSee also: 316 words316DefinitionsDefinitionsDefinitions: 142 words142ExamplesExamplesExamples: 138 words138CitationsCitationsCitations: 46 words46NotesNotesNotes: 31 words31
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001378926218 · captured 2026-10-06 · ledger · version history

Cite this page as: encyclopegia.org, “Pi-system”, snapshot enwiki-001378926218. https://encyclopegia.org/a/pi-system