Complex Numbers Not Necessary in QM: Explained

In summary, the conversation discusses the necessity of complex numbers in physics, particularly in quantum mechanics. While some argue that they are not needed and can be replaced with other mathematical tools, others point out that complex numbers have unique properties that are important in applications. The conversation also touches on the use of real numbers in physics and how they can be difficult to justify physically. Ultimately, the question is raised as to why complex numbers are singled out for removal in quantum mechanics, when other mathematical abstractions are accepted and used in physics.
  • #36
A. Neumaier said:
You gave a complex reason :-)

The real reason is that amplitudes satisfy a simple differential equations, probabilities don't. Knowing all probabilities at a fixed time is not even enough to determine the future probabilities, since probabilities lack the phase information at each point in configuration space.
The expression in my post is actually equivalent to the Schrodinger equation in the case where ##B## is ##A## at a latter time. Certainly knowing the probabilities isn't enough, but the interference phases (angles ##\theta##) are present in that relation.

What you're saying isn't incompatible with what I'm saying. The angles arise from the existence of relations between multiple sample spaces. However the evolution equations are cumbersome when dealing with the probabilities and angles directly, where as combining them into an complex amplitude is an alternate simpler expression of them that gives nicer differential equations, i.e. simplicity is the reason for using complex numbers as you said. I expressed this as "alternate more compact", one could say "simpler" as you have.
 
  • Like
Likes Klystron
Physics news on Phys.org
  • #37
DarMM said:
However the evolution equations are cumbersome when dealing with the probabilities and angles directly, where as combining them into an complex amplitude is an alternate simpler expression of them that gives nicer differential equations, i.e. simplicity is the reason for using complex numbers as you said.
Has anyone written down the evolution equations in terms of probability equations and angles? They must be ugly and impossible to motivate (without resorting to amplitudes), and they would have never been popular. Without complex numbers, the evolution equations probably would not even have been discovered...
 
  • Like
Likes Auto-Didact
  • #38
A. Neumaier said:
Has anyone written down the evolution equations in terms of probability equations and angles? They must be ugly and impossible to motivate (without resorting to amplitudes), and they would have never been popular. Without complex numbers, the evolution equations probably would not even have been discovered...
I've seen them, it's not too hard to derive, but I don't think anybody would use them. What I'm saying is that the existence of multiple sample spaces produces the multiple interference angles present in QM, a feature missing from Kolmogorov probability with its single sample space. However the resulting geometry of meshed sample spaces is cumbersome to deal with directly in terms of the probabilities and angles, hence the amplitude formalism.

Another thing is the constraints related to ensuring probabilities always sum to ##1## over exclusive outcomes imposes the structure of a Hilbert space on the amplitudes.

Adán Cabello's papers on the exclusivity principle focus on this where he shows requiring probabilities to be consistent across contexts implies they have relations between each other equivalent to them coming from (squares of) inner products on a Hilbert space. The Hilbert space being complex then occurs from requiring local tomography.

So I should say the specific form of the relation I posted is important as well, without the root you'd have a real Hilbert space.

Summing up, because I've blathered a bit:
The probabilities in QM involve multiple sample spaces that mesh together in a way that ensures consistency with probabilities summing to ##1## across contexts and consistency with local tomography*. This implies all probabilities and all relations between sample spaces can be encoded in a complex Hilbert space. Thus the use of complex numbers in QM.

*Local tomography is also basically imposed by special relativity, real Hilbert space QM has global degrees of freedom
 
Last edited:
  • #39
A. Neumaier said:
The Schrödinger equation at its inception already contained a factor ##i##. It is built into quantum mechanics quite independent of any interpretation. The canonical commutation relation also involves ##i##.

But what convinced Schrodinger then that the wavefunction can't be real? What's wrong with real wavefunctions and real operators?

I.e. what exactly becomes inconsistent if you try to build a quantum theory with a real wavefunction (1 real component)?
 
  • Like
Likes Auto-Didact
  • #40
haushofer said:
But what convinced Schrodinger then that the wavefunction can't be real? What's wrong with real wavefunctions and real operators?

I.e. what exactly becomes inconsistent if you try to build a quantum theory with a real wavefunction (1 real component)?
It has global degrees of freedom inconsistent with special relativity.
 
  • Like
Likes Auto-Didact
  • #41
haushofer said:
But what convinced Schrodinger then that the wavefunction can't be real? What's wrong with real wavefunctions and real operators?

I.e. what exactly becomes inconsistent if you try to build a quantum theory with a real wavefunction (1 real component)?
The stationary states whose energies gave the connection to the older quantum theory from spectroscopy have complex phases. With real wave functions one can handle static issues only.
 
