Preprint
Communication

Operators in the Hilbert Space: the Ramsey Approach

Altmetrics

Downloads

13

Views

41

Comments

0

This version is not peer-reviewed

Submitted:

03 December 2024

Posted:

06 December 2024

You are already at the latest version

Alerts
Abstract
Ramsey theory is applied to the analysis of operators acting on the functions belonging to the L^2 Hilbert space. The operators form the vertices of the bi-colored graph. If the operators commute, they are connected by a red link; if the operators do not commute they are connected with a green link. Thus, the complete, bi-colored graph emerges and the Ramsey theory becomes applicable. If the graph contains six vertices/operators, at least one monochromatic triangle will necessarily appear in the graph. Thus, the triad of operators forming the read triangle possesses the common set of eigenfunctions. The extension of introduced approach to infinite sets of operators is addressed. Applications of the introduced approach to problems of classical and quantum mechanics are suggested.
Keywords: 
Subject: Computer Science and Mathematics  -   Discrete Mathematics and Combinatorics

1. Introduction

In this communication we consider Ramsey graphs emerging from operators defined in Hilbert space [1,2,3]. Ramsey theory, introduced by Frank Plumpton Ramsey, a British philosopher and mathematician, is devoted to the mathematical problems which seek for a sub-structure embedded into a given structure [4]. The well-known problem typical for the Ramsey theory is the so-called “party problem”, which defines the minimum number of persons labeled R(m,n) that must be invited so that at least m are acquainted each with other (they are called “friends” in the notions of the Ramsey theory), or at least n are not acquainted each with other (they are respectively labeled as “strangers”) [5,6,7,8,9]. The well-known result is R 3 , 3 = 6.   Important results in the Ramsey Theory were obtained by Paul Erdős, Ronald Graham and their collaborators [5,8,9]. When Ramsey Theory is formulated in the terms of the graph theory, it claims that any graph will necessarily contain an interconnected sub-graph [7,8,9,10,11,12,13]. The Ramsey theorem, reshaped in the notions of the theory of graphs, states that one will find monochromatic cliques in any edge color labelling of a sufficiently large complete graph [7]. In our communication, we address the Ramsey graphs emerging from operators acting in the Hilbert space. Applications of the introduced approach to quantum mechanics is discussed.

2. Ramsey Graphs Generated by Sets of Operators

Consider the Hilbert space L 2 . Let a , b denote a finite (or infinite) interval on the real axis [1]. We denote L 2 a , b (or simply L 2 ) the set of all complex value Lebesgue measurable functions f defined on a , b such as f 2 is a Lebesgue integral on a , b . A pair of functions which differ only on a set of measure zero are not considered as distinct elements of L 2 [1]. Let D denote a subspace of L 2 . Consider the set of operators T i ,   i = 1 , N , each of one relates to each element f D ; a particular element T i f = g L 2 ; operators T i are defined in space L 2 with domain D. Let us assume that some of operators T i commute, and some of them do not commute. The operators commute (they are “friends” in terms of the Ramsey Theory) if Eq. 1 takes place:
T i , T k = T i T k T k T i = 0 ,                       i , k = 1 , N
The operators do not commute (they are, in turn, “strangers”) if Eq. 2 is true:
T i , T k = T i T k T k T i 0 ,                       i , k = 1 , N
Thus, the Ramsey analysis becomes possible, when operators T i serve as a vertices of the graph. If the operators commute, they are joint with a yellow edge. If they do not commute, they are joint with a blue edge. Thus, the complete, bi-colored, non-directed, Ramsey graph is formed. Let us illustrate the introduced coloring procedure, with the graph, shown in Figure 1. It should be stressed, that commuting of operators is suggested to be non-transitive [13]; this is important for our future treatment.
Consider the graph depicted in Figure 1: no monochromatic triangle is recognized in the graph built of five vertices/operators. This is quite understandable; indeed, the Ramsey number R 3 , 3 = 6. Now consider the bi-colored, complete, Ramsey graph emerging from six commuting/non commuting vertices/operators T i ,   i = 1 , 6 , shown in Figure 2.
Any two operators that commute, have a common set of eigenfunctions, provided only that each has a complete set of eigenfunctions [1]. In other words, the operators do not necessarily have to be Hermitian, unitary, anti-Hermitian, etc. [1]. Thus, a triad of operators T 1 , T 3 , T 5 have a common set of eigenfunctions. It should be stressed, that that triad of non-commuting operators, forming a “blue” triangle may appear in the graph. The Ramsey Theorem does not fix the color of the monochromatic triangle, which will be found in the bi-colored, complete graph built of six vertices.
Thus, following theorem is proved:
Theorem 
Consider the graph emerging from six vertices/operators T i ,   i = 1 , 6 defined in the Hilbert space L 2 . The operators are joint with a yellow link, when they commute; the operators are joint with a blue link, when they do not commute. At least one monochromatic (yellow or blue) triangle will be necessarily found in the graph.

