format: text

text:
# References

OPERATIONAL GALOIS ADJUNCTIONS111Appeared in “Current Research in Operational Quantum Logic: Algebras, Categories, Languages”, B. Coecke, D.J. Moore and A. Wilce (Eds.), Fundamental Theories of Physics 111, Kluwer Academic Publishers (2000).

BOB COECKE

Department of Mathematics,

Free University of Brussels,

Pleinlaan 2, B-1050 Brussels, Belgium.

e-mail: bocoecke@vub.ac.be

DAVID MOORE222Current address: Department of Physics and Astronomy, University of Canterbury, PO Box 4800, Christchurch, New Zealand.

Department of Theoretical Physics,

University of Geneva,

24 quai Ernest-Ansermet, CH-1211 Geneva 4, Switzerland.

e-mail: David.Moore@phys.canterbury.ac.nz

We present a detailed synthetic overview of the utilisation of categorical techniques in the study of order structures together with their applications in operational quantum theory. First, after reviewing the notion of residuation and its implementation at the level of quantaloids we consider some standard universal constructions and the extension of adjunctions to weak morphisms. Second, we present the categorical formulation of closure operators and introduce a hierarchy of contextual enrichments of the quantaloid of complete join lattices. Third, we briefly survey physical state-property duality and the categorical analysis of derived notions such as causal assignment and the propagation of properties.

1. Introduction

The starting point for the structure theory we shall expose in this paper is the well known fact that preordered sets may be considered as small thin categories; one can then not only reformulate a large part of the theory of order structures in categorical terms, but also apply general categorical techniques to specific order theoretic problems. We provide a brief introduction to category theory in section 2; for detailed presentations see for example \[Adámek, Herrlich and Strecker 1990; Borceux 1994; Mac Lane 1971\]. First, as discussed in section 3, the notion of an adjunction reduces to that of a residuation; the resulting coisomorphy between the categories of join complete lattices and meet complete lattices will provide a guiding principle for the rest of this work. For general expositions of residuation theory see \[Blyth and Janowitz 1972; Derdérian 1967\]. Second, as discussed in section 4, the consideration of simple examples allows the direct characterisation of special morphisms and thereby both the construction of limits and the definition of pseudoadjoints for weak morphisms. Third, as discussed in section 5, following \[Moore 1995, 1997, 2000\] the definition of a monad reduces to that of a closure operator. In particular, the categories of atomistic join complete lattices and closure spaces are equivalent; for a general discussion of the categorical algebra of matroids see \[Faure 1994; Faure and Frölicher 1996, 1998\]. Fourth, as discussed in section 6, following \[Amira, Coecke and Stubbe 1998; Coecke and Stubbe 1999a,b, 2000\] the passage from the static consideration of individual lattices to the dynamic viewpoint of induced quantaloids allows the introduction of an inclusion hierarchy of structures representing successive levels of contextual enrichment. For general expositions of quantaloid theory see \[Rosenthal 1991\]. Fifth, far from being of purely technical interest, this categorical formalism has direct application in operational quantum theory, as developed in \[Aerts 1982, 1994; Jauch and Piron 1969; Piron 1964, 1976, 1990\]. In particular, as discussed in section 7, following \[Moore 1999\] the categorical equivalence between orthogonal spaces and atomistic complete ortholattices determined by the existence of monadic comparison functors has a direct interpretation in terms of the primitive duality between the state and property descriptions of a physical system. By way of application, following \[Faure and Frölicher 1993, 1994, 1995\] one can then reformulate the Hilbertian representation of projective orthogeometries in purely categorical terms. Note that our exposition focuses on the basic structure theory of adjunctions on complete lattices. As such we shall not discuss topics such as orthoadjunctions on orthomodular lattices, an important subject leading to the analysis of Baer -semigroups via the Sasaki projection \[Foulis 1960, 1962\] and the action of conditioning maps on weight spaces \[Foulis and Randall 1971, 1974; Frazer, Foulis and Randall 1980\]. For extensions to test spaces see \[Bennett and Foulis 1998; Wilce 2000\], and for a logical analysis of perfect measurements in this context see \[Coecke and Smets 2000\].

For readability and ease of presentation we have relegated proofs to an appendix. Note that, while several of our results are either new or genuine extensions of standard ones, we would like to emphasise our uniform presentation of the theory and not just its novelty. As such, we have made no attempt to trace the historical origins and development of our categorical approach, preferring to emphasise its coherence as a synthetic tool and its utility in applications. Similarly, our bibliography should be taken as indicative rather than exhaustive. For the reader’s convenience, we end this introduction by collecting together the definitions of the main categories to be treated in the following. We will use abbreviations when denoting Hom-sets, e.g., $`J(L_1,L_2)`$ for those of JCLatt. First, any join preserving map $`f:L_1L_2`$ satisfies the condition $`f(0_1)=f(_1\mathrm{})=_2f(\mathrm{})=_2\mathrm{}=0_2`$. We then obtain the following hierarchy of categories of complete lattices :

Category Map preservation Constraints                     WJCLatt Non-empty joins          JCLatt Arbitrary joins Note : $`f(0_1)=0_2`$         BJCLatt Arbitrary joins, balanced $`f(1_1)=1_2`$         DJCLatt Arbitrary joins, dense $`f(a_1)=0_2a_1=0_1`$

Dualising we obtain the analogous categories of meet preserving maps. Second, the Galois adjunction provides an isomorphism between JCLatt and MCLattop, which restricts to isomorphisms $`\text{BJCLatt}\text{DMCLatt}^{\mathrm{op}}`$ and $`\text{DJCLatt}\text{BMCLatt}^{\mathrm{op}}`$. We shall show that this isomorphism can be extended to weak morphisms in two equivalent manners. Explicitly, for $`L`$ a complete lattice let $`[0,a]=\{xL|x<a\}`$ and $`L^u=L\dot{}\{\mathrm{𝟏}\}`$. Then WMCLattop is isomorphic to each of the categories :

Category Hom-sets Morphisms               PJCLatt $`PJ(L_1,L_2)=_{aL_1}J([0,a_1],L_2)`$ Sectional maps         UJCLatt $`UJ(L_1,L_2)=BJ(L_1^u,L_2^u)`$ Upper maps

Third, for complete atomistic lattices the duality between JCLatt and MCLatt also restricts to atomic morphisms. Explicitly, let $`\mathrm{\Sigma }_L`$ be the set of atoms of $`L`$ and $`\alpha :\mathrm{\Sigma }_1K_1\mathrm{\Sigma }_2`$ be a continuous partial map between the closure spaces $`(\mathrm{\Sigma }_1,T_1)`$ and $`(\mathrm{\Sigma }_2,T_2)`$. We then obtain the dual categories :

Category Morphisms Induced from closure               JCALatt $`f(\mathrm{\Sigma }_{L_1})\mathrm{\Sigma }_{L_2}`$ $`f_\alpha :A_1T_2f(A_1K_1)`$         MCALatt $`(p_1p_2)p_1<g(p_2)`$ $`g_\alpha :A_2K_1f^1(A_2)`$

Note that the categories JCALatt and CSpace are equivalent. Fourth, applying the power construction to complete lattices we obtain an inclusion hierarchy of quantaloids expressing successive degrees of contextual enrichment. Explicitly, define $`P_0(L)=P(L\{0\})`$, and for $`fJ(L_1,L_2)`$ and $`\theta J(P_0(L_1),P_0(L_2))`$ let us write $`f\theta `$ if $`f(A_1)=\theta (A_1)`$ for each $`A_1P_0(L)`$. We then obtain :

Category Morphisms Name               PStruct $`P_f`$ for $`fJ(L_1,L_2)`$ Power structures         BStruct $`_\alpha P_{f_\alpha }`$ for $`f_\alpha J(L_1,L_2)`$ Based structures         TStruct $`(f,\theta )`$ for $`f\theta `$ Transition structures         FStruct $`\theta J(P_0(L_1),P_0(L_2))`$ Functional structures

2. Category theory

At the most naive level, category theory may be construed as a hierarchy of object-structure relations, the standard definitions then reducing to unicity requirements for induced relations. First, if the morphism $`f`$ relates the objects $`A`$ and $`B`$ and the morphism $`g`$ relates the objects $`B`$ and $`C`$ then it is natural to suppose the existence of an induced relation $`gf`$ between $`A`$ and $`C`$: since identification provides a canonical relation between $`A`$ and itself we are then led to suppose the existence of identity morphisms as compositional units; since $`h(gf)`$ and $`(hg)f`$ are both induced relations between $`A`$ and $`D`$ we are led to require associativity considered as order indifference of concatenation. We then recover the usual definition of a category. Second, a relation between morphisms should respect the structurally important features involved in the concept of a morphism : a functor $`F`$ should then relate the domain and codomain objects of the initial morphism to those of the final morphism, so that $`Ff:FAFB`$ for $`f:AB`$: identity morphisms form a distinguished class and so should be preserved; the two induced relations $`F(gf)`$ and $`FgFf`$ between $`FA`$ and $`FB`$ should coincide. We then recover the usual definition of a functor. Third, any relation $`\theta `$ between two functors $`F`$ and $`G`$ should induce a relation or morphism $`\theta _A`$ between $`FA`$ and $`GA`$: further for $`f:AB`$ the two induced relations $`\theta _BFf`$ and $`Gf\theta _A`$ between $`FA`$ and $`GB`$ should coincide. We then recover the usual definition of a natural transformation.

Much of the power of category theory is due to the notion of universal constructions. A local approach is through the dual notions of limits and colimits of diagrams, where a diagram is an indexed set of objects subject to structural relations, that is, a functor $`:\text{J}\text{X}`$ where J is a small index category encoding the constraints. Now, to relate diagrams to compatible objects it suffices to remark that each object $`A`$ can be modeled by the corresponding constant functor $`C_A:\text{J}\text{X}`$. By definition, a source is then a natural transformation $`p:C_A`$. In this way we obtain limits as distinguished sources $`p`$ such that for any other source $`\overline{p}`$ there exists a unique morphism $`f`$ satisfying $`\overline{p}=pf`$. On the other hand, a global approach to universal constructions is provided by the notion of adjoint functors. Explicitly, let $`F:\text{X}\text{Y}`$ and $`G:\text{Y}\text{X}`$. Now we can only directly relate functors with the same domain and codomain. We are then led to define $`FG`$ if there exist natural transformations $`\eta :\mathrm{Id}_{\underset{¯}{\mathrm{X}}}GF`$ and $`\epsilon :FG\mathrm{Id}_{\underset{¯}{\mathrm{Y}}}`$ satisfying the coherence conditions $`\epsilon FF\eta =\mathrm{id}F`$ and $`G\epsilon \eta G=\mathrm{id}G`$. Note that the two conceptions of universality are closely interrelated. For example, if $`FG`$ then $`G`$ preserves limits and $`F`$ preserves colimits, and any two (co)adjoints of the same functor are naturally isomorphic. Further, products, defined as limits of trivial diagrams whose index category has only identity morphisms, may be globalised as adjoints of the appropriate diagonal functors. Finally, two categories are called equivalent if there exist natural isomorphisms $`\phi :\mathrm{Id}_{\underset{¯}{\mathrm{X}}}GF`$ and $`\psi :\mathrm{Id}_{\underset{¯}{\mathrm{Y}}}FG`$ satisfying the equivalent coherence conditions $`F\phi =\psi F`$ and $`\phi G=G\psi `$. Note that in this case $`FGF`$, the two functors $`F`$ and $`G`$ then preserving (co)limits and adjunctions.

Often one is interested in categories A which can be considered as specialisations of some base category X . For example, we may wish to treat objects in A as objects in X together with extra structure, and morphisms in A as morphisms in X which respect that structure in some sense. We are then led to define a concrete category over the category X to be a pair $`(\text{A},U)`$, where A is a category and $`U`$ is a faithful functor from A to X , that is, a functor which is injective on Hom-sets. It is then of interest to consider those morphisms $`f:UAUB`$ in X which lift, in the sense that there exists $`\phi :AB`$ with $`U\phi =f`$. For example, $`\phi :AB`$ is called initial if $`f:UA^{}UA`$ lifts whenever $`U\phi f`$ does, or final if $`g:UBUB^{}`$ lifts whenever $`fU\phi `$ does. Next, each fibre $`F(X)=U^1(X)`$ has a natural preorder defined by $`AB`$ if $`\mathrm{id}_X:UAUB`$ lifts. In particular, categories whose fibres are ordered by equality have algebraic character, whereas those whose fibres are complete lattices have topological character. Finally, an important step in category theory is to replace Hom-sets by objects in an appropriate structure category, leading to the notion of enrichment. Explicitly, in order to define composition adequately we require that the structure category V be symmetric monoidal closed, in the sense that there exists a tensor functor $`:\text{V}\times \text{V}\text{V}`$ and unit object $`I\mathrm{Ob}(\text{V})`$ such that the usual composition laws may be replaced by coherent natural transformations. For example, standard categories are just categories over Set , $`2`$-categories are defined to be categories over Cat , and quantaloids may be considered as categories enriched in join complete lattices \[Borceux and Stubbe 2000\]. Quantales then represent the monoidal one-object restrictions \[Paseka and Rosický 2000\]. We obtain quantale and quantaloid morphisms as the corresponding $`\underset{¯}{JCLatt}`$-enriched functors.

