Sigma-ring

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, a nonempty collection of sets is called a Template:Sigma-ring (pronounced sigma-ring) if it is closed under countable union and relative complementation.

Formal definition

Let ℛ be a nonempty collection of sets. Then ℛ is a Template:Sigma-ring if:

  1. Closed under countable unions: ⋃n=1∞An∈ℛ if An∈ℛ for all n∈ℕ
  2. Closed under relative complementation: A∖B∈ℛ if A,B∈ℛ

Properties

These two properties imply: ⋂n=1∞An∈ℛ whenever A1,A2,… are elements of ℛ.

This is because ⋂n=1∞An=A1∖⋃n=2∞(A1∖An).

Every Template:Sigma-ring is a δ-ring but there exist δ-rings that are not Template:Sigma-rings.

Similar concepts

If the first property is weakened to closure under finite union (that is, A∪B∈ℛ whenever A,B∈ℛ) but not countable union, then ℛ is a ring but not a Template:Sigma-ring.

Uses

Template:Sigma-rings can be used instead of [[Sigma-algebra|Template:Sigma-fields]] (Template:Sigma-algebras) in the development of measure and integration theory, if one does not wish to require that the universal set be measurable. Every Template:Sigma-field is also a Template:Sigma-ring, but a Template:Sigma-ring need not be a Template:Sigma-field.

A Template:Sigma-ring ℛ that is a collection of subsets of X induces a [[Sigma-algebra|Template:Sigma-field]] for X. Define 𝒜={E⊆X:E∈ℛ or Ec∈ℛ}. Then 𝒜 is a Template:Sigma-field over the set X - to check closure under countable union, recall a σ-ring is closed under countable intersections. In fact 𝒜 is the minimal Template:Sigma-field containing ℛ since it must be contained in every Template:Sigma-field containing ℛ.

See also

References

Template:Reflist

  • Walter Rudin, 1976. Principles of Mathematical Analysis, 3rd. ed. McGraw-Hill. Final chapter uses Template:Sigma-rings in development of Lebesgue theory.