17.2 The Groenewold-van Hove no-go theorem

Concept links · terms present in this machine draft; source roles are unverified: Lie algebra · Lie algebra representation

If one wants to quantize polynomial functions on phase space of degree greater than two, it quickly becomes clear that the problem of “operator ordering ambiguities” is a significant one. Diferent prescriptions involving diferent ways of ordering the and operators lead to diferent for the same function with physically diferent observables (although the diferences involve the commutator of and , so higher-order terms in

When physicists first tried to find a consistent prescription for producing an operator corresponding to a polynomial function on phase space of degree greater than two, they found that there was no possible way to do this consistent with the relation

for polynomials of degree greater than two. Whatever method one devises for quantizing higher degree polynomials, it can only satisfy that relation to lowest order in and there will be higher order corrections, which depend upon one’s choice of quantization scheme. Equivalently, it is only for the six dimensional Lie algebra of polynomials of degree up to two that the Schr¨odinger representation gives one a Lie algebra representation, and this cannot be consistently extended to a representation of a larger subalgebra of the functions on phase space. This problem is made precise by the following no-go theorem

Theorem (Groenewold-van Hove)

There is no map from polynomials on to self-adjoint operators on satisfying

and

for any Lie subalgebra of the functions on for which the subalgebra of polynomials of degree less than or equal to two is a proper subalgebra.

Proof. For a detailed proof, see section 5.4 of [8], section 4.4 of [26], or chapter 16 of [37]. In outline, the proof begins by showing that taking Poisson brackets of polynomials of degree three leads to higher order polynomials, and that furthermore for degree three and above there will be no finite dimensional subalgebras of polynomials of bounded degree. The assumptions of the theorem force certain specific operator ordering choices in degree three. These are then used to get a contradiction in degree four, using the fact that the same degree four polynomial has two diferent expressions as a Poisson bracket:

来源与版本

正文:英文 · OCR 机器稿 · 待校对

核对状态:OCR 机器稿 · 待校对

原书 PDF · 印刷页 197、198、199、200、201、202、203

来源版本:2025-10-20

来源 PDF SHA-256:5a1941b2443b54d5db3d055f1e5ba390429b7a728475258017aaac87ee85a837

OCR 来源 SHA-256:fa515c86806c0f33a46ffd47703578d161b4e948c69dd5f91749aa84c3ea8911

OCR 产物 SHA-256:fa515c86806c0f33a46ffd47703578d161b4e948c69dd5f91749aa84c3ea8911