Finally, much of the theory of order structures can be reformulated in purely categorical terms by remarking that preordered classes are in bijective correspondence with thin categories, namely categories for which each Hom-set has at most one element. Explicitly, $`a<b`$ if and only if $`\mathrm{Hom}(a,b)\mathrm{}`$, reflexivity being the existence of identity morphisms and transitivity being the condition of morphism composability. Note that the unicity of a morphism $`\alpha :ab`$ implies that any diagram which can be written must commute. In particular, products are exactly meets, $`(\alpha \mathrm{\Omega })(x<a_\alpha )x<_\alpha a_\alpha `$, whereas coproducts are exactly joins, $`(\alpha \mathrm{\Omega })(a_\alpha <x)_\alpha a_\alpha <x`$. Further, a functor between two preordered classes is exactly an isotone map, preservation of order being exactly preservation of composition. In particular, there exists a natural transformation $`\theta :fg`$ if and only if $`f<g`$, this being the necessary and sufficient condition for the existence of morphisms $`\theta _a:f(a)g(a)`$. For isotone maps $`f:L_1L_2`$ and $`g:L_2L_1`$, we then have that $`fg`$ if and only if $`\mathrm{id}_1<(gf)`$ and $`(fg)<\mathrm{id}_2`$, these being the necessary and sufficient conditions for the existence of natural transformations $`\eta :\mathrm{id}_1(gf)`$ and $`\epsilon :(fg)\mathrm{id}_2`$. Note that in this context quantaloids are exactly locally complete and thin $`2`$-categories. For convenience, in the following we shall restrict our attention to posets, that is, small thin categories for which no two distinct elements are isomorphic. For such categories natural isomorphy reduces to identity, so that adjoints are unique when they exist.

3. Morphisms and adjunctions

In this preliminary section we recall some elementary facts about adjunctions on posets considered as thin categories, results which form the core of the rest of this work. Explicitly, we start by transcribing the definition and basic properties of adjunctions in the context of posets, before turning to limit preservation properties in the context of complete lattices. We then globalise these observations to categories of posets and finish with some remarks on the orthocomplemented case. Let $`f`$ and $`g`$ be isotone maps on posets. Then :

\[3.1.1\] $`\mathrm{id}_1<(gf)`$ & $`(fg)<\mathrm{id}_2`$ iff $`f(a_1)<a_2a_1<g(a_2)`$;

\[3.1.2\] $`f`$ is an isomorphism with inverse $`g`$ iff $`fgf`$;

\[3.1.3\] If $`fg`$ then $`fgf=f`$ and $`gfg=g`$;

\[3.1.4\] If $`fg`$ and $`\overline{f}\overline{g}`$ then $`f<\overline{f}\overline{g}<g`$;

\[3.1.5\] $`\mathrm{id}\mathrm{id}`$, and if $`fg`$ and $`\overline{f}\overline{g}`$ then $`(\overline{f}f)(g\overline{g})`$.

The first result gives a more practical form for the adjunction condition, whereas the second encodes isomorphy as equivalence. The third result establishes adjunctions as pseudoinverses. As we shall see later, the fourth result enables a globalisation of adjunctions from the level of individual posets to the level of categories of posets, the fifth leading to a natural generalisation to quantaloids. Next, transcribing the limit preservation properties of adjunctions we obtain the following results for isotone maps on complete lattices :

\[3.2.1\] If $`fg`$ then $`f(A_1)=f(A_1)`$ and $`g(A_2)=g(A_2)`$;

\[3.2.2\] If $`f(A_1)=f(A_1)`$ then $`ff^{}:L_2L_1:a_2\{a_1L_1|f(a_1)<a_2\}`$;

\[3.2.3\] If $`g(A_2)=g(A_2)`$ then $`gg_{}:L_1L_2:a_1\{a_2L_2|a_1<g(a_2)\}`$;

\[3.2.4\] If $`f_\alpha g_\alpha `$ then $`_\alpha f_\alpha _\alpha g_\alpha `$;

\[3.2.5\] If $`fg`$, $`f_\alpha g_\alpha `$ then $`f(_\alpha f_\alpha )_\alpha (g_\alpha g)`$, $`(_\alpha f_\alpha )f_\alpha (gg_\alpha )`$.

The first result implies that join (meet) preservation is a necessary condition for the existence of a right (left) adjoints, the second and third implying sufficiency. The fourth result implies that the set $`J(L_1,L_2)`$ of join preserving maps between the complete lattices $`L_1`$ and $`L_2`$ is a complete lattice with respect to the pointwise join, whereas the set $`M(L_2,L_1)`$ of meet preserving maps between the complete lattices $`L_2`$ and $`L_1`$ is a complete lattice with respect to the pointwise meet. Finally, the fifth result implies that composition distributes on both sides over joins in JCLatt and meets in MCLatt . In particular, the category JCLatt provides the paradigm example of a quantaloid.

In our last remarks we have implicitly used Birkhoff’s theorem, which states that any join complete lattice is also meet complete and conversely. Note that this result may be construed as an application of the adjoint functor theorem to the indexed diagonal functor $`\mathrm{\Delta }:L\times _\alpha L:a(a_\alpha =a)`$, since $`L`$ is complete if and only if $`J\mathrm{\Delta }M`$, with $`J`$ the join and $`M`$ the meet. Nevertheless, as is typical in category theory, join and meet completeness are rather different at the level of morphisms. For example, let $`M(L_1,L_2)^{\mathrm{co}}`$ be the complete lattice of meet preserving maps with opposite pointwise order, MCLattop be the category of complete lattices with meet preserving maps and opposite Hom-sets, and MCLattcoop be the quantaloid of complete lattices with meet preserving maps, opposite pointwise order and opposite Hom-sets. Considering the families of maps $`A^{}:LL;ff^{}`$ and $`A_{}:LL;gg_{}`$ we then obtain :

\[3.3.1\] $`J(L_1,L_2)`$ is isomorphic as a complete lattice to $`M(L_2,L_1)^{\mathrm{co}}`$;

\[3.3.2\] JCLatt is isomorphic as a category to MCLattop;

\[3.3.3\] JCLatt is isomorphic as a quantaloid to MCLattcoop.

Finally, the above dualities can be usefully restricted to orthocomplemented lattices, that is, bounded lattices $`L`$ equipped with an operation $`{}_{}{}^{}:LL`$ satisfying : $`a<bb^{}<a^{}`$; $`a^{\prime \prime }=a`$; $`aa^{}=0`$. Explicitly, for $`\alpha :L_1L_2`$ a map between orthocomplemented lattices let $`C(\alpha ):L_1L_2:a_1\alpha (a_1^{})^{}`$ be the conjugate map. For $`fg`$ we then define the orthoadjoints $`f^{}:L_2L_1:a_2g(a_2^{})^{}`$ and $`g_{}:L_1L_2:a_1f(a_1^{})^{}`$. Let us write IoLatt for the category of orthocomplemented lattices with isotone maps, JCoLatt and MCoLatt for the categories of complete orthocomplemented lattices with respectively join or meet preserving maps, and COLatt for the category of complete lattices with maps preserving the join, the meet, and the orthocomplementation. Then :

\[3.4.1\] $`C`$ is an endofunctor on IoLatt restricting to $`\text{JCoLatt}\text{MCoLatt}`$;

\[3.4.2\] In JCoLatt we have $`(f_1f_2)^{}=f_2^{}f_1^{}`$, $`f^{}=f`$, $`f^{}f=0_1f=0_2`$;

\[3.4.3\] In JCoLatt we have $`u^{}u=\mathrm{id}`$ iff $`a_1<b_1^{}u(a_1)<u(b_1)^{}`$;

\[3.4.4\] In COLatt we have $`h_{}(a_2^{})=h^{}(a_2)^{}`$, $`h^{}=h_{}`$, $`hh^{}h=h`$.

The first result implies that JCoLatt is self-dual. The second result exhibits JCoLatt as a regular $``$-semigroup. The third result classifies isometries in JCoLatt , whereas the fourth implies that all orthomorphisms are partially isometric.

4. Special morphisms

As is usual in category theory, it is important to have a number of examples of particular morphisms such as constant maps or subobject inclusions. First, for $`\mathrm{𝟐}`$ the two-element lattice and $`[0,a]=\{xL|x<a\}`$ a lower interval, let

$`\alpha _a:`$ $`\mathbf{\hspace{0.17em}2}L:00;1a`$ $`C^a:`$ $`L\mathrm{𝟐}:x1(a<x);0(ax);`$   $`\alpha ^a:`$ $`\mathbf{\hspace{0.17em}2}L:0a;11`$ $`C_a:`$ $`L\mathrm{𝟐}:x0(x<a);1(xa);`$         $`i_a:`$ $`[0,a]L:xx`$ $`\widehat{ı}{}_{a}{}^{}:`$ $`[0,a]L:xx(xa);1(x=a);`$   $`\pi _a:`$ $`L[0,a]:xxa`$ $`\widehat{\pi }{}_{a}{}^{}:`$ $`L[0,a]:xx(x<a);a(xa).`$

For any adjunction $`fg`$ we then obtain :

\[4.1.1\] $`\alpha _aC^a`$ with $`f\alpha _{a_1}=\alpha _{f(a_1)}`$ and $`C^{a_1}g=C^{f(a_1)}`$;

\[4.1.2\] $`C_a\alpha ^a`$ with $`g\alpha ^{a_2}=\alpha ^{g(a_2)}`$ and $`C_{a_2}f=C_{g(a_2)}`$;

\[4.1.3\] $`i_a\pi _a`$ with $`\pi _ai_a=\mathrm{id}`$, and $`\widehat{\pi }{}_{a}{}^{}\widehat{ı}_a`$ with $`\widehat{\pi }{}_{a}{}^{}\widehat{ı}{}_{a}{}^{}=\mathrm{id}`$.

Note that the $`\alpha _a`$ exhaust join preserving maps $`\alpha :\mathrm{𝟐}L`$, since any such map must satisfy $`\alpha (0)=0`$, whereas the $`\alpha ^a`$ exhaust meet preserving maps $`\alpha :\mathrm{𝟐}L`$, since any such map must satisfy $`\alpha (1)=1`$. In particular, the $`C^a`$ exhaust meet preserving maps $`C:L\mathrm{𝟐}`$ whereas the $`C_a`$ exhaust join preserving maps $`C:L\mathrm{𝟐}`$. Here the restriction to complete join maps is essential; indeed the kernels of finite join maps $`f:L\mathrm{𝟐}`$ are exactly the ideals on $`L`$, such an ideal being prime if and only if $`f`$ also preserves finite meets. Now, if $`f:L_1L_2`$ preserves joins then $`f(0_1)=0_2`$: we then call $`f`$ balanced if $`f(1_1)=1_2`$ or dense if $`f(a_1)=0_2a_1=0_1`$. Dually, if $`g:L_2L_1`$ preserves meets then $`g(1_2)=1_1`$: we then call $`g`$ balanced if $`g(0_2)=0_1`$ or dense if $`g(a_2)=1_1a_2=1_2`$. Note that a morphism in either JCLatt or MCLatt is injective only if it is dense, or surjective only if it is balanced. Recall that $`h`$ is called an epimorphism if $`h_1h=h_2hh_1=h_2`$, or a monomorphism if $`hh_1=hh_2h_1=h_2`$. For $`fg`$ an adjunction we then obtain :

\[4.2.1\] $`f`$ is balanced iff $`g`$ is dense , or dense iff $`g`$ is balanced ;

\[4.2.2\] $`f`$ is epic iff $`f`$ is surjective iff $`fg=\mathrm{id}_2`$ iff $`g`$ is injective iff $`g`$ is monic ;

\[4.2.3\] $`f`$ is monic iff $`f`$ is injective iff $`gf=\mathrm{id}_1`$ iff $`g`$ is surjective iff $`g`$ is epic .

The first result implies that the categories BJCLatt with balanced join morphisms and DMCLattop with opposite dense meet morphisms are isomorphic, as are the categories DJCLatt and BMCLattop. The second and third results render explicit the general duality between epimorphisms and monomorphisms together with their standard set theoretic interpretations. Finally, if $`\overline{f}f=\mathrm{id}`$ then $`f`$ is called a section and $`\overline{f}`$ is called a retraction; each section is monic and each retraction is epic. For example, $`(\widehat{\pi }{}_{a}{}^{}i_a)(x)=\widehat{\pi }{}_{a}{}^{}(x)=x`$, so that $`\widehat{\pi }_a`$ is a retraction and $`i_a`$ is a section in JCLatt . Similarly, $`(\pi _a\widehat{ı}{}_{a}{}^{})(x)=[\pi _a(x)(xa);\pi _a(1)(x=a)]=x`$, so that $`\pi _a`$ is a retraction and $`\widehat{ı}_a`$ is a section in MCLatt .

