Loading...
Projects / Programmes source: ARIS

Isomorphisms, isometries, and preservers

Research activity

Code Science Field Subfield
1.01.04  Natural sciences and mathematics  Mathematics  Algebra 

Code Science Field
1.01  Natural Sciences  Mathematics 
Keywords
Order-isomorphism, operator interval, self-adjoint operator, Grassmann space, isometry, operator norm, Minkowski space, coherency, adjacency.
Evaluation (rules)
source: COBISS
Researchers (6)
no. Code Name and surname Research area Role Period No. of publicationsNo. of publications
1.  08721  PhD Matej Brešar  Mathematics  Researcher  2020 - 2023  829 
2.  50783  PhD Timotej Hrga  Computer intensive methods and applications  Researcher  2021 - 2023  23 
3.  29584  PhD Marko Kandić  Mathematics  Researcher  2020 - 2023  64 
4.  33288  PhD Lucijan Plevnik  Mathematics  Researcher  2020 - 2023  24 
5.  05953  PhD Peter Šemrl  Mathematics  Head  2020 - 2023  497 
6.  37670  PhD Matija Vidmar  Mathematics  Researcher  2020 - 2023  38 
Organisations (1)
no. Code Research organisation City Registration number No. of publicationsNo. of publications
1.  1554  University of Ljubljana, Faculty of Mathematics and Physics  Ljubljana  1627007  34,249 
Abstract
We will deal with four problems that are closely related. It has been known which operator intervals are order-isomorphic and for each pair of order-isomorphic operator intervals the general form of order-isomorphisms between the two intervals is known. An order-isomorphism is a bijective map between two operator intervals which preserves order in both directions. Can we drop the bijectivity assumption and still obtain some reasonable result? More precisely, we want to describe the general form of maps from an operator interval into the set of all bounded linear self-adjoint operators preserving order in both directions. There is no hope to get a reasonable result in the infinite-dimensional case. Hence, we will restrict to the finite-dimensional case. We believe that this problem is closely related to the problem of a maximal possible extension of an order-isomorphism between two operator intervals. One of the main tools when studying order-preserving maps on self-adjoint operators/matrices is the fundamental theorem of geometry of hermitian matrices which describes the general form of bijective adjacency preserving maps on hermitian matrices. All other problems that we will consider are also closely related to the study of adjacency preservers. The structural problem for isometries of Grassmann spaces on Hilbert spaces has been recently solved in full generality. Here, the Grassmann space is identified with the set of all projections of a given fixed rank and the distance is induced by the operator norm. We will study isometries of Grassmann spaces with respect to other norms. Fundamental theorem of chronogeometry describes the general form of bijective maps on Minkowski space that preserve coherency in both directions. Our goal is to find the optimal version of this classical result. We would like to describe the general form of maps on Minkowski space that preserve coherency in one direction only (no injectivity or surjectivity is assumed). So far we have succeeded to solve this problem under the additional assumption of continuity. Similarly, we plan to obtain the optimal version of the fundamental theorem of geometry of Grassmann spaces. This theorem describes the general form of bijective maps on a Grassmann space preserving adjacency in both directions. We would like to remove the bijectivity condition and replace the assumption of preserving adjacency in both directions by a weaker assumption of preserving adjacency in one direction only. Moreover, we would like to consider adjacency preservers between two different Grassmann spaces. The fundamental theorem of geometry of Grassmann spaces can be reduced to the fundamental theorem of geometry of matrices. We have recently obtained the optimal version of the fundamental theorem of geometry of matrices and we expect that the techniques we have developed will help us to solve the problem.
Views history
Favourite