A very simple constructive proof of Lowdin's pairing theorem is presented.
Proof of the TCP Theorem
✍ Scribed by Gerhart Lüders
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 122 KB
- Volume
- 281
- Category
- Article
- ISSN
- 0003-4916
No coin nor oath required. For personal study only.
✦ Synopsis
A comparatively simple proof is given for the general theorem that a wide class of quantized field theories which are invariant under the proper Lorentz group is also invariant with respect to the product of time reversal (T), charge conjugation (C), and parity (P). In the proof use is made of an important simplification introduced by Pauli.
1957 Academic Press
I. DEFINITION OF THE OPERATIONS 1. Interaction Representation
Since we want to present a proof of the theorem which is not restricted to interactions without derivatives of the field operators, we employ the interaction representation. In this representation the field operators obey equations of motion without interaction and free field commutation relations. We list these equations for the various types of fields we will be using. 2
Spin 0: (g 2 &m 2 ) .(x)=0, (g 2 &m 2 ) .*(x)=0 (I.1.1) [.*(x), .(x$)]=&i2(x&x$), [.(x), .(x$)]=[.*(x), .*(x$)]=0; (I.1.2) Spin 1: (g 2 &m 2 ) . + (x)=0, (g 2 &m 2 ) . + *(x)=0, (I.1.3) + . + (x)=0, + . + *(x)=0, (I.1.4
📜 SIMILAR VOLUMES
In this article, G is a permutation group on a finite set . We write permutations on the right, so that αg is the image of α ∈ by the action of g ∈ G. A subset S of is said to be G-regular if the stabilizer g ∈ G Sg = S is the identity. Our purpose is to give a direct short proof of the following t
Sane copiosam tu et uberem messem ex hoc agro collegisti, nos pauculas spicas contemptas tibi potius quam non visas. Triumphus igutur hic omnis tuus est: mihi abunde satis si armillis aut hasta donatus, sequar hunc candidae famae tuae currum. wJustus Lipsius In this paper we prove that, except fo
Hollmann, Ko rner, and Litsyn used generalized Steiner systems to prove that it is impossible to partition an n-cube into k Hamming spheres if 2<k<n+2. Furthermore, if k=n+2, they showed the only partition of the n-cube consists of a single sphere of radius n&2 and n+1 spheres of radius 0. We give a
## Abstract We give proofs of Ore's theorem on Hamilton circuits, Brooks' theorem on vertex coloring, and Vizing's theorem on edge coloring, as well as the Chvátal‐Lovász theorem on semi‐kernels, a theorem of Lu on spanning arborescences of tournaments, and a theorem of Gutin on diameters of orient