Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 54 min ago
PreprintCC BY 4.0arXiv

Orthogonal adjointness in posets with $0$

Abstract

Motivated by the concept of polarity introduced by G. Birkhoff for a binary relation on a set, we introduce a concept of orthogonality in a poset with $0$. A pair of operators f, g on a poset with $0$ is called orthogonally adjoint if f(x) is orthogonal to y if and only if x is orthogonal to g(y). We characterize the existence and the uniqueness of g for given f and describe basic properties of orthogonal adjointness. We present constructions of orthogonally adjoint pairs in pseudocomplemented posets. If a given operator f is an order-isomorphism of a pseudocomplemented poset satisfying some natural properties then the corresponding adjoint g can be described explicitly. Moreover, if f and f−1 are bijective ⊥-morphisms then they are orthogonally adjoint, too. Finally we show that a given pair of orthogonally adjoint mappings on a poset P may not be extendable to the Dedekind-McNeille completion of P and we present sufficient conditions for the existence of such an extension. We also provide sufficient conditions for the existence of an extension of orthogonally adjoint mappings to the lattice of ideals. Our results are illustrated by numerous examples.

Related

  1. The Landau-Dirac operator with shell interactions: self-adjointness and clustering
    Badreddine Benhellal, Vincent Bruneau, Pablo Miranda
    Journal of Spectral TheoryPreprintCC BY 4.0Full textMathematical physicsHAL
  2. Beyond the Shadow: Reciprocal Self-Adjointness, the Exact Spectral Offset, and the Limits of Integrability of the Parisi–Zamponi Matching Front
    Giovanni Frisina
    Zenodo (CERN European Organization for Nuclear Research)PreprintCC BY5 citedMathematical physicsOpenAlex
  3. Eulerian cyclic posets
    Richard Ehrenborg
    Enumerative Combinatorics and ApplicationsPeer-reviewedCC BY-NDFull textCombinatorics & discrete mathematicsDOAJ
  4. Compact-Open Dualities for Stably Continuous Posets
    Jérémie Marquès
    HALPreprintLicence not statedLogic & foundationsHAL
  5. A Generating Polynomial for Convex Subsets of Posets
    Ian George, Rowan Yeats
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{botur2026orthogonal,
  title = {{Orthogonal adjointness in posets with $0$}},
  author = {Michal Botur and Ivan Chajda and Helmut Länger},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2608.29732},
  eprint = {2608.29732},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.29732},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Orthogonal adjointness in posets with $0$
AU  - Michal Botur
AU  - Ivan Chajda
AU  - Helmut Länger
PY  - 2026
DA  - 2026/08/30
PB  - arXiv
DO  - 10.48550/arxiv.2608.29732
UR  - https://arxiv.org/abs/2608.29732
AB  - Motivated by the concept of polarity introduced by G. Birkhoff for a binary relation on a set, we introduce a concept of orthogonality in a poset with $0$. A pair of operators f, g on a poset with $0$ is called orthogonally adjoint if f(x) is orthogonal to y if and only if x is orthogonal to g(y). We characterize the existence and the uniqueness of g for given f and describe basic properties of orthogonal adjointness. We present constructions of orthogonally adjoint pairs in pseudocomplemented posets. If a given operator f is an order-isomorphism of a pseudocomplemented poset satisfying some natural properties then the corresponding adjoint g can be described explicitly. Moreover, if f and f^−1 are bijective ⊥-morphisms then they are orthogonally adjoint, too. Finally we show that a given pair of orthogonally adjoint mappings on a poset P may not be extendable to the Dedekind-McNeille completion of P and we present sufficient conditions for the existence of such an extension. We also provide sufficient conditions for the existence of an extension of orthogonally adjoint mappings to the lattice of ideals. Our results are illustrated by numerous examples.
ER  -