Back to the index. Or to the chambers

This article has 20 links. View as Cloud or List.

Loading ...

Planetmath Browser (2008—2009)

BSD licence | A django site

All articles taken from PlanetMath.org snapshot under CC-BY-SA licence.

→ The original article on PlanetMath.org

Other Formats: LaTeX

New! You can click on formulas to copy the LaTeX source to your clipboard. | Math Videos

Measure On A Boolean Algebra

Let be a Boolean algebra. A measure on is a non-negative extended real-valued function defined on such that

there is an $a\in A$ such that is a real number (not $\infty$ ),
if $a\wedge b=0$ , then $m(a\vee b)=m(a)+m(b)$ .

For example, a sigma algebra $\mathcal{B}$ over a set is a Boolean algebra, and a measure $\mu$ on the measurable space $(\mathcal{B},E)$ is a measure on the Boolean algebra $\mathcal{B}$ .

The following are some of the elementary properties of :

.
By condition 1, suppose $m(a)=r\in \mathbb{R}$ , then $m(a)=m(0\vee a)=m(0)+m(a)$ , so that .
is non-decreasing: $m(a)\le m(b)$ for $a\le b$
If $a\le b$ , then and are disjoint ( $c\wedge a=0$ ) and $b=c\vee a$ . So $m(b)=m(c\vee a)=m(c)+m(a)$ . As a result, $m(a)\le m(b)$ .
is subadditive: $m(a\vee b)\le m(a)+m(b)$ .
Since $a\vee b=(a-b)\vee b$ , and and are disjoint, we have that $m(a\vee b)=m((a-b)\vee b)=m(a-b)+m(b)$ . Since $a-b\le a$ , the result follows.

From the three properties above, one readily deduces that $I:=\lbrace a\in A\mid m(a)=0\rbrace$ is a Boolean ideal of .

A measure on is called a two-valued measure if maps onto the two-element set $\lbrace 0,1\rbrace$ . Because of the existence of an element $a\in A$ with , it follows that . Consequently, the set $F:=\lbrace a\in A \mid m(a)=1\rbrace$ is a Boolean filter. In fact, because is two-valued, is an ultrafilter (and correspondingly, the set $\lbrace a\mid m(a)=0\rbrace$ is a maximal ideal).

Conversely, given an ultrafilter of , the function $m:A\to \lbrace 0,1\rbrace$ , defined by iff $a\in F$ , is a two-valued measure on . To see this, suppose $a\wedge b=0$ . Then at least one of them, say , can not be in (or else $0=a\wedge b\in F$ ). This means that . If $b\in F$ , then $a\vee b\in F$ , so that $m(a\vee b)=1=m(b)=m(b)+m(a)$ . On the other hand, if $b\notin F$ , then $a',b'\in F$ , so $a'\wedge b'\in F$ , or $a\vee b\notin F$ . This means that $m(a\vee b)=0=m(a)+m(b)$ .

Remark. A measure (on a Boolean algebra) is sometimes called finitely additive to emphasize the defining condition 2 above. In addition, this terminology is used when there is a need to contrast a stronger form of additivity: countable additivity. A measure is said to be countably additive if whenever is a countable set of pairwise disjoint elements in such that $\bigvee K$ exists, then

$\displaystyle m(\bigvee K)=\sum_{a\in K} m(a).$

1	Measure
1	Real Number
1	Property
1	Disjoint
1	Surjective
1	Function
1	Countable
1	Additive
1	Converse Theorem
1	Relation Theory
1	Biconditional
1	Addition
2	Borel Space
3	Sigma Algebra
3	Mutually Disjoint
3	Boolean Lattice
4	Lattice Ideal
4	Lattice Filter
11	Boolean Ideal
15	Sub Linear