Next, recall that the direct product $`\times _\alpha L_\alpha `$ of the family of bounded posets $`L_\alpha `$ is the Cartesian product of the $`L_\alpha `$ equipped with the pointwise order. We may then define the maps :

$`\mathrm{\Pi }_\beta :`$ $`\times _\alpha L_\alpha L_\beta :(a_\alpha )a_\beta ;`$   $`i_\beta :`$ $`L_\beta \times _\alpha L_\alpha :b(a_\alpha )\text{with}a_\alpha =b(\alpha =\beta );0(\alpha \beta );`$   $`j_\beta :`$ $`L_\beta \times _\alpha L_\alpha :b(a_\alpha )\text{with}a_\alpha =b(\alpha =\beta );1(\alpha \beta ).`$

On the other hand, recall that the horizontal sum $`\dot{}_\alpha L_\alpha `$ of the $`L_\alpha `$ is the disjoint union of the $`L_\alpha \{0_\alpha ,1_\alpha \}`$ with componentwise order and adjoined minimal and maximal elements. We may then define the maps :

$`\mathrm{I}_\beta :`$ $`L_\beta \dot{}{}_{\alpha }{}^{}L_{\alpha }^{}:bb;`$   $`\sigma _\beta :`$ $`\dot{}{}_{\alpha }{}^{}L_{\alpha }^{}L_\beta :xx(xL_\beta );1(xL_\beta );`$   $`\rho _\beta :`$ $`\dot{}{}_{\alpha }{}^{}L_{\alpha }^{}L_\beta :xx(xL_\beta );0(xL_\beta ).`$

Finally, recall that a product of the family of objects $`L_\beta `$ is an object $`\overline{L}`$ together with a family of morphisms $`\overline{p}{}_{\beta }{}^{}:\overline{L}L_\beta `$ such that for any object $`L`$ and any family of morphisms $`p_\beta :LL_\beta `$ there exists a unique morphism $`\theta :L\overline{L}`$ satisfying $`p_\beta =\overline{p}{}_{\beta }{}^{}\theta `$; coproducts being products in the opposite category. Then :

\[4.3.1\] $`i_\beta \mathrm{\Pi }_\beta j_\beta `$ and $`\sigma _\beta \mathrm{I}_\beta \rho _\beta `$;

\[4.3.2\] $`\mathrm{\Pi }_\beta `$ is the product in BPos , JCLatt and MCLatt ;

\[4.3.3\] The coproducts in BPos , JCLatt , MCLatt are $`\mathrm{I}_\beta `$, $`i_\beta `$, $`j_\beta `$.

In particular, $`\mathrm{\Pi }_\beta `$ preserves both the join and the meet, $`i_\beta `$ preserves the join and $`j_\beta `$ preserves the meet. Further, $`i_\beta `$ preserves non-empty meets however $`i_\beta (1)1`$, whereas $`j_\beta `$ preserves non-empty joins however $`j_\beta (0)0`$. We then have simple examples of weak morphisms. On the other hand, $`\mathrm{I}_\beta `$ preserves both the join and the meet, $`\sigma _\beta `$ preserves the join and $`\rho _\beta `$ preserves the meet. Further, $`\sigma _\beta (1)=1`$ however $`\sigma _\beta `$ does not preserve binary meets, whereas $`\rho _\beta (0)=0`$ however $`\rho _\beta `$ does not preserve binary joins. We then have simple examples of balanced morphisms.

Finally, in applications one is often led to consider maps $`f:L_1L_2`$ which preserve non-empty joins or maps $`g:L_2L_1`$ which preserve non-empty meets. In this way we obtain the categories WJCLatt and WMCLatt . While such maps do not possess strict Galois adjoints, by considering either codomain restrictions or pointed extensions we can nevertheless introduce the notion of weak adjunctions. Explicitly, let $`g:L_2L_1`$ preserve non-empty meets but not necessarily satisfy $`g(1_2)=1_1`$. Then, for $`L^u=L\dot{}\{\mathrm{𝟏}\}`$ the upper pointed extension with adjoined universal maximal element $`a<\mathrm{𝟏}`$, the two maps $`g^p:L_2[0_1,g(1_2)]:a_2g(a_2)`$ and $`g^u:L_2^uL_1^u:a_2g(a_2);\mathbf{\hspace{0.17em}1}\mathrm{𝟏}`$ do preserve arbitrary meets, and so have respective left adjoints $`f^p:[0_1,g(1_2)]L_2`$ and $`f^u:L_1^uL_2^u`$. Now $`f^p`$ is of the form $`\alpha _1:[0_1,a_1]L_2`$ whereas $`g^u`$ is dense, $`g^u(a_2)=\mathrm{𝟏}a_2=\mathrm{𝟏}`$, so that $`f^u`$ is balanced, $`f^u(\mathrm{𝟏})=\mathrm{𝟏}`$. We are then led to consider the categories PJCLatt with sectional partial morphisms, $`PJ(L_1,L_2)=_{a_1L_1}J([0_1,a_1],L_2)`$, and UJCLatt with upper pointed morphisms, $`UJ(L_1,L_2)=BJ(L_1^u,L_2^u)`$. Note that for maps $`\alpha _1:[0_1,a_1]L_2`$ and $`\alpha _2:[0_2,a_2]L_3`$ we have $`(\alpha _2\alpha _1):[0_1,\alpha _1^{}(a_2)]L_3`$, since $`\alpha _1(x_1)[0_2,a_2]\alpha _1(x_1)<a_2x_1<\alpha _1^{}(a_2)`$. Now, given morphisms $`\alpha PJ(L_1,L_2)`$ and $`FUJ(L_1,L_2)`$ let us define the maps

$`F_\alpha :`$ $`L_1^uL_2^u:x_1\alpha (a_1)(x_1<a_1);\mathbf{1}(x_1a_1);`$   $`G_\alpha :`$ $`L_2^uL_1^u:x_2\alpha ^{}(x_2);\mathbf{1}\mathrm{𝟏};`$      $`\alpha _F:`$ $`[0_1,F^{}(1_2)]L_2:x_1F(x_1);`$   $`\beta _F:`$ $`L_2[0_1,F^{}(1_2)]:x_2F^{}(x_2).`$

For $`gWM(L_1,L_2)`$ we then obtain :

\[4.4.1\] $`F_\alpha G_\alpha `$ with $`F_{\alpha _2\alpha _1}=F_{\alpha _2}F_{\alpha _1}`$ and $`F_{\alpha _F}=F`$;

\[4.4.2\] $`\alpha _F\beta _F`$ with $`\alpha _{F_2F_1}=\alpha _{F_2}\alpha _{F_1}`$ and $`\alpha _{F_\alpha }=\alpha `$;

\[4.4.3\] If $`\alpha g^p`$ and $`Fg^u`$ then $`\alpha =\alpha _F`$ and $`F=F_\alpha `$.

The first and second results enable us to pass from partial morphisms to pointed morphisms and conversely in a functorial manner, the third result implying that the two methods of defining weak adjoints are equivalent. In particular, the three categories PJCLatt , WMCLattop and UJCLatt are isomorphic.

5. Monads and closure operators

Recall that a monad on the category X is a triple $`(T,\eta ,\mu )`$ consisting of an endofunctor $`T`$ together with natural transformations $`\eta :\mathrm{Id}T`$ and $`\mu :TTT`$ satisfying the coherence conditions : $`\mu T\mu =\mu \mu T`$; $`\mu T\eta =\mathrm{id}T`$; $`\mu \eta T=\mathrm{id}T`$. Note that if $`LR`$ is an adjunction via the natural transformations $`\eta `$ and $`\epsilon `$ then $`(RL,\eta ,R\epsilon L)`$ is a monad. On the other hand, if $`(T,\eta ,\mu )`$ is a monad then setting $`\mathrm{Ob}(\text{X}^T)`$ to be the set of $`T`$-algebras $`(A,\alpha )`$, where $`\alpha :TAA`$ satisfies $`\alpha \eta _A=\mathrm{id}_A`$ and $`\alpha T\alpha =\alpha \mu _A`$, and $`\mathrm{Hom}((A,\alpha ),(B,\beta ))`$ to be the set of $`T`$-morphisms $`f:AB`$, where $`f\alpha =\beta Tf`$, we obtain the so-called Eilenberg-Moore category generated by the adjunction $`F^TU^T`$, where $`F^T:A(TA,\mu _A);fTf`$ and $`U^T:(A,\alpha )A;ff`$. Further, for any monad of the form $`T=RL`$ there exists a unique functor $`K:\text{Y}\text{X}^T`$ such that $`R=U^TK`$ and $`F^T=KL`$. Explicitly, $`K:A(RA,R\epsilon _A);fRf`$. Now in the context of posets considered as thin categories the coherence conditions are trivially satisfied, since any diagram which can be written must commute. An isotone map $`T:LL`$ is then a monad if and only if the natural transformations $`\eta `$ and $`\mu `$ exist, which is the case if and only if $`\mathrm{id}<T`$ and $`TT<T`$ so that $`T`$ is a closure operator. First, there exists a morphism $`\alpha :Taa`$ if and only if $`Ta<a`$, which is the case if and only if $`Ta=a`$. The category $`L^T`$ is then the set of fixed points of $`T`$. Second, since $`F^TU^T`$ we have that $`F^T`$ preserves colimits and $`U^T`$ preserves limits. In particular, if $`L`$ is a complete lattice then so is $`L^T`$, with $`_TA=A`$ and $`_TA=T(A)`$. Third, if $`fg`$ then $`fgf=f`$ and $`gfg=g`$, so that the Eilenberg-Moore category of the monad $`gf`$ is given by the image of $`g`$.

Recall that an atom of the lattice $`L`$ is a minimal nonzero element and that the complete lattice $`L`$ is called atomistic if $`a=\{p\mathrm{\Sigma }_L|p<a\}`$ for each $`aL`$, where $`\mathrm{\Sigma }_L`$ is the set of atoms of $`L`$. A closure operator $`T:LL`$ on the atomistic lattice is then called simple if $`T(0)=0`$ and $`T(p)=p`$ for each $`p\mathrm{\Sigma }_L`$. Since the atoms are all fixed points, the Eilenberg-Moore category associated to any simple closure operator is also atomistic. As we shall now indicate, we then obtain an equivalence between suitable categories of complete atomistic lattices and closure spaces, namely sets $`\mathrm{\Sigma }`$ equipped with a simple closure operator on $`P(\mathrm{\Sigma })`$. Explicitly, let $`fg`$ be an adjunction between complete atomistic lattices and $`\alpha :\mathrm{\Sigma }_1K_1\mathrm{\Sigma }_2`$ be a partially defined map between closure spaces. Then :

\[5.1.1\] $`f(\mathrm{\Sigma }_{L_1})\mathrm{\Sigma }_{L_2}\{0_2\}`$ iff $`(p_1\mathrm{\Sigma }_{L_1})(p_2\mathrm{\Sigma }_{L_2})p_1<g(p_2)`$;

\[5.1.2\] $`\alpha (T_1A_1K_1)T_2\alpha (A_1K_1)`$ iff $`K_1\alpha ^1(A_2)`$ is closed for $`A_2`$ closed;

\[5.1.3\] The above conditions are stable under composition.

We then obtain the dual categories JCALatt and MCALatt together with the category CSpace of closure spaces. Next, given morphisms $`\alpha CS((\mathrm{\Sigma }_1,T_1),(\mathrm{\Sigma }_2,T_2))`$ and $`fJA(L_1,L_2)`$ let us define

$`f_\alpha `$ $`:P(\mathrm{\Sigma }_1)^{T_1}P(\mathrm{\Sigma }_2)^{T_2}:A_1T_2f(A_1K_1),`$   $`g_\alpha `$ $`:P(\mathrm{\Sigma }_2)^{T_2}P(\mathrm{\Sigma }_2)^{T_1}:A_2K_1f^1(A_2),`$   $`\alpha _f`$ $`:\mathrm{\Sigma }_1\{p_1\mathrm{\Sigma }_1|f(p_1)=0_2\}\mathrm{\Sigma }_2:p_1f(p_1).`$

Further, let $`i:LP(\mathrm{\Sigma }_L):a\{p\mathrm{\Sigma }|p<a\}`$ and $`\pi :P(\mathrm{\Sigma }_L)L:AA`$, with $`:(\mathrm{\Sigma },T)P(\mathrm{\Sigma })^T;\alpha f_\alpha `$ and $`𝒞:L(\mathrm{\Sigma }_L,i\pi );f\alpha _f`$. We obtain :

