In
abstract algebra, an interior algebra is a certain type of
algebraic structure
In mathematics, an algebraic structure consists of a nonempty set ''A'' (called the underlying set, carrier set or domain), a collection of operations on ''A'' (typically binary operations such as addition and multiplication), and a finite set of ...
that encodes the idea of the topological
interior
Interior may refer to:
Arts and media
* ''Interior'' (Degas) (also known as ''The Rape''), painting by Edgar Degas
* ''Interior'' (play), 1895 play by Belgian playwright Maurice Maeterlinck
* ''The Interior'' (novel), by Lisa See
* Interior de ...
of a set. Interior algebras are to
topology and the
modal logic
Modal logic is a collection of formal systems developed to represent statements about necessity and possibility. It plays a major role in philosophy of language, epistemology, metaphysics, and natural language semantics. Modal logics extend other ...
S4 what
Boolean algebras are to
set theory and ordinary
propositional logic. Interior algebras form a
variety of
modal algebra In algebra and logic, a modal algebra is a structure \langle A,\land,\lor,-,0,1,\Box\rangle such that
*\langle A,\land,\lor,-,0,1\rangle is a Boolean algebra,
*\Box is a unary operation on ''A'' satisfying \Box1=1 and \Box(x\land y)=\Box x\land\Box ...
s.
Definition
An interior algebra is an
algebraic structure
In mathematics, an algebraic structure consists of a nonempty set ''A'' (called the underlying set, carrier set or domain), a collection of operations on ''A'' (typically binary operations such as addition and multiplication), and a finite set of ...
with the
signature
:⟨''S'', ·, +, ′, 0, 1,
I⟩
where
:⟨''S'', ·, +, ′, 0, 1⟩
is a
Boolean algebra and postfix
I designates a
unary operator, the interior operator, satisfying the identities:
# ''x''
I ≤ ''x''
# ''x''
II = ''x''
I
# (''xy'')
I = ''x''
I''y''
I
# 1
I = 1
''x''
I is called the interior of ''x''.
The
dual
Dual or Duals may refer to:
Paired/two things
* Dual (mathematics), a notion of paired concepts that mirror one another
** Dual (category theory), a formalization of mathematical duality
*** see more cases in :Duality theories
* Dual (grammatical ...
of the interior operator is the
closure operator C defined by ''x''
C = ((''x''′)
I)′. ''x''
C is called the closure of ''x''. By the
principle of duality, the closure operator satisfies the identities:
# ''x''
C ≥ ''x''
# ''x''
CC = ''x''
C
# (''x'' + ''y'')
C = ''x''
C + ''y''
C
# 0
C = 0
If the closure operator is taken as primitive, the interior operator can be defined as ''x''
I = ((''x''′)
C)′. Thus the theory of interior algebras may be formulated using the closure operator instead of the interior operator, in which case one considers closure algebras of the form ⟨''S'', ·, +, ′, 0, 1,
C⟩, where ⟨''S'', ·, +, ′, 0, 1⟩ is again a Boolean algebra and
C satisfies the above identities for the closure operator. Closure and interior algebras form
dual
Dual or Duals may refer to:
Paired/two things
* Dual (mathematics), a notion of paired concepts that mirror one another
** Dual (category theory), a formalization of mathematical duality
*** see more cases in :Duality theories
* Dual (grammatical ...
pairs, and are paradigmatic instances of "Boolean algebras with operators." The early literature on this subject (mainly Polish topology) invoked closure operators, but the interior operator formulation eventually became the norm following the work of
Wim Blok
Willem Johannes "Wim" Blok (1947–2003) was a Dutch logician who made major contributions to algebraic logic, universal algebra, and modal logic. His important achievements over the course of his career include "a brilliant demonstration of the ...
.
Open and closed elements
Elements of an interior algebra satisfying the condition ''x''
I = ''x'' are called
open. The
complements of open elements are called
closed
Closed may refer to:
Mathematics
* Closure (mathematics), a set, along with operations, for which applying those operations on members always results in a member of the set
* Closed set, a set which contains all its limit points
* Closed interval, ...
and are characterized by the condition ''x''
C = ''x''. An interior of an element is always open and the closure of an element is always closed. Interiors of closed elements are called
regular open and closures of open elements are called regular closed. Elements which are both open and closed are called
clopen. 0 and 1 are clopen.
An interior algebra is called Boolean if all its elements are open (and hence clopen). Boolean interior algebras can be identified with ordinary Boolean algebras as their interior and closure operators provide no meaningful additional structure. A special case is the class of trivial interior algebras which are the single element interior algebras characterized by the identity 0 = 1.
Morphisms of interior algebras
Homomorphisms
Interior algebras, by virtue of being
algebraic structure
In mathematics, an algebraic structure consists of a nonempty set ''A'' (called the underlying set, carrier set or domain), a collection of operations on ''A'' (typically binary operations such as addition and multiplication), and a finite set of ...
s, have
homomorphisms. Given two interior algebras ''A'' and ''B'', a map ''f'' : ''A'' → ''B'' is an interior algebra homomorphism
if and only if ''f'' is a homomorphism between the underlying Boolean algebras of ''A'' and ''B'', that also preserves interiors and closures. Hence:
*''f''(''x''
I) = ''f''(''x'')
I;
*''f''(''x''
C) = ''f''(''x'')
C.
Topomorphisms
Topomorphisms are another important, and more general, class of
morphism
In mathematics, particularly in category theory, a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms a ...
s between interior algebras. A map ''f'' : ''A'' → ''B'' is a
topomorphism if and only if ''f'' is a homomorphism between the Boolean algebras underlying ''A'' and ''B'', that also preserves the open and closed elements of ''A''. Hence:
* If ''x'' is open in ''A'', then ''f''(''x'') is open in ''B'';
* If ''x'' is closed in ''A'', then ''f''(''x'') is closed in ''B''.
(Such morphisms have also been called ''stable homomorphisms'' and ''closure algebra semi-homomorphisms''.) Every interior algebra homomorphism is a topomorphism, but not every topomorphism is an interior algebra homomorphism.
Boolean homomorphisms
Early research often considered mappings between interior algebras which were homomorphisms of the underlying Boolean algebras but which did not necessarily preserve the interior or closure operator. Such mappings were called Boolean homomorphisms. (The terms ''closure homomorphism'' or ''topological homomorphism'' were used in the case where these were preserved, but this terminology is now redundant as the standard definition of a homomorphism in
universal algebra requires that it preserves all operations.) Applications involving countably complete interior algebras (in which countable meets and joins always exist, also called ''σ-complete'') typically made use of countably complete Boolean homomorphisms also called Boolean σ-homomorphisms - these preserve countable meets and joins.
Continuous morphisms
The earliest generalization of continuity to interior algebras was
Sikorski
Sikorski (feminine: Sikorska, plural: Sikorscy) is a Polish-language surname. It belongs to several noble Polish–Lithuanian Commonwealth families, see . Variants (via other languages) include Sikorsky (disambiguation), Sikorsky, Sikorskyi, and S ...
's based on the inverse image map of a continuous map. This is a Boolean homomorphism, preserves unions of sequences and includes the closure of an inverse image in the inverse image of the closure. Sikorski thus defined a ''continuous homomorphism'' as a Boolean σ-homomorphism ''f'' between two σ-complete interior algebras such that ''f''(''x'')
C ≤ ''f''(''x''
C). This definition had several difficulties: The construction acts
contravariantly producing a dual of a continuous map rather than a generalization. On the one hand σ-completeness is too weak to characterize inverse image maps (completeness is required), on the other hand it is too restrictive for a generalization. (Sikorski remarked on using non-σ-complete homomorphisms but included σ-completeness in his axioms for ''closure algebras''.) Later J. Schmid defined a continuous homomorphism or continuous morphism for interior algebras as a Boolean homomorphism ''f'' between two interior algebras satisfying ''f''(''x''
C) ≤ ''f''(''x'')
C. This generalizes the forward image map of a continuous map - the image of a closure is contained in the closure of the image. This construction is
covariant but not suitable for category theoretic applications as it only allows construction of continuous morphisms from continuous maps in the case of bijections. (C. Naturman returned to Sikorski's approach while dropping σ-completeness to produce topomorphisms as defined above. In this terminology, Sikorski's original "continuous homomorphisms" are σ-complete topomorphisms between σ-complete interior algebras.)
Relationships to other areas of mathematics
Topology
Given a
topological space ''X'' = ⟨''X'', ''T''⟩ one can form the
power set Boolean algebra of ''X'':
:⟨''P''(''X''), ∩, ∪, ′, ø, ''X''⟩
and extend it to an interior algebra
:''A''(''X'') = ⟨''P''(''X''), ∩, ∪, ′, ø, ''X'',
I⟩,
where
I is the usual topological interior operator. For all ''S'' ⊆ ''X'' it is defined by
:''S''
I = ∪
For all ''S'' ⊆ ''X'' the corresponding closure operator is given by
:''S''
C = ∩
''S''
I is the largest open subset of ''S'' and ''S''
C is the smallest closed superset of ''S'' in ''X''. The open, closed, regular open, regular closed and clopen elements of the interior algebra ''A''(''X'') are just the open, closed, regular open, regular closed and clopen subsets of ''X'' respectively in the usual topological sense.
Every
complete
Complete may refer to:
Logic
* Completeness (logic)
* Completeness of a theory, the property of a theory that every formula in the theory's language or its negation is provable
Mathematics
* The completeness of the real numbers, which implies t ...
atomic interior algebra is
isomorphic
In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word is ...
to an interior algebra of the form ''A''(''X'') for some
topological space ''X''. Moreover, every interior algebra can be
embedded in such an interior algebra giving a representation of an interior algebra as a
topological field of sets. The properties of the structure ''A''(''X'') are the very motivation for the definition of interior algebras. Because of this intimate connection with topology, interior algebras have also been called topo-Boolean algebras or topological Boolean algebras.
Given a
continuous map between two topological spaces
:''f'' : ''X'' → ''Y''
we can define a
complete
Complete may refer to:
Logic
* Completeness (logic)
* Completeness of a theory, the property of a theory that every formula in the theory's language or its negation is provable
Mathematics
* The completeness of the real numbers, which implies t ...
topomorphism
:''A''(''f'') : ''A''(''Y'') → ''A''(''X'')
by
:''A''(''f'')(''S'') = ''f''
−1 'S''
for all subsets ''S'' of ''Y''. Every complete topomorphism between two complete atomic interior algebras can be derived in this way. If Top is the
category of topological spaces In mathematics, the category of topological spaces, often denoted Top, is the category whose objects are topological spaces and whose morphisms are continuous maps. This is a category because the composition of two continuous maps is again contin ...
and continuous maps and Cit is the
category of complete atomic interior algebras and complete topomorphisms then Top and Cit are dually isomorphic and ''A'' : Top → Cit is a
contravariant functor that is a dual isomorphism of categories. ''A''(''f'') is a homomorphism if and only if ''f'' is a continuous
open map
In mathematics, more specifically in topology, an open map is a function between two topological spaces that maps open sets to open sets.
That is, a function f : X \to Y is open if for any open set U in X, the image f(U) is open in Y.
Likewise, a ...
.
Under this dual isomorphism of categories many natural topological properties correspond to algebraic properties, in particular connectedness properties correspond to irreducibility properties:
*''X'' is
empty if and only if ''A''(''X'') is trivial
*''X'' is
indiscrete if and only if ''A''(''X'') is
simple
*''X'' is
discrete if and only if ''A''(''X'') is Boolean
*''X'' is
almost discrete
In set theory, when dealing with sets of infinite size, the term almost or nearly is used to refer to all but a negligible amount of elements in the set. The notion of "negligible" depends on the context, and may mean "of measure zero" (in a me ...
if and only if ''A''(''X'') is
semisimple
*''X'' is
finitely generated (Alexandrov) if and only if ''A''(''X'') is operator complete i.e. its interior and closure operators distribute over arbitrary meets and joins respectively
*''X'' is
connected if and only if ''A''(''X'') is
directly indecomposable
In mathematics, one can often define a direct product of objects already known, giving a new one. This generalizes the Cartesian product of the underlying sets, together with a suitably defined structure on the product set. More abstractly, one ...
*''X'' is
ultraconnected if and only if ''A''(''X'') is
finitely subdirectly irreducible
Finite is the opposite of Infinity, infinite. It may refer to:
* Finite number (disambiguation)
* Finite set, a set whose cardinality (number of elements) is some natural number
* Finite verb, a verb form that has a subject, usually being inflected ...
*''X'' is
compact ultra-connected if and only if ''A''(''X'') is
subdirectly irreducible In the branch of mathematics known as universal algebra (and in its applications), a subdirectly irreducible algebra is an universal algebra, algebra that cannot be factored as a subdirect product of "simpler" algebras. Subdirectly irreducible algeb ...
Generalized topology
The modern formulation of topological spaces in terms of
topologies of open subsets, motivates an alternative formulation of interior algebras: A generalized topological space is an
algebraic structure
In mathematics, an algebraic structure consists of a nonempty set ''A'' (called the underlying set, carrier set or domain), a collection of operations on ''A'' (typically binary operations such as addition and multiplication), and a finite set of ...
of the form
:⟨''B'', ·, +, ′, 0, 1, ''T''⟩
where ⟨''B'', ·, +, ′, 0, 1⟩ is a Boolean algebra as usual, and ''T'' is a unary relation on ''B'' (subset of ''B'') such that:
#0,1 ∈ ''T''
#''T'' is closed under arbitrary joins (i.e. if a join of an arbitrary subset of ''T'' exists then it will be in ''T'')
#''T'' is closed under finite meets
#For every element ''b'' of ''B'', the join Σ exists
''T'' is said to be a generalized topology in the Boolean algebra.
Given an interior algebra its open elements form a generalized topology. Conversely given a generalized topological space
:⟨''B'', ·, +, ′, 0, 1, ''T''⟩
we can define an interior operator on ''B'' by ''b''
I = Σ thereby producing an interior algebra whose open elements are precisely ''T''. Thus generalized topological spaces are equivalent to interior algebras.
Considering interior algebras to be generalized topological spaces, topomorphisms are then the standard homomorphisms of Boolean algebras with added relations, so that standard results from
universal algebra apply.
Neighbourhood functions and neighbourhood lattices
The topological concept of
neighbourhoods can be generalized to interior algebras: An element ''y'' of an interior algebra is said to be a neighbourhood of an element ''x'' if ''x'' ≤ ''y''
I. The set of neighbourhoods of ''x'' is denoted by ''N''(''x'') and forms a
filter. This leads to another formulation of interior algebras:
A neighbourhood function on a Boolean algebra is a mapping ''N'' from its underlying set ''B'' to its set of filters, such that:
#For all ''x'' ∈ ''B'', max exists
#For all ''x'',''y'' ∈ ''B'', ''x'' ∈ ''N(y)'' if and only if there is a ''z'' ∈ ''B'' such that ''y'' ≤ ''z'' ≤ ''x'' and ''z'' ∈ ''N(z)''.
The mapping ''N'' of elements of an interior algebra to their filters of neighbourhoods is a neighbourhood function on the underlying Boolean algebra of the interior algebra. Moreover, given a neighbourhood function ''N'' on a Boolean algebra with underlying set ''B'', we can define an interior operator by ''x''
I = max thereby obtaining an interior algebra. ''N(x)'' will then be precisely the filter of neighbourhoods of ''x'' in this interior algebra. Thus interior algebras are equivalent to Boolean algebras with specified neighbourhood functions.
In terms of neighbourhood functions, the open elements are precisely those elements ''x'' such that ''x'' ∈ ''N(x)''. In terms of open elements ''x'' ∈ ''N(y)'' if and only if there is an open element ''z'' such that ''y'' ≤ ''z'' ≤ ''x''.
Neighbourhood functions may be defined more generally on
(meet)-semilattices producing the structures known as
neighbourhood (semi)lattices. Interior algebras may thus be viewed as precisely the Boolean neighbourhood lattices i.e. those neighbourhood lattices whose underlying semilattice forms a Boolean algebra.
Modal logic
Given a theory (set of formal sentences) ''M'' in the modal logic S4, we can form its
Lindenbaum–Tarski algebra
In mathematical logic, the Lindenbaum–Tarski algebra (or Lindenbaum algebra) of a logical theory ''T'' consists of the equivalence classes of sentences of the theory (i.e., the quotient, under the equivalence relation ~ defined such that ''p'' ...
:
:''L''(''M'') = ⟨''M'' / ~, ∧, ∨, ¬, ''F'', ''T'', □⟩
where ~ is the equivalence relation on sentences in ''M'' given by ''p'' ~ ''q'' if and only if ''p'' and ''q'' are
logically equivalent in ''M'', and ''M'' / ~ is the set of equivalence classes under this relation. Then ''L''(''M'') is an interior algebra. The interior operator in this case corresponds to the
modal operator □ (necessarily), while the closure operator corresponds to ◊ (possibly). This construction is a special case of a more general result for
modal algebra In algebra and logic, a modal algebra is a structure \langle A,\land,\lor,-,0,1,\Box\rangle such that
*\langle A,\land,\lor,-,0,1\rangle is a Boolean algebra,
*\Box is a unary operation on ''A'' satisfying \Box1=1 and \Box(x\land y)=\Box x\land\Box ...
s and modal logic.
The open elements of ''L''(''M'') correspond to sentences that are only true if they are necessarily true, while the closed elements correspond to those that are only false if they are necessarily false.
Because of their relation to S4, interior algebras are sometimes called S4 algebras or Lewis algebras, after the
logician C. I. Lewis, who first proposed the modal logics S4 and S5.
Preorders
Since interior algebras are (normal)
Boolean algebras with
operators, they can be represented by
fields of sets on appropriate relational structures. In particular, since they are
modal algebra In algebra and logic, a modal algebra is a structure \langle A,\land,\lor,-,0,1,\Box\rangle such that
*\langle A,\land,\lor,-,0,1\rangle is a Boolean algebra,
*\Box is a unary operation on ''A'' satisfying \Box1=1 and \Box(x\land y)=\Box x\land\Box ...
s, they can be represented as
fields of sets on a set with a single
binary relation
In mathematics, a binary relation associates elements of one set, called the ''domain'', with elements of another set, called the ''codomain''. A binary relation over Set (mathematics), sets and is a new set of ordered pairs consisting of ele ...
, called a
modal frame. The modal frames corresponding to interior algebras are precisely the
preordered sets.
Preordered sets (also called ''S4-frames'') provide the
Kripke semantics of the modal logic S4, and the connection between interior algebras and preorders is deeply related to their connection with modal logic.
Given a
preordered set
In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive relation, reflexive and Transitive relation, transitive. Preorders are more general than equivalence relations and (non-strict) partia ...
''X'' = ⟨''X'', «⟩ we can construct an interior algebra
: ''B''(''X'') = ⟨''P''(''X''), ∩, ∪, ′, ø, ''X'',
I⟩
from the
power set Boolean algebra of ''X'' where the interior operator
I is given by
:''S''
I = for all ''S'' ⊆ ''X''.
The corresponding closure operator is given by
:''S''
C = for all ''S'' ⊆ ''X''.
''S''
I is the set of all ''worlds'' inaccessible from ''worlds'' outside ''S'', and ''S''
C is the set of all ''worlds'' accessible from some ''world'' in ''S''. Every interior algebra can be
embedded in an interior algebra of the form ''B''(''X'') for some
preordered set
In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive relation, reflexive and Transitive relation, transitive. Preorders are more general than equivalence relations and (non-strict) partia ...
''X'' giving the above-mentioned representation as a
field of sets (a preorder field).
This construction and representation theorem is a special case of the more general result for
modal algebra In algebra and logic, a modal algebra is a structure \langle A,\land,\lor,-,0,1,\Box\rangle such that
*\langle A,\land,\lor,-,0,1\rangle is a Boolean algebra,
*\Box is a unary operation on ''A'' satisfying \Box1=1 and \Box(x\land y)=\Box x\land\Box ...
s and modal frames. In this regard, interior algebras are particularly interesting because of their connection to
topology. The construction provides the
preordered set
In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive relation, reflexive and Transitive relation, transitive. Preorders are more general than equivalence relations and (non-strict) partia ...
''X'' with a
topology, the
Alexandrov topology In topology, an Alexandrov topology is a topology in which the intersection of any family of open sets is open. It is an axiom of topology that the intersection of any ''finite'' family of open sets is open; in Alexandrov topologies the finite re ...
, producing a
topological space ''T''(''X'') whose open sets are:
:.
The corresponding closed sets are:
:{''C'' ⊆ ''X'' : for all ''x'' ∈ ''C'' and all ''y'' ∈ ''X'', ''y'' « ''x'' implies ''y'' ∈ ''C''}.
In other words, the open sets are the ones whose ''worlds'' are inaccessible from outside (the up-sets), and the closed sets are the ones for which every outside ''world'' is inaccessible from inside (the down-sets). Moreover, ''B''(''X'') = ''A''(''T''(''X'')).
Monadic Boolean algebras
Any
monadic Boolean algebra can be considered to be an interior algebra where the interior operator is the universal quantifier and the closure operator is the existential quantifier. The monadic Boolean algebras are then precisely the
variety of interior algebras satisfying the identity ''x''
IC = ''x''
I. In other words, they are precisely the interior algebras in which every open element is closed or equivalently, in which every closed element is open. Moreover, such interior algebras are precisely the
semisimple interior algebras. They are also the interior algebras corresponding to the modal logic S5, and so have also been called S5 algebras.
In the relationship between preordered sets and interior algebras they correspond to the case where the preorder is an
equivalence relation
In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation.
Each equivalence relation ...
, reflecting the fact that such preordered sets provide the Kripke semantics for S5. This also reflects the relationship between the
monadic logic of quantification (for which monadic Boolean algebras provide an
algebraic description) and S5 where the modal operators □ (necessarily) and ◊ (possibly) can be interpreted in the Kripke semantics using monadic universal and existential quantification, respectively, without reference to an accessibility relation.
Heyting algebras
The open elements of an interior algebra form a
Heyting algebra and the closed elements form a
dual
Dual or Duals may refer to:
Paired/two things
* Dual (mathematics), a notion of paired concepts that mirror one another
** Dual (category theory), a formalization of mathematical duality
*** see more cases in :Duality theories
* Dual (grammatical ...
Heyting algebra. The regular open elements and regular closed elements correspond to the pseudo-complemented elements and
dual
Dual or Duals may refer to:
Paired/two things
* Dual (mathematics), a notion of paired concepts that mirror one another
** Dual (category theory), a formalization of mathematical duality
*** see more cases in :Duality theories
* Dual (grammatical ...
pseudo-complemented elements of these algebras respectively and thus form Boolean algebras. The clopen elements correspond to the complemented elements and form a common subalgebra of these Boolean algebras as well as of the interior algebra itself. Every
Heyting algebra can be represented as the open elements of an interior algebra and the latter may be chosen to an interior algebra generated by its open elements - such interior algebras correspond one to one with Heyting algebras (up to isomorphism) being the free Boolean extensions of the latter.
Heyting algebras
play the same role for
intuitionistic logic that interior algebras play for the modal logic S4 and
Boolean algebras play for
propositional logic. The relation between Heyting algebras and interior algebras reflects the relationship between intuitionistic logic and S4, in which one can interpret theories of intuitionistic logic as S4 theories
closed
Closed may refer to:
Mathematics
* Closure (mathematics), a set, along with operations, for which applying those operations on members always results in a member of the set
* Closed set, a set which contains all its limit points
* Closed interval, ...
under
necessity. The one to one correspondence between Heyting algebras and interior algebras generated by their open elements reflects the correspondence between extensions of intuitionistic logic and normal extensions of the modal logic S4.Grz.
Derivative algebras
Given an interior algebra ''A'', the closure operator obeys the axioms of the
derivative operator,
D. Hence we can form a
derivative algebra ''D''(''A'') with the same underlying Boolean algebra as ''A'' by using the closure operator as a derivative operator.
Thus interior algebras are
derivative algebras. From this perspective, they are precisely the
variety of derivative algebras satisfying the identity ''x''
D ≥ ''x''. Derivative algebras provide the appropriate
algebraic semantics for the modal logic WK4. Hence derivative algebras stand to topological
derived sets and WK4 as interior/closure algebras stand to topological interiors/closures and S4.
Given a derivative algebra ''V'' with derivative operator
D, we can form an interior algebra ''I''(''V'') with the same underlying Boolean algebra as ''V'', with interior and closure operators defined by ''x''
I = ''x''·''x'' ′
D ′ and ''x''
C = ''x'' + ''x''
D, respectively. Thus every derivative algebra can be regarded as an interior algebra. Moreover, given an interior algebra ''A'', we have ''I''(''D''(''A'')) = ''A''. However, ''D''(''I''(''V'')) = ''V'' does ''not'' necessarily hold for every derivative algebra ''V''.
Stone duality and representation for interior algebras
Stone duality
In mathematics, there is an ample supply of categorical dualities between certain categories of topological spaces and categories of partially ordered sets. Today, these dualities are usually collected under the label Stone duality, since they fo ...
provides a category theoretic duality between Boolean algebras and a class of topological spaces known as
Boolean spaces. Building on nascent ideas of relational semantics (later formalized by
Kripke) and a result of R. S. Pierce,
Jónsson Jónsson is a surname of Icelandic origin, meaning ''son of Jón''. In Icelandic names, the name is not strictly a surname, but a patronymic. The name refers to:
* Arnar Jónsson (actor) (born 1943), Icelandic actor
* Arnar Jónsson (basketball) (bo ...
,
Tarski and G. Hansoul extended Stone duality to
Boolean algebras with operators
Any kind of logic, function, expression, or theory based on the work of George Boole is considered Boolean.
Related to this, "Boolean" may refer to:
* Boolean data type, a form of data with only two possible values (usually "true" and "false" ...
by equipping Boolean spaces with relations that correspond to the operators via a
power set construction. In the case of interior algebras the interior (or closure) operator corresponds to a pre-order on the Boolean space. Homomorphisms between interior algebras correspond to a class of continuous maps between the Boolean spaces known as pseudo-epimorphisms or p-morphisms for short. This generalization of Stone duality to interior algebras based on the Jónsson–Tarski representation was investigated by Leo Esakia and is also known as the ''Esakia duality for S4-algebras (interior algebras)'' and is closely related to the
Esakia duality for Heyting algebras.
Whereas the Jónsson–Tarski generalization of Stone duality applies to Boolean algebras with operators in general, the connection between interior algebras and topology allows for another method of generalizing Stone duality that is unique to interior algebras. An intermediate step in the development of Stone duality is
Stone's representation theorem which represents a Boolean algebra as a
field of sets. The Stone topology of the corresponding Boolean space is then generated using the field of sets as a
topological basis. Building on the
topological semantics
In mathematics, topology (from the Greek words , and ) is concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling, and bending; that is, without closing ...
introduced by Tang Tsao-Chen for Lewis's modal logic,
McKinsey and Tarski showed that by generating a topology equivalent to using only the complexes that correspond to open elements as a basis, a representation of an interior algebra is obtained as a
topological field of sets - a field of sets on a topological space that is closed with respect to taking interiors or closures. By equipping topological fields of sets with appropriate morphisms known as field maps C. Naturman showed that this approach can be formalized as a category theoretic Stone duality in which the usual Stone duality for Boolean algebras corresponds to the case of interior algebras having redundant interior operator (Boolean interior algebras).
The pre-order obtained in the Jónsson–Tarski approach corresponds to the accessibility relation in the Kripke semantics for an S4 theory, while the intermediate field of sets corresponds to a representation of the Lindenbaum–Tarski algebra for the theory using the sets of possible worlds in the Kripke semantics in which sentences of the theory hold. Moving from the field of sets to a Boolean space somewhat obfuscates this connection. By treating fields of sets on pre-orders as a category in its own right this deep connection can be formulated as a category theoretic duality that generalizes Stone representation without topology. R. Goldblatt had shown that with restrictions to appropriate homomorphisms such a duality can be formulated for arbitrary modal algebras and modal frames. Naturman showed that in the case of interior algebras this duality applies to more general topomorphisms and can be factored via a category theoretic functor through the duality with topological fields of sets. The latter represent the Lindenbaum–Tarski algebra using sets of points satisfying sentences of the S4 theory in the topological semantics. The pre-order can be obtained as the specialization pre-order of the McKinsey-Tarski topology. The Esakia duality can be recovered via a functor that replaces the field of sets with the Boolean space it generates. Via a functor that instead replaces the pre-order with its corresponding Alexandrov topology, an alternative representation of the interior algebra as a field of sets is obtained where the topology is the Alexandrov bico-reflection of the McKinsey-Tarski topology. The approach of formulating a topological duality for interior algebras using both the Stone topology of the Jónsson–Tarski approach and the Alexandrov topology of the pre-order to form a bi-topological space has been investigated by G. Bezhanishvili, R.Mines, and P.J. Morandi. The McKinsey-Tarski topology of an interior algebra is the intersection of the former two topologies.
Metamathematics
Grzegorczyk proved the elementary theory of closure algebras
undecidable.
[According to footnote 19 in McKinsey and Tarski, 1944, the result had been proved earlier by S. Jaskowski in 1939, but remained unpublished and not accessible ''in view of the present t the timewar conditions''.] Naturman demonstrated that the theory is
hereditarily undecidable (all its subtheories are undecidable) and demonstrated an infinite chain of elementary classes of interior algebras with hereditarily undecidable theories.
Notes
References
* Blok, W.A., 1976, ''Varieties of interior algebras,'' Ph.D. thesis, University of Amsterdam.
* Esakia, L., 2004,
Intuitionistic logic and modality via topology" ''Annals of Pure and Applied Logic 127'': 155-70.
* McKinsey, J.C.C. and
Alfred Tarski, 1944, "The Algebra of Topology," ''Annals of Mathematics 45'': 141-91.
* Naturman, C.A., 1991, ''Interior Algebras and Topology'', Ph.D. thesis, University of Cape Town Department of Mathematics.
* Bezhanishvili, G., Mines, R. and Morandi, P.J., 2008, ''Topo-canonical completions of closure algebras and Heyting algebras'', ''Algebra Universalis 58'': 1-34.
* Schmid, J., 1973, ''On the compactification of closure algebras'', ''Fundamenta Mathematicae 79'': 33-48
* Sikorski R., 1955, ''Closure homomorphisms and interior mappings'', ''Fundamenta Mathematicae 41'': 12-20
Algebraic structures
Mathematical logic
Boolean algebra
Closure operators
Modal logic