Preserver problems for the logics associated to Hilbert spaces and related Grassmannians
Mark Pankov

TL;DR
This paper explores transformations preserving orthogonality and compatibility in the quantum logic of Hilbert spaces, extending classical results like Wigner's theorem to Grassmannians and related structures.
Contribution
It provides new insights into preservers of orthogonality and compatibility relations in quantum logics and Grassmannians, generalizing classical theorems.
Findings
Characterization of transformations preserving orthogonality
Results on compatibility relation preservers
Extensions of Wigner's theorem to Grassmannians
Abstract
We consider the standard quantum logic associated to a complex Hilbert space , i.e. the lattice of closed subspaces of together with the orthogonal complementation. The orthogonality and compatibility relations are defined for any logic. In the standard quantum logic, they have a simple interpretation in terms of operator theory. For example, two closed subspaces (propositions in the logic ) are compatible if and only if the projections on these subspaces commute. We present both classical and more resent results on transformations of and the associated Grassmannians which preserve the orthogonality or compatibility relation. The first result in this direction was classical Wigner's theorem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Advanced Topics in Algebra · Matrix Theory and Algorithms
Preserver problems for the logics associated to Hilbert spaces and related Grassmannians
Mark Pankov
Mark Pankov: Faculty of Mathematics and Computer Science, University of Warmia and Mazury, Olsztyn, Poland
Abstract.
We consider the standard quantum logic associated to a complex Hilbert space , i.e. the lattice of closed subspaces of together with the orthogonal complementation. The orthogonality and compatibility relations are defined for any logic. In the standard quantum logic, they have a simple interpretation in terms of operator theory. For example, two closed subspaces (propositions in the logic ) are compatible if and only if the projections on these subspaces commute. We present both classical and more resent results on transformations of and the associated Grassmannians which preserve the orthogonality or compatibility relation. The first result in this direction was classical Wigner’s theorem.
Key words and phrases:
standard quantum logic, Hilbert Grassmannian, compatibility relation
2010 Mathematics Subject Classification:
15A86, 06C15, 81P10
1. Introduction
A logic is a lattice together with an addition operation known as negation and satisfying some axioms, elements of a logic are called propositions. By G. Birkhoff and J. Von Neumann [3], the logical structure of quantum mechanics corresponds to the logic whose propositions are subspaces of a finite-dimensional Hilbert space and whose negation is the orthogonal complementation. Currently, the standard quantum logic is the logic formed by closed subspaces of an arbitrary (not necessarily finite-dimensional) complex Hilbert space, as above, the negation is the orthogonal complementation. We strongly recommend the short problem book [6] as a quick introduction to the topic and [7, 38, 43] for more information. The readers can ask whether interesting logics related to a more general class of vector spaces? We only note that any logic formed by all closed subspaces of an infinite-dimensional complex Banach space is the standard quantum logic (S. Kakutani and G. W. Mackey [20]).
1.1. Lattices of closed subspaces
The lattice consisting of all subspaces of a vector space (not necessarily finite-dimensional) is well-studied. See, for example, [2]. By the Fundamental Theorem of Projective Geometry [2, Section III.1, p.44], every automorphism of this lattice is induced by a semilinear automorphism of the corresponding vector space if the dimension of the vector space is not less than . For a -dimensional vector space any bijective transformation of the set of -dimensional subspaces gives a lattice automorphism.
Similarly, every automorphism of the lattice of closed subspaces of an infinite-dimensional normed vector space is induced by an invertible bounded linear or conjugate-linear operator (the second possibility is realized only for the complex case). For finite-dimensional complex normed spaces this statement fails, since every subspace is closed and there are non-bounded semilinear automorphisms associated to non-continuous automorphisms of the field of complex numbers.
In the infinite-dimensional case, the description of automorphisms for the lattice of closed subspaces is not a simple consequence of the Fundamental Theorem of Projective Geometry. It was first given by G. W. Mackey [24] for real normed spaces. The complex case easily follows from one technical result obtained by S. Kakutani and G. W. Mackey in [20] (this fact is noted in [17]).
The lattice of closed subspaces of a Hilbert space can be decomposed into the disjoint sum of the following components called Grassmannians:
consisting of all -dimensional subspaces and consisting of all closed subspaces of codimension for every natural . Each can be identified with by the orthogonal complementation. 2.
formed by all closed subspaces whose dimension and codimension both are infinite (if is infinite-dimensional).
The Grassmannian is partially ordered by the inclusion relation. Every automorphism of this partially ordered set can be uniquely extended to an automorphism of the lattice of closed subspaces (M. Pankov [30, 31]).
1.2. Automorphisms of the logics associated to Hilbert spaces
Let be a complex Hilbert space. The inner product on and the associated norm will be denoted by and , respectively. We use the standard symbol to denote the orthogonality relation and write for the orthogonal complement of .
Consider the logic formed by closed subspaces of . Every automorphism of this logic satisfies the following conditions:
it is a lattice automorphism, 2.
it preserves the orthogonal complementation.
The first property implies that such an automorphism is induced by an invertible bounded linear or conjugate-linear operator if is infinite-dimensional, and it is defined by a semilinear automorphism if the dimension of is finite and not less than . It is not difficult to prove that every semilinear automorphism sending orthogonal vectors to orthogonal vectors is unitary or anti-unitary up to a scalar multiply. Therefore, the second property guarantees that every automorphism of the logic is induced by an unitary or anti-unitary operator if the dimension of is not less than . The statement fails if the dimension is equal to (consider the set formed by all pairs of orthogonal -dimensional subspaces, any bijective transformation of this set induces an automorphism of the logic).
In quantum mechanics, so-called pure states are identified with -dimensional subspaces of . The transition probability between two pure states is equal to , where and are unit vectors belonging to and , respectively. Classical Wigner’s theorem states that every bijective transformation of preserving the transition probability is induced by an unitary or anti-unitary operator. This is one of basic results of the mathematical foundations of quantum mechanics. Note that there is an analogue of this statement for not necessarily bijective transformations [13]. Wigner’s theorem can be extended on other Grassmannians. See [14, 25], where transformations of Grassmannians preserving the principal angles and the gap metric are determined. Transformations preserving structures related to quantum mechanics are also investigated in [26, Chapter 2].
Pairs of orthogonal elements from correspond to the case of zero transition probability. U. Uhlhorn [42] reproved Wigner’s theorem in terms of quantum logic as follows. Every bijective transformation of preserving the orthogonality relation in both directions is induced by an unitary or anti-unitary operator. The assumption that the dimension of is not less than cannot be omitted. By M. Györy [8] and P. Šemrl [39], the same holds for orthogonality preserving (in both directions) bijective transformations of and if the dimension of is greater than . In the case when the dimension is equal to , the statement fails (as above, we can take any bijective transformation of the set of all pairs of orthogonal -dimensional subspaces). If the dimension is less than , then there exist no orthogonal pairs of -dimensional subspaces.
It is not difficult to show that every bijective transformation of preserving the orthogonality relation in both directions is an automorphism of the corresponding partially ordered set. Therefore, the mentioned above statement concerning orthogonality preserving transformations of can be obtained from the fact that every automorphism of this partially ordered set is extendable to an automorphism of the lattice of closed subspaces. The proof of the same statement for will be based on Chow’s theorem [5] which describes automorphisms of Grassmann graphs.
1.3. Compatibility relation
So-called compatibility relation is defined for any logic. In classical logics, any two propositions are compatible. Two propositions and in the logic are compatible if there are propositions such that are mutually orthogonal and
[TABLE]
Any two incident or orthogonal elements of are compatible, i.e. the inclusion and orthogonal relations both are contained in the compatibility relation.
Every closed subspace of can be identified with the (orthogonal) projection on this subspace. Two closed subspaces are compatible if and only if the corresponding projections commute. This observation can be generalized as follows.
An observable in quantum mechanics is a measure defined on the -algebra of Borel subsets in which takes values in the logic and such that are orthogonal for any pair of disjoint Borel subsets . Two observables and are called compatible if and are compatible for any pair of Borel subsets . By the spectral theorem, there is a one-to-one correspondence between observables and self-adjoint operators on . Two observables are compatible if and only if the corresponding operators commute (von Neumann’s theorem).
A set consisting of mutually compatible propositions will be called compatible. For every orthogonal basis of any two closed subspaces spanned by subsets of this basis are compatible. Every maximal compatible subset of consists of all closed subspaces spanned by subsets of a certain orthogonal basis for . The family of all such subsets coincides with the family of maximal classical logics contained in . The logic together with the family of maximal classical sublogics is a structure similar to the Tits buildings of general linear groups. A building is a combinatoric construction defined for any group admitting so-called -pair. This is an abstract simplicial complex together with a family of distinguished subcomplexes called apartments, see [41]. The building for the group is formed by all subspaces of and every apartment is formed by all subspaces spanned by subsets of a certain basis for . Maximal compatible subsets of the logic correspond to the apartments defined by orthogonal bases.
The automorphism group of the logic is a proper subgroup in the group of all bijective transformations preserving the compatibility relation in both directions. Consider, for example, the orthogonal complementation or any transformation which transposes some with and leaves fixed all other elements. By L. Molnár and P. Šemrl [27], if is a bijective transformation of preserving the compatibility relation in both directions, then there is an automorphism of the logic such that for every we have either
[TABLE]
The same holds for bijective transformations of preserving the compatibility relation in both directions; this is a simple modification of L. Plevnik’s result [36]. Bijective transformations of preserving the compatibility relation in both directions were described by M. Pankov [34]. If is infinite-dimensional, then every such transformation can be uniquely extended to an automorphism of the logic . The same statement also is proved for the case when the dimension of is finite and distinct from (except one case of small dimension). In the case when the dimension of is equal to , there is a result similar to the description of compatibility preserving transformations of .
It was noted above that the compatibility relation is closely connected to the concept of apartment. Let be the Grassmannian formed by -dimensional subspaces of a vector space . For every basis of this vector space the associated apartment of consists of all -dimensional subspaces spanned by subsets of this basis. In the case when is finite-dimensional, apartments of are the intersections of with apartments of the building for the group . By [32], every apartments preserving bijective transformation of is induced by a semilinear automorphism of or a semilinear isomorphisms of to the dual vector space (the second possibility can be realized only in the case when the dimension of is equal to ).
Similarly, for every orthogonal basis of the associated orthogonal apartment of is formed by all -dimensional subspaces spanned by subsets of this basis. Orthogonal apartments can be characterized as maximal compatible subsets of . Therefore, a bijective transformation of preserves the compatibility relation in both directions if and only if it preserves the family of orthogonal apartments in both directions. The description of such transformations is based on some modifications of the methods applied to apartments preserving transformations in [32].
The compatibility and orthogonality relations have simple interpretations in terms of operator theory. Let us identify every closed subspace with the projection on this subspace. Since two closed subspaces are compatible if and only if the corresponding projections commute, compatibility preserving transformations of the standard quantum logic and the associated Grassmannians can be considered as commutativity preserving transformations of the corresponding sets of projections. Similarly, two closed subspaces are orthogonal if and only if the composition of the associated projections is zero. Therefore, our results concerning orthogonality and compatibility preserving transformations can be reformulated in terms of the discipline known as preserver problems on operator structures. This area describes transformations of operator spaces (sometimes, as in our case, operator sets) which preserve various types of relations, see [26].
2. Lattices of closed subspaces
2.1. Lattices
Let us start from some general definitions. Let be a partially ordered set. Let also be a subset of . An element is an upper bound of if for every . An upper bound of is said to be its least upper bound if for every upper bound of . Dually, is a lower bound of if for every . We say that a lower bound of is the greatest lower bound of if for every lower bound of .
The partially ordered set is called a lattice if for any two elements the subset has the least upper bound denoted by and the greatest lower bound denoted by . This lattice is bounded if it contain the least element [math] and the greatest element satisfying for every .
An isomorphism between partially ordered sets and is a bijective mapping preserving the order in both directions, i.e.
[TABLE]
for all . If our partially ordered sets are lattices and is an isomorphism between them, then
[TABLE]
for all . Isomorphisms of bounded lattices preserve the least and greatest elements.
2.2. Lattices of subspaces of vector spaces
Let be a vector space over a field. Denote by the set of all subspaces of which is partially ordered by the inclusion relation . This is a bounded lattice. For any two subspaces the least upper bound and the greatest lower bound coincide with the sum and the intersection , respectively. The least element is [math] and the greatest element is . In the case when , the lattice is trivial, i.e. it consists of the least element and the greatest element only. For this reason, we will always suppose that . For every natural the lattice contains the following two subsets:
the Grassmannian formed by -dimensional subspaces, 2.
the Grassmannian formed by subspaces of codimension .
If is finite, then coincides with . In the case when is infinite-dimensional, there is also the subset consisting of all subspaces whose dimension and codimension both are infinite. This subset is homogeneous, i.e. for any two elements of there is a linear automorphism of transferring one of them to the other, only in the case when the dimension of is the smallest infinite cardinal number .
Let and be vector spaces over fields and , respectively. We say that a mapping is semilinear if
[TABLE]
for all vectors and there is an isomorphism such that
[TABLE]
for every vector and every scalar . This mapping is linear if the fields are coincident and is identity. In the general case, it is said to be -linear. There are semilinear mappings associated to non-surjective field homomorphisms [16, 33], but we do not consider them here. Semilinear bijections are called semilinear isomorphisms. Every semilinear isomorphism induces an isomorphism of the lattice to the lattice . Every non-zero scalar multiple of is a semilinear isomorphism which induces the same lattice isomorphism. Conversely, if two semilinear isomorphisms define the same isomorphism between the lattices, then one of them is a scalar multiple of the other.
Suppose that and are semilinear isomorphisms which induce the same bijection of to , i.e. we have for every . Then for every non-zero vector there is a scalar such that
[TABLE]
If are linearly independent, then
[TABLE]
and , since and are linearly independent. If is a scalar multiple of , then we take any vector such that are linearly independent (this is possible, since ) and establish that . So, we have for any two non-zero vectors which means that is a scalar multiple of .
In the case when , every isomorphism between the lattices and is induced by a semilinear isomorphism. This is a simple consequence of the Fundamental Theorem of Projective Geometry which will be given below.
For every -dimensional subspace the set formed by all -dimensional subspaces contained in , i.e. , is called a line of . In the case when , the Grassmannian together with all such lines is known as the projective space associated to . We denote this projective space by . For there is only one line and we exclude this case.
An isomorphism of the projective space to the projective space is a bijection such that and send lines to lines.
Theorem 2.1** (The Fundamental Theorem of Projective Geometry).**
Suppose that the dimensions of and both are not less than . Then every isomorphism of to is induced by a semilinear isomorphism and any other semilinear isomorphism inducing this isomorphism of projective spaces is a scalar multiple of .
Proof.
See, for example, [2, Section III.1, p.44]. We also refer [16, 32] or the original research articles [15, 18] for a more general version of this result. ∎
Remark 2.1**.**
If and are of the same finite dimension not less than , then every bijection of to sending lines to subsets of lines is an isomorphism of to [1, Theorem 2.26].
Corollary 2.1**.**
If , then every isomorphism of the lattice to the lattice is induced by a semilinear isomorphism and any other semilinear isomorphism inducing is a scalar multiple of .
Proof.
Since preserves the inclusion relation in both directions, it transfers every to . Therefore, and the restriction of to is an isomorphism of to . By Theorem 2.1, there exists a semilinear isomorphism such that
[TABLE]
For any subspace we have
[TABLE]
which implies that coincides with . If is also induced by a semilinear isomorphism , then for every and Theorem 2.1 implies that is a scalar multiple of . ∎
In the case when , every bijective transformation of preserving [math] and is an automorphism of the lattice and the above statement fails.
2.3. Linear and conjugate-linear operators
The automorphism group of the field of real numbers is trivial and all semilinear mappings between real vector spaces are linear. The automorphism group of the field of complex numbers contains the conjugation and infinitely many other automorphisms.
Example 2.1**.**
Using Zorn’s lemma and [22, Chapter V, Theorem 2.8], we can show that every automorphism of a field can be extended to an automorphism of any algebraically closed extension of this field (see, for example, [33, Section 1.1]). The field ( is a prime number) is contained in the algebraically closed field . Consider the automorphism of sending every to and extend it to an automorphism of . Any such extension is not identity on which implies that it is different from the conjugation.
Lemma 2.1**.**
Every continuous automorphism of the field is identity or the conjugation.
Proof.
If is an automorphism of , then the restriction of to is identity. In the case when is continuous, its restriction to is identity. It is clear that and we get the claim. ∎
Let and be complex Hilbert spaces. A semilinear mapping is bounded if there is a nonnegative real number such that
[TABLE]
for all vectors . The smallest number satisfying this condition is called the norm of and denoted by .
Proposition 2.1**.**
For every bounded semilinear mapping of to the associated automorphism of the field is identity or the conjugation.
This is a simple consequence of the following.
Lemma 2.2**.**
If is an automorphism of the field such that for every sequence of complex numbers converging to [math] the sequence is bounded, then is identity or the conjugation.
Proof.
By Lemma 2.1, we need to show that is continuous. Since is additive, it is sufficient to establish that is continuous in [math]. Indeed, if , then and implies that .
If a sequence converges to [math] and is not converging to [math], then contains a subsequence such that the inequality holds for a certain real number and all natural . In the sequence , we choose a subsequence satisfying . Recall that is an automorphism of and we have for every natural . Then
[TABLE]
and the sequence is unbounded which contradicts our assumption. ∎
Linear mappings of to will be called linear operators. A semilinear mapping of to is said to be a conjugate-linear operator if the associated automorphism of is the conjugation. If a linear or conjugate-linear operator is invertible, then the operators and are of the same type, i.e. both are linear or conjugate-linear.
Example 2.2**.**
It is well-known that every linear operator on the Hilbert space is bounded. The mapping
[TABLE]
is an invertible bounded conjugate-linear operator on . Every conjugate-linear operator on is of type , where is a linear operator. Therefore, each conjugate-linear operator on is bounded.
Example 2.3**.**
Let be an orthonormal basis of . There is the unique conjugate-linear operator which leaves fixed every vector from this basis. If is a countable or finite subset of and , then
[TABLE]
Every conjugate-linear operator can be presented as the composition , where is a linear operator. The operator is invertible bounded.
We will exploit the following well-known operator properties:
A linear operator is bounded if and only if transfers bounded subsets to bounded subsets. 2.
By the bounded inverse theorem, for every invertible bounded linear operator the inverse operator is bounded.
Using the operator from Example 2.3, we can show that the same statements hold for conjugate-linear operators.
If is a bounded linear operator, then for every vector the mapping
[TABLE]
is a bounded linear functional on and, by Riesz’s representation theorem, there exists the unique vector such that
[TABLE]
for all vectors . The mapping is a bounded linear operator and . This operator is known as adjoint to .
Now, we suppose that is a bounded conjugate-linear operator. For every vector the mapping
[TABLE]
is a bounded linear functional on and there is the unique vector such that
[TABLE]
for all vectors . We get a conjugate-linear operator which will be called adjoint to . As above, the operator is bounded and .
For every linear or conjugate-linear bounded operator we have . Also, is invertible if and only if is invertible. In this case, the operators and are coincident.
An invertible linear operator on is unitary if for all vectors we have
[TABLE]
An invertible conjugate-linear operator on is said to be anti-unitary if
[TABLE]
for all vectors . In each of these cases, for every vector . In particular, unitary and anti-unitary operators are bounded and transfer orthonormal bases to orthonormal bases. An invertible bounded linear operator is unitary if and only if . Similarly, an invertible bounded conjugate-linear operator is anti-unitary if and only if the same equality holds.
Example 2.4**.**
The normalized Fourier transform on the Hilbert space is an unitary operator. The operator from Example 2.3 is anti-unitary and every anti-unitary operator on can be presented as the composition , where is an unitary operator on .
Example 2.5**.**
A linear operator on is called an idempotent if . The latter equality implies that the restriction of to the image is identity and for every the vector belongs to the kernel . This means that is the direct sum of the subspaces and , i.e. every vector can be uniquely presented as the sum of and such that . The operator also is an idempotent and
[TABLE]
Conversely, if is the direct sum of subspaces and , then for every vector there are the unique and such that and the operators and are idempotents. If an idempotent is bounded, then the subspaces and are closed and the adjoint operator also is an idempotent. Bounded self-adjoint idempotents are called projections. An idempotent is a projection if and only if the subspaces and are orthogonal. The Hilbert space is the orthogonal direct sum of the subspace of even functions and the subspace of odd functions; the corresponding projections are
[TABLE]
Example 2.6**.**
A non-identity operator is called an involution if . For every idempotent the operator is an involution; the restriction of to is identity and for all vectors . Conversely, for every involution the operator is an idempotent. So, there is a one-to-one correspondence between idempotents and involutions. An involution is unitary if and only if the associated idempotent is a projection. Every unitary involution is self-adjoint.
2.4. Lattices of closed subspaces of Hilbert spaces
Let be a complex Hilbert space. Denote by the set of all closed subspaces of which is partially ordered by the inclusion relation . This is a bounded lattice whose least element is [math] and whose greatest element is . For any two closed subspaces the greatest lower bound is the intersection and the least upper bound is , i.e. the minimal closed subspace containing .
Example 2.7**.**
The sum of closed subspaces and is not necessarily closed. Let be an orthonormal basis for . Suppose that is the closed subspace spanned by all and is the closed subspace spanned by all . Every vector from the basis belongs to which means that coincides with . However, is a proper subspace of . Indeed, the vector defined by a series belongs to if and only if the series is convergent (we leave all details for the readers). On the other hand, we can state that is closed if one of the following possibilities is realized:
at least one of the subspaces is finite-dimensional, 2.
and are orthogonal, in particular, if are orthogonal.
As above, we write for the Grassmannian formed by -dimensional subspaces of . Since all finite-dimensional subspaces of are closed, every such Grassmannian is contained in . Let be the Grassmannian consisting of closed subspaces whose codimension is equal to . In the case when is finite, coincides with .
If is infinite-dimensional, then we write for the set of all closed subspaces whose dimension and codimension both are infinite. This subset is homogeneous, i.e. for any two elements of there is an invertible bounded linear operator on transferring one of them to the other, only in the case when is separable.
Let and be complex Hilbert spaces. Every invertible bounded linear or conjugate-linear operator induces an isomorphism of the lattice to the lattice and any non-zero scalar multiple of gives the same lattice isomorphism.
The mapping is a bijective transformation of reversing the inclusion relation. It sends every to and conversely.
Proposition 2.2**.**
For every invertible bounded linear or conjugate-linear operator the mapping of to defined as
[TABLE]
is the lattice isomorphism induced by .
Proof.
If , then is equal to
[TABLE]
In other word, is orthogonal to if and only if is orthogonal to . This implies that coincides with for every closed subspace . ∎
The main result of this section is the following.
Theorem 2.2** (G. W. Mackey [24], S. Kakutani and G. W. Mackey [20]).**
Suppose that and are infinite-dimensional. Then every isomorphism of the lattice to the lattice is induced by an invertible bounded linear or conjugate-linear operator and any other operator inducing this lattice isomorphism is a scalar multiple of .
For the finite-dimensional case this statement fails. If is finite-dimensional, then consists of all subspaces of and there are the automorphisms of induced by unbounded semilinear automorphisms of , i.e. semilinear automorphisms associated to non-continuous automorphisms of the field .
If is infinite-dimensional, then is partially ordered by the inclusion relation, but it is not a lattice (there exist pairs such that is finite-dimensional or is of finite codimension). The next result concerns isomorphisms between such partially ordered sets.
Theorem 2.3** (M. Pankov [30, 31]).**
Suppose that and are infinite-dimensional. Then every isomorphism of the partially ordered set to the partially ordered set can be uniquely extended to an isomorphism of the lattice to the lattice .
Remark 2.2**.**
As above, we suppose that is infinite-dimensional. Let be the set consisting of all bounded idempotents on . This is a partially ordered set: for we have if
[TABLE]
Since every closed subspace can be identified with the projection whose image is , the lattice is contained in the partially ordered set . By P. G. Ovchinikov [28], every automorphism of the partially ordered set is of type
[TABLE]
where is an invertible bounded linear or conjugate-linear operator on . L. Plevnik [36] considered the partially ordered set formed by all idempotents from whose image and kernel both are infinite-dimensional. One of his results states that every automorphism of this partially ordered set can be uniquely extended to an automorphism of the partially ordered set .
2.5. Proof of Theorem 2.2
In this and the next sections, we will suppose that and are infinite-dimensional complex Hilbert spaces.
Lemma 2.3**.**
There is a sequence of vectors in satisfying the following condition: for every bounded sequence of complex numbers there exists a vector such that for every .
Proof.
Let be a sequence formed by unit mutually orthogonal vectors of . We set . Then for every bounded sequence of complex numbers the vector
[TABLE]
is as required. ∎
Lemma 2.4**.**
If a semilinear isomorphism sends every closed subspace of codimension to a closed subspace, then is linear or conjugate-linear.
Proof.
Let be the automorphism of associated to . By Lemma 2.2, we need to show that for every sequence of complex number converging to [math] the sequence is bounded. If the latter sequence is unbounded, then contains a subsequence such that
[TABLE]
where is the sequence from Lemma 2.3. Consider a vector satisfying for every and take . Then
[TABLE]
where each is a vector orthogonal to , and
[TABLE]
It follows from (2.1) that . Then the latter equality implies that
[TABLE]
Therefore, belongs to the closure of (recall that every is contained in ). By our hypothesis, the subspace is closed. Hence belongs to and we have which is impossible, since is a non-zero scalar multiple of . This contradiction gives the claim. ∎
Let be an isomorphism of the lattice to the lattice . Then transfers to and to . Therefore, the restriction of to is an isomorphism between the projective spaces and . Theorem 2.1 implies the existence of a semilinear isomorphism such that
[TABLE]
As in the proof of Corollary 2.1, we establish that the same equality holds for every closed subspace and any other semilinear isomorphism inducing is a scalar multiple of .
Since sends to , Lemma 2.4 guarantees that is linear or conjugate-linear. Now, we prove that it transfers bounded subsets to bounded subsets which implies that is bounded. Let be a bounded subset of . It is sufficient to show that the subset
[TABLE]
is bounded in for every vector . This guarantees that is bounded (every weakly bounded subset is bounded).
For every vector there exists a vector such that
[TABLE]
Let us fix a vector satisfying . Any vector can be presented in the form
[TABLE]
where is a vector orthogonal to . Then
[TABLE]
Since , we have . This means that
[TABLE]
where is equal to or . So,
[TABLE]
The latter implies that the subset (2.2) is bounded, since is bounded.
Remark 2.3**.**
Theorem 2.2 was first proved by G. W. Mackey in [24] for the lattices of closed subspaces of infinite-dimensional real normed spaces. Lemma 2.4 was obtained in [20]. It shows that the arguments given in [24] work for the complex case. See also [17].
2.6. Proof of Theorem 2.3
Let be an isomorphism of the partially ordered set to the partially ordered set .
Lemma 2.5**.**
For every there is an invertible bounded linear or conjugate-linear operator such that
[TABLE]
for every contained in .
Proof.
Let be the set of all elements of contained in . Then consists of all elements of contained in . We consider the closed subspaces and as Hilbert spaces and write and for the orthogonal complements of and in these Hilbert spaces. Denote by and the sets formed by closed subspaces of infinite codimension in and , respectively. Then
[TABLE]
The bijection sending every to is order preserving in both directions. It is clear that
[TABLE]
for every natural . In particular, the restriction of to is an isomorphism between the projective spaces and . So, there is a semilinear isomorphism such that
[TABLE]
As above, we establish that this equality holds for all . Also, for every the lattice is contained in and the restriction of to this lattice is an isomorphism to the lattice . Theorem 2.2 implies that is bounded on any infinite-dimensional subspace . Since can be presented as the orthogonal sum of two elements from , the similinear mapping is bounded. So, is an invertible bounded linear or conjugate-linear operator such that
[TABLE]
for every . Proposition 2.2 shows that the operator satisfies the required condition. ∎
Lemma 2.6**.**
Let and be elements of satisfying
[TABLE]
Then there exists such that and are elements of containing .
Proof.
Let and be the orthogonal complements of in and , respectively. We choose inductively a sequence of mutually orthogonal vectors such that
[TABLE]
for every . Denote by the closed subspace spanned by . The subspace is as required. ∎
Let be a -dimensional subspace of . We take any containing and set
[TABLE]
We need to show that the definition of does not depend on the choice of .
Suppose that is contained in and . In the case when is an element of , we choose contained in and such that . Then
[TABLE]
If is finite dimensional, then, by Lemma 2.6, there is such that and are elements of containing . Applying the above arguments to and , we establish that
[TABLE]
So, we get a mapping . This is an isomorphism of to , hence it is induced by a semilinear isomorphism . It is clear that
[TABLE]
and the restriction of to is a scalar multiple of . Recall that each is bounded. Also, can be presented as the orthogonal sum of two elements from . This means that is bounded, i.e. it is an invertible bounded linear or conjugate-linear operator.
Suppose that is an invertible bounded linear or conjugate-linear operator such that for every . For every -dimensional subspace there exist satisfying and we have
[TABLE]
This implies that is a scalar multiple of , in other words, the extension of to a lattice isomorphism is unique.
Remark 2.4**.**
This proof is an essential modification of the proof given in [30, 31].
3. Logics associated to Hilbert spaces
3.1. Logics
A logic is a bounded lattice together with an orthogonal complementation (negation) satisfying the following conditions:
- (1)
implies that for all , 2. (2)
and for every , 3. (3)
if and , then .
Elements of the logic are called propositions.
By the axiom (2), the orthogonal complementation is a bijective transformation of . It follows from (1) that and . The axiom (3) implies that . The readers can check that De Morgan Law holds true:
[TABLE]
for all .
We say that is orthogonal to and write if . By the axioms (1) and (2), the latter implies that . Therefore, the orthogonality relation is symmetric.
Two distinct propositions are called compatible if there exist mutually orthogonal propositions such that
[TABLE]
Note that [math] and are compatible to any proposition.
A quantum logic is a logic with at least two non-compatible propositions and a classical logic is a logic, where any two propositions are compatible. See [6, 7, 43] for more information.
For every complex Hilbert space the lattice together with the orthogonal complementation is a quantum logic. This logic is known as the standard quantum logic associated to .
3.2. Automorphisms of the logic
Let be a complex Hilbert space. An automorphism of the logic is a lattice automorphism commuting with the orthogonal complementation, i.e.
[TABLE]
Every unitary or anti-unitary operator induces an automorphism of the logic . Any non-zero scalar multiple induces the same automorphism, but the operator is unitary or anti-unitary only in the case when the complex scalar is unit, i.e. .
The description of automorphisms of the logic is a simple consequence of results from the previous section and the following statement.
Lemma 3.1**.**
If and is a semilinear automorphism of transferring orthogonal vectors to orthogonal vectors, i.e. implies that , then is a non-zero scalar multiple of an unitary or anti-unitary operator.
Proof.
First, we consider the case when is linear or conjugate-linear. Since sends orthogonal vectors to orthogonal vectors, for every orthonormal basis of there is an orthonormal basis such that for a certain non-zero scalar . We can assume that for every (otherwise, we take the operator , where is the unitary operator sending every to ). If and are distinct elements of , then the vectors and are orthogonal and the same holds for the vectors
[TABLE]
The latter implies that for any pair . In other words, there is a positive real number such that , where is a unit complex number. The linear operator transferring every to is unitary and the conjugate-linear operator satisfying the same condition is anti-unitary. We have , where is one of these operators.
Now, we need to show that is linear or conjugate-linear. If are orthogonal unit vectors, then we apply the above arguments to the orthogonal pair and establish that
[TABLE]
If unit vectors are non-orthogonal, then we choose a unit vector orthogonal to both (this is possible, since ) and get
[TABLE]
So, the function is constant on the set of unit vectors which implies that is bounded. Hence is linear or conjugate-linear. ∎
Remark 3.1**.**
We do not prove the statement for . This case is left as an exercise for the readers.
Theorem 3.1**.**
If , then every automorphism of the logic is induced by an unitary or anti-unitary operator on . This operator is unique up to a unit scalar multiple.
Proof.
Every automorphism of the logic is induced by a semilinear automorphism of . This follows from Corollary 2.1 and Theorem 2.2 for the finite-dimensional and infinite-dimensional case, respectively. Such a semilinear automorphism sends orthogonal vectors to orthogonal vectors and Lemma 3.1 implies that it is a scalar multiple of an unitary or anti-unitary operator. The second statement is obvious. ∎
The above statement fails for the case when .
Example 3.1**.**
Suppose that . The orthogonal complement of every also belongs to . Denote by the set of all such pairs . Every bijective transformation of can be extended to an automorphism of the logic, but such an extension is not unique. If is a bijective transformation of sending to , then we define as one of the elements from and as the other. We get a bijective transformation of preserving the orthogonality relation in both directions. This bijection can be uniquely extended to an automorphism of the logic.
Theorem 3.2**.**
Let be a bijective transformation of preserving the orthogonality relation in both directions, i.e. for all we have
[TABLE]
Then is an automorphism of the logic .
Proof.
For every we denote by the set of all elements from orthogonal to . Then
[TABLE]
If , then
[TABLE]
So, is a lattice automorphism. Observe that is the greatest element of . This implies that commutes with the orthogonal complementation. ∎
Using Theorem 2.3 and Lemma 3.1, we prove the following.
Theorem 3.3** (P. Šemrl [39]).**
If is infinite-dimensional, then every bijective transformation of preserving the orthogonality relation in both directions can be uniquely extended to an automorphism of the logic .
Proof.
Let be a bijective transformation of preserving the orthogonality relation in both directions. As in the proof of Theorem 3.2, we establish that is an automorphism of the partially ordered set . By Theorem 2.3, is induced by an invertible bounded linear or conjugate-linear operator on . This operator sends orthogonal vectors to orthogonal vectors and Lemma 3.1 implies that it is a scalar multiple of an unitary or anti-unitary operator. So, can be extended to an automorphism of the logic . It follows from Theorem 2.3 that such an extension is unique. ∎
Remark 3.2**.**
The original proof of the latter statement (see [39]) is not related to Theorem 2.3.
By classical Wigner’s theorem, every bijective transformation of preserving the transition probability is induced by an unitary or anti-unitary operator. Recall that the transition probability between is equal to , where and are unit vectors; i.e. the transition probability is zero only in the orthogonal case. There is a non-bijective analogue of this result (see, for example, [13]). In the case when , the bijective version of Wigner’s theorem is contained in the following.
Proposition 3.1** (U. Uhlhorn [42]).**
Every bijective transformation of preserving the orthogonality relation in both directions can be uniquely extended to an automorphism of the logic .
Proof.
The statement is trivial if . Suppose that and is a bijective transformation of preserving the orthogonality relation in both directions. We check that is an automorphism of the projective space .
Let be a -dimensional subspace of . We take any orthogonal basis for and denote by the -dimensional subspace containing . All are mutually orthogonal and we write for the maximal closed subspace orthogonal to them. A -dimensional subspace is contained in if and only if is contained in . This implies that is -dimensional (since is orthogonality preserving in both directions). So, transfers lines to lines. Similarly, we show that the same holds for .
By Theorem 2.1, is induced by a semilinear automorphism of . This semilinear automorphism sends orthogonal vectors to orthogonal vectors, i.e. it is a scalar multiple of an unitary or anti-unitary operator. This gives the claim. ∎
In Section 5, the same statement will be proved for the Grassmannian under the assumption that . Note that this statement fails if . In this case, the orthogonal complement of is the unique element of orthogonal to . As in Example 3.1, any bijective transformation of the set of all such pairs gives a class of bijective transformations of preserving the orthogonality relation in both directions. Since we assume that , every logic automorphism is induced by an unitary or anti-unitary operator.
Remark 3.3**.**
If , then a simple verification shows that every bijective transformation of sending orthogonal elements to orthogonal elements is orthogonality preserving in both directions. Suppose that is finite and not less than . Consider a bijective transformation of which sends orthogonal elements to orthogonal elements. As in the proof of Proposition 3.1, for a -dimensional subspace we choose mutually orthogonal -dimensional subspaces which are orthogonal to . If is the -dimensional subspace orthogonal to all , then transfers every -dimensional subspace of to a -dimensional subspace of . So, sends lines to subsets of lines and, by Remark 2.1, it is an automorphism of . Therefore, is induced by an unitary or anti-unitary operator, i.e. it is orthogonality preserving in both directions.
3.3. Compatibility relation
Two elements are compatible if there exist such that are mutually orthogonal and
[TABLE]
It is clear that and are the intersections of with and , respectively. Therefore, and are compatible if and only if
[TABLE]
are orthogonal.
For example, are compatible if or , i.e. the compatibility relation contains the inclusion and orthogonality relations. Also, if is compatible to every element of , then is [math] or .
Every closed subspace can be identified with the projection whose image is (Example 2.5). Closed subspaces are orthogonal if and only if
[TABLE]
Proposition 3.2**.**
Closed subspaces are compatible if and only if the projections commute.
Proof.
Direct verification. ∎
Remark 3.4**.**
This simple observation is a partial case of classical von Neumann’s theorem. By the spectral theorem, every bounded self-adjoint operator on can be identified with a spectral measure which takes values in the logic , or equivalently, in the set of projections on . Two such measures are called compatible if all values of one measure are compatible to all values of the other. The von Neumann theorem states that two bounded self-adjoint operators and commute if and only if the corresponding measures and are compatible. See [6, 43] for more information.
We say that a subset of is compatible if any two distinct elements from this subset are compatible. Observe that are compatible if and only if there is an orthogonal basis of such that and are spanned by subsets of this basis. For every orthogonal basis of we denote by the set formed by all elements of spanned by subsets of . This is a compatible subset of . The equality implies that the vectors from one of the bases are scalar multiples of the vectors from the other. So, there is a one-to-one correspondence between subsets of type and orthonormal bases of .
Proposition 3.3**.**
Every maximal compatible subset of is for a certain orthogonal basis of .
Proof.
We need to show that every compatible subset is contained in a certain . Let be the set formed by all smallest non-zero intersections of elements from . In other words, belongs to if and only if it is the intersection of some elements from and the remaining elements of are orthogonal to . Observe that the elements of are mutually orthogonal and belongs to only in the case when it is orthogonal to all other elements of . For every we denote by the maximal closed subspace in orthogonal to all elements of contained in . Consider the set consisting of all elements of and all non-zero . The elements of this set are mutually orthogonal and there is an orthogonal basis of such that every element from is spanned by a subset of . It is easy to see that . ∎
The set partially ordered by the inclusion relation together with the orthogonal complementation is a maximal classical logic contained in the logic . Conversely, every maximal classical logic contained in is of such type.
Remark 3.5**.**
The logic together with all maximal classical sublogics is a structure similar to the buildings associated to general linear groups. If is a set (not necessarily finite), then a simplicial complex over is formed by finite subsets of such that every one-element subset belongs to and for every all subsets of belong to ; the elements of and are called vertices and simplices, respectively. For example, if is a vector space of finite dimension, then the flag complex is the simplicial complex whose vertices are all subspaces of and the simplices are all (not necessarily maximal) flags, i.e. chains of incident subspaces. A building is a simplicial complex together with a family of distinguished subcomplexes called apartments and satisfying some axioms [41]. The building associated to the group is the flag complex whose apartments are defined by bases of ; every apartment consists of all flags formed by subspaces spanned by subsets of a certain basis. The maximal classical sublogics of correspond to the apartments of defined by orthogonal bases.
Every automorphism of the logic preserves the compatibility relation in both directions. However, the automorphism group of the logic is a proper subgroup in the group of all bijective transformations of preserving the compatibility relation in both directions. For example, the orthogonal complementation belongs to this group, but it is not a logic automorphism. Consider a more general example.
Example 3.2**.**
Let be a subset of satisfying the following condition: for every the orthogonal complement belongs to . Denote by the bijective transformation of defined as follows
[TABLE]
This transformation preserves the compatibility relation in both directions (since every compatible to is also compatible to ).
We state that every bijective transformation of preserving the compatibility relation in both directions is a logic automorphism or the composition of a logic automorphism and a certain .
Theorem 3.4** (L. Molnár and P. Šemrl [27]).**
Let be a bijective transformation of preserving the compatibility relation in both directions, i.e. are compatible if and only if are compatible. Then there exists an automorphism of the logic such that for every we have either
[TABLE]
Remark 3.6**.**
In [27], this result was formulated in terms of commutativity of projections.
The same statement holds for the Grassmannian .
Theorem 3.5** (L. Plevnik [36]).**
Suppose that is infinite-dimensional and is a bijective transformation of preserving the compatibility relation in both directions. Then there exists an automorphism of the logic such that for every we have either
[TABLE]
Remark 3.7**.**
Recall that is the set of all bounded idempotents on whose image and kernel both are infinite-dimensional (Remark 2.2). In [36], L. Plevnik describes commutativity preserving bijective transformations of . We use the same arguments to prove Theorem 3.5. There is a natural one-to-one correspondence between idempotents and involutions (Example 2.6) and the mentioned above Plevnik’s result can be reformulated in terms of commutativity preserving transformations of the set of bounded involutions corresponding the idempotents from . In other words, this is an infinite-dimensional version of the description of commutativity preserving bijective transformations of the sets of conjugate involutions in the general linear group [29]. Earlier, results of the same nature were exploited to determining automorphisms of classical groups, see [11, 12].
3.4. Proof of Theorems 3.4 and 3.5
For every subset we denote by the set of all elements of compatible to every element of and write instead of . Note that [math] and always belong to .
Let and be distinct compatible elements of both different from [math] and . Then can be presented as the orthogonal sum of the following subspaces
[TABLE]
(some of them may be zero) and consists of all orthogonal sums
[TABLE]
(note that [math] and correspond to the cases when and , respectively). Some of these sums may be coincident and we have
[TABLE]
where is the number of non-zero .
Using the number of elements in , we can distinguish elements from .
Lemma 3.2**.**
If , then for every compatible to we have
[TABLE]
In the case when does not belong to , there is compatible to and such that
[TABLE]
Proof.
Suppose that is an element of . If is the orthogonal complement of , then and consists of elements. For all other cases, there are precisely tree non-zero and the number of elements in is equal to .
Suppose that does not belong to . We take any compatible to and such that is non-zero and is a proper subspace of . Then all are non-zero and the number of elements in is equal to . ∎
To prove Theorem 3.5 we will consider the intersection of with for .
Lemma 3.3**.**
Suppose that is infinite-dimensional. If are distinct compatible elements from and , then the following two conditions are equivalent:
- (1)
, 2. (2)
* or or or .*
Proof.
The assumption implies that at least three are non-zero.
The condition (2) is equivalent to the fact that one of is zero, i.e. there are precisely three non-zero . We have
[TABLE]
This guarantees that at most one of non-zero is finite-dimensional (otherwise, at most one of is infinite-dimensional and or has finite dimension or codimension which is impossible). If all non-zero are infinite-dimensional, then
[TABLE]
(each non-zero and the sum of any two non-zero are elements of ). If one of non-zero is finite-dimensional, then it and its orthogonal complement do not belong to and we have
[TABLE]
If (2) fails, then all are non-zero. In this case, there are at most two finite-dimensional (otherwise, at most one of is infinite-dimensional and or has finite dimension or codimension). If all are infinite-dimensional, then every orthogonal sum , where is a proper subset of , belongs to and
[TABLE]
If only one of is finite-dimensional, then it and its orthogonal complement do not belong to and we have
[TABLE]
Similarly, if and are finite-dimensional, then ant their orthogonal complements do not belong to which means that
[TABLE]
We get the claim. ∎
Proof of Theorem 3.4.
Let is a bijective transformation of preserving the compatibility relation in both directions. If a closed subspace is compatible to all elements of , then this subspace is [math] or . Therefore, transfers the set to itself. Lemma 3.2 implies that also sends to itself. The case when is trivial and we suppose that .
Consider the bijective transformation of defined as follows
[TABLE]
Then preserves the orthogonality relation in both directions and, by Proposition 3.1, it can be extended to a certain automorphism of the logic . The transformation preserves the compatibility relation in both directions. Also, leaves fixed every or sends it to the orthogonal complement . Therefore, is compatible to if and only if is compatible to (any element of is compatible to if and only if it is compatible to ). A -dimensional subspace is compatible to if and only if it is contained in or . Therefore, coincides with or for every . So, the logic automorphism is as required. ∎
Proof of Theorem 3.5.
Suppose that is infinite-dimensional and is a bijective transformation of preserving the compatibility relation in both directions. For distinct compatible elements we have
[TABLE]
if and only if is the orthogonal complement of . Therefore, preserves the orthogonal complementation, i.e.
[TABLE]
for every .
We will construct a bijective transformation of satisfying the following conditions:
is orthogonality preserving in both directions, 2.
for every we have or .
Theorem 3.3 states that can be extended to a logic automorphism and we get the claim.
Let . We take any orthogonal to and distinct from . By Lemma 3.3, one of the following two possibilities is realized:
- (1)
is orthogonal to or , 2. (2)
is orthogonal to or .
In the first case, we set . In the second case, we define as the orthogonal complement of . We need to show that the definition of does not depend on the choice of element orthogonal to . In other words, if the possibility , is realized for a certain orthogonal to , then the same possibility is realized for all such .
Let and be distinct elements of orthogonal to and distinct from . First, we consider the case when and are non-compatible. Suppose that is orthogonal to or and is orthogonal to or . In other words, one of is contained in and one of is contained in . This means that one of is compatible to one of . Since is compatibility preserving in both directions, one of is compatible to one of which contradicts the fact that and are non-compatible. Therefore, is orthogonal to or if and only if it is orthogonal to or .
In the case when and are compatible, we choose any orthogonal to and non-compatible to both and . By the arguments given above, the following three conditions are equivalent:
is orthogonal to or , 2.
is orthogonal to or , 3.
is orthogonal to or .
So, the transformation is well-defined.
Since is bijective, we have in the case when . It is easy to see that coincides with or , but we cannot state that at this moment. We need to show that is bijective. Let us consider the inverse transformation and the associated transformation defined as for .
Let and . Suppose that . Then for every orthogonal to we have
[TABLE]
If is orthogonal to , then we consider which is orthogonal to and distinct from . Since and are orthogonal, we have . In the case when is orthogonal to , we take . As above, is orthogonal to and distinct from . Since is orthogonal to , we get again.
Now, we suppose that . Then for every orthogonal to we have
[TABLE]
Consider the first possibility (the second is similar). In this case, is orthogonal to and distinct from . Then and are orthogonal. This means that .
So, for every we have and the same arguments show that . Therefore, is bijective which guarantees that
[TABLE]
for every . To complete the proof we need to establish that is orthogonality preserving in both directions.
Suppose that are orthogonal and . If , then is orthogonal to or and
[TABLE]
respectively. For each of these cases we have . The case when is similar. Therefore, sends orthogonal pairs to orthogonal pairs. It is clear that the same holds for and is orthogonality preserving in both directions. ∎
3.5. Kakutani-Mackey theorem
Let be a complex normed space. Denote by the associated lattice of closed subspaces, i.e. the set of all closed subspaces of partially ordered by the inclusion relation . As in the lattices of closed subspaces of Hilbert spaces, for any two closed subspaces the greatest lower bound is the intersection and the least upper bound is the minimal closed subspace containing . The lattice is bounded: the least element is [math] and the greatest element is .
The direct analogue of Theorem 2.2 holds for the lattices of closed subspaces of infinite-dimensional normed vector spaces. The proof is similar, but we need some additional arguments which hold automatically for Hilbert spaces.
The following classical result says that for an infinite-dimensional complex Banach space the lattice together with an orthogonal complementation satisfying the logic axioms (1) and (2) is the standard quantum logic.
Theorem 3.6** (S. Kakutani and G. W. Mackey [20]).**
Let be an infinite-dimensional complex Banach space. Suppose that there is a bijective transformation of the lattice satisfying the following conditions:
- (1)
for any the inclusion implies that , 2. (2)
* and for every .*
Then there is an inner product such that the following assertions are fulfilled:
The vector space together with this inner product is a complex Hilbert space. 2.
The identity transformation of is an invertible bounded linear operator of the Banach space to the Hilbert space, i.e. a subspace of is closed in the Banach space if and only if it is closed in the Hilbert space111We cannot state that the norm related to the inner product coincides with the primordial norm, but these norms define the same topology on .. 3.
For every the subspace is the orthogonal complement of in the Hilbert space.
In other word, the lattice together with this orthogonal complementation is the standard quantum logic.
Sketch of proof.
Let be the vector space formed by all bounded linear functionals on . This is a normed vector space: the norm of is the smallest number such that
[TABLE]
for all vectors . For every we denote by the annihilator of in , i.e. the set of all bounded linear functionals satisfying . This is a closed subspace of .
Using (1), we establish that the bijection of to sending every to is an isomorphism of to . By Theorem 2.1, there is a semilinear isomorphism such that
[TABLE]
for every . It is not difficult to see that the same equality holds for all . In particular, sends closed subspaces of codimension to closed subspaces. There is the direct analogue of Lemma 2.4 for infinite-dimensional normed vector spaces [20, Lemma 2]. Therefore, is a linear or conjugate-linear invertible bounded operator.
Suppose that is linear. Let and be linearly independent vectors of . We set and . Then
[TABLE]
By (2), we have for every . This implies that each of the scalars
[TABLE]
is non-zero. On the other hand, we have
[TABLE]
and the equation
[TABLE]
has a solution for . We get a contradiction which means that is conjugate-linear.
Now, we define the inner product on . For all vectors we set
[TABLE]
The condition (2) guarantees that is non-zero for every non-zero vector . Since is unique up to a non-zero scalar multiple, we can assume that for a certain vector the scalar is a positive real number.
It clear that is linear and is conjugate-linear for every fixed . We need to show that
[TABLE]
for all and is a positive real number for every non-zero .
It easily follows from (1) that for any two vectors we have if and only if . Suppose that is non-zero. We choose non-zero scalars such that
[TABLE]
Then which implies that and , i.e.
[TABLE]
Similarly, we obtain that
[TABLE]
Using (3.2)–(3.4), we establish that
[TABLE]
In other words, for any two vectors satisfying the scalar is real if and only if is real. Recall that there is non-zero such that is real. Then is real if is non-zero. In the case when , we take any vector such that and both are non-zero. So, for every non-zero vector the scalar is a non-zero real number. Then (3.2) and (3.3) imply (3.1). For every non-zero we consider the real function
[TABLE]
defined on the segment . The function is continuos (the operator is bounded) and is non-zero for every . Since , we have always .
Therefore, is an inner product on . Using the fact that is bounded, the readers can show that the identity transformation of is an invertible bounded linear operator of the Banach space to the normed vector space related to the inner product . This implies that the norm defined by the inner product is complete. ∎
4. Grassmannians of vector spaces
In this section, we consider the transformations of Grassmannians of vector spaces induced by semilinear isomorphisms and present some characterizations of such transformations. One of them is well-known Chow’s theorem [5]. We will need it in the next section. Also, these transformations can be characterized as apartments preserving. This result is not exploited in what follows, but we will use the same idea to study compatibility preserving transformations.
4.1. Chow’s theorem
Let be a vector space over a field. Recall that for every natural we denote by the Grassmannian formed by -dimensional subspaces of . Two -dimensional subspaces of are called adjacent if their intersection is -dimensional. This is equivalent to the fact that the sum of these subspaces is -dimensional. Any two distinct -dimensional subspaces of are adjacent. If is finite, then the same holds for any two distinct -dimensional subspaces of .
The Grassmann graph is the graph whose vertex set is the Grassmannian and whose edges are pairs of adjacent -dimensional subspaces. This graph is connected, i.e. for any there is a sequence
[TABLE]
where and are adjacent elements of for every . The smallest number for which such a sequence exists is called the path distance between and (see, for example, [10, Section 15.1]), we denote this distance by . It is not difficult to prove that
[TABLE]
Every semilinear automorphism of induces an automorphism of the Grassmann graph .
Denote by the dual vector space formed by all linear functionals on . If is finite-dimensional, then and the second dual vector space can be naturally identified with . In the case when is infinite-dimensional, we have , see [2, Section II.3]. For every subset the annihilator
[TABLE]
is a subspace of . Similarly, for every subset the annihilator
[TABLE]
is a subspace of .
Suppose that is finite. For every subspace of or the dimension of the annihilator is equal to the codimension of this subspace and the annihilator of the annihilator coincides with the subspace. The annihilator mapping is a bijection of to reversing the inclusion relation and sending every to .
Proposition 4.1**.**
If is finite, then the annihilator mapping induces an isomorphism between the Grassmann graphs and .
Proof.
Easy verification. ∎
Every semilinear isomorphism of to induces an isomorphism of to . The composition of this isomorphism and the annihilator mapping is an isomorphism of to and we get an automorphism of if .
Theorem 4.1** (W.L. Chow [5]).**
Suppose that and, in addition, we require that if is finite-dimensional. Then every automorphism of the Grassmann graph is induced by a semilinear automorphism of or a semilinear isomorphism of to and the second possibility is realized only in the case when .
If or is finite-dimensional and , then any two distinct elements of are adjacent and every bijective transformation of is an automorphism of the graph .
In [5] (see also [12, 32, 44]), this statement was proved only for the case when is finite-dimensional, but the same arguments work if is infinite-dimensional. Also, classical Chow’s theorem follows immediately from the description of isometric embeddings of Grassmann graphs [33, Chapter 3]. For these reasons, we only sketch the proof of Theorem 4.1. It is based on the description of maximal cliques in the Grassmann graph .
Recall that a subset in the vertex set of a graph is called a clique if any two distinct elements of this subset are adjacent vertices in the graph.
From this moment, we suppose that and, in addition, if is finite-dimensional. For every subspace we denote by the set of all -dimensional subspaces containing . If is -dimensional, then is a clique of . Cliques of such type are called stars. For every subspace we write for the set of all -dimensional subspaces contained in . In the case when is -dimensional, this is a clique of . Every such clique is said to be a top.
Proposition 4.2**.**
Every maximal clique of is a star or a top.
Sketch of proof.
It is sufficiently to show that every clique of the graph is contained in a star or a top. The statement is trivial if consists of two elements. Suppose that . If and is not contained in the star , then we show that it is a subset of the top . ∎
To prove Theorem 4.1 we will use the following intersection properties of maximal cliques. The intersection of two distinct stars of is empty or it contains precisely one element, the second possibility is realized if and only if the associated -dimensional subspaces are adjacent. Similarly, the intersection of two distinct tops of is empty or a one-element set and the second possibility is realized only in the case when the associated -dimensional subspaces are adjacent. The intersection of a star and a top is non-empty if and only if is contained in . Every such intersection is called a line of . A star and a top together with all lines contained in them can be identified with the projective spaces associated to and , respectively.
Proof of Theorem 4.1 (sketch).
Let be an automorphism of the Grassmann graph . Then and transfer maximal cliques (stars and tops) to maximal cliques. Since the intersection of two distinct maximal cliques is empty or a one-element set or a line, lines go to lines in both directions.
Suppose that and both send stars to stars. Then induces a bijective transformation of . This is an automorphism of preserving the types of maximal cliques and we get an automorphism of the projective space if . In the case when , we apply the above arguments to . Step by step, we come to an automorphism of . It is induced by a semilinear automorphism of (Theorem 2.1) and is induced by the same semilinear automorphism.
Consider the case when transfers a certain star to a top . Since and send lines to lines, the restriction of to this star is an isomorphism between the projective spaces and . Theorem 2.1 implies that the vector spaces and are of the same dimension which is possible only in the case when is finite and equal to . Using the intersection properties of maximal cliques, we establish that transfers every star to a top and every top goes to a star. The composition of and the annihilator mapping is an isomorphism of to which preserves the types of maximal cliques (the annihilator mapping sends stars to tops and tops to stars). By the arguments from the previous paragraph, this graph isomorphism is induced by a semilinear isomorphism of to . ∎
Remark 4.1**.**
By R. Westwick [45], every bijective transformation of sending adjacent elements to adjacent elements is an automorphism of the graph if is finite-dimensional; in other words, if a bijective transformation of is adjacency preserving in one direction and is finite-dimensional, then this transformation is adjacency preserving in both directions. Kreuzer’s example [21] shows that this statement fails for the case when is infinite-dimensional. Also, if is infinite-dimensional, then there is an analogue of Chow’s theorem for the Grassmannians and , see [37].
The diameter of the graph , i.e. the maximal path distance between vertices, is equal to . We say that two elements of are opposite if the path distance between them is maximal. If , then this is equivalent to the fact that the intersection of the subspaces is [math]. In the case when , two elements of are opposite if and only if their sum coincides with . In the next section, we will use the following.
Theorem 4.2**.**
If is a bijective transformation of preserving the relation to be opposite in both directions, i.e. are opposite if and only if are opposite, then is an automorphism of .
Remark 4.2**.**
Theorem 4.2 is proved in [19] (see also [32]) under the assumption that is finite-dimensional (the main idea is taken from [4]), but the same arguments work in the case when is of an arbitrary (not necessarily finite) dimension. The statement is trivial if or is finite and . In the general case, it is a simple consequence of the following characterization of the adjacency relation in terms of the relation to be opposite: distinct are adjacent if and only if there exists such that every element of opposite to is opposite to or . There are more general results concerning transformations preserving pairs with bounded or fixed distance [9, 23].
4.2. Apartments preserving transformations
For every basis of the vector space the set formed by all -dimensional subspaces spanned by subsets of is called the apartment of associated to . Two bases of define the same apartment of if and only if the vectors from one of the basis are scalar multiples of the vectors from the other. If is finite-dimensional, then apartments of are the intersections of with apartments of the building (Remark 3.5), every such intersection is a finite set. In the case when is infinite-dimensional, every apartment of contains infinitely many elements.
It is not difficult to prove that for any two subspaces of there is a basis of such that each of these subspaces is spanned by a subset of this basis. As a direct consequence, we get the following remarkable property of apartments: for any two -dimensional subspaces of there is an apartment of containing them.
If is finite and is a basis of , then the annihilator mapping transfers the associated apartment of to the apartment of corresponding to the dual basis . The basis consists of defined by the condition , where is the Kronecker delta.
Remark 4.3**.**
Apartments of Grassmannians have a useful interpretation in terms of exterior products. Let us consider the exterior -product (which is defined for an arbitrary, not necessarily finite-dimensional, vector space over a field). This is the vector space (over the same field) whose elements are linear combinations of so-called -vectors , where are linearly independent vectors from (see [40] for the precise definition). If is a basis of the vector space , then all -vectors of type , where are mutually distinct elements of , form a basis of the vector space . Every such basis of is said to be regular. If is finite, then
[TABLE]
If vectors and span the same -dimensional subspace of , then
[TABLE]
where is the matrix of decomposition of in the basis . Therefore, the -dimensional subspace of spanned by vectors can be naturally identified with the -dimensional subspace of containing the -vector . We get an injective mapping of to whose image consists of all -dimensional subspaces of containing -vectors. This mapping is known as the Plücker embedding. It transfers every line of to a line of the projective space . The apartment of defined by a basis goes to the apartment of defined by the regular basis of corresponding to .
Remark 4.4**.**
If is finite, then every apartment of consists of elements and it is the image of an isometric embedding of the Johnson graph in the Grassmann graph . Recall that is the graph whose vertices are -element subsets in a certain -element set and two such subsets are adjacent vertices in the graph if their intersection is a -element subset. Note that there are isometric embeddings of in whose images are not apartments [33, Chapter 4].
The bijective transformations of induced by semilinear automorphisms of send apartments to apartments. If , then the same holds for the transformations of defined by semilinar isomorphisms of to .
Theorem 4.3** (M. Pankov [32]).**
If and is a bijective transformation of such that and send apartments to apartments, then is induced by a semilinear automorphism of or a semilinear isomorphism of to and the second possibility is realized only in the case when .
In the case when , this statement easily follows from Theorem 2.1. We observe that three distinct elements of belong to the same apartment if and only if they are non-collinear points of the projective space , i.e. there is no line of containing them. Therefore, if is a bijective transformation of satisfying the condition of Theorem 4.3, then and send triples of non-collinear points to triples of non-collinear points. This means that triples of collinear points go to triples of collinear points in both directions. Then and transfer lines to lines, i.e. is an automorphism of .
If is finite, then it is sufficient to prove Theorem 4.3 only for the case when . Indeed, if is an apartments preserving bijective transformation of , then is a bijective transformation of satisfying the same condition. The latter transformation is an automorphism of if and only if is an automorphism of .
Remark 4.5**.**
We refer [35] for the description of apartments preserving transformations of the Grassmannians of infinite-dimensional vector spaces formed by subspaces of infinite dimensions and codimensions.
4.3. Proof of Theorem 4.3
Let be a basis of . Denote by the associated apartment of . We suppose that . In the case when is finite, we also assume that .
For every we denote by and the sets consisting of all elements of which contain and do not contain , respectively. For any distinct we define
[TABLE]
[TABLE]
A subset is said to be inexact if there is an apartment of distinct from and containing .
Example 4.1**.**
We claim that for any distinct the subset
[TABLE]
is inexact. In the basis , we replace by the vector . If is the apartment of corresponding to this new basis, then
[TABLE]
Lemma 4.1**.**
Every maximal inexact subset of is of type (4.1).
Proof.
We need to show that every inexact subset is contained in a subset of type (4.1). For every we denote by the intersection of all elements from containing and we write if does not contain such elements. We claim that the dimension of at least one of is not equal to (indeed, if each is the -dimensional subspace containing , then is not inexact). If , then
[TABLE]
for any . In the case when , we take any such that and establish that is contained in . ∎
We say that is a complementary subset if is a maximal inexact subset. An easy verification shows that the complementary subset corresponding to (4.1) is . Our proof is based on the following simple characterization of the relation to be opposite in terms of complementary subsets.
Lemma 4.2**.**
Two elements of are opposite if and only if there is no complementary subset of containing both these elements.
Proof.
Let . The complementary subset contains both if and only if
[TABLE]
By our assumption, , i.e. two elements of are opposite if and only if their intersection is zero. If , then there is no complementary subset containing both . Suppose that and have a non-zero intersection and take any . Since
[TABLE]
there is . Then the complementary subset contains both and . ∎
Let be a bijective transformation of such that and send apartments to apartments. For any we take an apartment containing them. It is clear that transfers inexact subsets of to inexact subsets of the apartment . Similarly, sends inexact subsets of to inexact subsets of . Therefore, is a maximal inexact subset of if and only if is a maximal inexact subset of . This means that a subset is complementary if and only if is a complementary subset of . Then Lemma 4.2 guarantees that and are opposite if and only if the same holds for and . So, preserves the opposite relation in both directions and, by Theorem 4.2, it is an automorphism of the Grassmann graph . Theorem 4.1 gives the claim.
Remark 4.6**.**
The proof of Theorem 4.3 given in [32] is based on the following characterization of adjacency in terms of complementary subsets. Let be an apartment of . For any pair of distinct we denote by the collection of all complementary subsets of containing both . An easy verification shows that the following assertions are fulfilled:
- (1)
In the case when is finite-dimensional, are adjacent if and only if contains the maximal number of complimentary subsets. This number is equal to . 2. (2)
Suppose that is infinite-dimensional. For any pair of distinct there are adjacent such that is contained in ; moreover, if , then the pairs and are coincident, i.e. are adjacent.
If is a bijective transformation of such that and send apartments to apartments, then the statements (1) and (2) guarantee that is an automorphism of .
Remark 4.7**.**
Suppose that is finite and not less than . Let be a bijective transformation of sending apartments to apartments (we do not require that satisfies the same condition). It was noted above that we can restrict ourself to the case when . If , then transfers any triple of non-collinear points of to a triple of non-collinear points. This implies that sends any triple of collinear points to a triple of collinear points. Then maps lines to subsets of lines and, by Remark 2.1, it is an automorphism of . Consider the case when . Let be an apartment of . Then transfers every inexact subset of to an inexact subset of the apartment . Since and have the same finite number of inexact subsets, is an inexact subset of if and only if is an inexact subset of . As above, we establish that is an automorphism of . Therefore, the statement of Theorem 4.3 holds even if we do not require that the inverse transformation sends apartments to apartments. A more general result can be found in [33, Chapter 5].
5. Grassmannians of Hilbert spaces
We return to Grassmannians of Hilbert spaces. As above, we suppose that is a complex Hilbert space. The following two types of bijective transformations of will be considered: transformations preserving the orthogonality relation in both directions and compatibility preserving transformations.
5.1. Orthogonality preserving transformations
By Theorem 3.3 and Proposition 3.1, every bijective transformation of or preserving the orthogonality relation in both directions can be uniquely extended to an automorphism of the logic . Using Theorem 4.1, we prove the following.
Theorem 5.1** (M. Györy [8], P. Šemrl [39]).**
If , then every bijective transformation of preserving the orthogonality relation in both directions can be uniquely extended to an automorphism of the logic .
If , then there exist no orthogonal pairs of -dimensional subspaces. Consider the case when . For every the orthogonal complement is the unique -dimensional subspace orthogonal to . It was noted in Subsection 3.2 that any bijective transformation of the set of all such pairs defines a class of bijective transformations of preserving the orthogonality relation in both directions. If , then every such transformation of can be uniquely extended to a logic automorphism and there are logic automorphisms which are not induced by unitary and anti-unitary operators. If , then every logic automorphism is induced by an unitary or anti-unitary operator and there are bijective transformations of which preserve the orthogonality relation in both directions and cannot be extended to logic automorphisms.
Proof of Theorem 5.1.
Let be a bijective transformation of preserving the orthogonality relation in both directions and . For the statement was proved above (Proposition 3.1) and we suppose that .
For every subspace we denote by the set of all -dimensional subspaces contained in . If , then consists of all -dimensional subspaces orthogonal to . Hence is formed by all -dimensional subspaces orthogonal to which means that
[TABLE]
and is a bijective transformation of . The condition guarantees that .
Let be the set of all closed subspaces of whose codimension is a finite number not less than and whose dimension is greater than . If is infinite-dimensional, then is formed by all closed subspaces of finite codimension . In the case when is finite, it consists of all subspaces satisfying
[TABLE]
(this set is non-empty, since ). The set is non-empty if belongs to and we claim that there exists such that
[TABLE]
Indeed, can be presented as the intersection of some and
[TABLE]
is as required. We get a bijective transformation of satisfying (5.1) for every . It is easy to see that preserves the inclusion relation in both directions. Hence, it preserves the codimensions of subspaces.
Let and be elements of such that belongs to (since , any two adjacent elements of satisfy this condition). Then consists of all -dimensional subspaces orthogonal to both and
[TABLE]
is formed by all -dimensional subspaces orthogonal to both . This implies that
[TABLE]
Therefore,
[TABLE]
are of the same finite codimension. Since are adjacent if and only if the codimension of is equal to , the transformation sends adjacent elements to adjacent elements. Applying the same arguments to , we establish that is an automorphism of the Grassmann graph . It follows from Theorem 4.1 that is induced by a semilinear automorphism of . This semilinear automorphism transfers orthogonal vectors to orthogonal vectors and, by Lemma 3.1, it is a scalar multiple of an unitary or ant-iunitary operator. ∎
Remark 5.1**.**
The original proofs from [8, 39] are not related to Chow’s theorem. Other proof based on Chow’s theorem can be found in [14].
5.2. Compatibility preserving transformations
In Section 3.3, we describe bijective transformations of and preserving the compatibility relation in both directions. Now, we investigate such kind of transformations for the Grassmannian and restrict ourself to the case when is infinite-dimensional. Some remarks concerning the finite-dimensional case will be given at the end of this section.
Theorem 5.2** (M. Pankov [34]).**
If is infinite-dimensional, then every bijective transformation of preserving the compatibility relation in both directions can be uniquely extended to an automorphism of the logic .
For this statement is a simple consequence of Proposition 3.1. Indeed, two distinct elements of are compatible if and only if they are orthogonal.
In the case when , the proof will be based on the notion of orthogonal apartment. For every orthogonal basis of the set of all -dimensional subspaces spanned by subsets of is said to be the orthogonal apartment of associated to , in other words, this is the intersection of and the Grassmannian .
Recall that a subset of is called compatible if any two distinct elements of this subset are compatible. By Proposition 3.3, orthogonal apartments can be characterized as maximal compatible subsets of , i.e. the family of orthogonal apartments of coincides with the family of maximal compatible subsets of . Therefore, for a bijective transformation of the following two conditions are equivalent:
and send orthogonal apartments to orthogonal apartments, 2.
preserves the compatibility relation in both directions.
We will use some modifications of the arguments from Section 4.3 to show that every bijective transformation of satisfying the above conditions is orthogonality preserving in both directions.
We need to explain why the method from Section 3.4 cannot be exploited to study compatibility preserving transformations of . As above, we suppose that is infinite-dimensional. If is odd, then
[TABLE]
for any distinct compatible . If is even, then the same is true, except the case when . The latter equality implies that the subspace
[TABLE]
is -dimensional, i.e. it belongs to .
5.3. Proof of Theorem 5.2
Let be an orthogonal basis of and let be the associated orthogonal apartment of . We suppose that is infinite-dimensional and .
As in Section 4.3, for every we denote by and the sets consisting of all elements of which contain and do not contain , respectively. For any distinct we define
[TABLE]
[TABLE]
[TABLE]
A subset is said to be orthogonally inexact if there is an orthogonal apartment of distinct from and containing .
Example 5.1**.**
We state that for any distinct the subset
[TABLE]
is orthogonally inexact. In the basis , we replace the vectors and by any other pair of orthogonal vectors belonging to the -dimensional subspace spanned by and (these new vectors are not scalar multiples of and ). If is the associated orthogonal apartment of , then
[TABLE]
This means that (5.2) is orthogonally inexact.
Lemma 5.1**.**
Every maximal orthogonally inexact subset in is of type (5.2).
Proof.
We need to show that every orthogonally inexact subset is contained in a subset of type (5.2). For every we denote by the intersection of all subspaces satisfying one of the following conditions:
- (1)
is an element of containing , 2. (2)
is the orthogonal complement of an element from which does not contain .
Each is non-zero. If is the orthogonal apartment defined by an orthogonal basis and is contained in , then every subspace satisfying (1) or (2) and, consequently every , is spanned by a subset of . Therefore, if every is -dimensional, then is the unique orthogonal apartment containing which contradicts the fact that is orthogonally inexact. So, there is at least one such that . We take any such that belongs to and claim that
[TABLE]
If contains , then and belongs to . If does not contain , then which means that is not contained in and belongs to . ∎
We say that is an orthocomplementary subset if is a maximal orthogonally inexact subset, i.e.
[TABLE]
for some distinct . The latter equality implies that
[TABLE]
This orthocomplementary subset will be denoted by . Note that .
In the case when is infinite-dimensional, there is a simple characterization of orthogonality in terms of orthocomplementary subsets.
Lemma 5.2**.**
Suppose that is infinite-dimensional. Then are orthogonal if and only if the number of orthocomplementary subsets of containing both and is finite.
Proof.
If the orthocomplementary subset contains both and , then one of the following possibilities is realized:
- (1)
one of belongs to and the other to , 2. (2)
one of belongs to and the other is not contained in .
The number of orthocomplementary subsets satisfying (1) is finite. If and are orthogonal, then and there is no satisfying (2). In the case when , the condition (2) holds for infinitely many . ∎
Let be a bijective transformation of preserving the compatibility relation in both directions, in other words, and send orthogonal apartments to orthogonal apartments. For any orthogonal -dimensional subspaces there is an orthogonal apartment containing them. It is clear that sends orthogonally inexact subsets of to orthogonally inexact subsets of the orthogonal apartment . Similarly, transfers orthogonally inexact subsets of to orthogonally inexact subsets of . This means that is a maximal orthogonally inexact subset of if and only if is a maximal orthogonally inexact subset of . Therefore, a subset is orthocomplementary if and only if is an orthocomplementary subset of . Lemma 5.2 guarantees that and are orthogonal. Similarly, we establish that transfers orthogonal elements to orthogonal elements. So, preserves the orthogonality relation in both directions and we apply Theorem 5.1.
5.4. Compatibility preserving transformations. The finite-dimensional case
If is finite-dimensional, then all orthogonal apartments (maximal compatible subsets) of have the same finite number of elements. This implies that for a bijective transformation of the following two conditions are equivalent:
sends orthogonal apartments to orthogonal apartments, 2.
sends compatible elements to compatible elements.
Under the assumption that is finite and not equal to we can characterize pairs of adjacent elements in orthogonal apartments by orthocomplementary subsets for almost all cases. This is impossible only in the case when and . For example, if , then two distinct compatible elements of are adjacent or orthogonal and the distinguishing of such two possibilities is an open problem. Using the mentioned above characterization and Westwick’s generalization of Chow’s theorem (see Remark 4.1) we establish the following.
Theorem 5.3** (M. Pankov [34]).**
Let be a bijective transformation of sending compatible elements to compatible elements we do not assume that the same holds for the inverse transformation f^{-1}$$). Suppose that is finite and not equal to . In the case when , we also require that is distinct from and . Then can be uniquely extended to an automorphism of the logic .
In the case when , we get the following result similar to Theorems 3.4 and 3.5.
Theorem 5.4** (M. Pankov [34]).**
Suppose that and is a bijective transformation of preserving the compatibility relation in both directions. There exists an automorphism of the logic such that for every we have either
[TABLE]
The proofs of the above statements involve some technical details and the arguments do not work for the case when is equal to or . For this reason, we do not present them here.
Acknowledgment
The author expresses his deep gratitude to Antonio Pasini for useful remarks and interesting discussions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Artin E., Geometric Algebra , Interscience Publishers, New York, 1957.
- 2[2] Baer R., Linear Algebra and Projective Geometry , Academic Press, New York, 1952.
- 3[3] Birkhoff G., Von Neumann J., The Logic of Quantum Mechanics , Annals of Math. 36(1937), 823–843.
- 4[4] Blunck A., Havlicek H., On bijections that preserve complementarity of subspaces , Discrete Math. 301(2005), 46–56.
- 5[5] Chow W. L., On the geometry of algebraic homogeneous spaces , Ann. of Math. 50(1949), 32–67.
- 6[6] Cohen D.W. An Introduction to Hilbert Space and Quantum Logic , Problem books in mathematics, Springer–Verlag, 1989.
- 7[7] Engesser K., Gabbay D.M., Lehmann D. (ed.), Handbook of quantum logic and quantum structures: quantum structures , Elsevier, 2009.
- 8[8] Györy M., Transformations on the set of all n 𝑛 n -dimensional subspaces of a Hilbert space preserving orthogonality , Publ. Math. Debrecen 65 (2004), 233–242.