\[5.2.1\] $`\pi i`$ with associated simple closure $`i\pi :A\{p\mathrm{\Sigma }|p<A\}`$;

\[5.2.2\] $`\alpha _f`$ is a morphism of closure spaces;

\[5.2.3\] $`f_\alpha g_\alpha `$ is an adjunction of complete atomistic lattices;

\[5.2.4\] $`𝒞`$ is an equivalence between CSpace and JCALatt .

Note that these results restrict in a canonical manner to complete atomistic ortholattices. Indeed, for each such lattice let us define the binary relation $``$ on $`\mathrm{\Sigma }_L`$ by $`pq`$ if $`p<q^{}`$. Then the induced map $`T:P(\mathrm{\Sigma }_L)P(\mathrm{\Sigma }_L):AA^{}`$ with $`A^{}=\{q\mathrm{\Sigma }|(pA)pq\}`$ is a simple closure operator, with $`A\mathrm{\Sigma }_L`$ biorthogonal if and only if $`A=\{p\mathrm{\Sigma }_L|p<A\}`$. Now $``$ is symmetric, $`pqqp`$, antireflexive, $`pqpq`$, and separating, $`pq(r\mathrm{\Sigma }_L)pr\&q/r`$. In fact the last condition is exactly the requirement that singletons be biorthogonal. We then obtain an equivalence between the category JCAoLatt of atomistic join complete ortholattices and the category OSpace of orthogonality spaces.

The above considerations allow us to recover some standard results concerning power functors and complete Boolean algebras, results which will be generalised in the next section to transition structures. First, let CaBAlg be the category of complete atomic Boolean algebras with as morphisms all maps preserving the join, the meet, and the orthocomplementation. Note that any two of these conditions implies the third. Indeed, $`A=(A^{})^{}`$ and $`A=(A^{})^{}`$ so that any map which preserves the join and the orthocomplementation also preserves the meet, whereas any map which preserves the meet and the orthocomplementation also preserves the join. On the other hand, if $`f`$ preserves finite joins and meets and satisfies $`f(0_1)=0_2`$ and $`f(1_1)=1_2`$, then $`f(a_1)f(a_1^{})=f(a_1a_1^{})=f(0_1)=0_2`$ and $`f(a_1)f(a_1^{})=f(a_1a_1^{})=f(1_1)=1_2`$, so that $`f(a_1^{})=f(a_1)^{}`$ since any Boolean algebra is uniquely complemented. Second, given the set function $`\alpha :\mathrm{\Sigma }_1\mathrm{\Sigma }_2`$ define $`S_\alpha :P(\mathrm{\Sigma }_2)P(\mathrm{\Sigma }_1):A_2\{x_1\mathrm{\Sigma }_1|\alpha (x_1)A_2\}`$ and $`P_\alpha :P(\mathrm{\Sigma }_1)P(\mathrm{\Sigma }_2):A_1\{x_2\mathrm{\Sigma }_2|(x_1A_1)\alpha (x_1)=x_2\}`$. Third, for $`B`$ a complete atomistic Boolean algebra let $`\mu _B:BP(\mathrm{\Sigma }_B):a\{p\mathrm{\Sigma }_B|p<a\}`$ and $`\rho _B:P(\mathrm{\Sigma }_B)B:AA`$. Then for $`fg`$ an adjunction between complete atomistic Boolean algebras we obtain :

\[5.3.1\] $`P_\alpha S_\alpha `$, with $`\alpha `$ injective iff $`S_\alpha P_\alpha =\mathrm{id}`$ or surjective iff $`P_\alpha S_\alpha =\mathrm{id}`$;

\[5.3.2\] $`\mu _B\rho _B`$ is an equivalence, and $`f(\mathrm{\Sigma }_{B_1})\mathrm{\Sigma }_{B_2}`$ iff $`g(a_2^{})=g(a_2)^{}`$.

The first result implies that the maps $`S:\text{Set}\text{CaBalg}^{\mathrm{op}}:\mathrm{\Sigma }P(\mathrm{\Sigma });\alpha S_\alpha `$ and $`P:\text{Set}\text{JCLatt}:\mathrm{\Sigma }P(\mathrm{\Sigma });\alpha P_\alpha `$ are functors. Indeed, $`S`$ is well defined, $`x_1S_\alpha (A_2^c)\alpha (x_1)A_2^c\alpha (x_1)A_2x_1S_\alpha (A_2)x_1S_\alpha (A_2)^c`$, and functorial, since we have $`xS_{\mathrm{id}}(A)(yA)x=\mathrm{id}(x)=yxA`$ and $`x_1S_{\alpha _2\alpha _1}(A_3)(\alpha _2\alpha _1)(x_1)A_3\alpha _1(x_1)S_{\alpha _2}(A_3)x_1(S_{\alpha _1}S_{\alpha _2})(A_3)`$. The second result implies that $`S`$ is an equivalence : by the first part the equivalence between closure spaces and complete atomistic lattices with join preserving atomic maps restricts to an equivalence between sets and complete atomistic Boolean algebras with join preserving kernel free atomic maps, whereas by the second part this latter category is dual to the category of complete atomistic Boolean algebras with maps preserving the meet, the orthocomplement, and so the join.

6. Transition structures

Now, in applying the power construction to complete lattices we have two relevant orders, namely $`AB`$ in $`P(L)`$ and $`a<b`$ in $`L`$. It is then of interest to consider the strong preorder on $`P(L)`$ defined by $`AB`$ if $`A<B`$. Note that this preorder is indeed superordinate to both of the original orders, since we have that $`ABA<BAB`$ and $`a<b\{a\}=a<b=\{b\}\{a\}\{b\}`$. Further, in the context of join preserving maps the minimal element may be treated as redundant, since all such maps satisfy the condition $`f(0_1)=0_2`$. We are then lead to consider the truncated power set $`P_0(L)=P(L\{0\})`$. This reduction is reasonable, since $`P(L)=P((L\{0\})\{0\})=P(L\{0\})\times P(\{0\})`$ and $`(A\{0\})=(A)(\{0\})=(A)0=A`$. In particular, we obtain the category PStruct of power structures, $`PS(L_1,L_2)=P_0(J(L_1,L_2))`$, and the category FStruct of functional structures, $`FS(L_1,L_2)=J(P_0(L_1),P_0(L_2))`$. Now in the category of power structures we focus on the set of join preserving maps $`f:L_1L_2`$, whereas in the category of functional structures we focus on the set of union preserving maps $`\theta :P_0(L_1)P_0(L_2)`$. Since the condition of join preservation may be written $`f(A_1)=P_f(A_1)`$, it is then of interest to consider intermediate structures defined by pairs $`(f,\theta )`$ satisfying the coherence condition $`f\theta f(A_1)=\theta (A_1)`$, i.e., for the operational resolution $`J:P_0(L)L:AA`$ we have $`f\theta fJ_1=J_2\theta `$. Then, for $`\mathrm{}:LP_0(L):a(0,a]`$:

\[6.1.1\] $`J\mathrm{}`$ with $`J\mathrm{}=\mathrm{id}`$;

\[6.1.2\] Given union preserving $`\theta `$, if $`f\theta `$ then $`f`$ is unique and join preserving ;

\[6.1.3\] If $`\theta `$ preserves unions, there exists $`f\theta `$ iff $`\theta `$ is strongly isotone ;

\[6.1.4\] If $`f_1\theta _1`$, $`f_2\theta _2`$ then $`f_2f_1\theta _2\theta _1`$; if $`f_\alpha \theta _\alpha `$ then $`_\alpha f_\alpha _\alpha \theta _\alpha `$.

The first result is a trivial technical lemma allowing the compact presentation of the coherence condition. The second and third results allow the reconstruction of the underlying morphism $`f`$ associated to a given covering $`\theta `$. The first part of the fourth result allows us to introduce the category TStruct of transition structures, where $`TS(L_2,L_2)`$ is the set of pairs $`(f,\theta )`$ such that $`f\theta `$, whereas the second part allows us to define the subcategory BStruct of based structures, whose morphisms are obtained by closing the Hom-sets of PStruct with respect to unions. We then obtain an inclusion hierarchy of intermediate categories between PStruct , construed as an isomorphic image of JCLatt , and FStruct , construed as the maximal power construction on lattices.

Note that the obvious inclusions $`\text{PStruct}\text{BStruct}\text{TStruct}\text{FStruct}`$ are functorial, since the objects and compositions laws are the same in the four categories. Further, the quantaloid morphism $`F:\text{TStruct}\text{JCLatt}:(f,\theta )f`$ is retractive, since $`F\mathrm{I}=\mathrm{id}`$ for $`\mathrm{I}:\underset{¯}{JCLatt}\text{TStruct}:f(f,P_f)`$. Finally, the above quantaloid inclusions are all strict, the category of transition structures then being the maximal faithful coherent enrichment of JCLatt . Explicitly, let $`\mathrm{𝟐}`$ be the two element lattice so that $`P_0(\mathrm{𝟐})=P(\mathrm{𝟐}\{0\})=P(\{1\})`$. We then obtain :

\[6.2.1\] $`PS(\mathrm{𝟐},L)=L`$ whereas $`BS(\mathrm{𝟐},L)=TS(\mathrm{𝟐},L)=FS(\mathrm{𝟐},L)=P_0(L)`$;

\[6.2.2\] $`PS(L,\mathrm{𝟐})=BS(L,\mathrm{𝟐})=TS(L,\mathrm{𝟐})=L`$ whereas $`FS(L,\mathrm{𝟐})=P_0(L)`$;

\[6.2.3\] The inclusions $`\text{PStruct}\text{BStruct}\text{TStruct}\text{FStruct}`$ are strict.

These results can be directly extended to partial constructs, namely categories $`𝒜`$ which are concrete over the category PSet of sets with partially defined maps. Indeed, let us consider a partial construct $`U:𝒜\text{PSet}`$ such that each Hom-set contains a non-trivial morphism, $`\mathrm{Ker}(Uf)\mathrm{Dom}(Uf)`$. First, the image of $`𝒫U`$, where $`𝒫:\text{PSet}\text{JCLatt}`$ is the partial power functor, defines a category $`𝒫𝒜`$ which generalises the category PStruct of power structures. Second, by analogy to the category BStruct of based structures, closing $`𝒫𝒜`$ Hom-sets under pointwise unions we obtain the quantaloid $`𝒬^{}𝒜`$. Third, by analogy to the category FStruct of functional structures, taking all union preserving maps we obtain the quantaloid $`𝒬^+𝒜`$. Note that functors $`F:𝒜`$ canonically lift to $`𝒫`$ and $`𝒬^{}`$ but not to $`𝒬^+`$. In a certain sense, then, we may consider $`𝒬^{}𝒜`$ as a functorial enrichment of $`𝒜`$ and $`𝒬^+𝒜`$ as its contextual enrichment. Now, the above inclusion hierarchy arises for the case $`U:\text{JCLatt}\text{PSet}:LL\{0\}`$. In particular, for any subquantaloid $`𝒜`$ of JCLatt we may generalise the category TStruct of transition structures to the quantaloid $`𝒬^0𝒜`$, the map $`f`$ being the property transition associated to the state transition $`\theta `$. In fact, given any subcategory $`𝒜`$ of JCLatt , considering $`𝒫𝒜`$ as a subcategory of TStruct we can define $`𝒜`$, the smallest subquantale of JCLatt containing $`𝒜`$, as the image of $`𝒫𝒜`$ under the underlying functor. We then obtain pre-enrichments as free extensions of subcategories guaranteeing that all $`𝒬^{}`$-morphisms may be considered as state transitions.

7. States and properties

In this section we briefly indicate how the above categorical techniques find a direct application in the so-called ‘Geneva School approach’, a framework theory allowing abstract mathematical representations of concrete physical notions. The primitive concrete notions of this approach are those of ‘particular physical system’, namely a part of the ostensively external phenomenal world considered as distinct from its surroundings, and ‘definite experimental project’, namely a real experimental procedure where we have decided in advance what would be the positive result should we perform the experiment. We then obtain the mathematical notions of ‘state’, construed as an abstract name for a singular realisation of the physical system, and ‘property’, construed as the element of reality corresponding to a definite experimental project. Now the sets $`\mathrm{\Sigma }`$ of states and $`L`$ of properties each possess mathematical structure arising directly from their physical natures. First, two states $``$ and $`^{}`$ are called orthogonal, written $`^{}`$, if there exists a definite experimental project which is certain for the first and impossible for the second. The orthogonality relation is then trivially symmetric and antireflexive. In particular, writing $`A^{}`$ for the orthogonal of $`A\mathrm{\Sigma }`$ we have that $`AA^{}`$ and $`ABB^{}A^{}`$. The map $`AA^{}`$ is then a closure operator, so that the set $`(\mathrm{\Sigma },)`$ of biorthogonals is a complete atomistic ortholattice with atoms $`\{\}^{}`$. Second, the property $`a`$ is called stronger than the property $`b`$, written $`a<b`$, if $`b`$ is actual whenever $`a`$ is actual. The strength relation is then trivially a partial order. Further, the construction of the product $`\mathrm{\Pi }𝐀`$ of the family $`𝐀`$ of definite experimental projects implies that $`L`$ is a complete lattice whose meet is given by semantic conjunction. These two structures are intimately linked by the so-called Cartan maps, which associate to each property $`a`$ the set $`\mu (a)`$ of states in which it is actual and to each state $``$ the set $`S()`$ of its actual properties. Indeed, by definition $`\mu :LP(\mathrm{\Sigma })`$ is injective and satisfies $`\mu (A)=\mu (A)`$, whereas the induced map $`\rho :\mathrm{\Sigma }L:S()`$ satisfies $`a<b[\rho ()<a\rho ()<b]`$.

