Sublattices and Δ-blocks of orthomodular posets

2020 ◽  
Vol 30 (7) ◽  
pp. 1401-1423
Author(s):  
Ivan Chajda ◽  
Helmut Länger

Abstract States of quantum systems correspond to vectors in a Hilbert space and observations to closed subspaces. Hence, this logic corresponds to the algebra of closed subspaces of a Hilbert space. This can be considered as a complete lattice with orthocomplementation, but it is not distributive. It satisfies a weaker condition, the so-called orthomodularity. Later on, it was recognized that joins in this structure need not exist provided the subspaces are not orthogonal. Hence, the resulting structure need not be a lattice but a so-called orthomodular poset, more generally an orthoposet only. For orthoposets, we introduce a binary relation $\mathrel \Delta$ and a binary operator $d(x,y)$ that are generalizations of the binary relation $\textrm{C}$ and the commutator $c(x,y)$, respectively, known for orthomodular lattices. We characterize orthomodular posets among orthogonal posets. Moreover, we describe connections between the relations $\mathrel \Delta$ and $\leftrightarrow$ (the latter was introduced by P. Pták and S. Pulmannová) and the operator $d(x,y)$. In addition, we investigate certain orthomodular posets of subsets of a finite set. In particular, we describe maximal orthomodular sublattices and Boolean subalgebras of such orthomodular posets. Finally, we study properties of $\Delta$-blocks with respect to Boolean subalgebras and distributive subposets they include.

2020 ◽  
Author(s):  
Ivan Chajda ◽  
Helmut Länger

Abstract Orthomodular posets form an algebraic formalization of the logic of quantum mechanics. A central question is how to introduce implication in such a logic. We give a positive answer whenever the orthomodular poset in question is of finite height. The crucial advantage of our solution is that the corresponding algebra, called implication orthomodular poset, i.e. a poset equipped with a binary operator of implication, corresponds to the original orthomodular poset and that its implication operator is everywhere defined. We present here a complete list of axioms for implication orthomodular posets. This enables us to derive an axiomatization in Gentzen style for the algebraizable logic of orthomodular posets of finite height.


2018 ◽  
Vol 11 (06) ◽  
pp. 1850097 ◽  
Author(s):  
Ivan Chajda ◽  
Helmut Länger

Using the operators of taking upper and lower cones in a poset with a unary operation, we define operators [Formula: see text] and [Formula: see text] in the sense of multiplication and residuation, respectively, and we show that by using these operators, a general modification of residuation can be introduced. A relatively pseudocomplemented poset can be considered as a prototype of such an operator residuated poset. As main results, we prove that every Boolean poset as well as every pseudo-orthomodular poset can be organized into a (left) operator residuated structure. Some results on pseudo-orthomodular posets are presented which show the analogy to orthomodular lattices and orthomodular posets.


1975 ◽  
Vol 19 (2) ◽  
pp. 160-172
Author(s):  
R. H. Schelp

It is shown in Gudder and Schelp (1970) that partial Baer *-semigroups coordinatize orthomodular partially ordered sets (orthomodular posets). This means for P an orthomodular poset there exists a partial Baer *-semigroup whose closed projections are order isomorphic to P preserving ortho-complementation. This coordinatization theorem generalizes Foulis (1960) in which orthomodular lattices are coordinatized by Baer *-semigroups. In particular Foulis (unpublished) shows that any complete atomic Boolean lattice is coordinatized by a Bear *-semigroup of relations. Since Greechie (1968), (1971) shows that a whole class of orthomodular posets can be formed by “pasting” together Boolean lattices, it is natural to consider the following problem. Let y be a family of Baer *-semigroups of relations which coordinatize the family B of complete atomic lattices. Is it possible to construct a partial *-semigroup of relations R which contains each member of Y such that when P is an orthomodular poset obtained by a “Greechie pasting” of members of 38 then 91 coordinatizes R This question is considered in the sequel and answered affirmatively for a certain subclass of “Greechie pasted” orthomodular posets. In addition the construction of 8)t nicely fulfills another objective in that it provides us with “nontrivial” coordinate partial Baer *-semigroups for a whole family of well known orthomodular posets. This is particularly significant since the only other known coordinate partial Baer *-semigroups, for those posets in this family which are not lattices, are the “minimal” ones given in Gudderand and Schelp (1970).