Last edited:
  • Like
Likes Auto-Didact
  • #42
PeroK said:
But, really, why worry about complex numbers in particular?
...
Moreover, in a formal development of numbers it is the real numbers where a lot of the problems lie. And, especially, if you try to justify the real numbers as something physical. For example, a typical real number is indescribable, in the sense that it requires an infinite amount of information to quantify it.
I fullly agree with this stance.
PeroK said:
Why, then, does no one try to do physics based on rational numbers and countable sets? I imagine that it is possible. But, I suspect that the sacrifice in losing calculus and much else besides is too much. Whereas, the sacrifice in losing the complex numbers is perhaps more manageable.
This is exactly what i am trying to do. Ie. to take representability and computability seriously. That means countable sets of distinguishable events are in the starting points. Real numbers can be thought of as an "approximation" that actually makes the math easier when you reach high complexity, but one must not forget that once you trace things back to LOW complexity (think big bang and primordal observers) the whole continuum mathematics are invalid as basis for physics IMO. This way of reconstructing measures will also automatically solve renormalization problems, that are really created simply because the limits are take and their orders are lost.

But there is not much published on this, and the mainstream paradigms also heavily rests of analysis and real numbers. It also requires a new understanding of symmetries, as the continuuum symmetries in this light may need to be reunderstood as approximations of complex systems rather than as fundamental mathematical truths. This complicates a lot of things in how we think of mathematics toolboxes of physics. I am personally convinced its the way to go though.

/Fredrik
 
  • Like
Likes Auto-Didact
  • #43
A. Neumaier said:
The set of definable real numbers (or any other mathematical objects) is countable and has all the properties of the reals (or the objects in question). It gives a countable model of them.

It has all the properties that can be described by a countable first-order axiomatization. But does that include all of the properties of the real numbers that are important for constructing physical models using, for example, calculus?

The particular property I'm thinking might be problematic is the least upper bound property: that every bounded set of real numbers has a least upper bound that is also a real number. But does every bounded set of definable real numbers have a least upper bound that is also a definable real number?
 
  • #44
PeterDonis said:
The particular property I'm thinking might be problematic is the least upper bound property: that every bounded set of real numbers has a least upper bound that is also a real number. But does every bounded set of definable real numbers have a least upper bound that is also a definable real number?
Yes. Defining ##\sqrt{2}:=\sup\{x\in Q\mid x^2<2\}## is a valid definition of a particular real number.

More generally, if ##S## is a set of definable real numbers then ##\sup S## gives a definition of its supremum, hence the latter is also definable.
 
  • Like
Likes Auto-Didact, vanhees71 and dextercioby
  • #45
A. Neumaier said:
if SSS is a set of definable real numbers then ##\sup S## gives a definition of its supremum, hence the latter is also definable.

That's what I thought, but then I started reading about things like this...

https://en.wikipedia.org/wiki/Specker_sequence

...which is a sequence of computable real numbers whose supremum is not computable. But "computable" would seem to be a stricter notion than "definable", since the latter does not require that you actually know how to compute the supremum (for instance), only that you know how to define it using a countable set of axioms. So I guess that's the difference.
 
  • #46
PeterDonis said:
That's what I thought, but then I started reading about things like this...

https://en.wikipedia.org/wiki/Specker_sequence

...which is a sequence of computable real numbers whose supremum is not computable. But "computable" would seem to be a stricter notion than "definable", since the latter does not require that you actually know how to compute the supremum (for instance), only that you know how to define it using a countable set of axioms. So I guess that's the difference.
The computable numbers are meant in the sense of constructive mathematics, numbers defined in such a way that the definition implies an algorithm for computing arbitrarily close rational numbers. Unlike definable reals, computable reals do not form a countable model for the real numbers.

Being algorithmic is a much stronger condition than ''using a countable set of axioms''!
 
  • #47
This is very interesting! What can one not do with the definables? Can all of analysis be built atop them?
 
  • #48
A. Neumaier said:
Yes. Defining ##\sqrt{2}:=\sup\{x\in Q\mid x^2<2\}## is a valid definition of a particular real number.

More generally, if ##S## is a set of definable real numbers then ##\sup S## gives a definition of its supremum, hence the latter is also definable.

Let ##S## be a set of rational numbers. All rational numbers are definable. Therefore ##\sup S## is definable. But, every real number is the supremum of a set of rational numbers. Hence, every real number is definable.

In particular the set of all sets of rational numbers is uncountable. So you'll have to careful about how you define a set.

Something like the set of all rational sequences comes easily enough, from a finite set of axioms.
 
  • Like
Likes PeterDonis
  • #49
A. Neumaier said:
Unlike definable reals, computable reals do not form a countable model for the real numbers.

This would seem to imply that there are more computable reals than definable reals. That doesn't seem right, since we can define numbers that are not computable.
 
  • #50
DarMM said:
This is very interesting! What can one not do with the definables? Can all of analysis be built atop them?

If it can I'll eat my real analysis book.
 
  • #51
PeroK said:
Let ##S## be a set of rational numbers. All rational numbers are definable. Therefore ##\sup S## is definable.

Are all sets of rational numbers definable? The set of all sets of rational numbers is uncountable.
 
  • #52
A. Neumaier said:
if ##S## is a set of definable real numbers then ##\sup S## gives a definition of its supremum, hence the latter is also definable.

In this light of the response I just gave to @PeroK, there is a missing step in this argument which in fact is invalid. The supremum of a definable set of definable numbers is definable; but not all sets of definable numbers are definable sets; they can't all be, because the set of all sets of definable numbers is uncountable.
 
  • Like
Likes PeroK
  • #53
PeterDonis said:
Are all sets of rational numbers definable? The set of all sets of rational numbers is uncountable.

I think the problem is that you need a new definition of a set. For example, the set ##\{1/2, 3/4, 7/8 \dots \}## is a specific set of definable numbers. But the set ##\{a_1, a_2, \dots \}## where the ##a_n## are arbitrary, unspecified definable numbers won't have the property being claimed.

There are too many of these sets, so something would need to be done about that.
 
  • #54
PeroK said:
the set ##\{a_1, a_2, \dots \}## where the ##a_n## are arbitrary, unspecified definable numbers won't have the property being claimed

Yes, which is why I think that you have found a missing premise in the argument @A. Neumaier was making that, per my post #52, is actually invalid; so I'm not convinced that the definable real numbers have all of the necessary properties of the full set of real numbers to allow real analysis to be "built" on just the definable real numbers.
 
  • #55
PeterDonis said:
That's what I thought, but then I started reading about things like this...

https://en.wikipedia.org/wiki/Specker_sequence

...which is a sequence of computable real numbers whose supremum is not computable. But "computable" would seem to be a stricter notion than "definable", since the latter does not require that you actually know how to compute the supremum (for instance), only that you know how to define it using a countable set of axioms. So I guess that's the difference.
I am hardly an expert on this, but based on what I have read on various points or sources, here are few things that might be helpful:
(1) For example, I think the things like specker sequence example might just be an artifact of requiring decimal expansions to be computable. When one switches or changes the definitions even computable analysis goes quite far.

(2) Outside of pure comptuable mathematics, a vast majority of mathematics can be done in very weak systems. One often cited system is ACA0 (one of systems of reverse mathematics) ... but I am not really familiar with details.
But for example, things like specker sequence example will hardly be a problem when we use arithmetic sets (even with decimal expansion definition) ... which are very small but natural collection of subsets of natural numbers.

But even outside of reverse mathematics, there are good number of revisionist approaches that have been applied successfully (there are number of people who have worked on this successfully).
 
  • #56
A. Neumaier said:
The stationary states whose energies gave the connection to the older quantum theory from spectroscopy has complex phases. With real wave functions one can handle static issues only.

Do you have a reference for that? I've read a few QM-books and find it odd that somehow this question is not or barely treated :)
 
  • #57
DarMM said:
It has global degrees of freedom inconsistent with special relativity.
Do you have a reference or can you elaborate?
 
  • #58
haushofer said:
Do you have a reference or can you elaborate?
Here are two I like:
https://arxiv.org/abs/1611.09029
http://www.dima.unige.it/microlocal/wp-content/uploads/2016/12/OPPIO.pdf

You can see that only the complex case doesn't contradict Poincaré symmetry.

It's also the only case that allows local tomography, i.e. the statistics of the state is recoverable from local measurements. This means for example that the state of a two particle system can be recovered from measurements on both particles individually:
https://arxiv.org/abs/1202.4513
 
  • Like
Likes maline
  • #59
haushofer said:
Historically, when did people realize the wavefunction needs to be complex/have 2 real degrees of freedom and one real degree of freedom (i.e. a real scalar function) does not suffice? Was it in the introduction of Heisenberg's commutation relations?
The commutation relations are due to Born. Always Born is forgotten although without him Heisenberg didn't even know what he was doing at Helgoland. The formulation of matrix mechanics is mostly achieved by Born and Jordan (the latter even quantizing the electromagnetic field already in the famous 2nd paper by Born, Jordan, and Heisenberg quite a while before Dirac).
 
  • Like
