New Mexico State University researchers are demonstrating key developments in poset research, revealing a method to fundamentally reshape mathematical ordering without altering core components. The team reports demonstrating that a specific mathematical construction allows researchers to build an orthomodular poset from a ‘strong orthoposet’ while keeping the same underlying set and orthocomplementation. This means altering the relationships within a structure while preserving its essential elements, a potentially powerful technique for manipulating complex systems. According to the researchers, this work establishes an adjunction, indicating a structural link between ortholattices and orthomodular posets. The research specifically focuses on strong orthoposets, those where any two orthogonal elements have a join, and details how these can be transformed into orthomodular posets.
Introduction Every orthocomplemented poset ( op ) is the set-theoretic union of its Boolean subalgebras
Every orthocomplemented poset (op) is the set-theoretic union of its Boolean subalgebras. John Harding of New Mexico State University, Gejza Jenča of the Slovak University of Technology, and Bert Lindenhovius of Johannes Kepler University Linz have shown that the category of orthomodular posets is a full coreflective subcategory of the category of strong orthoposets, those orthoposets in which any two orthogonal elements have a join. This construction provides a coreflector from the category of strong orthoposets to its full subcategory of orthomodular posets that restricts to a right adjoint functor from the category of ortholattices to orthomodular posets. Researchers construct an orthomodular poset with the same underlying set and same orthocomplementation as a strong orthoposet, but with modified order. This establishes a connection: the ordering of a mathematical structure can be altered without changing its underlying set or orthocomplementation.
The researchers have also established an adjunction, a specific type of relationship, between ortholattices and orthomodular posets. This adjunction signifies a connection between these mathematical categories. The statement that if L is an ortholattice, then G(L) is an orthomodular poset further solidifies the broad applicability of this construction. The team’s work builds on the concept of an sop-morphism, defined as an order-preserving map that preserves both orthocomplementation and binary orthogonal joins.
Throughout this note, we will be concerned with joins and meets of a subset of a bounded poset P. These do not always exist. For A ⊆ P, we will say that A has a join if there is a least upper bound of A in P, and similarly for meets. In this case, we write ⋁ A for its join, and ⋀ A for its meet. When A consists of two elements x, y we use x ∨ y and x ∧ y for these. We often write ⋁ A = x or ⋀ A = y to indicate both that A has a join or meet, and to also give the value of this join or meet. In particular, if we write x ∨ y = 1, we mean that x, y have a least upper bound in the poset and that the value of this least upper bound is 1.
The team has demonstrated a specific property relating to Boolean subalgebras. Lemma 2.5 establishes that elements x and y belong to a Boolean subalgebra of an orthocomplemented poset if and only if certain conditions regarding their relationships and orthocomplements hold. The authors state that these subalgebras are limited in size under specific conditions. The statement that if L is an ortholattice, then G(L) is an orthomodular poset further solidifies the broad applicability of this construction, suggesting a connection between Boolean subalgebras and the overall structure of the poset that is expected to drive further research.
The ability to reshape mathematical structures without fundamentally altering their core components is gaining traction as a powerful technique. The researchers demonstrate that x ∨ (x’ ∧ z) = z under specific conditions, a result that underpins the proof of orthomodularity. This specificity is crucial; the researchers aren’t dealing with all orthoposets, but a defined subset possessing a key property that enables the transformation. The proof of Theorem 3.2, detailed in their recent publication, hinges on several claims. For instance, they establish that if x and y lie in a Boolean subalgebra of P, then this seemingly technical detail is vital for demonstrating the preservation of fundamental operations during the transformation.
Proposition 4.1 confirms that if P is a sop, then P and G(P) have the same Boolean subalgebras, and for elements x, y in a Boolean subalgebra B, their join and meet in B agrees with their join and meet in P and with their join and meet in G(P). This preservation of Boolean subalgebras is crucial for maintaining consistency during transformations. However, the construction isn’t universally applicable. Example 4.3 illustrates this limitation, detailing an op that fails to meet the criteria for a sop, and therefore cannot be reliably processed. The researchers found that the expected relationships break down when the strong orthoposet condition is not met. Even when starting with a well-behaved ortholattice, the resulting orthomodular poset may not always inherit desirable properties, as shown by Example 4.4, which details a case where the construction results in a structure that is not a lattice. These examples highlight that while powerful, the construction has defined limitations, and careful consideration of the initial structure is essential for successful application.
A Categorical View: Researchers have shown that the category of orthomodular posets is a full coreflective subcategory of the category of strong orthoposets, with coreflector G. This construction provides a coreflector from the category of strong orthoposets to its full subcategory of orthomodular posets that restricts to a right adjoint functor from the category of ortholattices to orthomodular posets. The team’s work builds on the concept of an sop-morphism, defined as an order-preserving map that preserves both orthocomplementation and binary orthogonal joins. A key lemma demonstrates that if f is an sop-morphism between two strong orthoposets, P and Q, then the same set map considered as a map f: G(P) → G(Q) is also an sop-morphism. The researchers state that this outlines a critical property of this transformation. The statement that if L is an ortholattice, then G(L) is an orthomodular poset further solidifies the broad applicability of this construction. This construction provides a coreflector from the category of strong orthoposets to its full subcategory of orthomodular posets, and this functor is right adjoint.
Source: https://arxiv.org/abs/2607.01259