2013 ◽  
Vol 21 (3) ◽  
pp. 223-233
Author(s):  
Eliza Niewiadomska ◽  
Adam Grabowski

Summary In the article the formal characterization of preference spaces [1] is given. As the preference relation is one of the very basic notions of mathematical economics [9], it prepares some ground for a more thorough formalization of consumer theory (although some work has already been done - see [17]). There was an attempt to formalize similar results in Mizar, but this work seems still unfinished [18]. There are many approaches to preferences in literature. We modelled them in a rather illustrative way (similar structures were considered in [8]): either the consumer (strictly) prefers an alternative, or they are of equal interest; he/she could also have no opinion of the choice. Then our structures are based on three relations on the (arbitrary, not necessarily finite) set of alternatives. The completeness property can however also be modelled, although we rather follow [2] which is more general [12]. Additionally we assume all three relations are disjoint and their set-theoretic union gives a whole universe of alternatives. We constructed some positive and negative examples of preference structures; the main aim of the article however is to give the characterization of consumer preference structures in terms of a binary relation, called characteristic relation [10], and to show the way the corresponding structure can be obtained only using this relation. Finally, we show the connection between tournament and total spaces and usual properties of the ordering relations.


2021 ◽  
Vol 2038 (1) ◽  
pp. 012026
Author(s):  
Miloslav Znojil

Abstract With an innovative idea of acceptability and usefulness of the non-Hermitian representations of Hamiltonians for the description of unitary quantum systems (dating back to the Dyson’s papers), the community of quantum physicists was offered a new and powerful tool for the building of models of quantum phase transitions. In this paper the mechanism of such transitions is discussed from the point of view of mathematics. The emergence of the direct access to the instant of transition (i.e., to the Kato’s exceptional point) is attributed to the underlying split of several roles played by the traditional single Hilbert space of states ℒ into a triplet (viz., in our notation, spaces K and ℋ besides the conventional ℒ ). Although this explains the abrupt, quantum-catastrophic nature of the change of phase (i.e., the loss of observability) caused by an infinitesimal change of parameters, the explicit description of the unitarity-preserving corridors of access to the phenomenologically relevant exceptional points remained unclear. In the paper some of the recent results in this direction are summarized and critically reviewed.


Quantum ◽  
2020 ◽  
Vol 4 ◽  
pp. 273 ◽  
Author(s):  
Daniel Nickelsen ◽  
Michael Kastner

We introduce structured random matrix ensembles, constructed to model many-body quantum systems with local interactions. These ensembles are employed to study equilibration of isolated many-body quantum systems, showing that rather complex matrix structures, well beyond Wigner's full or banded random matrices, are required to faithfully model equilibration times. Viewing the random matrices as connectivities of graphs, we analyse the resulting network of classical oscillators in Hilbert space with tools from network theory. One of these tools, called the maximum flow value, is found to be an excellent proxy for equilibration times. Since maximum flow values are less expensive to compute, they give access to approximate equilibration times for system sizes beyond those accessible by exact diagonalisation.


2018 ◽  
Vol 11 (02) ◽  
pp. 1850093 ◽  
Author(s):  
Ivan Chajda ◽  
Helmut Länger

Orthomodular posets form an algebraic semantic for the logic of quantum mechanics. We show several methods how to construct orthomodular posets via a representation within the powerset of a given set. Further, we generalize this concept to the concept of weakly orthomodular and dually weakly orthomodular posets where the complementation need not be antitone or an involution. We show several interesting examples of such posets and prove which intervals of these posets are weakly orthomodular or dually weakly orthomodular again. To every (dually) weakly orthomodular poset can be assigned an algebra with total operations, a so-called (dually) weakly orthomodular [Formula: see text]-lattice. We study properties of these [Formula: see text]-lattices and show that the variety of these [Formula: see text]-lattices has nice congruence properties.


Sign in / Sign up

Export Citation Format

Share Document