Likes Auto-Didact, Demystifier, haushofer and 1 other person
  • #60
Summing this up (@atyy this is a bit more accurate than my previous post):

QM is a probability theory with multiple sample spaces, it then has angles ##\theta_j## that represent relations between these sample spaces. The probabilities and interference angles can (at first glance) be combined into vectors that are either real, complex or quaternionic which results in a much simpler Hilbert space formalism, where as dealing with probabilities and interference angles directly is cumbersome.

However on closer inspection the quaternionic case has "too many" angles resulting in the possibility of one sample space interfering with another in such a way as to force its probabilities to exceed ##1##. Or another way of looking at it, the quaternionic uncertainty relations can imply uncertainties that break unitarity.

The real case then turns out to break Poincaré symmetry.

Thus the only multiple sample space consist probability theory is one whose angles can be encoded in complex vectors, i.e. QM.
 
  • Like
Likes Auto-Didact and Fra
  • #61
haushofer said:
Do you have a reference for that? I've read a few QM-books and find it odd that somehow this question is not or barely treated :)
Trivialities need no references and are rarely treated explicitly. If ##H\psi_0=E\psi_0## at ##t=0## with real ##\psi_0## then ##\psi(t)=e^{-itE/\hbar}\psi_0## is complex for most times ##t##.
 
  • Like
Likes Auto-Didact
  • #62
DarMM said:
[...] do with the definables? Can all of analysis be built atop them?
Yes, but it doesn't change anything. Any theory represented in first order logic is independent of the model used to represent it.
PeroK said:
If it can I'll eat my real analysis book.
Guten Appetit!
PeroK said:
Let ##S## be a set of rational numbers. All rational numbers are definable. Therefore ##\sup S## is definable. But, every real number is the supremum of a set of rational numbers. Hence, every real number is definable.
No. Most sets of rationals are not definable. (There are uncountably many sets of rationals, but only countably many of them can be defined.)
PeterDonis said:
not all sets of definable numbers are definable sets; they can't all be, because the set of all sets of definable numbers is uncountable.
Yes.
PeterDonis said:
This would seem to imply that there are more computable reals than definable reals.
No. Their number is countable but they do not form a model for the reals since the supremum axiom fails for them.
PeroK said:
But the set ##\{a_1, a_2, \dots \}## where the ##a_n## are arbitrary, unspecified definable numbers won't have the property being claimed.
This is not a well-defined set, as you specify neither the meaning of the ##a_i## nor the meaning of ##\dots##.
PeterDonis said:
I'm not convinced that the definable real numbers have all of the necessary properties of the full set of real numbers to allow real analysis to be "built" on just the definable real numbers.
Please acquaint yourself with Skolem's paradox, which - although there are more than uncountably many sets - gives countable models for ZFC, essentially by taking the definable sets as the sets in the model. The point is that there is no absolute notion of countability (as mentioned towards the end of the cited Wikipedia article). The notion of countability in the language describing the model is different from the notion of countability in the model itself!
 
  • Like
Likes Auto-Didact, eloheim and dextercioby
  • #63
A. Neumaier said:
The point is that there is no absolute notion of countability (as mentioned towards the end of the cited Wikipedia article). The notion of countability in the language describing the model is different from the notion of countability in the model itself!
Does the constructible universe represent a similar kind of phenomenon, or whether it's a bit different from this? I am completely unfamiliar with it (with only a very vague intuition about it), but I am trying to understand whether this lies along the lines of what you are saying here.
My vague/pop science understanding of it as the "thinnest" class of sets that could serve as a model of ZFC, and any other model would be "thicker" in the sense that it has more sets at the same level (is this anywhere close to being accurate?). But does this relate to uncountability too in some concrete way?

P.S. It isn't a well-thought out question (and also probably too naive/faulty) so you might skip it. I am mostly asking to get a bit better intuition (for myself).
 
Last edited:
  • #64
SSequence said:
Does the constructible universe represent a similar kind of phenomenon?
The constructible universe serves a related purpose. It shows that within any model of ZF (Zermelo-Fraenkel axioms) one can find another model for ZFC (i.e, in which the axiom of choice also holds), and in which the generalized continuum hypothesis is valid.

All that stuff on model dependent issues is studied very thoroughly and in many ramifications by people working in mathematical logic.
 
Last edited:
  • Like
Likes Auto-Didact and SSequence
  • #65
PeroK said:
There are too many of these sets, so something would need to be done about that.
A. Neumaier said:
The notion of countability in the language describing the model is different from the notion of countability in the model itself!
The first notion of countability is a notion on the metalevel, the second one one the object level. If one confuses the two by mixing the levels, one gets logical nonsense of the same kind as in Russell's paradox - even with finite natural numbers:

Let ##n## be the smallest natural number that cannot be defined using less than 100 characters. This seems to define a natural number using less than 100 characters that by its very definition cannot be defined with less than 100 characters.
 
Last edited:
  • Like
Likes Auto-Didact and Demystifier
  • #66
I see two questions discussed here.

One is the origin or reason for the seemingly natural use of complex
numbers in QM, and the other one is the issue/problem(?) of uncountable
or infinite sets.

Superficially they are independent and think DarMM put it well in that QM can be seen as a natural or efficient way to represent the information in a generalised probability theory but there you have different but dependent conjugate sample spaces.

So the question left is not, why complex numbers, its - why does nature seem to prefer non-commutative P-spaces? Is there answer to this within physics?

The other question, of the physical correspondence to infinite (or worse
uncountable) amounts of information gets less philosophical and more
physical if you try to understand quantum mechanics as a form of
information mechanics between interacting agents. Here the problem
becomes that of how an agent (not a human scientist) can encode and
process infinite amounts of information in finite time? So i think any countable mimic of the reals, will not solve the problem here, the problem is still infinite sets, and countable infinity is bad enough. Its just that if its uncountable infinite, you are sort of permanently LOST - you lost track of all orders. So things are more under control as long as things are countable, but we still have the ordering problem when allowing these logical systems to interact in time.

Incidently I think they these two problems are related, because when you try to see physical interactions as computations in competition, wise
resource handling becomes a survival trait. And its my firm understanding that this is the best "explanation" to WHY nature prefers non-commucative structures, its simply because its the most efficient way to structure yourself in an environment of hostile fellow agents trying to decode you.

This puts the coding into evolutionary context.

/Fredrik
 
  • #67
Fra said:
any countable mimic of the reals, will not solve the problem here, the problem is still infinite sets, and countable infinity is bad enough.
The subset of defined objects used by humanity is very finite, certainly of size less than ##10^{30}## [##=10^{12}## words or formulas produced per person ##\times 10^{10}## persons per generation ##\times 10^8## estimated generations humanity might exists], and hence less than the number of atoms in 20 tons of carbon.

This is more than enough for doing physics. The remaining countably many definable things are just the reservoir for creative work!
 
Last edited:
  • Like
Likes dextercioby
  • #68
DarMM said:
Here are two I like:
https://arxiv.org/abs/1611.09029
http://www.dima.unige.it/microlocal/wp-content/uploads/2016/12/OPPIO.pdf

You can see that only the complex case doesn't contradict Poincaré symmetry.

It's also the only case that allows local tomography, i.e. the statistics of the state is recoverable from local measurements. This means for example that the state of a two particle system can be recovered from measurements on both particles individually:
https://arxiv.org/abs/1202.4513
Thanks. It seems rather technical though, but that's my problem ;) Is there an intuitive way of understanding this theorem? And is something similarly true for the non-relativistic case, i.e. for the Bargmann algebra?
 
  • #69
A. Neumaier said:
Trivialities need no references and are rarely treated explicitly. If ##H\psi_0=E\psi_0## at ##t=0## with real ##\psi_0## then ##\psi(t)=e^{-itE/\hbar}\psi_0## is complex for most times ##t##.
Well, yes, but then you assume a certain operator form for the Hamiltonian. Maybe I'm stupid or miss something simple, so let's rephrase my question. Imagine I try to construct QM from first principles similarly as Schrodinger did. However, I want my wave functions and operators to be strictly real. What's, according to you, the first inconsistency that blows then into my face?
 
  • #70
haushofer said:
Well, yes, but then you assume a certain operator form for the Hamiltonian. Maybe I'm stupid or miss something simple, so let's rephrase my question. Imagine I try to construct QM from first principles similarly as Schrodinger did. However, I want my wave functions and operators to be strictly real. What's, according to you, the first inconsistency that blows then into my face?
That you cannot even begin. Which dynamics does your try assume? And how does it account for the spectral features that had to be explained (and were explained) by Schrödinger?
 
  • Like
Likes DanielMB and dextercioby

Similar threads

Replies
7
Views
1K
Replies
48
Views
11K
Replies
1
Views
868
  • Quantum Interpretations and Foundations
Replies
33
Views
4K
  • Quantum Physics
Replies
14
Views
3K
  • Science and Math Textbooks
Replies
2
Views
1K
  • Quantum Physics
Replies
31
Views
4K
  • Differential Equations
Replies
3
Views
2K
  • Science and Math Textbooks
Replies
34
Views
3K
Replies
2
Views
659
Back
Top