The standard axioms then allow one to characterise the images of $`\mu `$ and $`\rho `$, namely those sets of states which represent properties and those properties which represent states. First, note that each atom $`p`$ is a state representative. Indeed, $`p0`$ so that there exists a state $``$ in which $`p`$ is actual. Then $`\rho ()<p`$ so that $`p=\rho ()`$. Further, operationally the state represents all that can be done with certainty with the system. The general principle that the generation of any actual property requires the destruction of another then indicates that we should postulate a bijective correspondence between state representatives and atoms. The property lattice is then atomistic. Second, the orthogonality of two states is an objective feature of the system as a whole. We are then led to suppose the existence of a map $`{}_{}{}^{\mathrm{}}:\mathrm{\Sigma }L:pp^{\mathrm{}}`$ such that $`pq`$ if and only if $`q<p^{\mathrm{}}`$, with induced action $`{}_{}{}^{}:LL:a\{p^{\mathrm{}}|p<a\}`$. Then $`\mu (a^{})=\mu (a)^{}`$, and  satisfies the conditions $`a<bb^{}<a^{}`$ and $`a<a^{\prime \prime }`$. Third, we can identify the lattices $`(\mathrm{\Sigma },)`$ and $`L`$ by supposing in addition that  be surjective, that is, that each property have an opposite. Then the map  is an orthocomplementation, and if $`pq`$ there exists $`r`$ such that $`pr`$ and $`q/r`$. In summary, with these three axioms we can model the set of properties of any given physical system by a complete atomistic ortholattice, and the set of its states by an orthogonality space, the physical state-property duality being a concrete realisation of the abstract equivalence between the categories OSpace and JCAoLatt . Note that any complete atomistic ortholattice can be putatively interpreted as a property lattice. First, in order to interpret atoms as states, we assume that for each $`p\mathrm{\Sigma }`$ there exists a definite experimental project $`\alpha _p`$ which is certain for $`q`$ if and only if $`q=p`$. Second, in order to interpret $`q<p^{}`$ as an orthogonality relation, we assume that for each $`p\mathrm{\Sigma }`$ there exists a definite experimental project $`\beta _p`$ which is certain for $`q`$ if and only if $`q<p^{}`$. To obtain a coherent interpretation we then assume that $`\beta _p=\alpha _p^{}`$, the inverse obtained by exchanging the terms of the alternative. Completing with respect to the product we then obtain exactly the lattice $`L`$, since the condition $`a=\{p^{}|p<a\}`$ implies that $`a^{}`$ is generated by the $`\beta _p`$ with $`p`$ majorised by $`a`$. For a somewhat different categorical implementation of the Geneva School axioms see \[Valckenborgh 2000\].

Apart from its mathematical elegance, the categorical realisation of state-property duality is a powerful tool in the study of axiomatic quantum theory. For example, it is implicit in the construction of many standard secondary notions, such as the classical decomposition, construed as a product in JCAoLatt , and observables, construed as morphisms in COLatt with domain a complete Boolean algebra whose Stone space encodes the measurement scale. First, $`zL`$ is called central if there exists a direct product decomposition $`\pi :L_1\times L_2L`$ with $`z=\pi (1,0)`$, in which case $`z`$ has unique complement $`z^{}=\pi (0,1)`$. Now for complete atomistic ortholattices, the central elements are exactly the classical properties, namely those $`zL`$ such that for each $`p\mathrm{\Sigma }_L`$ either $`p<z`$ or $`p<z^{}`$. In particular, for $`\alpha \mathrm{\Omega }`$ the atoms of the center of $`L`$ we have that $`L=\times _\alpha [0,\alpha ]`$. Second, the spectrum of the observable $`\mu :𝐁L`$ may be obtained from the decomposition $`N=\mu ^{}(0)`$, $`D=\{E\mathrm{\Sigma }_𝐁|E<N^{}\}`$, $`C=D^{}N^{}`$, the interval $`[0,D]`$ being atomistic and so representing the discrete spectrum and the interval $`[0,C]`$ being atomless and so representing the continuous spectrum. Further, different physical and mathematical aspects of a given problem are often best treated using different techniques, so that the various categorical equivalences exposed above are crucial in enabling natural translations. For example, the meet has a definite physical interpretation as semantic conjunction, being operationally constructible via the product, whereas it is often technically useful to consider join preserving maps, these being the usual objects for representation theorems. The duality between MCLatt and JCLatt then allows one to define a concept in physically meaningful terms and then study it using mathematically adequate techniques. For example, the construction of Hilbertian realisations for Arguesian orthogeometries $`(G,)`$ is purely categorical, being based on an appropriate embedding of $`G`$ as a hyperplane in the projective geometry $`\overline{G}`$ whose elements are endomorphisms of $`G`$ with a given fixed axis $`H`$. First, the set $`V=\overline{G}G`$ has a natural vector space structure over the division ring of homotheties defined with respect to a fixed $`0V`$. Second, each non-degenerate morphism $`g:G_1N_1G_2`$ admits a canonical extension $`h:\overline{G}{}_{1}{}^{}\overline{N}{}_{1}{}^{}\overline{G}_2`$ whose restriction to $`V_1`$ defines a semilinear map $`f:V_1V_2`$. Third, and finally, the orthogonality relation defines a non-degenerate homomorphism $`g:GG^{}:p\{p\}^{}`$, where $`G^{}`$ is the dual geometry of hyperplanes of $`G`$, whose associated quasilinear map $`f:VV^{}`$ then defines a Hermitian form.

A case in point is the notion of deterministic evolutions. First, one can partially encode an imposed evolution by defining a map $`\mathrm{\Phi }_{01}`$ which associates to each definite experimental project $`\alpha _1`$ defined at the final time $`t_1`$ the definite experimental project $`\alpha _0`$ defined at the initial time $`t_0`$ by the prescription ‘Evolve the system as required and effectuate $`\alpha _1`$’ \[Daniel 1982, 1989\]. Then it can be physically demonstrated that $`\mathrm{\Phi }_{01}`$ preserves the product and maps $`O_1`$ to $`O_0`$. We thereby obtain an induced map $`\phi _{01}:L_1L_0`$ which preserves non-empty meets and maps $`0_1`$ to $`0_0`$. In words, each given evolution induces a weak balanced meet morphism. In the simplest case, where $`\phi _{01}(1_1)=1_0`$ so that the system is never destroyed by the evolution, we then obtain the dense right adjoint $`\psi _{10}:L_0L_1`$. Physically, the adjunction condition implies that $`\psi _{10}(p_0)`$ is the strongest final property whose actuality is guaranteed by the evolution for the initial state defined by the atom $`p_0`$. If this property in fact determines the final state of the system, then we can realise the evolution as a dense atomic join morphism. Finally, under suitable stability conditions two orthogonal final states arise from two orthogonal initial states, since if $`\alpha _1`$ separates $`\psi _{10}(p_0)`$ and $`\psi _{10}(q_0)`$ then $`\mathrm{\Phi }_{01}\alpha _1`$ separates $`p_0`$ and $`q_0`$. In the Hilbertian context, one can then prove that a sufficiently continuous evolution may be represented by a unitary flow \[Faure, Moore and Piron 1995\]. More generally, the cognitive duality between causal assignment and consecutive propagation of properties may be encoded in the quantaloid isomorphism $`A^{}:\text{JCLatt}\text{MCLatt}^{\mathrm{coop}}`$ \[Coecke 2000; Coecke, Moore and Stubbe 2000\]. Explicitly, given two property lattices $`L_1`$ and $`L_2`$ let us write $`a_1a_2`$ if $`a_1L_1`$ is a material cause of $`a_2L_2`$. Then by the operational signification of the lattice partial order as semantic implication and the operational construction of the lattice meet as semantic conjunction, the relation $``$ should be fully isotone, $`(x_1<a_1a_2<x_2)(x_1x_2)`$, and preserve right non-empty meets, $`(a_1a_{2\alpha })(a_1_\alpha a_{2\alpha })`$. Setting $`g:L_2L_1:a_2\{a_1L_1|a_1a_2\}`$ we may then express causal assignment by a weak meet morphism, in the sense that $`(a_1a_2)(a_1<g(a_2))`$, whose pseudoadjoint $`f:L_1^uL_2^u`$ implements the notion of consecutive propagation of properties. In particular, the interpretation of propagation as an evolutive flow may be complemented by the interpretation of assignment in terms of states of compoundness.

APPENDIX

In this appendix we provide proofs of the results cited in the text.

Proof of proposition 3.1 :

(1) Let $`\mathrm{id}_1<(gf)`$ and $`(fg)<\mathrm{id}_2`$. Then $`f(a_1)<a_2a_1<(gf)(a_1)<g(a_2)`$ and $`a_1<g(a_2)f(a_1)<(fg)(a_2)<a_2`$. Let $`f(a_1)<a_2a_1<g(a_2)`$. Then for each $`a_1L_1`$ we have that $`f(a_1)<f(a_1)a_1<(gf)(a_1)`$ and for each $`a_2L_2`$ we have that $`g(a_2)<g(a_2)(fg)(a_2)<a_2`$.

(2) First $`f^1=ggf=\mathrm{id}_1`$; second $`fg=\mathrm{id}_2\mathrm{id}_1<gf,fg<\mathrm{id}_2`$; third $`\mathrm{id}_2<fg,gf<\mathrm{id}_1fgf`$.

(3) $`\mathrm{id}_1<gf`$ so that $`f=f\mathrm{id}_1<fgf`$ and $`g=\mathrm{id}_1g<gfg`$, whereas $`fg<\mathrm{id}_2`$ so that $`fgf<\mathrm{id}_2f=f`$ and $`gfg<g\mathrm{id}_2=g`$.

(4) Let $`f<\overline{f}`$. Then $`(f\overline{g})(a_2)<(\overline{f}\overline{g})(a_2)<a_2\overline{g}(a_2)<g(a_2)`$ for each $`a_2L_2`$. Let $`\overline{g}<g`$. Then $`a_1<(\overline{g}\overline{f})(a_1)<(g\overline{f})(a_1)f(a_1)<\overline{f}(a_1)`$ for each $`a_1L_1`$.

(5) $`\mathrm{id}(a)<ba<ba<\mathrm{id}(b)`$, and so $`\mathrm{id}\mathrm{id}`$. Let $`fg`$ and $`\overline{f}\overline{g}`$. Then $`(\overline{f}f)(a_1)<a_3f(a_1)<\overline{g}(a_3)a_1<(g\overline{g})(a_3)`$, and so $`(\overline{f}f)(g\overline{g})`$.

Proof of proposition 3.2 :

(1) $`f(A_1)<a_2A_1<g(a_2)(a_1A_1)[a_1<g(a_2)f(a_1)<a_2]f(A_1)<a_2`$; $`a_1<g(A_2)f(a_1)<A_2(a_2A_2)[f(a_1)<a_2a_1<g(a_2)]a_1<g(A_2)`$.

(2) If $`f(A)=f(A)`$ then $`f(a_1)<a_2a_1<\{x_1L_1|f(x_1)<a_2\}=f^{}(a_2)`$ and $`a_1<f^{}(a_2)f(a_1)<f(\{x_1L_1|f(x_1)<a_2\})=\{f(x_1)|f(x_1)<a_2\}<a_2`$.

(3) If $`g(A)=g(A)`$ then $`a_1<g(a_2)g_{}(a_1)=\{x_2L_2|a_1<g(x_2)\}<a_2`$ and $`g_{}(a_1)<a_2a_1<\{g(x_2)|a_1<g(x_2)\}=g(\{x_2L_2|a_1<g(x_2)\}<g(a_2)`$.

(4) $`(_\alpha f_\alpha )(a_1)<a_2(\alpha )f_\alpha (a_1)<a_2(\alpha )a_1<g_\alpha (a_2)a_1<(_\alpha g_\alpha )(a_2)`$.

(5) $`(f_\alpha f_\alpha )(a_1)<a(\alpha )[f_\alpha (a_1)<g(a)a_1<(g_\alpha g)(a)]a_1<_\alpha (g_\alpha g)(a)`$; $`(_\alpha f_\alpha f)(a)<a_2(\alpha )[f(a)<g_\alpha (a_2)a<(gg_\alpha )(a_2)]a<_\alpha (gg_\alpha )(a_2)`$.

Proof of proposition 3.3 :

(1) First, let $`A^{}:J(L_1,L_2)M(L_2,L_1)^{\mathrm{co}}:ff^{}`$. Then $`A^{}`$ is well defined, since $`f^{}`$ is unique and preserves meets, and isotone, $`f<\overline{f}\overline{f}^{}<f^{}f^{}<^{\mathrm{op}}\overline{f}^{}`$. Second, let $`A_{}:M(L_2,L_1)^{\mathrm{co}}J(L_1,L_2):gg_{}`$. Then $`A_{}`$ is well defined, since $`g_{}`$ is unique and preserves joins, and isotone, $`g<^{\mathrm{op}}\overline{g}\overline{g}<gg_{}<\overline{g}_{}`$. Third, $`A_{}A^{}=\mathrm{id}`$ and $`A^{}A_{}=\mathrm{id}`$. Indeed, if $`fg`$ then $`g=f^{}`$ and $`f=g_{}`$. Hence $`(A_{}A^{})(f)=(f^{})_{}=g_{}=f`$ and $`(A^{}A_{})(g)=(g_{})^{}=f^{}=g`$.

(2) First, let $`A^{}:\text{JCLatt}\text{MCLatt}{}_{}{}^{\mathrm{op}}:LL;ff^{}`$. Then $`A^{}`$ is well defined, since we have $`fJ(L_1,L_2)f^{}M(L_2,L_1)=M^{\mathrm{op}}(L_1,L_2)`$, and a functor, $`A^{}(f_2f_1)=(f_2f_1)^{}=f_1^{}f_2^{}=f_2^{}^{\mathrm{op}}f_1^{}=A^{}(f_2)^{\mathrm{op}}A^{}(f_1)`$. Second, let $`A_{}:\text{MCLatt}{}_{}{}^{\mathrm{op}}\text{JCLatt}:LL;gg_{}`$. Then $`A_{}`$ is well defined, since we have $`gM^{\mathrm{op}}(L_1,L_2)=M(L_2,L_1)g_{}J(L_2,L_2)`$, and a functor, $`A_{}(g_2^{\mathrm{op}}g_1)=A_{}(g_1g_2)=(g_1g_2)_{}=g_2g_1=A_{}(g_2)A_{}(g_1)`$. Third, as above $`A_{}A^{}=\mathrm{id}`$ and $`A^{}A_{}=\mathrm{id}`$.

(3) Let $`A^{}:\text{JCLatt}\text{MCLatt}{}_{}{}^{\mathrm{coop}}:ff^{}`$ and $`A_{}:\text{MCLatt}{}_{}{}^{\mathrm{coop}}\text{JCLatt}:gg_{}`$. Then combining the above two results we have that $`A^{}`$ and $`A_{}`$ are well defined, are quantaloid morphisms, and satisfy $`A_{}A^{}=\mathrm{id}`$ and $`A^{}A_{}=\mathrm{id}`$.

Proof of proposition 3.4 :

(1) $`a_1<b_1b_1^{}<a_1^{}\alpha (b_1^{})<\alpha (a_1^{})(C\alpha )(a_1)=\alpha (a_1^{})^{}<\alpha (b_1^{})^{}=(C\alpha )(b_1)`$, so that $`C(\alpha )`$ is isotone and $`C`$ is well defined. $`(C\mathrm{id})(a)=\mathrm{id}(a^{})^{}=a^{\prime \prime }=a`$ and $`C(\alpha _2\alpha _1)(a_1)=(\alpha _2\alpha _1)(a_1^{})^{}=\alpha _2(\alpha _1(a_1^{})^{\prime \prime })^{}\alpha _2((C\alpha _1)(a_1)^{})^{}=(C\alpha _2C\alpha _1)(a_1)`$, so that $`C`$ is a functor. $`(CC\alpha )(a_1)=(C\alpha )(a_1^{})^{}=\alpha (a_1^{\prime \prime })^{\prime \prime }=\alpha (a_1)`$. If $`fg`$ then $`(Cg)(a_2)=g(a_2^{})^{}<a_1a_1^{}<g(a_2^{})f(a_1^{})<a_2^{}a_2<f(a_1^{})^{}=(Cf)(a_1)`$, so that $`C(g)C(f)`$. Hence $`C`$ maps join maps to meet maps and conversely.

(2) First, if $`fg`$ then $`f^{}=C(g)C(f)=g_{}`$ and so $``$ is well defined on JCoLatt . Second, $`(f_2f_1)^{}=C((f_2f_1)^{})=C(f_2{}_{}{}^{}f_1{}_{}{}^{})=C(f_1{}_{}{}^{})C(f_2{}_{}{}^{})=f_1{}_{}{}^{}f_2^{}`$ and $`f^{}=C(f^{})=C(C(f)_{}{}_{}{}^{})=(CC)(f)=f`$, so that $``$ is an involution. Third, by the adjunction condition $`f^{}(a_2)<a_1^{}a_1<f^{}(a_2)^{}=f^{}(a_2^{})f(a_1)<a_2^{}`$. Fourth, $`f^{}f=0_1(f^{}f)(1_1)<0_1f(1_1)=f(0_1^{})<f(1_1)^{}f(1_1)=0_2f=0_2`$.

(3) If $`u^{}u=\mathrm{id}`$ then $`a_1<b_1^{}(u^{}u)(a_1)=a_1<b_1^{}u(b_1)<u(a_1)^{}u(a_1)<u(b_1)^{}`$. If conversely then $`a_1<x_1u(a_1)<u(x_1^{})^{}u(x_1^{})<u(a_1)^{}(u^{}u)(a_1)<x_1`$.

(4) First, $`h_{}(a_2^{})<a_1a_2^{}<h(a_1)h(a_1^{})=h(a_1)^{}<a_2a_1^{}<h^{}(a_2)h^{}(a_2)^{}<a_1`$. Second, $`h^{}(a_2)=h^{}(a_2^{})^{}=h_{}(a_2)^{\prime \prime }=h_{}(a_2)`$ and $`h_{}(a_2)=h_{}(a_2^{})^{}=h^{}(a_2)^{\prime \prime }=h^{}(a_2)`$. Third, $`hh^{}h=hh_{}h=h`$ and $`hh_{}h=hh^{}h=h`$.

Proof of proposition 4.1 :

(1) First, if $`\chi =0`$ then $`0<C^a(x)`$ and $`\alpha _a(0)=0<x`$ whereas if $`\chi =1`$ then $`1<C^a(x)C^a(x)=1\alpha _a(1)=a<x`$. Hence $`\alpha _aC^a`$. Second, we have $`(f\alpha _{a_1})(0)=f(0_1)=0_2=\alpha _{f(a_1)}(0)`$ and $`(f\alpha _{a_1})(1)=f(a_1)=\alpha _{f(a_1)}(1)`$. Third, we have $`(C^{a_1}g)(a_2)=1a_1<g(a_1)f(a_1)<a_2C^{f(a_1)}(a_2)=1`$.

(2) First, if $`\chi =0`$ then $`x<\alpha ^a(0)=aC_a(x)=0C_a(x)<0`$ whereas if $`\chi =1`$ then $`x<1=\alpha ^a(x)`$ and $`C_a(x)<1`$. Hence $`C_a\alpha ^a`$. Second, we have $`(g\alpha ^{a_2})(0)=g(a_2)=\alpha ^{g(a_2)}(0)`$ and $`(g\alpha ^{a_2})(1)=g(1_2)=1_1=\alpha ^{g(a_2)}(1)`$. Third, we have $`(C_{a_2}f)(a_1)=0f(a_1)<a_2a_1<g(a_2)C_{g(a_2)}(a_1)=0`$.

(3) Let $`xL`$. Then $`(i_a\pi _a)(x)=i_a(xa)=xa<x`$ and $`i_a\pi _a<\mathrm{id}`$. Let $`x[0,a]`$. Then $`x=xa=\pi _a(x)=(\pi _ai_a)(x)`$ and $`\pi _ai_a=\mathrm{id}`$. Let $`xL`$. Then $`x<[x(x<a):1(xa)]=[\widehat{ı}{}_{a}{}^{}(x)(x<a);\widehat{ı}{}_{a}{}^{}(a)(xa)]=(\widehat{ı}{}_{a}{}^{}\widehat{\pi }{}_{a}{}^{})(x)`$ and $`\mathrm{id}<\widehat{ı}{}_{a}{}^{}\widehat{\pi }_a`$. Let $`x[0,a]`$. Then $`(\widehat{\pi }{}_{a}{}^{}\widehat{ı}{}_{a}{}^{})(x)=[\widehat{\pi }{}_{a}{}^{}(x)(xa);\widehat{\pi }{}_{a}{}^{}(1)(x=a)]=x`$ and $`\widehat{\pi }{}_{a}{}^{}\widehat{ı}{}_{a}{}^{}=\mathrm{id}`$.

Proof of proposition 4.2 :

(1) Let $`f`$ be balanced. Then $`g(a_2)=1_11_1<g(a_2)1_2=f(1_1)<a_2a_2=1`$, and $`g`$ is dense. Let $`g`$ be dense. Then $`1_1<(gf)(1_1)f(1_1)=1_2`$, and $`f`$ is balanced. Let $`f`$ be dense. Then $`(fg)(0_2)<0_2g(0_2)=0_1`$, and $`g`$ is balanced. Let $`g`$ be balanced. Then $`f(a_1)=0_2f(a_1)<0_2a_1<g(0_2)=0_1a_1=0_1`$, and $`f`$ is dense.

(2) Let $`f`$ be epic. Then $`C_{a_2}f=C_{g(a_2)}=C_{(gfg)(a_2)}=C_{(fg)(a_2)}f`$, so that $`C_{a_2}=C_{(fg)(a_2)}`$ and $`a_2=(fg)(a_2)`$. Let $`f`$ be surjective. Then with $`a_2=f(a_1)`$ we have $`(fg)(a_2)=(fgf)(a_1)=f(a_1)=a_2`$ and $`fg=\mathrm{id}_2`$. Let $`fg=\mathrm{id}_2`$. Then $`g(a_2)=g(b_2)a_2=\mathrm{id}_2(a_2)=(fg)(a_2)=(fg)(b_2)=\mathrm{id}_2(b_2)=b_2`$. Let $`g`$ be injective. Then $`gg_1=gg_2(gg_1)(a)=(gg_2)(a)g_1(a)=g_2(a)`$. Let $`g`$ be monic. Then $`f_1f=f_2fgg_1=(f_1f)^{}=(f_2f)^{}=gg_1`$, so that $`g_1=g_2f_1=g_1=g_2=f_2`$.

(3) Let $`f`$ be a monic. Then $`f(a_1)=f(b_1)f\alpha _{a_1}=\alpha _{f(a_1)}=\alpha _{f(b_1)}=f\alpha _{b_1}`$, so that $`\alpha _{a_1}=\alpha _{b_1}`$ and $`a_1=b_1`$. Let $`f`$ be injective. Then $`(fgf)(a_1)=f(a_1)`$ and $`(gf)(a_1)=a_1`$. Let $`gf=\mathrm{id}_1`$. Then $`a_1=\mathrm{id}_1(a_1)=(gf)(a_1)`$. Let $`g`$ be surjective. Then $`g_1g=g_2gg_1(a_1)=(g_1g)(a_2)=(g_2g)(a_2)=g_2(a_1)`$ for $`a_1=g(a_2)`$. Let $`g`$ be epic. Then $`ff_1=ff_2g_1g=(ff_1)^{}=(ff_2)^{}=g_2g`$, so that $`g_1=g_2f_1=g_1=g_2=f_2`$.

Proof of proposition 4.3 :

