Ring of sets

Template:Short description Template:Distinguish In mathematics, there are two different notions of a ring of sets, both referring to certain families of sets.

In order theory, a nonempty family of sets $ℛ$ is called a ring (of sets) if it is closed under union and intersection.^[1] That is, the following two statements are true for all sets $A$ and $B$ ,

$A, B \in ℛ$ implies $A \cup B \in ℛ$ and
$A, B \in ℛ$ implies $A \cap B \in ℛ .$

In measure theory, a nonempty family of sets $ℛ$ is called a ring (of sets) if it is closed under union and relative complement (set-theoretic difference).^[2] That is, the following two statements are true for all sets $A$ and $B$ ,

$A, B \in ℛ$ implies $A \cup B \in ℛ$ and
$A, B \in ℛ$ implies $A ∖ B \in ℛ .$

This implies that a ring in the measure-theoretic sense always contains the empty set. Furthermore, for all sets Template:Mvar and Template:Mvar,

A \cap B = A ∖ (A ∖ B),

which shows that a family of sets closed under relative complement is also closed under intersection, so that a ring in the measure-theoretic sense is also a ring in the order-theoretic sense.

Examples

If Template:Mvar is any set, then the power set of Template:Mvar (the family of all subsets of Template:Mvar) forms a ring of sets in either sense.

If Template:Math is a partially ordered set, then its upper sets (the subsets of Template:Mvar with the additional property that if Template:Mvar belongs to an upper set U and Template:Math, then Template:Mvar must also belong to Template:Mvar) are closed under both intersections and unions. However, in general it will not be closed under differences of sets.

The open sets and closed sets of any topological space are closed under both unions and intersections.^[1]

On the real line Template:Math, the family of sets consisting of the empty set and all finite unions of half-open intervals of the form Template:Open-closed, with Template:Math is a ring in the measure-theoretic sense.

If Template:Mvar is any transformation defined on a space, then the sets that are mapped into themselves by Template:Mvar are closed under both unions and intersections.^[1]

If two rings of sets are both defined on the same elements, then the sets that belong to both rings themselves form a ring of sets.^[1]

Related structures

A ring of sets in the order-theoretic sense forms a distributive lattice in which the intersection and union operations correspond to the lattice's meet and join operations, respectively. Conversely, every distributive lattice is isomorphic to a ring of sets; in the case of finite distributive lattices, this is Birkhoff's representation theorem and the sets may be taken as the lower sets of a partially ordered set.^[1]

A family of sets closed under union and relative complement is also closed under symmetric difference and intersection. Conversely, every family of sets closed under both symmetric difference and intersection is also closed under union and relative complement. This is due to the identities

$A \cup B = (A △ B) △ (A \cap B)$ and
$A ∖ B = A △ (A \cap B) .$

Symmetric difference and intersection together give a ring in the measure-theoretic sense the structure of a boolean ring.

In the measure-theoretic sense, a Template:Em is a ring closed under Template:Em unions, and a δ-ring is a ring closed under countable intersections. Explicitly, a σ-ring over $X$ is a set $ℱ$ such that for any sequence ${A_{k}}_{k = 1}^{\infty} \subseteq ℱ,$ we have $⋃_{k = 1}^{\infty} A_{k} \in ℱ .$

Given a set $X,$ a Template:Em − also called an Template:Em − is a ring that contains $X .$ This definition entails that an algebra is closed under absolute complement $A^{c} = X ∖ A .$ A σ-algebra is an algebra that is also closed under countable unions, or equivalently a σ-ring that contains $X .$ In fact, by de Morgan's laws, a δ-ring that contains $X$ is necessarily a σ-algebra as well. Fields of sets, and especially σ-algebras, are central to the modern theory of probability and the definition of measures.

A Template:Em is a family of sets $𝒮$ with the properties

∅∈𝒮,
- If (3) holds, then $\emptyset \in 𝒮$ if and only if $𝒮 \neq \emptyset .$
$A, B \in 𝒮$ implies $A \cap B \in 𝒮,$ and
$A, B \in 𝒮$ implies $A ∖ B = ⋃_{i = 1}^{n} C_{i}$ for some disjoint $C_{1}, \dots, C_{n} \in 𝒮 .$

Every ring (in the measure theory sense) is a semi-ring. On the other hand, $𝒮 : = {\emptyset, {x}, {y}}$ on $X = {x, y}$ is a semi-ring but not a ring, since it is not closed under unions.

A Template:EmTemplate:Sfn or Template:Em Template:Sfn is a collection $𝒮$ of subsets of $X$ satisfying the semiring properties except with (3) replaced with:

If $E \in 𝒮$ then there exists a finite number of mutually disjoint sets $C_{1}, \dots, C_{n} \in 𝒮$ such that $X ∖ E = ⋃_{i = 1}^{n} C_{i} .$

