Measure algebra

Last updated

In mathematics, a measure algebra is a Boolean algebra with a countably additive positive measure. A probability measure on a measure space gives a measure algebra on the Boolean algebra of measurable sets modulo null sets.

Boolean algebra (structure) Algebraic structure modeling logical operations

In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties of both set operations and logic operations. A Boolean algebra can be seen as a generalization of a power set algebra or a field of sets, or its elements can be viewed as generalized truth values. It is also a special case of a De Morgan algebra and a Kleene algebra.

Probability measure Measure of total value one, generalizing probability distributions

In mathematics, a probability measure is a real-valued function defined on a set of events in a probability space that satisfies measure properties such as countable additivity. The difference between a probability measure and the more general notion of measure is that a probability measure must assign value 1 to the entire probability space.

A measure space is a basic object of measure theory, a branch of mathematics that studies generalized notions of volumes. Measure spaces contain information about the underlying set, the subsets of said set that are feasible for measuring and the method that is used for measuring. One important example of a measure space is a probability space.

Definition

A measure algebra is a Boolean algebra B with a measure m, which is a real-valued function on B such that:

Related Research Articles

Measure (mathematics) mathematical function which associates a comparable numeric value to some subsets of a given set

In mathematical analysis, a measure on a set is a systematic way to assign a number to each suitable subset of that set, intuitively interpreted as its size. In this sense, a measure is a generalization of the concepts of length, area, and volume. A particularly important example is the Lebesgue measure on a Euclidean space, which assigns the conventional length, area, and volume of Euclidean geometry to suitable subsets of the n-dimensional Euclidean space Rn. For instance, the Lebesgue measure of the interval [0, 1] in the real numbers is its length in the everyday sense of the word, specifically, 1.

Ultrafilter in set theory

In the mathematical field of set theory, an ultrafilter on a given partially ordered set (poset) P is a maximal filter on P, that is, a filter on P that cannot be enlarged. Filters and ultrafilters are special subsets of P. If P happens to be a Boolean algebra, each ultrafilter is also a prime filter, and vice versa.

In mathematics, a Borel set is any set in a topological space that can be formed from open sets through the operations of countable union, countable intersection, and relative complement. Borel sets are named after Émile Borel.

In mathematics, and more specifically in abstract algebra, an algebraic structure on a set A is a collection of finitary operations on A; the set A with this structure is also called an algebra.

In mathematics, in particular in measure theory, an outer measure or exterior measure is a function defined on all subsets of a given set with values in the extended real numbers satisfying some additional technical conditions. A general theory of outer measures was first introduced by Constantin Carathéodory to provide a basis for the theory of measurable sets and countably additive measures. Carathéodory's work on outer measures found many applications in measure-theoretic set theory, and was used in an essential way by Hausdorff to define a dimension-like metric invariant now called Hausdorff dimension.

In mathematics, the ba space of an algebra of sets is the Banach space consisting of all bounded and finitely additive signed measures on . The norm is defined as the variation, that is

In order theory, a partially ordered set X is said to satisfy the countable chain condition, or to be ccc, if every strong antichain in X is countable.

In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum. Complete Boolean algebras are used to construct Boolean-valued models of set theory in the theory of forcing. Every Boolean algebra A has an essentially unique completion, which is a complete Boolean algebra containing A such that every element is the supremum of some subset of A. As a partially ordered set, this completion of A is the Dedekind–MacNeille completion.

Quantifier elimination is a concept of simplification used in mathematical logic, model theory, and theoretical computer science. Informally, a quantified statement " such that " can be viewed as a question "When is there an such that ?", and the statement without quantifiers can be viewed as the answer to that question.

In mathematical logic, a Boolean-valued model is a generalization of the ordinary Tarskian notion of structure from model theory. In a Boolean-valued model, the truth values of propositions are not limited to "true" and "false", but instead take values in some fixed complete Boolean algebra.

In mathematics, a free Boolean algebra is a Boolean algebra with a distinguished set of elements, called generators, such that:

  1. Each element of the Boolean algebra can be expressed as a finite combination of generators, using the Boolean operations, and
  2. The generators are as independent as possible, in the sense that there are no relationships among them that do not hold in every Boolean algebra no matter which elements are chosen.

In mathematics, a positive measure μ defined on a σ-algebra Σ of subsets of a set X is called a finite measure if μ(X) is a finite real number, and a set A in Σ is of finite measure if μ(A) < ∞. The measure μ is called σ-finite if X is the countable union of measurable sets with finite measure. A set in a measure space is said to have σ-finite measure if it is a countable union of measurable sets with finite measure. A measure being σ-finite is a weaker condition than being finite, i.e. all finite measures are σ-finite but there are (many) σ-finite measures that are not finite.

Boolean algebra is a mathematically rich branch of abstract algebra. Just as group theory deals with groups, and linear algebra with vector spaces, Boolean algebras are models of the equational theory of the two values 0 and 1. Common to Boolean algebras, groups, and vector spaces is the notion of an algebraic structure, a set closed under zero or more operations satisfying certain equations.

In mathematics, a vector measure is a function defined on a family of sets and taking vector values satisfying certain properties. It is a generalization of the concept of finite measure, which takes nonnegative real values only.

In mathematics, a refinement monoid is a commutative monoid M such that for any elements a0, a1, b0, b1 of M such that a0+a1=b0+b1, there are elements c00, c01, c10, c11 of M such that a0=c00+c01, a1=c10+c11, b0=c00+c10, and b1=c01+c11.

In mathematics, a cardinal function is a function that returns cardinal numbers.

In model theory, a complete theory is called stable if it does not have too many types. One goal of classification theory is to divide all complete theories into those whose models can be classified and those whose models are too complicated to classify, and to classify all models in the cases where this can be done. Roughly speaking, if a theory is not stable then its models are too complicated and numerous to classify, while if a theory is stable there might be some hope of classifying its models, especially if the theory is superstable or totally transcendental.

In mathematics, a Loeb space is a type of measure space introduced by Loeb (1975) using non-standard analysis.

In mathematics, a Maharam algebra is a complete Boolean algebra with a continuous submeasure. They were introduced by Maharam (1947).

References

Thomas J. Jech is a mathematician specializing in set theory who was at Penn State for more than 25 years.

Digital object identifier Character string used as a permanent identifier for a digital object, in a format controlled by the International DOI Foundation

In computing, a Digital Object Identifier or DOI is a persistent identifier or handle used to identify objects uniquely, standardized by the International Organization for Standardization (ISO). An implementation of the Handle System, DOIs are in wide use mainly to identify academic, professional, and government information, such as journal articles, research reports and data sets, and official publications though they also have been used to identify other types of information resources, such as commercial videos.

International Standard Book Number Unique numeric book identifier

The International Standard Book Number (ISBN) is a numeric commercial book identifier which is intended to be unique. Publishers purchase ISBNs from an affiliate of the International ISBN Agency.