Search arXivSearch

arXiv · 2504.19563

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

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(R^n),\perp)$, where $R$ is the Hilbert field, has the property of being embeddable into any other quadratic orthoset of rank $n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miroslav Korbelář, Jan Paseka, Thomas Vetterlein. 2025-10-28. Characterisation of quadratic spaces over the Hilbert field by means of the orthogonality relation. https://arxiv.org/abs/2504.19563

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA