Primes as Energy levels (eigenvalues of a certain operator)

Click For Summary
The discussion explores the concept of considering prime numbers as energy levels or eigenvalues of a specific operator related to the Riemann Zeta function, which is proposed to act as a statistical partition function. Participants discuss the potential interpretation of the sum involving primes as the trace of an operator, suggesting that primes could be modeled within a random matrix framework. There is mention of matrices whose negative eigenvalues may approximate primes, and the conversation includes examples of matrices and their eigenvalues. The idea is that an infinite matrix could yield a sequence of eigenvalues that aligns with prime numbers, indicating a deep connection between number theory and quantum mechanics. The thread highlights the ongoing exploration of mathematical relationships between primes and physical theories.
eljose
Messages
484
Reaction score
0
"primes" as Energy levels...(eigenvalues of a certain operator)

I have heard about the Riemann Zeta function to be some kind of physical partition function..my question is..could we consider primes as "Energy levels" (eigenvalues) of a certain partition function or operator?..in the form that exit an operator P so:

P|\psi>=p_{n}|\psi>

could someone give some information of the "Riemann zeta function" as an statistical partition function?..thanks.
 
Physics news on Phys.org
It's called random matrix theory, it is very famous, I've explained it to you before, and you can use google.
 
My question is...could be the sum:

\sum_{n} e^{-sp_{n}}=f(s) be interpreted as the "Trace" of certain operator so we can give an "estimation" for this SUm f(s), consierng primes are "eigenvalues" of a certain Hermitian operator that have a random matrix approach, or if it is satisfied that if we have:

P|\psi>=p_n |\psi>

then f(s)=Tr[e^{-sP}] (at least as an approximation)
 
What if eljose gave a thread and no one came?
 


I don't know of any matrix that has all the primes as its only eigenvalues. But there appears to be a matrix such that its most negative eigenvalue (one eigenvalue per matrix) is a prime plus minus a small number.

T(n,1)=1, T(1,k)=1, n>=k: -\sum\limits_{i=1}^{k-1} T(n-i,k), n<k: -\sum\limits_{i=1}^{n-1} T(k-i,n)


\displaystyle T(n,k) = \begin{bmatrix} +1&+1&+1&+1&+1&+1&+1 \\ +1&-1&+1&-1&+1&-1&+1 \\ +1&+1&-2&+1&+1&-2&+1 \\ +1&-1&+1&-1&+1&-1&+1 \\ +1&+1&+1&+1&-4&+1&+1 \\ +1&-1&-2&-1&+1&+2&+1 \\ +1&+1&+1&+1&+1&+1&-6 \end{bmatrix}

For which the list of the most negative eigenvalue for the first 100 matrices is:

{-1., 1.41421, 2.65544, 3.43931, 4.77106, 5.24392, 6.84437, 7.15539, \
7.47476, 7.57341, 10.9223, 11.096, 12.9021, 13.0453, 13.259, 13.4055, \
16.9724, 17.0824, 18.9443, 19.0552, 19.2282, 19.307, 22.9972, \
23.0759, 23.1576, 23.2173, 23.2976, 23.3972, 29.0103, 29.0407, \
30.963, 31.0104, 31.1008, 31.1505, 31.268, 31.34, 37.0284, 37.0658, \
37.1289, 37.174, 41.029, 41.0503, 42.9921, 43.0326, 43.0807, 43.1149, \
46.996, 47.0293, 47.0619, 47.1025, 47.1582, 47.2011, 53.0192, \
53.0497, 53.1076, 53.1419, 53.1893, 53.2117, 59.0477, 59.0681, \
61.0248, 61.0474, 61.0812, 61.1071, 61.1644, 61.1812, 67.0341, \
67.059, 67.0929, 67.1062, 71.027, 71.0496, 73.014, 73.0331, 73.0575, \
73.0829, 73.1282, 73.1427, 79.024, 79.0442, 79.0633, 79.0799, \
83.0154, 83.0287, 83.0648, 83.0806, 83.1091, 83.1312, 89.032, \
89.0463, 89.0784, 89.0973, 89.1237, 89.1374, 89.1731, 89.1921, \
97.0597, 97.0753, 97.0963, 97.1128}

which when rounded is:

{-1, 1, 3, 3, 5, 5, 7, 7, 7, 8, 11, 11, 13, 13, 13, 13, 17, 17, 19, \
19, 19, 19, 23, 23, 23, 23, 23, 23, 29, 29, 31, 31, 31, 31, 31, 31, \
37, 37, 37, 37, 41, 41, 43, 43, 43, 43, 47, 47, 47, 47, 47, 47, 53, \
53, 53, 53, 53, 53, 59, 59, 61, 61, 61, 61, 61, 61, 67, 67, 67, 67, \
71, 71, 73, 73, 73, 73, 73, 73, 79, 79, 79, 79, 83, 83, 83, 83, 83, \
83, 89, 89, 89, 89, 89, 89, 89, 89, 97, 97, 97, 97}

Compare this to the previous prime with the Mathematica command:

http://www.wolframalpha.com/input/?i=Table[NextPrime[i,+-1],+{i,+1,+101}]"

https://oeis.org/A191898"
 

Attachments

Last edited by a moderator:


Again consider the same infinite matrix above starting:

T(n,k) = \begin{bmatrix} +1&+1&+1&+1&+1&+1&+1 \\ +1&-1&+1&-1&+1&-1&+1 \\ +1&+1&-2&+1&+1&-2&+1 \\ +1&-1&+1&-1&+1&-1&+1 \\ +1&+1&+1&+1&-4&+1&+1 \\ +1&-1&-2&-1&+1&+2&+1 \\ +1&+1&+1&+1&+1&+1&-6 \end{bmatrix}

It then appears that the eigenvalues of a infinitely large matrix T(n,k), when sorted and rounded, contains a infinitely long sequence of consecutive prime numbers.

Example: The 11 most negative eigenvalues of a 300 times 300 T(n,k) matrix are approximately: -293.072, -283.13, -281.127, -277.148, -271.195, -269.177, -263.223, -257.262, -251.299, -241.477, -239.354 which when rounded are: -293, -283, -281, -277, -271, -269, -263, -257, -251, -241, -239 which are the 52nd to the 62nd primes.
 
I am studying the mathematical formalism behind non-commutative geometry approach to quantum gravity. I was reading about Hopf algebras and their Drinfeld twist with a specific example of the Moyal-Weyl twist defined as F=exp(-iλ/2θ^(μν)∂_μ⊗∂_ν) where λ is a constant parametar and θ antisymmetric constant tensor. {∂_μ} is the basis of the tangent vector space over the underlying spacetime Now, from my understanding the enveloping algebra which appears in the definition of the Hopf algebra...

Similar threads

Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 0 ·
Replies
0
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 32 ·
2
Replies
32
Views
9K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
2
Views
6K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 6 ·
Replies
6
Views
4K