(1) If $`b<\mathrm{\Pi }_\beta ((a_\alpha ))`$ then $`\alpha =\beta (i_\beta (b))_\alpha =b<a_\alpha `$ and $`\alpha \beta (i_\beta (b))_\alpha =0<a_\alpha `$. If $`i_\beta (b)<(a_\alpha )`$ then $`b=(i_\beta (b))_\beta <a_\beta =\mathrm{\Pi }_\beta ((a_\alpha ))`$. Hence $`i_\beta \mathrm{\Pi }_\beta `$. If $`(a_\alpha )<j_\beta (b)`$ then $`\mathrm{\Pi }_\beta ((a_\alpha ))=a_\beta <(j_\beta (b))_\beta =b`$. If $`\mathrm{\Pi }_\beta ((a_\alpha ))<b`$ then $`\alpha =\beta a_\alpha <b=(j_\beta (b))_\alpha `$ and $`\alpha \beta a_\alpha <1=(j_\beta (b))_\alpha `$. Hence $`\mathrm{\Pi }_\beta j_\beta `$. If $`x<\mathrm{I}_\beta (b)=b`$ then $`xL_\beta `$ and $`\sigma _\beta (x)=x<b`$. If $`\sigma _\beta <b`$ then $`xL_\beta x=\sigma _\beta (x)<b=\mathrm{I}_\beta (b)`$ and $`xL_\beta 1=\sigma _\beta (x)<bx<1=b=\mathrm{I}_\beta (b)`$. Hence $`\sigma _\beta \mathrm{I}_\beta `$. If $`b<\rho _\beta (x)`$ then $`xL_\beta \mathrm{I}_\beta (b)=b<\rho _\beta (x)=x`$ and $`xL_\beta b<\rho _\beta (x)=0\mathrm{I}_\beta (b)=b=0<x`$. If $`b=\mathrm{I}_\beta (b)<x`$ then $`xL_\beta `$ and $`b<x=\rho _\beta (x)`$. Hence $`\mathrm{I}_\beta \rho _\beta `$.

(2) Let $`p_\beta :LL_\beta `$ be maps. Now $`a\times _\alpha L_\alpha a=(\mathrm{\Pi }_\alpha (a))`$. Hence the unique map $`\theta :L\times _\alpha L_\alpha `$ with $`p_\beta =\mathrm{\Pi }_\beta \theta `$ is $`\theta (x)=((\mathrm{\Pi }_\alpha \theta )(x))=(p_\alpha (x))`$. Since the partial order, minimal and maximal elements, joins and meets are computed pointwise, $`\theta `$ will be a morphism in BPos , JCLatt or MCLatt iff each $`p_\alpha `$ is.

(3) First, let $`q_\beta :L_\beta L`$ be morphisms. Then the unique map $`\phi :\dot{}_\alpha L_\alpha L`$ such that $`q_\beta =\phi \mathrm{I}_\beta `$ is given by $`\phi (b)=(\phi \mathrm{I}_\beta )(b)=q_\beta (b)`$ for $`bL_\beta `$. Note that there is no ambiguity for $`x=0`$ or $`x=1`$ since $`q_\beta (0)=0`$ and $`q_\beta (1)=1`$. It remains to prove that $`\phi `$ is isotone. Let $`x<x^{}`$. Then $`x`$ and $`x^{}`$ belong to the same component, say $`L_\beta `$, and $`\phi (x)=q_\beta (x)<q_\beta (x^{})=\phi (x^{})`$. Second, $`\mathrm{\Pi }_\beta `$ is the product in MCLatt , so that $`\mathrm{\Pi }_\beta `$ is the coproduct in MCLattop and $`i_\beta `$ is the coproduct in JCLatt . Third, $`\mathrm{\Pi }_\beta `$ is the product in JCLatt , so that $`\mathrm{\Pi }_\beta `$ is the coproduct in JCLattop and $`j_\beta `$ is the coproduct in MCLatt .

Proof of proposition 4.4 :

(1) First, for $`x_2\mathrm{𝟏}`$ we have $`(F_\alpha G_\alpha )(x_2)=F_\alpha (\alpha ^{}(x_2))=(\alpha \alpha ^{})(x_2)<x_2`$, and for $`x_2=\mathrm{𝟏}`$ we have $`(F_\alpha G_\alpha )(\mathrm{𝟏})=F_\alpha (\mathrm{𝟏})=\mathrm{𝟏}`$. On the other hand, for $`x_1<a_1`$ we have $`x_1<(\alpha ^{}\alpha )(x_1)=G_\alpha (\alpha (x_1))=(G_\alpha F_\alpha )(x_1)=G_\alpha `$, and for $`x_1a_1`$ we have $`x_1<\mathrm{𝟏}=G_\alpha (\mathrm{𝟏})=(G_\alpha F_\alpha )`$. Second, we have that $`(F_{\alpha _2}F_{\alpha _1})(x_1)=\mathrm{𝟏}`$ iff $`x_1(G_{\alpha _1}G_{\alpha _2})(1_3))=G_{\alpha _1}(\alpha _2^{}(1_3))=G_{\alpha _1}(a_2)=\alpha _1^{}(a_2)`$ iff $`F_{\alpha _2\alpha _1}(x_1)=\mathrm{𝟏}`$, and for $`x_1<\alpha ^{}(a_2)`$ we have $`F_{\alpha _2\alpha _1}(x_1)=(\alpha _2\alpha _1)(x_1)=(F_{\alpha _2}F_{\alpha _2})(x_1)`$. Third, for $`x_1<F^{}(1_2)`$ we have $`F_{\alpha _F}(x_1)=\alpha _F(x_1)=F(x_1)`$, and for $`x_1F^{}(1_2)`$ we have $`F_{\alpha _F}(x_1)=\mathrm{𝟏}=F(x_1)`$ since $`x_1F^{}(1_2)F(x_1)1_2F(x_1)=\mathrm{𝟏}`$.

(2) First, for $`x_2L_2`$ we have $`(\alpha _F\beta _F)(x_2)=\alpha _F(F^{}(x_2))=(FF^{})(x_2)<x_2`$, and for $`x_1<F^{}(1_2)`$ we have $`x_1<(F^{}F)(x_1)=\beta _F(F(x_1))=(\beta _F\alpha _F)(x_1)`$. Second, $`\alpha _{F_2F_1}(x_1)=(F_2F_1)(x_1)=\alpha _{F_2}(F_1(x_1))=(\alpha _{F_2}\alpha _{F_1})(x_1)`$. Third, $`F_\alpha ^{}(1_2)=G_\alpha (1_2)=\alpha ^{}(1_2)=a_1`$, and $`\alpha _{F_\alpha }(x_1)=F_\alpha (x_1)=\alpha (x_1)`$ for $`x_1<a_1`$.

(3) If $`x_2\mathrm{𝟏}`$ then $`g^u(x_2)=g(x_2)=g^p(x_2)=\alpha ^{}(x_2)=G_\alpha (x_2)`$, whereas if $`x_2=\mathrm{𝟏}`$ then $`g^u(x_2)=\mathrm{𝟏}=G_\alpha (x_2)`$. Hence $`g^u=G_\alpha `$ so that $`F=F_\alpha `$. Finally, if $`x_2L_2`$ then $`g^p(x_2)=g(x_2)=g^u(x_2)=F^{}(x_2)=\beta _F(x_2)`$, so that $`g^p=\beta _F`$ and $`\alpha =\alpha _F`$.

Proof of proposition 5.1 :

(1) Suppose that $`f(\mathrm{\Sigma }_{L_1})\mathrm{\Sigma }_{L_2}\{0_2\}`$, and $`p_1\mathrm{\Sigma }_{L_1}`$. Then either $`f(p_1)=0_2`$ or $`f(p_1)`$ is an atom. In either case there exists $`p_2\mathrm{\Sigma }_{L_2}`$ such that $`f(p_1)<p_2`$ and so $`p_1<g(p_2)`$. Suppose that for each $`p_1\mathrm{\Sigma }_{L_1}`$ there exists $`p_2\mathrm{\Sigma }_{L_2}`$ such that $`p_1<g(p_2)`$. Then $`f(p_1)<p_2`$, so that either $`f(p_1)=p_2`$ or $`f(p_1)=0_2`$.

(2) Let $`\alpha (T_1A_1K_1)T_2\alpha (A_1K_1)`$, and for $`T_2A_2=A_2`$ set $`A_1=K_1\alpha ^1(A_2)`$. Then $`T_1A_1K_1\alpha ^1(\alpha (T_1A_1)K_1)K_1\alpha ^1(T_2\alpha (A_1K_1))K_1f^1(A_2)=A_2`$ since $`A_1K_1=f^1(A_2)`$. Let $`T_1(K_1\alpha ^1(A_2))=K_1\alpha ^1(A_2)`$ if $`T_2(A_2)=A_2`$, and set $`A_2=T_2\alpha (A_1K_1)`$. Then $`\alpha (T_1A_1K_1)\alpha (\alpha ^1(A_2))A_2=T_2\alpha (A_1K_1)`$ since $`A_1K_1\alpha ^1(\alpha (A_1K_1))K_1\alpha ^1(T_2\alpha (A_1K_1))=K_1\alpha ^1(A_2)`$.

(3) First, $`(f_2f_1)(\mathrm{\Sigma }_{L_1})f_2(\mathrm{\Sigma }_{L_2}\{0_2\})\mathrm{\Sigma }_{L_3}\{0_3\}`$. Second, the kernel of a composition is given by $`K=K_1\alpha _1^1(K_2)`$. Hence, if $`A_3`$ is closed then so is $`K(\alpha _2\alpha _1)^1(A_3)=(K_1\alpha _1^1(K_2))\alpha _1^1(\alpha _2^1(A_3))=K_1\alpha _1^1(K_2\alpha _2^1(A_3))`$. Third, $`K_{\alpha _3(\alpha _2\alpha _1)}=(K_1\alpha _1^1(K_2))(\alpha _2\alpha _1)^1(K_3)=K_1\alpha _1^1(K_2\alpha _2^1(K_3))=K_{(hg)f}`$.

Proof of proposition 5.2 :

(1) $`A=\{p\mathrm{\Sigma }|pA\}\{p\mathrm{\Sigma }|p<A\}=\{p\mathrm{\Sigma }|p<\pi (A)\}=(i\pi )(A)`$ and $`(\pi i)(a)=i(a)=\{p\mathrm{\Sigma }|p<a\}=0`$, so that $`\pi i`$. Further, the closure $`i\pi `$ is simple, since $`(i\pi )(\mathrm{})=\{p\mathrm{\Sigma }|p<\mathrm{}=0\}=\mathrm{}`$ and $`(i\pi )(\{p\})=\{q\mathrm{\Sigma }|p<\{p\}=p\}=\{p\}`$.

(2) Note that $`A\mathrm{P}(\mathrm{\Sigma })^{i\pi }`$ if and only if $`A=\{p\mathrm{\Sigma }|p<a\}`$. Let $`(i_2\pi _2)(A_2)=A_2`$. Then $`K_1=\{p\mathrm{\Sigma }_1|f(p_1)=0_2\}=\{p\mathrm{\Sigma }_2|f(p_1)=0_2\&f(p_1)<A_2\}`$ and $`\alpha _f^1(A_2)=\{p_1\mathrm{\Sigma }_1|\alpha _f(p_1)A_2\}=\{p_1\mathrm{\Sigma }_1|f(p_1)0\&f(p_1)<A_2\}`$, so that $`K_1\alpha _f^1(A_2)=\{p_1\mathrm{\Sigma }_1|f(p_1)<A_2\}=\{p_1\mathrm{\Sigma }_1|p_1<f^{}(A_2)\}`$ is closed.

(3) First, if $`f_\alpha (A_1)A_2`$ then $`\alpha (A_1K_1)T_2\alpha (A_1K_1)=f_\alpha (A_1)A_2`$ so that $`A_1K_1\alpha ^1(\alpha (A_1K_1))f^1(A_2)`$ and $`A_1K_1(A_1K_1)K_1\alpha ^1(A_2)=g_\alpha (A_2)`$. Second, if $`A_1g_\alpha (A_2)=K_1\alpha ^1(A_2)`$ then we have $`A_1K_1\alpha ^1(A_2)`$ so that $`f_\alpha (A_1)=T_2\alpha (A_1K_1)T_2\alpha (\alpha ^1(A_2))T_2(A_2)=A_2`$. Third, let $`p_1\mathrm{\Sigma }_1`$. Then $`p_1K_1f_\alpha (\{p_1\})=T_2\alpha (\{p_1\}K_1)=T_2f(\{p_1\})=T_2\{f(p_1)\}=\{f(p_1)\}`$, whereas $`p_1K_1f_\alpha (\{p_1\})=T_2\alpha (\{p_1\}K_1)=T_2f(\mathrm{})=T_2(\mathrm{})=\mathrm{}`$.

