Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 71 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 93 tok/s Pro
Kimi K2 207 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Boolean subalgebras of orthoalgebras (1711.03748v2)

Published 10 Nov 2017 in math.QA and math.RA

Abstract: We develop a direct method to recover an orthoalgebra from its poset of Boolean subalgebras. For this a new notion of direction is introduced. Directions are also used to characterize in purely order-theoretic terms those posets that are isomorphic to the poset of Boolean subalgebras of an orthoalgebra. These posets are characterized by simple conditions defining orthodomains and the additional requirement of having enough directions. Excepting pathologies involving maximal Boolean subalgebras of four elements, it is shown that there is an equivalence between the category of orthoalgebras and the category of orthodomains with enough directions with morphisms suitably defined. Furthermore, we develop a representation of orthodomains with enough directions, and hence of orthoalgebras, as certain hypergraphs. This hypergraph approach extends the technique of Greechie diagrams and resembles projective geometry. Using such hypergraphs, every orthomodular poset can be represented by a set of points and lines where each line contains exactly three points.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.