Field of sets

"Set algebra" redirects here. For the basic properties and laws of sets, see Algebra of sets.

In mathematics, a field of sets is a mathematical structure consisting of a pair ${\displaystyle (X,{\mathcal {F}})}$ consisting of a set ${\displaystyle X}$ and a family ${\displaystyle {\mathcal {F}}}$ of subsets of ${\displaystyle X}$ called an algebra over ${\displaystyle X}$ that contains the empty set as an element, and is closed under the operations of taking complements in ${\displaystyle X,}$ finite unions, and finite intersections.

Fields of sets should not be confused with fields in ring theory nor with fields in physics. Similarly the term "algebra over ${\displaystyle X}$" is used in the sense of a Boolean algebra and should not be confused with algebras over fields or rings in ring theory.

Fields of sets play an essential role in the representation theory of Boolean algebras. Every Boolean algebra can be represented as a field of sets.

Definitions

A field of sets is a pair ${\displaystyle (X,{\mathcal {F}})}$ consisting of a set ${\displaystyle X}$ and a family ${\displaystyle {\mathcal {F}}}$ of subsets of ${\displaystyle X,}$ called an algebra over ${\displaystyle X,}$ that has the following properties:

1. Closed under complementation in ${\displaystyle X}$:
   $${\displaystyle X\setminus F\in {\mathcal {F}}{\text{ for all }}F\in {\mathcal {F}}.}$$
2. Contains the empty set (or contains ${\displaystyle X}$) as an element: ${\displaystyle \varnothing \in {\mathcal {F}}.}$
   • Assuming that (1) holds, this condition (2) is equivalent to: ${\displaystyle X\in {\mathcal {F}}.}$
3. Any/all of the following equivalent ^{[note 1]} conditions hold:
   1. Closed under binary unions :
      $${\displaystyle F\cup G\in {\mathcal {F}}{\text{ for all }}F,G\in {\mathcal {F}}.}$$
   2. Closed under binary intersections :
      $${\displaystyle F\cap G\in {\mathcal {F}}{\text{ for all }}F,G\in {\mathcal {F}}.}$$
   3. Closed under finite unions:
      $${\displaystyle F_{1}\cup \cdots \cup F_{n}\in {\mathcal {F}}{\text{ for all integers }}n\geq 1{\text{ and all }}F_{1},\ldots ,F_{n}\in {\mathcal {F}}.}$$
   4. Closed under finite intersections:
      $${\displaystyle F_{1}\cap \cdots \cap F_{n}\in {\mathcal {F}}{\text{ for all integers }}n\geq 1{\text{ and all }}F_{1},\ldots ,F_{n}\in {\mathcal {F}}.}$$

In other words, ${\displaystyle {\mathcal {F}}}$ forms a subalgebra of the power set Boolean algebra of ${\displaystyle X}$ (with the same identity element ${\displaystyle X\in {\mathcal {F}}}$). Many authors refer to ${\displaystyle {\mathcal {F}}}$ itself as a field of sets. Elements of ${\displaystyle X}$ are called points while elements of ${\displaystyle {\mathcal {F}}}$ are called complexes and are said to be the admissible sets of ${\displaystyle X.}$

A field of sets ${\displaystyle (X,{\mathcal {F}})}$ is called a σ-field of sets and the algebra ${\displaystyle {\mathcal {F}}}$ is called a σ-algebra if the following additional condition (4) is satisfied:

4. Any/both of the following equivalent conditions hold:
   1. Closed under countable unions:
      $${\displaystyle \bigcup _{i=1}^{\infty }F_{i}:=F_{1}\cup F_{2}\cup \cdots \in {\mathcal {F}}}$$
      for all ${\displaystyle F_{1},F_{2},\ldots \in {\mathcal {F}}.}$
   2. Closed under countable intersections:
      $${\displaystyle \bigcap _{i=1}^{\infty }F_{i}:=F_{1}\cap F_{2}\cap \cdots \in {\mathcal {F}}}$$
      for all ${\displaystyle F_{1},F_{2},\ldots \in {\mathcal {F}}.}$