(4) $`:\alpha f_\alpha `$ and $`𝒞:f\alpha _f`$ are functors, since $`K_{\alpha _2\alpha _1}=K_{\alpha _1}\alpha _1^1(K_{\alpha _2})`$ so that $`g_{\alpha _2\alpha _1}(A_3)=K_{\alpha _2\alpha _1}(\alpha _2\alpha _1)^1(A_3)=K_{\alpha _1}\alpha _1^1(K_{\alpha _2}\alpha _2^1(A_3))=(g_{\alpha _1}g_{\alpha _2})(A_3)`$, and $`K_{\alpha _{f_2f_1}}=\{p_1\mathrm{\Sigma }_1|(f_2f_1)=0_3\}=K_{\alpha _{f_1}}\alpha _1^1(K_{\alpha _{f_2}})=K_{\alpha _{f_2}\alpha _{f_1}}`$ so that $`\alpha _{f_2f_1}=\alpha _{f_2}\alpha _{f_1}`$. Let $`\phi _\mathrm{\Sigma }:\mathrm{\Sigma }𝒞\mathrm{\Sigma }:p\{p\}`$ and $`\psi _L:L𝒞L:a\{p\mathrm{\Sigma }_L|p<a\}`$. Then $`\phi `$, $`\psi `$ are natural, $`(𝒞\alpha \phi _{\mathrm{\Sigma }_1})(p)=\alpha _{f_\alpha }(\{p\})=f_\alpha (\{p\})=\{\alpha (p)\}=(\phi _{\mathrm{\Sigma }_2}\alpha )(p)`$ and $`(𝒞f\psi _{L_1})(a)=f_{\alpha _f}(\psi _{L_1}(a))=\{p\mathrm{\Sigma }_{L_1}|p<f(a)\}=(\psi _{L_2}f)(a)`$, and form an equivalence, $`\phi _\mathrm{\Sigma }(A)=f_{\phi _\mathrm{\Sigma }}(A)=\phi _\mathrm{\Sigma }(TA)=\phi _\mathrm{\Sigma }(A)=\{\{p\}|\{p\}A\}=\psi _\mathrm{\Sigma }(A)`$.

Proof of proposition 5.3 :

(1) First, the maps $`S_\alpha `$ and $`P_\alpha `$ are isotone, since for $`A_2B_2`$ and $`A_1B_1`$ we have $`x_1S_\alpha (A_1)(x_2A_2)\alpha (x_1)=x_2(x_2B_2)\alpha (x_1)=x_2x_1S_\alpha (B_2)`$ and $`x_2P_\alpha (A_2)(x_1A_1)\alpha (x_1)=x_2(x_1B_1)\alpha (x_1)=x_2x_2P_\alpha (B_1)`$. Second, $`x_1(S_\alpha P_\alpha )(A_1)\alpha (x_1)P_\alpha (A_1)(y_1A_1)\alpha (x_1)=\alpha (y_1)`$. In particular, $`A_1(S_\alpha P_\alpha )(A_1)`$, and if $`S_\alpha P_\alpha =\mathrm{id}`$ or $`\alpha `$ is injective we have that $`\alpha (x_1)=\alpha (\overline{x}{}_{1}{}^{})(y_1\{\overline{x}{}_{1}{}^{}\})\alpha (x_1)=\alpha (y_1)x_1(S_\alpha P_\alpha )(\{\overline{x}{}_{1}{}^{}\})=\{\overline{x}{}_{1}{}^{}\}x_1=\overline{x}_1`$ and $`x_1(S_\alpha P_\alpha )(A_1)(y_1A_1)[\alpha (x_1)=\alpha (y_1)x_1=y_1]x_1A_1`$. Third, $`x_2(P_\alpha S_\alpha )(A_2)(x_1S_\alpha (A_2))\alpha (x_1)=x_2(x_1\mathrm{\Sigma }_1)x_2=\alpha (x_1)A_2`$. In particular, $`(P_\alpha S_\alpha )(A_2)A_2`$, and if $`P_\alpha S_\alpha =\mathrm{id}`$ or $`\alpha `$ is surjective we obtain $`x_2\mathrm{\Sigma }_2x_2\{x_2\}=(P_\alpha S_\alpha )(\{x_2\})(x_1\mathrm{\Sigma }_1)x_2=\alpha (x_1)`$ and $`x_2(P_\alpha S_\alpha )(A_2)(x_1\mathrm{\Sigma }_1)x_2=\alpha (x_1)A_2x_2A_2`$.

(2) First, $`p=p1=p(aa^{})=(pa)(pa^{})`$, so that either $`pa=pp<a`$ or $`pa^{}=pp<a^{}`$. In particular $`pq^{}`$ if and only if $`p=q`$, so that for $`A\mathrm{\Sigma }_B`$ we obtain $`p<Ap(A)^{}=A^{}(qA)pq^{}pA`$. Hence $`(\rho \mu )(a)=\{p\mathrm{\Sigma }_B|p<a\}=a`$ and $`(\mu \rho )(A)=\{p\mathrm{\Sigma }_B|p<A\}=A`$. Second, let $`f(\mathrm{\Sigma }_{B_1})\mathrm{\Sigma }_{B_2}`$. Then $`g(0_2)=0_1`$, since if $`p_1<g(0_2)`$ then $`f(p_1)<0_2`$ which is impossible by hypothesis, so that $`g(a_2)g(a_2^{})=g(a_2a_2^{})=g(0_2)=0_1`$. Further, for each $`p_1\mathrm{\Sigma }_{B_1}`$ either $`f(p_1)<a_2`$ and $`p_1<g(a_1)<g(a_1)g(a_1^{})`$ or $`f(p_1)<a_2^{}`$ and $`p_1<g(a_2^{})<g(a_2)g(a_2^{})`$, so that $`g(a_2)g(a_2^{})=1_1`$. Hence $`g(a_2^{})=g(a_2)^{}`$. Third, let $`g(a_2^{})=g(a_2)^{}`$. Then $`f(p_1)0_2`$ since we have that $`f(a_1)<0_2a_1<g(0_2)=g(1_2^{})=g(1_2)^{}=1_1^{}=0_1`$. Further, if $`a_2<f(p_1)`$ then either $`p_1<g(a_2)`$, so that $`a_2<f(p_1)<a_2`$ and $`a_2=f(p_1)`$, or $`p_1<g(a_2)^{}=g(a_2^{})`$, so that $`a_2<f(p_1)<a_2^{}`$ and $`a_2=0_2`$. Hence $`f(p_1)`$ is an atom.

Proof of proposition 6.1 :

(1) The maps are isotone : if $`AB`$ then $`J(A)=A<B=J(B)`$, and if $`a<b`$ then $`\mathrm{}(a)=[0,a][0,b]=\mathrm{}(b)`$. Further, $`(J\mathrm{})(a)=J([0,a])=[0,a]=a`$, and $`A[0,A]=\mathrm{}(A)=(\mathrm{}J)(a)`$.

(2) Let $`f\theta `$. Then $`f=f\mathrm{id}_1=fJ_1\mathrm{}_1=J_2\theta \mathrm{}_1`$. Further, let $`g=J_1\phi \mathrm{}_2`$ where $`\theta \phi `$. Then $`fg=fJ_1\phi \mathrm{}_2=J_2\theta \phi \mathrm{}_2<J_2\mathrm{}_2=\mathrm{id}_2`$ and $`\mathrm{id}_1=J_1\mathrm{}_1<J_1\phi \theta \mathrm{}_1<J_1\phi \mathrm{}_2J_2\theta \mathrm{}_1=gf`$, so that $`fg`$.

(3) Suppose that $`\theta `$ is strongly isotone, and define $`f:L_1L_2:a_1\theta (\{a_1\})`$. Then we have $`f(A_1)=\theta (\{A_1\})=\theta (A_1)`$, since $`\{A_1\}=A_1`$ so that $`\{A_1\}A_1`$. Suppose that $`f\theta `$ and $`A_1B_1`$. Then $`A_1<B_1`$, so that $`\theta (A_1)=f(A_1)<f(B_1)=\theta (B_1)`$ and $`\theta (A_1)\theta (B_1)`$.

(4) If $`f_1\theta _1`$, $`f_2\theta _2`$ then $`f_2f_1J_1=f_2J_2\theta _1=J_3\theta _2\theta _1`$, and $`f_2f_1\theta _2\theta _1`$. If $`f_\alpha \theta _\alpha `$ then $`(_\alpha f_\alpha )J_1=_\alpha (f_\alpha J_1)=_\alpha (J_2\theta _\alpha )=J_2(_\alpha \theta _\alpha )`$, and $`_\alpha f_\alpha _\alpha \theta _\alpha `$.

Proof of proposition 6.2 :

(1) First, $`fJ(\mathrm{𝟐},L)`$ iff $`f=f_a:[00;\mathrm{\hspace{0.17em}1}a]`$, whereas $`\theta J(P_0(\mathrm{𝟐}),P_0(L))`$ iff $`\theta =\theta _A:[\mathrm{}\mathrm{};\{1\}A]`$. Second, $`P_{f_a}=\theta _{\{a\}}`$ so that $`_{aA}P_{f_a}=\theta _A`$. Third, $`f_a\theta _Af_a(X)=\theta _A(X)a=f(1)=f(\{1\})=\theta (\{1\})=A`$. Hence $`PS(\mathrm{𝟐},L)=L`$ whereas $`BS(\mathrm{𝟐},L)=TS(\mathrm{𝟐},L)=FS(\mathrm{𝟐},L)=P_0(L)`$.

(2) First, $`fJ(L,\mathrm{𝟐})`$ iff $`f=f_a:[x0(x<a);1(xa)]`$, whereas we have that $`\theta J(P_0(L),P_0(\mathrm{𝟐}))`$ iff $`\theta =\theta _A:[X\mathrm{}(XA);\{1\}(XA)]`$. Second, $`P_{f_a}(\{x\})=[\mathrm{}(x<a);\{1\}(xa)]`$ and so $`P_{f_a}=\theta _{[0,a]}`$. Third, $`f_a\theta _A`$ iff $`X<af_a(X)=0\theta _A(X)=0XA`$, iff $`A=[0,a]`$ and $`\theta _A=P_{f_a}`$. Hence $`PS(L,\mathrm{𝟐})=BS(L,\mathrm{𝟐})=TS(L,\mathrm{𝟐})=L`$ whereas $`FS(L,\mathrm{𝟐})=P_0(L)`$.

(3) We must give an example for which the inclusion $`\text{BStruct}\text{TStruct}`$ is strict. Let $`\theta :P_0(L)P_0(L):A[A(1A);\{a\}A(1A)]`$. Then $`\theta `$ preserves unions, $`\theta (_\alpha A_\alpha )=\{a\}A1_\alpha A_\alpha (\alpha )[1A_\alpha \theta (A_\alpha )=\{a\}A]_\alpha \theta (A_\alpha )=\{a\}A`$, and $`\mathrm{id}_L\theta `$, since if $`1A`$ we have $`\mathrm{id}_L(A)=A=\theta (A)`$ whereas if $`1A`$ we have $`\mathrm{id}_L(A)=A=1=a1=a(A)=(\{a\}A)=\theta (A)`$. However, if there exists $`1ba`$ then we cannot express $`\theta `$ as a union of power maps. Indeed, suppose that $`\theta =_\alpha P_{f_\alpha }`$ so that $`\theta (\{x\})=_\alpha P_{f_\alpha }(\{x\})=\{f_\alpha (x)\}`$. Then $`\{f_\alpha (x)\}=\theta (\{x\})=\{x\}`$ for $`x1`$ whereas $`\{f_\alpha (1)\}=\theta (\{1\})=\{a,1\}`$. Hence we would have $`\theta =P_{f_1}P_{f_a}`$ where $`f_1:xx`$ and $`f_a:xx(x1);a(x=1)`$, the latter not being isotone since $`b<1`$ whereas $`f_a(b)=ba=f_a(1)`$.


text:
# Acknowledgement

## Acknowledgement

We thank Prof. Y. Singh and Prof. Chandan Dasgupta for their comments. SPD acknowledges the support from grant INT9615212 from NSF. CK acknowledges financial support from the University Grants Commission (UGC) of India.

## Figure Captions

Fig 1 : Ideal gas part of the free energy per particle ( in units of $`\beta ^1`$) vs. $`\alpha `$ ( in units of $`\sigma ^2`$ ) for density $`\rho _{o}^{}{}_{}{}^{}=1.0`$. The solid line is obtained from the exact evaluation, i.e. eqn. (4) and the dashed line is the result from the approximation.

Fig 2 : Free Energy difference per particle ($`\mathrm{\Delta }f`$) ( in units of $`\beta ^1`$ ) vs. density in the low $`\alpha `$ regime.

Fig 3 : Difference in Free Energy per particle ($`\mathrm{\Delta }f`$) ( in units of $`\beta ^1`$ ) vs. $`\alpha `$ ( in units of $`\sigma ^2`$) in the low $`\alpha `$ regime ($`\rho _{o}^{}{}_{}{}^{}=1.12`$). The inset demonstrates the continuity of the curve near the maximum.

Fig 4 : Average displacement $`d`$ ( in units of $`\sigma `$ ) vs. $`\rho _o`$. The dashed curve depicts the supercooled phase and the solid line is for the fcc crystal.

Fig 5: Barrier height $`h`$ (in units of $`\beta ^1`$) between the liquid and the supercooled phase vs. the average packing fraction $`\eta `$. The solid line is a power law fit to this data.

Fig 6: The Bulk Modulus E(in units of ($`\beta \sigma ^3)^1`$) vs. density for the amorphous structure. In the inset, pressure P (in units of ($`\beta \sigma ^3)^1`$) vs. density is shown.