3. Ramsey extension for the infinite sets of operators

Consider infinite, however, countable set of operators T i ,   i = 1 , 2 , defined in the Hilbert space L 2 . This set generates infinite bi-colored graph, illustrated with Figure 3, when operators T i ,   i = 1 , 2 , serve as vertices and coloring of the edges is defined by Eq. (1) and Eq. (2). According to the infinite Ramsey theorem there must be necessarily present an infinite monochromatic clique in the aforementioned graph (a clique of the undirected graph is a subset of vertices of the graph; every two distinct vertices in the clique are adjoining) [14].
Thus, an infinite monochromatic clique of operators will be necessarily be found in the graph. This proves the following theorem:
Theorem 
Consider infinite, however countable set of operators T i ,   i = 1 , 2 , defined in the Hilbert space L 2 . Operators T i ,   i = 1 , 2 , act as the vertices of the infinite graph. The operators are joint with the yellow edge, when they commute; the operators are joint with a blue edge, when they do not commute. Infinite monochromatic clique will necessarily be found in the graph.
If this clique is “yellow” the operators forming the clique have a common set of eigenfunctions. The operators do not necessarily have to be Hermitian, unitary or anti-Hermitian. Again, the exact color of the infinite monochromatic clique remains unknown.

4. Discussion and applications

The mathematical technique enabling converting of sets of operators into the bi-colored, complete, non-directed, Ramsey graph is suggested. The operators play a role of the vertices of the graph. The dual relations between operators are prescribed by the relations of commutation between the operators. The introduced approach is applicable for the analysis of the motion of the rigid body and problems of quantum mechanics. Indeed, translations and rotations of a rigid body may be represented by the commuting and non-commuting operators of translations/rotations [15,16,17]. Observables of quantum mechanics (coordinates, energy, momenta, angular momenta, etc.) are also the commuting and non-commuting operators [19,20,21]. Thus, the introduced approach is also applicable for the quantum mechanics.

Conclusions

We infer that the Ramsey approach may be introduced for the analysis of the sets (finite or infinite) of the operators defined on the Hilbert space. Operators act as the vertices of the graph. The vertices/operators are joint with the yellow edge, when the operators commute, and they are joint with the blue link when the operators do not commute. Consider the graph emerging from six vertices/operators T i ,   i = 1 , 6 defined in the Hilbert space L 2 . At least one monochromatic (yellow or blue) triangle will necessarily be present in the graph, due to the fact that the Ramsey number R 3 , 3 = 6 . If the triangle is “yellow”, the triad of operators, forming the triangle, have a common set of eigenfunctions Address infinite, countable set of operators T i ,   i = 1 , 2 , defined in the Hilbert space L 2 . Operators T i ,   i = 1 , 2 ,   act as the vertices of the infinite graph. Infinite monochromatic (yellow or blue) clique will necessarily appear in the graph. If this infinite clique is “yellow” the operators forming the clique have a common set of eigenfunctions. The operators do not necessarily have to be Hermitian, unitary or anti-Hermitian. The suggested approach is applicable for the analysis of the problems of mechanics, when operators represent translations/rotations of the rigid body. The introduced Ramsey analysis is also useful for quantum mechanics, when operators represent the observables.

Data availability

No data was used for the research described in the article.