Fields of sets in the representation theory of Boolean algebras

Stone representation

For an arbitrary set ${\displaystyle Y,}$ its power set ${\displaystyle 2^{Y}}$ (or, somewhat pedantically, the pair ${\displaystyle (Y,2^{Y})}$ of this set and its power set) is a field of sets. If ${\displaystyle Y}$ is finite (namely, ${\displaystyle n}$-element), then ${\displaystyle 2^{Y}}$ is finite (namely, ${\displaystyle 2^{n}}$-element). It appears that every finite field of sets (it means, ${\displaystyle (X,{\mathcal {F}})}$ with ${\displaystyle {\mathcal {F}}}$ finite, while ${\displaystyle X}$ may be infinite) admits a representation of the form ${\displaystyle (Y,2^{Y})}$ with finite ${\displaystyle Y}$; it means a function ${\displaystyle f:X\to Y}$ that establishes a one-to-one correspondence between ${\displaystyle {\mathcal {F}}}$ and ${\displaystyle 2^{Y}}$ via inverse image: ${\displaystyle S=f^{-1}[B]=\{x\in X\mid f(x)\in B\}}$ where ${\displaystyle S\in {\mathcal {F}}}$ and ${\displaystyle B\in 2^{Y}}$ (that is, ${\displaystyle B\subset Y}$). One notable consequence: the number of complexes, if finite, is always of the form ${\displaystyle 2^{n}.}$

To this end one chooses ${\displaystyle Y}$ to be the set of all atoms of the given field of sets, and defines ${\displaystyle f}$ by ${\displaystyle f(x)=A}$ whenever ${\displaystyle x\in A}$ for a point ${\displaystyle x\in X}$ and a complex ${\displaystyle A\in {\mathcal {F}}}$ that is an atom; the latter means that a nonempty subset of ${\displaystyle A}$ different from ${\displaystyle A}$ cannot be a complex.

In other words: the atoms are a partition of ${\displaystyle X}$; ${\displaystyle Y}$ is the corresponding quotient set; and ${\displaystyle f}$ is the corresponding canonical surjection.

Similarly, every finite Boolean algebra can be represented as a power set – the power set of its set of atoms; each element of the Boolean algebra corresponds to the set of atoms below it (the join of which is the element). This power set representation can be constructed more generally for any complete atomic Boolean algebra.

In the case of Boolean algebras which are not complete and atomic we can still generalize the power set representation by considering fields of sets instead of whole power sets. To do this we first observe that the atoms of a finite Boolean algebra correspond to its ultrafilters and that an atom is below an element of a finite Boolean algebra if and only if that element is contained in the ultrafilter corresponding to the atom. This leads us to construct a representation of a Boolean algebra by taking its set of ultrafilters and forming complexes by associating with each element of the Boolean algebra the set of ultrafilters containing that element. This construction does indeed produce a representation of the Boolean algebra as a field of sets and is known as the Stone representation. It is the basis of Stone's representation theorem for Boolean algebras and an example of a completion procedure in order theory based on ideals or filters, similar to Dedekind cuts.

Alternatively one can consider the set of homomorphisms onto the two element Boolean algebra and form complexes by associating each element of the Boolean algebra with the set of such homomorphisms that map it to the top element. (The approach is equivalent as the ultrafilters of a Boolean algebra are precisely the pre-images of the top elements under these homomorphisms.) With this approach one sees that Stone representation can also be regarded as a generalization of the representation of finite Boolean algebras by truth tables.

Separative and compact fields of sets: towards Stone duality

• A field of sets is called separative (or differentiated) if and only if for every pair of distinct points there is a complex containing one and not the other.
• A field of sets is called compact if and only if for every proper filter over ${\displaystyle X}$ the intersection of all the complexes contained in the filter is non-empty.

These definitions arise from considering the topology generated by the complexes of a field of sets. (It is just one of notable topologies on the given set of points; it often happens that another topology is given, with quite different properties, in particular, not zero-dimensional). Given a field of sets ${\displaystyle \mathbf {X} =(X,{\mathcal {F}})}$ the complexes form a base for a topology. We denote by ${\displaystyle T(\mathbf {X} )}$ the corresponding topological space, ${\displaystyle (X,{\mathcal {T}})}$ where ${\displaystyle {\mathcal {T}}}$ is the topology formed by taking arbitrary unions of complexes. Then

• ${\displaystyle T(\mathbf {X} )}$ is always a zero-dimensional space.
• ${\displaystyle T(\mathbf {X} )}$ is a Hausdorff space if and only if ${\displaystyle \mathbf {X} }$ is separative.
• ${\displaystyle T(\mathbf {X} )}$ is a compact space with compact open sets ${\displaystyle {\mathcal {F}}}$ if and only if ${\displaystyle \mathbf {X} }$ is compact.
• ${\displaystyle T(\mathbf {X} )}$ is a Boolean space with clopen sets ${\displaystyle {\mathcal {F}}}$ if and only if ${\displaystyle \mathbf {X} }$ is both separative and compact (in which case it is described as being descriptive)

The Stone representation of a Boolean algebra is always separative and compact; the corresponding Boolean space is known as the Stone space of the Boolean algebra. The clopen sets of the Stone space are then precisely the complexes of the Stone representation. The area of mathematics known as Stone duality is founded on the fact that the Stone representation of a Boolean algebra can be recovered purely from the corresponding Stone space whence a duality exists between Boolean algebras and Boolean spaces.

Fields of sets with additional structure

Sigma algebras and measure spaces

If an algebra over a set is closed under countable unions (hence also under countable intersections), it is called a sigma algebra and the corresponding field of sets is called a measurable space. The complexes of a measurable space are called measurable sets. The Loomis-Sikorski theorem provides a Stone-type duality between countably complete Boolean algebras (which may be called abstract sigma algebras) and measurable spaces.

A measure space is a triple ${\displaystyle (X,{\mathcal {F}},\mu )}$ where ${\displaystyle (X,{\mathcal {F}})}$ is a measurable space and ${\displaystyle \mu }$ is a measure defined on it. If ${\displaystyle \mu }$ is in fact a probability measure we speak of a probability space and call its underlying measurable space a sample space. The points of a sample space are called sample points and represent potential outcomes while the measurable sets (complexes) are called events and represent properties of outcomes for which we wish to assign probabilities. (Many use the term sample space simply for the underlying set of a probability space, particularly in the case where every subset is an event.) Measure spaces and probability spaces play a foundational role in measure theory and probability theory respectively.

In applications to Physics we often deal with measure spaces and probability spaces derived from rich mathematical structures such as inner product spaces or topological groups which already have a topology associated with them - this should not be confused with the topology generated by taking arbitrary unions of complexes.

Topological fields of sets

A topological field of sets is a triple ${\displaystyle (X,{\mathcal {T}},{\mathcal {F}})}$ where ${\displaystyle (X,{\mathcal {T}})}$ is a topological space and ${\displaystyle (X,{\mathcal {F}})}$ is a field of sets which is closed under the closure operator of ${\displaystyle {\mathcal {T}}}$ or equivalently under the interior operator i.e. the closure and interior of every complex is also a complex. In other words, ${\displaystyle {\mathcal {F}}}$ forms a subalgebra of the power set interior algebra on ${\displaystyle (X,{\mathcal {T}}).}$

Topological fields of sets play a fundamental role in the representation theory of interior algebras and Heyting algebras. These two classes of algebraic structures provide the algebraic semantics for the modal logic S4 (a formal mathematical abstraction of epistemic logic) and intuitionistic logic respectively. Topological fields of sets representing these algebraic structures provide a related topological semantics for these logics.

Every interior algebra can be represented as a topological field of sets with the underlying Boolean algebra of the interior algebra corresponding to the complexes of the topological field of sets and the interior and closure operators of the interior algebra corresponding to those of the topology. Every Heyting algebra can be represented by a topological field of sets with the underlying lattice of the Heyting algebra corresponding to the lattice of complexes of the topological field of sets that are open in the topology. Moreover the topological field of sets representing a Heyting algebra may be chosen so that the open complexes generate all the complexes as a Boolean algebra. These related representations provide a well defined mathematical apparatus for studying the relationship between truth modalities (possibly true vs necessarily true, studied in modal logic) and notions of provability and refutability (studied in intuitionistic logic) and is thus deeply connected to the theory of modal companions of intermediate logics.

Given a topological space the clopen sets trivially form a topological field of sets as each clopen set is its own interior and closure. The Stone representation of a Boolean algebra can be regarded as such a topological field of sets, however in general the topology of a topological field of sets can differ from the topology generated by taking arbitrary unions of complexes and in general the complexes of a topological field of sets need not be open or closed in the topology.

Algebraic fields of sets and Stone fields

A topological field of sets is called algebraic if and only if there is a base for its topology consisting of complexes.

If a topological field of sets is both compact and algebraic then its topology is compact and its compact open sets are precisely the open complexes. Moreover, the open complexes form a base for the topology.

Topological fields of sets that are separative, compact and algebraic are called Stone fields and provide a generalization of the Stone representation of Boolean algebras. Given an interior algebra we can form the Stone representation of its underlying Boolean algebra and then extend this to a topological field of sets by taking the topology generated by the complexes corresponding to the open elements of the interior algebra (which form a base for a topology). These complexes are then precisely the open complexes and the construction produces a Stone field representing the interior algebra - the Stone representation. (The topology of the Stone representation is also known as the McKinsey–Tarski Stone topology after the mathematicians who first generalized Stone's result for Boolean algebras to interior algebras and should not be confused with the Stone topology of the underlying Boolean algebra of the interior algebra which will be a finer topology).

Preorder fields

A preorder field is a triple ${\displaystyle (X,\leq ,{\mathcal {F}})}$ where ${\displaystyle (X,\leq )}$ is a preordered set and ${\displaystyle (X,{\mathcal {F}})}$ is a field of sets.

Like the topological fields of sets, preorder fields play an important role in the representation theory of interior algebras. Every interior algebra can be represented as a preorder field with its interior and closure operators corresponding to those of the Alexandrov topology induced by the preorder. In other words, for all ${\displaystyle S\in {\mathcal {F}}}$:

$${\displaystyle \mathrm {Int} (S)=\{x\in X:{\text{ there exists a }}y\in S{\text{ with }}y\leq x\}}$$

and

$${\displaystyle \mathrm {Cl} (S)=\{x\in X:{\text{ there exists a }}y\in S{\text{ with }}x\leq y\}}$$

Similarly to topological fields of sets, preorder fields arise naturally in modal logic where the points represent the possible worlds in the Kripke semantics of a theory in the modal logic S4, the preorder represents the accessibility relation on these possible worlds in this semantics, and the complexes represent sets of possible worlds in which individual sentences in the theory hold, providing a representation of the Lindenbaum–Tarski algebra of the theory. They are a special case of the general modal frames which are fields of sets with an additional accessibility relation providing representations of modal algebras.

Algebraic and canonical preorder fields

A preorder field is called algebraic (or tight) if and only if it has a set of complexes ${\displaystyle {\mathcal {A}}}$ which determines the preorder in the following manner: ${\displaystyle x\leq y}$ if and only if for every complex ${\displaystyle S\in {\mathcal {A}}}$, ${\displaystyle x\in S}$ implies ${\displaystyle y\in S}$. The preorder fields obtained from S4 theories are always algebraic, the complexes determining the preorder being the sets of possible worlds in which the sentences of the theory closed under necessity hold.

A separative compact algebraic preorder field is said to be canonical. Given an interior algebra, by replacing the topology of its Stone representation with the corresponding canonical preorder (specialization preorder) we obtain a representation of the interior algebra as a canonical preorder field. By replacing the preorder by its corresponding Alexandrov topology we obtain an alternative representation of the interior algebra as a topological field of sets. (The topology of this "Alexandrov representation" is just the Alexandrov bi-coreflection of the topology of the Stone representation.) While representation of modal algebras by general modal frames is possible for any normal modal algebra, it is only in the case of interior algebras (which correspond to the modal logic S4) that the general modal frame corresponds to topological field of sets in this manner.

Complex algebras and fields of sets on relational structures

The representation of interior algebras by preorder fields can be generalized to a representation theorem for arbitrary (normal) Boolean algebras with operators. For this we consider structures ${\displaystyle (X,(R_{i})_{I},{\mathcal {F}})}$ where ${\displaystyle (X,(R_{i})_{I})}$ is a relational structure i.e. a set with an indexed family of relations defined on it, and ${\displaystyle (X,{\mathcal {F}})}$ is a field of sets. The complex algebra (or algebra of complexes) determined by a field of sets ${\displaystyle \mathbf {X} =(X,\left(R_{i}\right)_{I},{\mathcal {F}})}$ on a relational structure, is the Boolean algebra with operators

$${\displaystyle {\mathcal {C}}(\mathbf {X} )=({\mathcal {F}},\cap ,\cup ,\prime ,\emptyset ,X,(f_{i})_{I})}$$

where for all ${\displaystyle i\in I,}$ if ${\displaystyle R_{i}}$ is a relation of arity ${\displaystyle n+1,}$ then ${\displaystyle f_{i}}$ is an operator of arity ${\displaystyle n}$ and for all ${\displaystyle S_{1},\ldots ,S_{n}\in {\mathcal {F}}}$

$${\displaystyle f_{i}(S_{1},\ldots ,S_{n})=\left\{x\in X:{\text{ there exist }}x_{1}\in S_{1},\ldots ,x_{n}\in S_{n}{\text{ such that }}R_{i}(x_{1},\ldots ,x_{n},x)\right\}}$$

This construction can be generalized to fields of sets on arbitrary algebraic structures having both operators and relations as operators can be viewed as a special case of relations. If ${\displaystyle {\mathcal {F}}}$ is the whole power set of ${\displaystyle X}$ then ${\displaystyle {\mathcal {C}}(\mathbf {X} )}$ is called a full complex algebra or power algebra.

Every (normal) Boolean algebra with operators can be represented as a field of sets on a relational structure in the sense that it is isomorphic to the complex algebra corresponding to the field.

(Historically the term complex was first used in the case where the algebraic structure was a group and has its origins in 19th century group theory where a subset of a group was called a complex.)

See also

• Alexandrov topology  – topological space in which the intersection of any family of open sets is openPages displaying wikidata descriptions as a fallback
• Algebra of sets  – Identities and relationships involving sets
• Boolean ring  – mathematical conceptPages displaying wikidata descriptions as a fallback
• δ-ring  – Ring closed under countable intersections
• General frame
• Interior algebra  – Algebraic structure
• 𝜆-system (Dynkin system)  – Family closed under complements and countable disjoint unions
• List of Boolean algebra topics
• Measure theory  – Generalization of mass, length, area and volumePages displaying short descriptions of redirect targets
• Monotone class  – theoremPages displaying wikidata descriptions as a fallbackPages displaying short descriptions with no spaces
• π-system  – Family of sets closed under intersection
• Preordered field  – Algebraic object with an ordered structurePages displaying short descriptions of redirect targets
• Probability theory  – Branch of mathematics concerning probability
• Ring of sets  – Family closed under unions and relative complements
• Set function  – Function from sets to numbers
• σ-algebra  – Algebric structure of set algebra
• Sigma-ideal  – Family closed under subsets and countable unions
• 𝜎-ring  – Ring closed under countable unions
• Stone duality
• Stone's representation theorem for Boolean algebras  – Every Boolean algebra is isomorphic to a certain field of sets

Notes

1. The listed statements are equivalent if (1) and (2) hold. The equivalence of statements (a) and (b) follows from De Morgan's laws. This is also true of the equivalence of statements (c) and (d).

References

• Goldblatt, R., Algebraic Polymodal Logic: A Survey, Logic Journal of the IGPL, Volume 8, Issue 4, p. 393-450, July 2000
• Goldblatt, R., Varieties of complex algebras, Annals of Pure and Applied Logic, 44, p. 173-242, 1989
• Johnstone, Peter T. (1982). Stone spaces (3rd ed.). Cambridge: Cambridge University Press. ISBN   0-521-33779-8.
• Naturman, C.A., Interior Algebras and Topology, Ph.D. thesis, University of Cape Town Department of Mathematics, 1991
• Patrick Blackburn, Johan F.A.K. van Benthem, Frank Wolter ed., Handbook of Modal Logic, Volume 3 of Studies in Logic and Practical Reasoning, Elsevier, 2006

External links

• "Algebra of sets", Encyclopedia of Mathematics , EMS Press, 2001 [1994]
• Algebra of sets, Encyclopedia of Mathematics.

Families ${\displaystyle {\mathcal {F}}}$ of sets over ${\displaystyle \Omega }$ v t e
Is necessarily true of ${\displaystyle {\mathcal {F}}\colon }$ or, is ${\displaystyle {\mathcal {F}}}$ closed under:	Directed by ${\displaystyle \,\supseteq }$	${\displaystyle A\cap B}$	${\displaystyle A\cup B}$	${\displaystyle B\setminus A}$	${\displaystyle \Omega \setminus A}$	${\displaystyle A_{1}\cap A_{2}\cap \cdots }$	${\displaystyle A_{1}\cup A_{2}\cup \cdots }$	${\displaystyle \Omega \in {\mathcal {F}}}$	${\displaystyle \varnothing \in {\mathcal {F}}}$	F.I.P.
π-system
Semiring										Never
Semialgebra(Semifield)										Never
Monotone class						only if ${\displaystyle A_{i}\searrow }$	only if ${\displaystyle A_{i}\nearrow }$
𝜆-system(Dynkin System)				only if ${\displaystyle A\subseteq B}$			only if ${\displaystyle A_{i}\nearrow }$ or they are disjoint			Never
Ring (Order theory)
Ring (Measure theory)										Never
δ-Ring										Never
𝜎-Ring										Never
Algebra (Field)										Never
𝜎-Algebra(𝜎-Field)										Never
Dual ideal
Filter				Never	Never				${\displaystyle \varnothing \not \in {\mathcal {F}}}$
Prefilter(Filter base)				Never	Never				${\displaystyle \varnothing \not \in {\mathcal {F}}}$
Filter subbase				Never	Never				${\displaystyle \varnothing \not \in {\mathcal {F}}}$
Open Topology							(even arbitrary ${\displaystyle \cup }$)			Never
Closed Topology						(even arbitrary ${\displaystyle \cap }$)				Never
Is necessarily true of ${\displaystyle {\mathcal {F}}\colon }$ or, is ${\displaystyle {\mathcal {F}}}$ closed under:	directed downward	finite intersections	finite unions	relative complements	complements in ${\displaystyle \Omega }$	countable intersections	countable unions	contains ${\displaystyle \Omega }$	contains ${\displaystyle \varnothing }$	Finite Intersection Property
Additionally, a semiring is a π-system where every complement ${\displaystyle B\setminus A}$ is equal to a finite disjoint union of sets in ${\displaystyle {\mathcal {F}}.}$ A semialgebra is a semiring that contains ${\displaystyle \Omega .}$ ${\displaystyle A,B,A_{1},A_{2},\ldots }$ are arbitrary elements of ${\displaystyle {\mathcal {F}}}$ and it is assumed that ${\displaystyle {\mathcal {F}}\neq \varnothing .}$