Semi-ring of sets
From Maths
(Redirected from Semiring of sets)
Contents
[hide]Definition
A collection of sets, \mathcal{F} [Note 1] is called a semi-ring of sets if[1]:
- \emptyset\in\mathcal{F}
- \forall S,T\in\mathcal{F}[S\cap T\in\mathcal{F}]
- \forall S,T\in\mathcal{F}\exists(S_i)_{i=1}^m\subseteq\mathcal{F}\text{ pairwise disjoint}[S-T=\bigudot_{i=1}^m S_i][Note 2] - this doesn't require S-T\in\mathcal{F} note, it only requires that their be a finite collection of disjoint elements whose union is S-T.
Purpose
The main motivation for semi-rings (in Measure Theory at least) is to let us provide a pre-measure on a semi-ring (a kind of pre-measure[Note 3]) and then use a theorem to prove this can be extended to a normal pre-measure (a similar structure define on a ring of sets instead). Then we can apply extending pre-measures to outer-measures to obtain an outer-measure, all without going through the tedious task of defining a pre-measure on a ring and doing only the basics by defining it on a semi-ring.
Examples
- Lebesgue pre-measure on a semi-ring - in one dimension the semi-ring, \mathscr{J}^1, here is the collection of all half-open-half-closed intervals on the real line, [a,b)\subset\mathbb{R} (with [a,b):=\{x\in\mathbb{R}\ \vert a\le x < r\}) for a,b\in\mathbb{R} with the convention that if then [a,b)=\emptyset.
- Clearly, \emptyset\in\mathscr{J}^1
- Let a,b,c,d\in\mathbb{R} , Suppose a<b and c<d (as if either interval is the empty set the result is trivial). Suppose they partially intersect with a<c and b<d, then clearly [a,b)\cap[c,d)=[c,b), this is the most difficult case.
- Using the same variables, the "hardest" case is that of a<c<d<b so we have [a,b)-[c,d) with [c,d) being inside [a,b), then: [a,b)-[c,d)=[a,c)\cup[d,b). The other cases are easier still.
- Showing even \mathscr{J}^1 is a ring of sets is very tedious. If the reader cannot see this, he should try it. Where as defining pre-measure on a semi-ring instead is something we've already done most of the work for!
See also
- Pre-measure on a semi-ring (an instance of a pre-measure)
- A pre-measure on a semi-ring may be extended uniquely to a pre-measure on a ring
- Types of set algebras
Notes
- Jump up ↑ An F is a bit like an R with an unfinished loop and the foot at the right. "Semi Ring".
- Jump up ↑ Usually the finite sequence ({ S_i })_{ i = m }^{ \infty }\subseteq \mathcal{F} being pairwise disjoint is implied by the \bigudot however here I have been explicit. To be more explicit we could say:
- \forall S,T\in\mathcal{F}\exists(S_i)_{i=1}^m\subseteq\mathcal{F}\left[\underbrace{\big(\forall i,j\in\{1,\ldots,m\}\subset\mathbb{N}[i\ne j\implies S_i\cap S_j=\emptyset]\big)}_{\text{the }S_i\text{ are pairwise disjoint} }\overbrace{\wedge}^\text{and}\left(S-T=\bigcup_{i=1}^m S_i\right)\right]
- Caution:The statement: \forall S,T\in\mathcal{F}\exists(S_i)_{i=1}^m\subseteq\mathcal{F}\left[\big(\forall i,j\in\{1,\ldots,m\}\subset\mathbb{N}[i\ne j\implies S_i\cap S_j=\emptyset]\big)\implies\left(S-T=\bigcup_{i=1}^m S_i\right)\right] is entirely different
- In this statement we are only declaring that a finite sequence exists, and if it is NOT pairwise disjoint, then we may or may not have S-T=\bigcup_{i=1}^mS_i. We require that they be pairwise disjoint AND their union be the set difference of S and T.
- Caution:The statement: \forall S,T\in\mathcal{F}\exists(S_i)_{i=1}^m\subseteq\mathcal{F}\left[\big(\forall i,j\in\{1,\ldots,m\}\subset\mathbb{N}[i\ne j\implies S_i\cap S_j=\emptyset]\big)\implies\left(S-T=\bigcup_{i=1}^m S_i\right)\right] is entirely different
- \forall S,T\in\mathcal{F}\exists(S_i)_{i=1}^m\subseteq\mathcal{F}\left[\underbrace{\big(\forall i,j\in\{1,\ldots,m\}\subset\mathbb{N}[i\ne j\implies S_i\cap S_j=\emptyset]\big)}_{\text{the }S_i\text{ are pairwise disjoint} }\overbrace{\wedge}^\text{and}\left(S-T=\bigcup_{i=1}^m S_i\right)\right]
- Jump up ↑ Many authors consider a pre-measure to be something we can extend to a measure somehow. We do not use this. Instead we define a pre-measure as being a function with certain properties on a ring of sets. This is useful because a pre-measure, under this definition, is almost a measure. A ring of sets is closed under all the elementary set operations.
We also adopt the convention of calling anything that can be extended to either a pre-measure (and thus an outer-measure and later a measure) a pre-measure on X where X is say a semi-ring or something.
All we need to do is show the pre-measure on X extends uniquely to a pre-measure to allow the theorems (extending pre-measures to measures) to yield us a measure.
References
|