Declaration of competing interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. N. I. Akhiezer, I. M. N. I. Akhiezer, I. M. Glaszman, Theory of Linear Operators in Hilbert Spaces, Dover, NY, USA, 1993.
  2. J. Weidmann, Linear Operators in Hilbert Spaces, Springer, NY, USA, 1980.
  3. E. G. Efros, Z-J. Ruan, Theory of Operator Spaces, London Mathematical Society monographs. Clarendon Press, 2000.
  4. F. P. Ramsey, On a Problem of Formal Logic. In: Gessel, I., Rota, GC. (eds) Classic Papers in Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston, 2009, pp. 264-286.
  5. R. L. Graham, B. L. Rothschild, J. H. Spencer, Ramsey theory, 2nd ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., New York, A Wiley-Interscience Publication, 1990, pp. 10-110.
  6. M. Di Nasso, I. Goldbring, M. Lupini, Nonstandard Methods in Combinatorial Number Theory, Lecture Notes in Mathematics, vol. 2239, Springer-Verlag, Berlin, 2019.
  7. M. Katz, J. Reimann, Introduction to Ramsey Theory: Fast Functions, Infinity, and Metamathematics, Student Mathematical Library Volume: 87; 2018; pp. 1-34.
  8. P. Erdős, Solved and unsolved problems in combinatorics and combinatorial number theory, Congressus Numerantium, 1981, 32, 49–62.
  9. , Gyárfás, A. A variant of the classical Ramsey problem. Combinatorica 1997, 17, 459–467. [CrossRef]
  10. D. Conlon, J. Fox, B. Sudakov, Recent developments in graph Ramsey theory, Surveys in Combinatorics, 424 (2015) 49-118.
  11. F. D. Dubo, Stein M. On the Ramsey number of the double star, Discrete Mathematics, 348 (1) (2025) 114227.
  12. X. Hu, Q. Li, Ramsey numbers and a general Erdős-Rogers function, Discrete Mathematics, 347 (12) (2024) 114203.
  13. N. Shvalb, M. Frenkel, S. Shoval, Ed. Bormashenko, A Note on the Geometry of Closed Loops, Mathematics 11(8) (2023) 1960.
  14. S. A. Choudum, B Ponnusamy, Ramsey numbers for transitive tournaments, Discrete Mathematics 206 (1999) 119–129.
  15. A. Soifer, From Pigeonhole Principle to Ramsey Principle. In: The Mathematical Coloring Book. Springer, New York, NY, 2009, pp. 263-265.
  16. H. Goldstein, Classical Mechanics; Addison-Wesley Publishing Co.: Boston, MA, USA, 1959.
  17. R. L. Halfman, Dynamics, vol. 1, Addison-Wesley Inx., Reading, USA, 1962 .
  18. T. R. Kane, D. A. Levinson, Dynamics, Theory and Applications, McGraw-Hill, NY, 2005.
  19. A. Messiah, Quantum Mechanics, Dover Books on Physics, Dover Publications, Mineola, NY, 2014.
  20. L. D. Landau, E. M. Lifshitz, Quantum mechanics. Non-Relativistic Theory, Volume 3 of Course of Theoretical Physics, 3rd Ed., Pergamon Press, Oxford, 1965.
  21. Ed. Bormashenko, N. Shvalb, Ramsey Approach to Quantum Mechanics, 2024, arXiv:2411.02082v2 [math-ph].
Figure 1. Five operators T i ,   i = 1 , 5 are defined in space L 2 serve as the vertices of the graph. Commuting operators are joint with the yellow edges; non-commuting operators are joint with the blue edges. No monochromatic triangle is recognized.
Figure 1. Five operators T i ,   i = 1 , 5 are defined in space L 2 serve as the vertices of the graph. Commuting operators are joint with the yellow edges; non-commuting operators are joint with the blue edges. No monochromatic triangle is recognized.
Preprints 141756 g001
Figure 2. Bi-colored, non-directed complete graph created by the vertices/operators T i ,   i = 1 , 6 is depicted. Coloring is established by Eq. (1) and Eq. (2). Triangle T 1 , T 3 , T 5 is a monochromatic/yellow one.
Figure 2. Bi-colored, non-directed complete graph created by the vertices/operators T i ,   i = 1 , 6 is depicted. Coloring is established by Eq. (1) and Eq. (2). Triangle T 1 , T 3 , T 5 is a monochromatic/yellow one.
Preprints 141756 g002
Figure 3. Infinite number of operators T i ,   i = 1 , 2 , generate the infinite graph. The operators are joint with the yellow edge, when they commute (they are “friends”); the operators are joint with a blue edge, when they do not commute; these operators are “strangers”. Infinite monochromatic clique will necessarily be found in the graph.
Figure 3. Infinite number of operators T i ,   i = 1 , 2 , generate the infinite graph. The operators are joint with the yellow edge, when they commute (they are “friends”); the operators are joint with a blue edge, when they do not commute; these operators are “strangers”. Infinite monochromatic clique will necessarily be found in the graph.
Preprints 141756 g003
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated