Papers
Topics
Authors
Recent
Search
2000 character limit reached

Characterisation of quadratic spaces over the Hilbert field by means of the orthogonality relation

Published 28 Apr 2025 in math.RA | (2504.19563v1)

Abstract: An orthoset is a set equipped with a symmetric, irreflexive binary relation. With any (anisotropic) Hermitian space $H$, we may associate the orthoset $(P(H),\perp)$, consisting of the set of one-dimensional subspaces of $H$ and the usual orthogonality relation. $(P(H),\perp)$ determines $H$ essentially uniquely. We characterise in this paper certain kinds of Hermitian spaces by imposing transitivity and minimality conditions on their associated orthosets. By gradually considering stricter conditions, we restrict the discussion to a more and more narrow class of Hermitian spaces. We are eventually interested in quadratic spaces over countable subfields of $\mathbb R$. A line of an orthoset is the orthoclosure of two distinct element. For an orthoset to be line-symmetric means roughly that its automorphism group acts transitively both on the collection of all lines as well as on each single line. Line-symmetric orthosets turn out to be in correspondence with transitive Hermitian spaces. Furthermore, quadratic orthosets are defined similarly, but are required to possess, for each line $\ell$, a group of automorphisms acting on $\ell$ transitively and commutatively. We show the correspondence of quadratic orthosets with transitive quadratic spaces over ordered fields. We finally specify those quadratic orthosets that are, in a natural sense, minimal: for a finite $n \geq 4$, the orthoset $(P(Rn),\perp)$, where $R$ is the Hilbert field, has the property of being embeddable into any other quadratic orthoset of rank $n$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Collections

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