This condition is stronger than (3), which can be seen as follows. If $𝒮$ is a semialgebra and $E, F \in 𝒮$ , then we can write $F^{c} = F_{1} \cup \dots \cup F_{n}$ for disjoint $F_{i} \in S$ . Then: $E ∖ F = E \cap F^{c} = E \cap (F_{1} \cup \dots \cup F_{n}) = (E \cap F_{1}) \cup \dots \cup (E \cap F_{n})$

and every $E \cap F_{i} \in S$ since it is closed under intersection, and disjoint since they are contained in the disjoint $F_{i}$ 's. Moreover the condition is strictly stronger: any $S$ that is both a ring and a semialgebra is an algebra, hence any ring that is not an algebra is also not a semialgebra (e.g. the collection of finite sets on an infinite set $X$ ).

Template:Large Template:Navbar
Template:Nowrap Template:Nowrap	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small
Template:Nowrap	Template:Ya	Template:Ya	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na
Template:Nowrap	Template:Ya	Template:Ya	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na	Template:Ya	Never
Template:Nowrap	Template:Ya	Template:Ya	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na	Template:Ya	Never
[[Monotone class\|Template:Nowrap]]	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na	Template:Ya	Template:Ya	Template:Na	Template:Na	Template:Na
[[Dynkin system\|Template:Nowrap Template:Nowrap]]	Template:Ya	Template:Na	Template:Na	Template:Ya	Template:Ya	Template:Na	Template:Ya	Template:Ya	Template:Ya	Never
[[Ring of sets\|Template:Nowrap]]	Template:Ya	Template:Ya	Template:Ya	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na	Template:Na
[[Ring of sets\|Template:Nowrap]]	Template:Ya	Template:Ya	Template:Ya	Template:Ya	Template:Na	Template:Na	Template:Na	Template:Na	Template:Ya	Never
[[Delta-ring\|Template:Nowrap]]	Template:Ya	Template:Ya	Template:Ya	Template:Ya	Template:Na	Template:Ya	Template:Na	Template:Na	Template:Ya	Never
[[Sigma-ring\|Template:Nowrap]]	Template:Ya	Template:Ya	Template:Ya	Template:Ya	Template:Na	Template:Ya	Template:Ya	Template:Na	Template:Ya	Never
[[Field of sets\|Template:Nowrap]]	Template:Ya	Template:Ya	Template:Ya	Template:Ya	Template:Ya	Template:Na	Template:Na	Template:Ya	Template:Ya	Never
[[σ-algebra\|Template:Nowrap Template:Small]]	Template:Ya	Template:Ya	Template:Ya	Template:Ya	Template:Ya	Template:Ya	Template:Ya	Template:Ya	Template:Ya	Never
[[Dual ideal\|Template:Nowrap]]	Template:Ya	Template:Ya	Template:Ya	Template:Na	Template:Na	Template:Na	Template:Ya	Template:Ya	Template:Na	Template:Na
[[Filter (set theory)\|Template:Nowrap]]	Template:Ya	Template:Ya	Template:Ya	Never	Never	Template:Na	Template:Ya	Template:Ya	$\emptyset \in̸ ℱ$	Template:Ya
[[Prefilter\|Template:Nowrap Template:Small]]	Template:Ya	Template:Na	Template:Na	Never	Never	Template:Na	Template:Na	Template:Na	$\emptyset \in̸ ℱ$	Template:Ya
[[Filter subbase\|Template:Nowrap]]	Template:Na	Template:Na	Template:Na	Never	Never	Template:Na	Template:Na	Template:Na	$\emptyset \in̸ ℱ$	Template:Ya
[[Topology (structure)\|Template:Nowrap]]	Template:Ya	Template:Ya	Template:Ya	Template:Na	Template:Na	Template:Na	Template:Ya	Template:Ya	Template:Ya	Never
[[Topology (structure)\|Template:Nowrap]]	Template:Ya	Template:Ya	Template:Ya	Template:Na	Template:Na	Template:Ya	Template:Na	Template:Ya	Template:Ya	Never
Template:Nowrap Template:Nowrap	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small	Template:Small
Additionally, a Template:Em is a [[pi-system\|Template:Pi-system]] where every complement $B ∖ A$ is equal to a finite disjoint union of sets in $ℱ .$ A Template:Em is a semiring where every complement $Ω ∖ A$ is equal to a finite disjoint union of sets in $ℱ .$ $A, B, A_{1}, A_{2}, \dots$ are arbitrary elements of $ℱ$ and it is assumed that $ℱ \neq \emptyset .$

References

Template:Reflist

Sources

Template:Sfn whitelist

External links

Ring of sets at Encyclopedia of Mathematics

↑ ^1.0 ^1.1 ^1.2 ^1.3 ^1.4 Template:Citation.
↑ Template:Citation.

[b37-1] 1.0 ^1.1 ^1.2 ^1.3 ^1.4 Template:Citation.

[2] Template:Citation.

[1]

[2]

Ring of sets

Contents

Examples

Related structures

See also

References

Sources

External links

Navigation menu

Ring of sets

Examples

Related structures

See also

References

Sources

External links

Navigation menu

Search