Quantum Fractals - From Heisenberg's Uncertainty To Barnsley's Fractality (PDFDrive)
Quantum Fractals - From Heisenberg's Uncertainty To Barnsley's Fractality (PDFDrive)
Fractals
From Heisenberg's Uncertainty
to Barnsley's Fractality
Arkadiusz Jadczyk
Quantum Future Group Inc., USA
World Scientific
NEW JERSEY • LONDON • SINGAPORE • BEIJING • SHANGHAI • HONG KONG • TA I P E I • CHENNAI
For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance
Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA. In this case permission to photocopy
is not required from the publisher.
Printed in Singapore
To Laura
for her support of the creative principle
v
May 2, 2013 14:6 BC: 8831 - Probability and Statistical Theory PST˙ws
Preface
vii
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. viii/0
About the Book This book combines a number of different topics such
as: fractals generation and analysis, elements of geometry, linear and multi-
linear algebra and group theory, special relativity, quantum measurements
and, in particular, Heisenberg’s uncertainty relations and their interpreta-
tion, as well as some elements of random processes.
Since it is rather unusual to find a single person that would be inter-
ested in all of these areas, this book has been organized in such a way that
the reader should be able to extract from it the information that is of a
particular interest in her/his research. Nevertheless the primary idea of
the book is to bring together a diversity of ideas and, in this way, encour-
age cooperation and stimulate mutual interest between various branches of
quantum physics and fractal research for the benefit of all.
For this reason the book has not been organized in strict linear or-
der. To facilitate the process of extracting the information of interest there
are repetitions: the same concept may appear in the book several times,
though in a somewhat different context and stressing different aspects. The
reader that would like to know more about a given concept can always find
additional information by perusing the index.
For those who wish to start with looking first at examples: they can
start with “the impossible quantum fractal” — Sec. 2.5 — and then check
examples of hyperbolic quantum fractals in Sec. 3.1.
Those who are simply looking for algorithms and examples of the code
that were used for generating these examples may like to start directly with
Sec. 3.4.
On the other hand readers interested in the foundations of quantum
theory can start with Chap. 4 or one of its sections.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. ix/0
Contents
Preface vii
1. Introduction 1
ix
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. x/0
3. Examples 109
3.1 Hyperbolic quantum fractals . . . . . . . . . . . . . . . . 109
3.1.1 The circle . . . . . . . . . . . . . . . . . . . . . . . 110
3.1.2 Platonic quantum fractals for a qubit . . . . . . . 120
3.2 Controlling chaotic behavior and fractal dimension . . . . 167
3.3 Quantum fractals on n-spheres . . . . . . . . . . . . . . . 171
3.3.1 Clifford algebras . . . . . . . . . . . . . . . . . . . 173
3.3.2 Stereographic projection . . . . . . . . . . . . . . 194
3.3.3 Conformal maps and Frobenius-Perron operator . 195
3.4 Algorithms for generating hyperbolic quantum fractals . . 199
3.4.1 Chaos game on n-sphere . . . . . . . . . . . . . . 202
3.4.2 Approximation to the invariant measure . . . . . 208
Contents xi
Bibliography 317
Index 329
May 2, 2013 14:6 BC: 8831 - Probability and Statistical Theory PST˙ws
Chapter 1
Introduction
This book brings together two concepts. The first is over a hundred years
old — the “quantum”, while the second, “fractals”, is newer, achieving
popularity after the pioneering work of Benoit Mandelbrot. Both areas of
research are expanding dramatically day by day. It is somewhat amaz-
ing that quantum theory, in spite of its age, is still a boiling mystery as
we see in some quotes from recent publications addressed to non-expert
readers:
1
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 2/1
Introduction 3
Introduction 5
Fig. 1.1 Spikes and bursts, in a way similar to quantum jumps, interrupt the continuous
accumulation of the electric potential in neuronal activity. URL: http://en.wikipedia.
org/wiki/Neural\%20oscillation.
Introduction 7
which hides the resulting chaos behind “negative probabilities”). This pro-
gram has not yet been implemented, but I see no reason why it cannot be.
Wave functions, or quantum state vectors are strange objects. Their
ontological status is debatable. Can we really “see”, in some kind of an
experiment, the patterns that they form? What are these wave functions
anyway?
According to some interpretations wave functions (or “pure quantum
states”) are purely subjective, they represent our knowledge. As Henry
Stapp puts it in his book “Mind, Matter and Quantum Mechanics” [Stapp
(1993)]:
Now imagine a monkey flying such an UFO disk. The monkey operates
a joystick with 24 positions — each position defines an instant maneuver
that changes the direction and rotates the disk. The monkey marks on the
hemispherical transparent dome the position of a fixed star — say Alpha
Centauri. After each such maneuver the new mark appears on the dome
— the change of the visible star position is the result of the relativistic
aberration. The monkey operates the joystick randomly and is not getting
tired. After about a hundred thousand of such random operations a fractal
pattern starts to appear on the screen.
Today the above scene, although it is supported by rigorous mathemat-
ics, is fit only for a Sci-Fi movie. The author of “Beyond Star Trek” rightly
argues that such maneuvers are impossible according to the conventional
science and technology. But human beings seem to fear no challenges, and
tomorrow our science and technology can be ready for experiments resulting
in essentially the same effect.
2 For a somewhat different perspective on quantum fractals see [Slomczyński et al.
Introduction 9
Fig. 1.2 Parabolic Quantum Fractal. The ocean around is a symbolic (“artistic”) rep-
resentation of the classical world.
Perhaps the most amazing of all quantum fractals is the one I have
discovered after starting the work on this book — the parabolic quan-
tum fractal stemming from the most simple formula z → z + 4 and its
24 octahedral variations — you see on the cover of this book. In Fig. 1.2
we have exterior view of this object.3 Its shape reminds us of the Buck-
minster Fuller geodesic dome — we may call it the Quantum Dome. It has
huge circular “windows”. I do not have a mathematical formula for these
windows, though certainly there is one — yet to be discovered. When stere-
ographically projected from the sphere on the plane — the windows that
have different sizes on the sphere acquire the same size on the plane. The
Quantum Dome fractal is also “an impossible one” — according to a math-
ematical theorem proved by Andrew Vince [Vince (2013)] (based on the
definition of an attractor proposed by Barnsley and Vince [Barnsley and
Vince (2011)]) we can’t get a “true fractal” from parabolic transformations
such as z → z + 4.4 And yet here it is, and its existence asks for a better
understanding of what should be called a fractal and what not.
http://www.youtube.com/watch?v=YNzf1o4GAAY
4 Of course I tried also other parabolic transformations such as z + 1 and z + 2, but
To speculate even further5 the Quantum Dome (or similar fractals) may
also have engineering applications. Can such a design have some special
optimizing material properties? Can it be used as a “fractal antenna”
of some kind, the way fractal antennas are being used in sophisticated
engineering cell phones. Can it be used for space-propulsion of some sort?
I am having these thoughts while looking at the intriguing and unexpected
shapes and design patterns.
There is also a mysterious connection to Pythagorean triples and
quadruples (see Sec. 2.7.14), discrete space-time structures etc. All of these
deserve further research. This book may serve, I hope, as a jumping-off
platform in this respect.
5 To quote from Irving John Good, a British brilliant mathematician, who worked as
a cryptologist with Alan Turing: “It is often better to be stimulating and wrong than
boring and right.” [Good, 1962, p. 1]
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 11/2
Chapter 2
Before discussing quantum fractals let us start with the classical example
of a fractal — the Cantor set. This simple example allows us to become
accustomed with important concepts that will be needed later on.
One of the simplest, and probably most important fractals is called “the
Cantor set”. George Cantor, a maverick German mathematician (1845–
1918) was the first one who dared to introduce a rigorous concept of in-
finities into mathematics. His life was not an easy one as he had to fight
against strong prejudices both from his colleagues mathematicians as well
as from theologians. At that time the concept of “infinity” was reserved for
God. The great French mathematician of that time, Henri Poincaré was
accusing Cantor of introducing a “great disease” into mathematics, while
Cantor’s famous German colleague, Leopold Kronecker, considered him to
be a scientific charlatan, a renegade and a corrupter of youth. The Church
accused Cantor of propagating pantheism. Perhaps partly as the result of
all this Cantor died after being driven mad [Dauben (1990)]. However his
infinities have found their way into mathematics rather quickly, and today
his calculus of infinities (so called “cardinal numbers”) is being taught to
undergraduate students.1
The Cantor set, that this section is about, is a fractal which is one-
dimensional, therefore, visually, rather dull, unless you are a mathematician
that can appreciate its abstract properties. The algorithm for creating the
Cantor set is extremely simple:
1 The same is not however true about Cantor’s philosophy. As a philosopher Cantor
was a dualist — he was dividing reality into a material part and an “aetherial” part.
11
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 12/2
For the true Cantor set this construction never stops. The Cantor set is
the limiting set of the algorithm. In practice we stop after few steps and
enjoy the result. We get the idea.
Visually it is better to present the Cantor set as a two-dimensional strip
— similar to the strips we see when looking at the spectra of chemical
elements — cf. Fig. 2.1.
Saturn’s rings have also certain features of the Cantor set [Avron and
Simon (1981); Heck and Perdang (1991)].
Fig. 2.2 Fractal analysis of Saturn rings — [Li and Ostoja-Starzewski (2012)].
1
T2 : x → (x + 2). (2.2)
3
N = 1000
0.01
0.008
0.006
0.004
0.002
0.0
0 1/9 2/9 3/9 4/9 5/9 6/9 7/9 8/9 1
In our Chaos Game we can select only those point that fall in the interval
(0, 1/9) and plot only their relative frequencies. This way we “zoom” into
our picture. Yet, as you can see in Fig. 2.4 the pattern is the same. The
small differences are easily explained by the numerical approximations and
by random fluctuations.
What we see on these pictures is, in fact, a “Cantor measure”. The
Cantor set itself is the “support” of this measure — the set on the horizontal
axis over which we have black bars of a nonzero height.
The Cantor set is one of the simplest examples of Iterated Function
Systems (IFS).
N = 1000
0.012
0.01
0.008
0.006
0.004
0.002
0.0
0 1/81 2/81 3/81 4/81 5/81 6/81 7/81 8/81 1/9
Fig. 2.4 Cantor measure through the Chaos Game — zoom into the subinterval [0, 1/9].
more famous — the so called ‘Sierpinski triangle’. While in the case of the
Cantor set we had a pair of transformations acting on a one-dimensional
interval, here we have three transformations (or “maps”) acting on the unit
square [0, 1] × [0, 1] in the two-dimensional plane R2 .
The maps are, in the case of Sierpinski triangle, coded in the following
three 3 × 3 real matrices L1 , L2 , L3 :
⎛ ⎞
0.5 0 0
L1 = ⎝ 0 0.5 0⎠ ,
0 0 1
⎛ ⎞
0.5 0 0.5
L2 = ⎝ 0 0.5 0 ⎠ , (2.3)
0 0 1
⎛ ⎞
0.5 0 0.25
L3 = ⎝ 0 0.5 0.5 ⎠
0 0 1
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 17/2
The first two rows and columns of these matrices define a uniform x, y
contraction by the factor 0.5, — the same contraction for each of the three
maps. The third column describes translation — different for each of the
three transformations.
We act with each matrix on the column vector (x, y, 1), to get (x , y , 1),
using the standard matrix-vector multiplication. Then we act on the re-
sult with another randomly selected matrix. Repeating this procedure say,
100,000 times and plotting the points, we obtain the fractal image shown
in Fig. 2.5.
The procedure is the same as for the Sierpinski triangle. However the
fractal is living now in 3D, therefore its visualization becomes a problem.
If we try to plot 1 mln points, we get a 3D image which, when projected on
the plane, is impossible to interpret — Fig. 2.6. To get an idea what kind
of a fractal we are dealing with it is necessary, in this case, to take the view
of just a thin slice along one of the six faces of the cube, as in Fig. 2.7. Yet
even then it is difficult to imagine what kind of a 3D object we are dealing
with. The solution, in this case, consists of using a different method for
creating the same 3D fractal, namely start with a solid cube and iteratively
remove the appropriate sub-cubes, as in Fig. 2.8.
Thus, for instance, the two maps Eq. (2.2) defining the Cantor set form
a hyperbolic IFS. Originally hyperbolic iterated function systems (for
comprehensive reviews see e.g. Refs. [Barnsely (1988); Peitgen et al.
(1992)]) consisted of a collection of affine maps acting on the plane R2 .
An affine map is a map of the form x = Ax + b:
x
1
x1 a11 a12 x1 b1
=φ = + . (2.7)
x
2
x2 a21 a22 x2 b2
It is only the matrix A that determines the contraction ratio. The trans-
lation by vector b does not affect this ratio. The contraction ratio k can
be computed as the square root of the highest eigenvalue of the symmetric
matrix AT A. Explicitly:
k = α + β + (α − β)2 + γ 2 , (2.8)
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 21/2
where
α = (a211 + a221 )/2, β = (a211 + a222 )/2, γ = a11 a12 + a21 a22 . (2.9)
Each hyperbolic IFS has an attractor set. In the case of the Cantor IFS
the attractor is the Cantor set. A general definition of the attractor for a
hyperbolic IFS requires a little bit of a preparation.
That is W(A) is the union of all images wi (A) of A under the maps wi . We
then have the following theorem:
W(A) = A. (2.11)
Usually, in order to visualize the attractor, we start with the whole space
A0 = X, and construct iteratively the sequence Ak+1 = W(Ak ). Then,
as k → ∞, the sets Ak approximate the attractor better and better. In
order to define “better and better” the concept of the Hausdorff distance
is needed.
Definition 2.3. Let (X, d) be a metric space, and let H(X) be the col-
lection of all nonempty closed, bounded subsets of X. For any nonempty
set A ⊂ X we denote by A the union of all open balls with radius and
centers in A.
For A, B ∈ H(X) we define
The sketch of the proof can be found in [Munkres (2000)]. For a hyperbolic
IFS we have:
A = lim W k (X), (2.13)
k→∞
n
(P ∗ f )(x) = pi (x)f (wi (x)). (2.15)
i=1
We have defined the Cantor set through an iterated function system con-
sisting of two transformations that are selected with equal probabilities.
These transformations, let us call them here w1 , w2 :
1
w1 (x) = x, (2.18)
3
1 2
w2 (x) = x+ . (2.19)
3 3
act on points of the interval [0, 1]. Whenever we have a transformation
acting on points, it induces transformation of functions, we denote it by
T ∗:
When we have two transformations, T1 and T2 , that are selected with prob-
abilities p1 and p2 , the resulting function is also weighted with probabilities.
This way we arrive at what is called the Koopman operator T associated
with the IFS:
the number (μ, f ) = f dμ. We define the dual operator T∗ on measures
by the formula:
In order to calculate the matrix coefficients Tji∗ , we take scalar products (in
L2 ) of the above formula with ek .
(ek , T ∗ ei ) = Tji∗ (ek , ej ). (2.24)
j
The functions ei are orthogonal and (ek , ej ) = Δδk,j , where δkj is the
Kronecker delta. This way we get the formula:
∗ 1 1 x x+2
Tki = (ek , T ∗ ei ) = χΔi ( ) + χΔi ( ) dx, (2.25)
2Δ 2Δ Δk 3 3
where the factor 2 in the denominator comes from the fact that each of the
two transformations is selected with the probability 1/2.
Now, χΔ ( x3 ) = χ3Δ (x), and χΔ ( x+2
3 ) = χ3Δ−2 (x). Therefore we obtain
the following formula:
1
∗
Tki = |3Δi ∩ Δk | + |(3Δi − 2) ∩ Δk | , (2.26)
2Δ
where we denote by |.| the length of the corresponding interval.
Notice that owing to the fact that i Δi is the whole interval [0, 1], we
∗ ∗
get i Tki = 1. Thus the sum of elements in every row of the matrix Tki
June 12, 2014 16:56 World Scientific Book - 9in x 6in QuantumFractals3 pg. 25/2
1
Tik = max(0, min(3i, k) − max(3i − 3, k − 1))
2
1
+ max(0, min(3i − 2N, k) − max(3i − 3 − 2N, k − 1)). (2.28)
2
1 20 40 54
1 1
20 20
40 40
54 54
1 20 40 54
Fig. 2.9 Band structure of the Frobenius-Perron matrix for the Cantor set for N = 54.
0.010
0.008
0.006
0.004
0.002
0.000
Fig. 2.10 Frobenius-Perron matrix for the Cantor set for N = 1000.
Fig. 2.11 Action of a Möbius transformation on the sphere. Circles are mapped into
circles, angles between circles are preserved. This particular Möbius transformation is
encoded in the matrix ( 10 11 ).
Remark 2.3. Each point x0 on the sphere can be represented by the point
(x, 1) on the light cone x2 − (x4 )2 = 0, in Minkowski space, with its time
coordinate x4 normalized to x4 = 1. The probabilities given by Eq. (2.33)
are thus proportional to the time component of the transformed point on
the light cone. Within the framework of Lorentz transformations such a
condition may seem to be counterintuitive. But, as it is explained further in
this book, such a formula for place-dependent probabilities is required by a
quantum measurement theory that is able to reproduce the standard Born’s
interpretation of the quantum-mechanical wave function. Any departure
from this formula, and one such departure is discussed in Sec. 4.7, would
lead to a version of a nonlinear quantum mechanics with all its attractions
and all its dangers.
In the next section we will see one example of a quantum fractal “in
action”.
Probably the simplest quantum fractal is the one that is similar to the
Cantor set, except that it lives on the unit circle instead of the unit interval.
We will discuss it later, in Sec. 3.1.1. But in order to get a real taste of
what quantum fractals are about, it is useful to start with something that is
more illustrative, even though more complicated. This way we will acquaint
ourselves with the whole machinery that will be described in detail in the
following sections.
Our first quantum fractal will be created by an iterated function sys-
tem consisting of 24 transformations, and it will live on a two-dimensional
sphere. It will satisfy the Balancing Condition Eq. (2.29), and its place
dependent probabilities will given by Eq. (2.32).
The two-dimensional unit sphere can be projected stereographically on
the (complex) plane. We will first describe our construction on the plane,
then realize it on the sphere, and then stereographically project from the
sphere onto the plane.
2 In Eq. (2.33), and in the rest of this book, we use Einstein’s convention of a summation
We will do it in this order for the following reason: the plane is infinite;
iterations of Möbius transformations acting on the plane occasionally pro-
duce very large numbers (they may even produce infinities!), and it may
lead to unnecessary computational inaccuracies. These numerical inaccu-
racies and instabilities can be avoided if iterations are taking place on the
sphere — which constitutes the natural arena on which quantum fractals
live.
1, 0 1 1, −i 1 1, i 0, i
U1 = , U2 = √ , U3 = √ , U4 = ,
0, 1 2 −i, 1 2 i, 1 i, 0
1 0, 1 − i 1 1 − i, 1 − i
U5 = √ , U6 = ,
2 −1 − i, 0 2 −1 − i, 1 + i
1 1 − i, −1 + i 1 1 − i, 0
U7 = , U8 = √ ,
2 1 + i, 1 + i 2 0, 1 + i
1 1 + i, −1 + i 1 1, −1
U9 = , U10 = √ ,
2 1 + i, 1 − i 2 1, 1
1 1 + i, 1 − i 1 1, 1
U11 = , U12 = √ ,
2 −1 − i, 1 − i 2 −1, 1
1 i, −i 1 1 − i, 1 + i 1 i, i
U13 = √ , U14 = , U15 = √ ,
2 −i, −i 2 −1 + i, 1 + i 2 i, −i
1 1 − i, −1 − i 1 1 + i, 0
U16 = , U17 = √ ,
2 1 − i, 1 + i 2 0, 1 − i
1 1 + i, 1 + i 1 1 + i, −1 − i
U18 = , U19 = ,
2 −1 + i, 1 − i 2 1 − i, 1 − i
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 31/2
1 0, 1 + i 0, 1
U20 = √ , U21 = ,
2 −1 + i, 0 −1, 0
1 i, 1 1 i, −1 i, 0
U22 = √ , U23 = √ , U24 = .
2 −1, −i 2 1, −i 0, −i
These 24 matrices can be obtained in the following way (cf. [Springer
(1977); Stekolshchik (2008)]): we start with a set G0 of three matrices
G0 = {g1 , g2 , g3 } defined by
0 0i 1 −1 −1
g1 = , g2 = , g3 = √ , (2.34)
0 −1 i0 2 −
where = eπi/4 . We generate the group of 48 elements from this set, for
instance by first taking their products, G1 = G0 · G0 , then G2 = G1 · G1 ,
then G3 = G2 · G2 . This way we obtain 48 different elements that form
the binary octahedral group. The group elements occur in pairs ±g. We
remove one element from each such pair. Our 24 matrices Uα were obtained
in such a way.
All these 24 matrices are unitary of determinant one, they belong to
the group SU (2). SU (2) — the special unitary group in two dimensions,
is the double covering group of the group SO(3) — the (proper, i.e. of
determinant +1) rotation group in three dimensions.3
The matrices Uα form a projective representation of the symmetry group
of the cube in the following sense: for every pair α, β = 1, .., 24, there exists
a unique γ such that Uα Uβ = ±Uγ . We could use the whole group of 48
elements, but this is not needed for our purpose because matrices Uα and
−Uα define the same Möbius transformations of the sphere. The extra
24 elements would differ only by ±1 from Uα , and this sign would not
contribute to the construction of the IFS.
Our notation is consistent owing to the fact that U1 is the identity matrix.
Now all matrices Aα are all in SL(2, C). They all have trace 2 — they define
parabolic transformations.
It may be of interest to notice that the matrices Aα are constructed
in such a way that (Aα )−1 = A25−α . This property is not at all evident
4 From the Abelian group of parabolic transformations discussed in more detail in
Sec. 2.7.13.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 33/2
from the construction, but it can be easily verified by a direct matrix mul-
tiplication. Therefore, our set of 24 matrices is closed with respect to the
operation of taking of the inverse.
This fact5 is interesting, but it is not really important. What is im-
portant is that:
24
A∗α Aα = 216 I. (2.38)
α=1
1 x + iy
ξ= , (2.39)
1 + x2 + y 2 1
to obtain:
1 qα (x, y)
pα (x, y) = + , (2.40)
24 54(1 + x2 + y 2 )
where qα (x, y) are given by the following sequence of 24 quadratic polyno-
mials in x, y:
2 1 + x − x2 − y 2 , 2(x − 2y), 2(x + 2y), 2 x2 + x + y 2 − 1 ,
2 x2 + y 2 + y − 1 , x2 + y 2 − 4y − 1, −x2 − y 2 + 4y + 1,
2 1 − x2 − y 2 − y , 2y − 4x, −x2 − 4x − y 2 + 1,
2(2x + y), x2 + 4x + y 2 − 1, −x2 + 4x − y 2 + 1,
4x − 2y, x2 − 4x + y 2 − 1, −2(2x + y), 2 1 − x2 − y 2 + y ,
x2 + y 2 + 4y − 1, −x2 − y 2 − 4y + 1, 2 x2 + y 2 − y − 1 ,
2 x2 − x + y 2 − 1 , 4y − 2x, −2(x + 2y), −2 x2 + x + y 2 − 1 .
24 24
It can be verified that α=1 qα (x, y) = 0, therefore α=1 pα (x, y) = 1.
The minima and maxima of the probability functions pα (x, y) form a
regular pattern at the points whose coordinates are rational functions of the
Golden Ratio ϕ — cf. Fig. 2.12. A typical behavior of one such probability
function is shown in Fig. 2.13.
5 As well as the fact that the entries of our matrices are Gaussian integers — complex
numbers with integer real and imaginary coefficients. Therefore our quantum IFS can
be used as a generator of Pythagorean quadruples — cf. Sec. 2.7.14.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 34/2
2 (0, ϕ)
1
(−ϕ, 0) (ϕ, 0)
0
−1
−2 (0, −ϕ)
−3
−4
−5
−5 −4 −3 −2 −1 0 1 2 3 4 5
Fig. 2.12 Maxima and minima √ of the 24 probability functions on the complex plane. ϕ
is the Golden Ratio ϕ = (1 + 5)/2 = 1.618...
1 0 −4 4 1 −4 0 4 1 4 0 4
0 1 0 0 4 −7 0 8 −4 −7 0 −8
L(1) = 4 0 −7 8 , L(2) = 0 0 1 0
, L(3) = 0 0 1 0
,
4 0 −8 9 4 −8 0 9 4 8 0 9
1 0 4 4 1 0 0 0 1 0 0 0
0 1 0 0 0 1 4 4 0 −7 4 8
L(4) = −4 0 −7 −8 , L(5) = 0 −4 −7 −8 , L(6) = 0 −4 1 4 ,
4 0 8 9 0 4 8 9 0 −8 4 9
1 0 0 0 1 0 0 0 −7 4 0 8
0 −7 4 −8 0 1 4 −4 −4 1 0 4
L(7) = 0 −4 1 −4 , L(8) = 0 −4 −7 8 , L(9) = 0 0 1 0
,
0 8 −4 9 0 −4 −8 9 −8 4 0 9
−7 0 −4 8 −7 −4 0 −8 −7 0 −4 −8
0 1 0 0 4 1 0 4 0 1 0 0
L(10) = 4 0 1 −4 , L(11) = 0 0 1 0
, L(12) = 4 0 1 4
,
−8 0 −4 9 8 4 0 9 8 0 4 9
−7 0 4 −8 −7 4 0 −8 −7 0 4 8
0 1 0 0 −4 1 0 −4 0 1 0 0
L(13) = −4 0 1 −4 , L(14) = 0 0 1 0
, L(15) = −4 0 1 4 ,
8 0 −4 9 8 −4 0 9 −8 0 4 9
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 35/2
Fig. 2.13 Graph of the probability function p(x, y, 9) near its min-max points.
−7 −4 0 8 1 0 0 0 1 0 0 0
4 1 0 −4 0 1 −4 4 0 −7 −4 −8
L(16) = 0 0 1 0
, L(17) = 0 4 −7 8 , L(18) = 0 4 1 4
,
−8 −4 0 9 0 4 −8 9 0 8 4 9
1 0 0 0 1 0 0 0 1 0 −4 −4
0 −7 −4 8 0 1 −4 −4 0 1 0 0
L(19) = 0 4 1 −4 , L(20) = 0 4 −7 −8 , L(21) = 4 0 −7 −8 ,
0 −8 −4 9 0 −4 8 9 −4 0 8 9
1 −4 0 −4 1 4 0 −4 1 0 4 −4
4 −7 0 −8 −4 −7 0 8 0 1 0 0
L(22) = 0 0 1 0
, L(23) = 0 0 1 0
, L(24) = −4 0 −7 8 .
−4 8 0 9 −4 −8 0 9 −4 0 −8 9
Each of the matrices L(α) has exactly one fixed point on the sphere. For
instance L(1) has one fixed point — the north pole of the sphere. Fig. 2.14
shows the action of L(1) on the sphere. Other transformations are all
similar (related by a 3D rotation) to L(1).
The probabilities pα , in terms of the coordinates x, y, z of the points on
the unit sphere x2 + y 2 + z 2 = 1, can now be calculated from Eq. (2.33).
They are of the form:
1 qα (x, y, z)
pα (x, y, z) = + , (2.41)
24 54
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 36/2
Fig. 2.14 Action of L(1) on the sphere. The shading shows the Jacobian: the level of
the compression of a given infinitesimal area. L(1) maps the highly distorted region on
the left to the corresponding image of the distorted region on the right.
Fig. 2.15 Parabolic quantum fractal made of QIFS of 24 Möbius transformations with
dodecahedral symmetry. 1,000,000,000 points on the sphere projected vertically on the
plane. The square [−1, 1] × [−1, 1] has been divided into 1200 × 1200 square cells and the
hits has been counted for each of the cells. The color bar displays log10 (n + 1), where n
is the number of hits in a given cell.
The pattern has an evident translational symmetry with the period 4.0. It
can be seen from Fig. 2.17 and Fig. 2.18, that the correspondence between
the regions in both figures, one on the sphere and one in the plane, is not
that evident: the circles 1, 2, 3, 4 after stereographic projection become of
the same size as circles A, B, C, D, the reason being that they are closer to
the projection point — the north pole of the sphere.
are being avoided. But do we have an attractor here that is not the whole
plane?
point 2 + 2i. This results in 5063328 points (coinciding points are counted
as one) shown in the picture. Visually — see Fig. 2.19 — there is a strong
similarity with a part of the result of the Chaos Game. Additionally, two
exact circles have been superimposed in Fig. 2.19 in order to check how
exact is the above guess. While the larger circle fits pretty well, it is not
quite the same with the small one.
in a long sequence of our “Chaos Game” is the same and equal to 1/24,
the frequencies of consecutive pairs are not the same, cf. Fig. 2.20, where
the lighter squares correspond to higher frequencies. It can be seen from
this picture that repeating the same transformation twice (the diagonal)
happens rarely. This is probably due to the fact that each of the transfor-
mations contains a unitary rotation along an axis that is orthogonal to the
contraction-expansion direction. But can this particular pattern be some-
how understood by examining the set of 24 matrices and nothing else? To
test the hypothesis Fig. 2.21 shows the density plot of the distance between
Lorentz matrices L(i) and L(j) measured by the function
Fig. 2.19
√ Five letter words applied to 2 + 2i with superimposed
√ two circles: one of
radius 3 and center at 2 + 2i, the other one with radius 3/5 and center 2/5 + 2i/5.
Plot range x, y from −14 to 14.
Figure 2.21 is, of course, perfectly symmetric, which is not the case with
Fig. 2.20, but otherwise the similarity is rather striking. How to understand
this phenomenon? In principle the statistics of pairs can be deduced from
the formula (12) in [Jadczyk (2006)], but this is yet to be done.
20
15
10
5 10 15 20
Fig. 2.20 Frequencies of pairs (i, j), where the transformation Ai is followed by Aj
using place dependent probabilities Eqs. (2.41) and (2.42). Darker squares correspond
to smaller frequency. The counting was performed on a sample 100,000 iterations long.
This action can be derived form the natural action on complex vectors using
the projective method as follows:
ab z1 az1 + bz2
= . (2.45)
cd z2 cz1 + dz2
Then, with z1 = z, z2 = 1 we obtain:
az+b
ab z cz+d
= (cz + d) . (2.46)
cd 1 1
The action in Eq. (2.44) is singular for z = −d/c. This point is mapped into
infinity. That is why it is convenient to add the point ∞ to the complex
plane, to compactify it, to make it into the Riemann sphere. But this is not
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 43/2
20
15
10
5 10 15 20
Fig. 2.21 Distance d(i, j) between Lorentz matrices L(i) and L(j).
the optimal solution. A much better solution is to act on the sphere from
the very beginning.
Another disadvantage of the complex plane representation is that ma-
trices A and cA, 0 = c ∈ C, define the same transformation. We have a
redundancy in our description. It is much better to get rid of these two
problems from the very beginning. In the next section we will show how
this can be done by replacing 2 × 2 complex matrices by 4 × 4 real ones.
q(x) = xT η x, (2.48)
We say that the metric tensor η has signature (1, 1, 1, −1) or (3, 1). More
popular among physicists is the opposite convention: one plus, three mi-
nuses. This other choice is particularly convenient when we do not want
to interfere with the sign of energy, the quantity dual to “time”. On the
first pages of Ref. [Misner et al., 1973, Table of sign conventions] one can
find a useful table presenting conventions that are used in most popular
textbooks.
xα = ηαβ xβ , xα = ηαβ xβ ,
q(x) = ηαβ xα xβ = ηαβ xα xβ . (2.50)
Fig. 2.22 Intersection of the future light cone with the plane x4 = 1, including two
generator lines.
Knowing that our group acts on the sphere, the next thing is to get a
parametric representation of this action. To this end let us consider the
intersection of the future light cone with the hyperplane x4 = 1. This
intersection is the two-sphere described by the equations
(x1 )2 + (x2 )2 + (x3 )2 = 1, x4 = 1. (2.55)
For a point x belonging to this intersection, define
ni = xi , i = 1, 2, 3, n = (n1 , n2 , n3 ), n4 = 1. (2.56)
Then, owing to the equation 0 = q(n) = n − (n ) = n − 1, the vector
2 4 2 2
n is a unit vector.6
6 We are using here the letter n instead of x in order to stress the fact that our vector
is normalized.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 47/2
Let L be a matrix from the restricted Lorentz group SO+ (3, 1). The
vector Ln has coordinates:
(Ln)i = Lij nj + Li4 n4 , (2.57)
(Ln)4 = L4j nj + L44 n4 . (2.58)
Now, L maps the future light cone onto itself. Therefore (cf. Eq. (2.53)):
3
(Ln) = ((Ln)i )2 > 0.
4
(2.59)
i=1
Define
(Ln)i
(L · n)i = . (2.60)
(Ln)4
Or, explicitly:
3
j=1 Lij nj + Li4
(L · n) = 3
i
. (2.61)
j=1 L4j nj + L44
Now, from Eq. (2.60), if n2 = 1, then also L · n has square of one. Thus
the restricted Lorentz group SO+ (3, 1) acts, through n → L · n, on the
two-sphere.
Then the denominator of Eq. (2.61) is nothing else than the norm of the
vector ñ. Taking the quotient in Eq. (2.61) is equivalent to the normalization
of the vector. Yet, computationally, there will be always small numerical
differences between ||ñ|| and the denominator in Eq. (2.61) calculated using
the coefficients of the matrix L. On certain occasions these differences tend
to accumulate in iterations. Therefore it is numerically more stable to
implement the transformations Eq. (2.61) as
ñ
L·n= , (2.63)
||ñ||
that is
ñi
(L · n)i = . (2.64)
3 j 2
j=1 (ñ )
June 12, 2014 16:56 World Scientific Book - 9in x 6in QuantumFractals3 pg. 48/2
eiφ 0
U = U (φ) = , φ∈R (2.68)
0 e−iφ
June 12, 2014 16:56 World Scientific Book - 9in x 6in QuantumFractals3 pg. 49/2
is not only in SL(2, C) but also in SU (2) — the group of unitary ma-
trices (i.e. U ∗ U = I) of determinant 1. We will see that it can be inter-
preted as describing a rotation in the three-dimensional space R3 around the
z-axis by the angle 2φ. The group SU (2) is the double covering group of
the proper orthogonal group SO+ (3).
Both U (φ) and T (α) are one-parameter subgroups of SL(2, C). We have
U (φ)U (φ ) = U (φ + φ ) and T (α)T (α ) = T (α + α ).
Pauli matrices. The first step, that is widely used in relativistic physics,
is to realize the four-dimensional Minkowski space M as the space of all
Hermitian 2 × 2 matrices. To this end we introduce four Pauli matrices
sμ , (μ = 0, 1, 2, 3), with coefficients (sμ )ab , as follows7 :
10 01 0 i 1 0
s0 = , s1 = , s2 = , s3 = . (2.76)
01 10 −i 0 0 −1
The matrices sμ have the (easily verified) property that
Tr (sμ sν ) = 2δμν , (2.77)
where δμν is the “Kronecker delta”. Moreover, we have the following com-
pleteness formula (that can also be verified by direct calculations):
3
(sμ )ab (sμ )cd = 2δad δbc , (a, b, c, d = 1, 2). (2.78)
μ=0
point (event). Notice that, owing to the formula Eq. (2.77), the coordinates
xμ can be read from the matrix X:
1
xμ = Tr (Xσμ ). (2.81)
2
In particular, what follows also from the explicit form of X in Eq. (2.79),
1
x0 = Tr (X). (2.82)
2
Action of SL(2, C): If X is a Hermitian matrix, X = X ∗ , and if A is
an arbitrary matrix, then X = AXA∗ is also Hermitian, as we have
∗
X = (AXA∗ )∗ = A∗∗ XA∗ = AXA∗ = X . (2.83)
If A is a matrix in SL(2, C), then det(A) = 1, therefore
det(X ) = det(AXA∗ ) = | det(A)|2 det(X) = det(X), (2.84)
or
(x )2 − (x ) − (x )2 − (x )2 = (x0 )2 − (x1 )2 − (x2 )2 − (x3 )2 .
0 1 2 3
(2.85)
Remark 2.8. Although L(A)ν μ are (real) numbers and sμ are (complex,
but Hermitian) matrices, it is convenient to write the formula Eq. (2.86)
with numbers on the right hand side. It helps keeping track of the left
and right group actions. With the notation as above we have L(AA ) =
L(A)L(A ), where the matrix multiplication is the standard one:
(LL )μν = Lμρ Lρν . (2.87)
By taking the trace of both sides of Eq. (2.86) multiplied by sλ , and using
Eq. (2.77) we obtain the following important formula8 :
1
L(A)μν =
Tr (sμ Asν A ). (2.88)
2
It follows now from Eq. (2.78) that
Tr (L(A)) = |Tr (A)|2 . (2.89)
8A similar formula can be found in [Carmeli and Malin, 2000, p. 56, (3.84a)], however
with an error. Carmeli and Malin have there (incorrectly) Λαβ instead of the correct
Λαβ . On the other hand, in Ref. [Carmeli, 1977, p. 36] the formula is correct.
June 12, 2014 16:56 World Scientific Book - 9in x 6in QuantumFractals3 pg. 53/2
Remark 2.9. In the formulas below we are using index 4 instead of the
index 0 for the “time coordinate”. We do so because these formulas are
being used in the computer implementation of quantum fractals. In some
computer languages such as Fortran, Mathematica, Matlab, some Pascal
versions, the “native” indexing of arrays starts with the index 1 rather than
from 0. One can always go to the base index 0 representation by renaming
the index 4 → 0.
ab
A= , ad − bc = 1 (2.90)
cd
the 16 entries of the real 4 × 4 matrix L = L(A) are given explicitly by the
following formulas:
(z) and (z) denote respectively the real and the imaginary part of a
complex number z.
One can show that the map A → L(A) is a group homomorphism from
SL(2, C) onto the connected component of the identity SO+ (3, 1) of the
Lorentz group — cf. [Carmeli and Malin, 2000, Ch. 3.4.2].
Let X be a Hermitian matrix representing a point (“event”) with coor-
dinates xμ in Minkowski’s space. Then X = AXA∗ is also Hermitian and
can be written as X = xμ sμ . We then have
9 These formulas agree, up to the order of terms, with those given in Ref. [Carmeli and
and, from the fact that the matrices sμ form a basis in the space of Hermi-
tian matrices, after renaming the labelling indices, we obtain:
xν = L(A)ν μ xμ . (2.93)
Since, owing to Eq. (2.84), Eq. (2.85), det(X ) = det(X), the Minkowski
quadratic form has the same value on xμ and on xμ . Therefore L is a
Lorentz transformation.
Notice that, owing to Eq. (2.91), the component L(A)44 of the matrix
L(A) is necessarily positive. In fact, since L(A)44 = Tr (A∗ A)/2 ≥ 1,
L(A)44 ≥ 1. (2.94)
Preservation of the future light cone. We will now show that L(A)
preserves the future light cone. Let x, with coordinates xμ , be a point on
the future light cone. Then det(X) = 0 and x0 = Tr (X) > 0; the matrix X
has two eigenvalues. The determinant is the product of these eigenvalues,
therefore one of these eigenvalues must be zero, the other one must be
positive. X is a positive definite matrix.
Recall that a matrix A is called positive (or positive definite) if and only
if u∗ Au > 0 for any nonzero vector u. Or, written differently,
(ξ, Xξ) > 0 for all 0 = ξ ∈ C2 . (2.95)
A matrix is positive if and only if it is Hermitian and all its eigenvalues are
positive. If A and B are positive matrices, then tA + (1 − t)B is positive
for 0 ≤ t ≤ 1. It is easy to see that for 2 × 2 matrices the property of
positivity is equivalent to the property of both, determinant (the product
of eigenvalues) and the trace (the sum of eigenvalues) of the matrix, being
positive.
But then (ξ, X ξ) = (A∗ ξ, XA∗ ξ) = (ξ , Xξ ), where ξ = A∗ ξ, is
also positive. Therefore X is positive definite as well. Since det(X ) =
det(X) = 0, it follows that the trace of X is positive, therefore x > 0.
0
Topology of SO+ (3, 1). The image of SL(2, C) under the group homo-
morphism SL(2, C) → SO+ (3, 1) not only preserves the time direction, but
also does not contain space inversions, that is that all the matrices L(A)
have determinant +1. This property follows from the fact that SL(2, C),
as a topological space, is path connected, which, in turn, follows from the
polar decomposition theorem (cf. e.g. [Axler (1997)]). Namely, every non-
singular matrix A can √ be uniquely decomposed as A = T U, where T is a
positive matrix (T = AA∗ ), and U is a unitary matrix (U U ∗ = I). If
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 55/2
with real coefficients xμ . The coefficients xμ can be read back from the
matrix X using the simple formulas in Eq. (2.81), Eq. (2.82).
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 56/2
Among Hermitian matrices there are special ones that are idempotents.
They have the property that X 2 = X. The matrices X = 0, and X = I
do have this property, but they are considered as being trivial idempotents.
What are the nontrivial ones? As we will show, they are orthogonal projec-
tion operators on one-dimensional subspaces of C2 .
As a rule, we will use the letter P to denote them. Using Eq. (2.97) and
writing down the equation X 2 = X we obtain that any nontrivial Hermitian
idempotent P is necessarily of the form
1
Pn = (I + n · s), (2.98)
2
where n1 , n2 , n3 are real,
n · s = n1 s 1 + n 2 s 2 + n 3 s 3 , n2 = n21 + n22 + n23 = 1. (2.99)
Conversely, every such Pn is an idempotent. From Eq. (2.81) we can then
calculate ni in terms of Pn :
1
ni = Tr ((2Pn − I)si ) = Tr (Pn si ), i = 1, 2, 3, (2.100)
2
where we have used the fact that Tr (si ) = 0 for i = 1, 2, 3.
Therefore Hermitian idempotents are uniquely parametrized by vectors
n on the unit sphere S 2 — according to Eq. (2.98).
The general formula for the orthogonal projection operator onto the sub-
space spanned by a normalized vector ζ reads:
ζ1 ¯ ¯
Pζ = ζ ⊗ ζ † = ζ1 ζ2 , (2.105)
ζ2
or, in action on a vector χ
We can now use Eq. (2.104) in order to express now Pζ in term of complex
plane coordinates (x, y):
Pζ = ζ ⊗ ζ † (2.108)
1 z
== z̄ 1
1 + |z|2 1
1 |z|2 z
=
1 + |z|2 z̄ 1
1 1 + x2 + y 2 x + iy
=
1 + x2 + y 2 x − iy 1
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 58/2
2x
n1 = 1+|z|2
{∞} = (0, 0, 1) 2y
n2 = 1+|z|2
−1+|z|2
n3 = 1+|z|2
n = (n1 , n2 , n3 )
z=0 z = x + iy
n1
x = 1−n 3
n2
y = 1−n3
Fig. 2.23 Stereographic projection relating complex plane and projection operator rep-
resentations.
nx = 2(XZ + Y W ) = 2 a · b,
ny = XW − Y Z = 2 a × b, (2.130)
nz = X + Y − Z − W = a − b = 2a − 1.
2 2 2 2 2 2 2
ξ → eiψ ξ (2.131)
X = a cos(ψ), (2.132)
Y = a sin(ψ), (2.133)
Z = b cos(θ + ψ), (2.134)
W = b sin(θ + ψ). (2.135)
b
b
ψψ++θθ
θ a
a
ψ
ψ
a2a+
2
+bb22 =
= 11
nx = sin(φ) cos(θ),
ny = sin(φ) sin(θ), (2.142)
nz = cos(φ).
We see that the phase angle ψ disappears completely from the expressions
for the components of the vector n, while the angles φ and θ play the
role of the standard spherical angle coordinates on the sphere: φ is the
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 63/2
latitude measured from the north pole, and θ is the longitude measured
from the meridian of y = 0.
This way we have implemented a map from the three-dimensional sphere
S 3 described by the equation X 2 + Y 2 + Z 2 + W 2 = 1, and parametrized
by three angles φ, θ, ψ, onto two-dimensional sphere S 2 described by the
equation n2x + n2y + n2z = 1 and parametrized by the angles φ, θ. This map
S 3 → S 2 is known as Hopf fibration. The fibers of the Hopf fibration are
the circles parametrized by the ψ angle while φ and θ are constant.
We will now describe the physical meaning of the angle φ.
Let n be a spin direction, and let P (n) be the orthogonal projection on
the corresponding spin state:
1
P (n) = (I + σ · n) . (2.143)
2
According to the standard quantum theory the probability pξ (n) of regis-
tering spin in the direction n, when the spin state is described by a unit
vector ξ in C2 , is given by the formula:
Suppose now that n = (0, 0, 1), that is that we want to measure the prob-
ability of the spin direction pointing towards the north pole of the sphere.
In this case, using the notation of this section, Eq. (2.144) gives us
φ 1 + cos(φ)
pξ (n) = |z1 |2 = a2 = cos2 = . (2.145)
2 2
The foci of constant probability on the Bloch sphere are therefore parallels
of latitude. The north pole, φ = 0, gives us probability 1; the south pole,
φ = π — probability 0; while the equator, φ = π/2 — probability 1/2.
But how to visualize not just states, but spin vectors representing spin
states of a constant probability? To this end we will use the stereographic
projection from the three-sphere S 3 to the Euclidean space R3 . The formu-
las for the stereographic projection are similar to those in two dimension:
X
x= ,
1−W
Y
y= , (2.146)
1−W
Z
z= .
1−W
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 64/2
Fig. 2.25 Tori of constant probability. Stereographic projection from the sphere S 3 .
Shown three isosurfaces for p = 0.853553, 0.5, 0.146447 corresponding respectively to
φ = π/4, π/2, 3π/4. The most inner torus (cut from the top and the bottom) is that of
φ = 3π/4.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 65/2
Fig. 2.26 Isosurfaces of constant probability with a family of phase lines (the “Villarceau
circles”) — the fibers of the Hopf fibration.
that is just one spin state.10 Our choice of the singular point W = 1 in
the stereographic projection formula is preferring the z-axis of the spin
direction. It is therefore instructive to consider also the measurement of,
say, the x-component of the spin. In this case the projection P (n) becomes:
1 1 11
P (n) = (I + σx ) = , (2.148)
2 2 11
which easily translates into the probability formula:
1
px (φ, θ, ψ) = (1 + sin(φ) cos(θ)) . (2.149)
2
Suppose now that we want to visualize the isosurface of px = 1/2. In this
case the isosurface equation is cos(θ) sin(φ) = 0, therefore the isosurface can
be build from two parts: one with θ = π/2, the other one with θ = 3π/2,
while φ ∈ [0, π] and ψ ∈ [0, 2π] are arbitrary. The resulting surface is a
deformed torus, closing at infinity, as can be seen in Fig. 2.28. Figure 2.29
shows a family of 16 such isosurfaces (which happen to be, in this case,
half-planes) of constant phase ψ. In EEQT (cf. Sec. 4.4) we use fuzzy
10 In a different context (related to Penrose twistors) essentially the same picture can be
Fig. 2.27 A family of Villarceau circles making one isosurface torus viewed from above.
The torus represents one parallel of latitude on the Bloch sphere. Each circle represents
one point on the Bloch sphere.
Fig. 2.28 Two isosurfaces of constant probability: one for spin z-component (torus),
and one for spin x-component (deformed torus, closing at infinity).
the same Lorentz matrices and the same quantum fractals on the Bloch
sphere. But, in principle, quantum fractals can be also drawn in the space
of spin state vectors — that is on the three-dimensional S 3 — or, using the
stereographic projection, in the three-dimensional Euclidean space R3 . In
such a case the phases contained in the complex matrices become important.
We did not implement this idea for the same reason we did not show higher
dimensional quantum fractals discussed in Sec. 3.3 — mainly because it
would need an implementation of a 3D graphical representation of fractals,
which constitutes a technical challenge.
have
APn A∗ = λPn , (2.151)
where n = A · n, as in Eq. (2.96) and
1
λ = λ(A, n) = . (2.152)
L(A)0i ni + L00
The function λ : SL(2, C) × S 2 → R+ satisfies the cocycle condition
λ(A A, n) = λ(A , A · n)λ(A, n). (2.153)
Proof. Let n be the vector in R4 with coordinates (1, n). Then, with
n0 = 1, (cf. Eq. (2.98))
1 1
Pn = (I + ns ) = nμ sμ . (2.154)
2 2
Therefore (cf. Eq. (2.86))
1 μ
APn A∗ = n Asμ A ∗
2
1
= nμ Lνμ sν . (2.155)
2
Since s0 = I, and taking into account Eq. (2.61),we get:
1 L(A)iμ nμ si
APn A∗ = I+
L(A)0μ nμ L(A)0μ nμ
1
= Pn (2.156)
L(A)0i ni + L00
where
n = A · n = L(A) · n. (2.157)
Therefore
1
λ(A, n) = . (2.158)
L(A)0i ni + L00
The cocycle identity follows now from
(A A)Pn (A A)∗ = λ(A A, n)PA A·n , (2.159)
on one hand, while on the other hand, we have
∗
(A A)Pn (A A)∗ = A APn A∗ A
∗
= A λ(A, n)PA·n A
= λ(A, n)λ(A , A · n)PA A·n .
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 70/2
We can also parametrize the sphere (minus one point) using the stereo-
graphic projection parametrization by expressing the unit vector n in terms
of z = x + iy as in Eq. (2.112), then substitute for L(A) the explicit for-
mulas in Proposition 2.2. But we can also use the formula Eq. (2.109) to
obtain:
Proposition 2.4. With A = ac db ∈ SL(2, C), the factor λ in Eq. (2.158)
can be also written as
|az + b|2 + |cz + d|2
λ(A, z) = . (2.160)
1 + |z|2
Proof. In order to prove the statement we take the trace of both sides of
Eq. (2.151) and notice that the trace of a projection on a one-dimensional
subspace is 1. Thus we get:
λ = Tr (APz A∗ ) = Tr (A∗ APz ). (2.161)
Now we have that
|a2 | + |c|2 āb + c̄d
A∗ A = ¯ |b|2 + |d|2 . (2.162)
b̄a + dc
Then the direct calculation gives:
1 2
λ= ¯ + |b|2 + |d|2 .
(|a| + |c|2 )|z|2 + (āb + c̄d)z̄ + (b̄a + dc)z
1 + |z| 2
(2.163)
The statement in the Proposition then follows by a direct calculation of
|az + b|2 + |cz + d|2 , and by checking that the result coincides with the
expression in the parenthesis.
The linear fractional transformations z → (az +b)/(cz +d) implemented
by SL(2, C) matrices A are called Möbius transformations.
Since we are considering now the case of det(X) = 0, we can write the
series in the second term as sin(ω)/ω, and we obtain
sinh ω
eX = cosh(ω) I + X. (2.175)
ω
Notice that it does not matter which of the two square roots of det(X),
that differ by a sign, we use in this formula. Moreover, with understand-
ing that sin(0)/0 = 1, the last formula applies to the case of det(X) = 0
as well.
Remark 2.11. Notice that the argument ω of the sinh and cosh functions
is, in general, a complex number. If z = x + iy, where x, y are real, then
cosh z = cosh x cos y + i sinh x sin y,
sinh z = sinh x cos y + i cosh x sin y.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 73/2
Proposition 2.6. Let A be a matrix from SL(2, C), i.e. det(A) = 1. Then
A = eαX . (2.200)
A = eX . (2.201)
iπ
iii) If Tr (A) = −2, and A = −I, then, with X = 0 −iπ 0
we have
X
Tr (X) = 0 and A = e .
iv) If Tr (A) = −2, and A = −I, then A is not an exponential of a traceless
matrix.
3
loxodromic
2
1
)
-1
−2.0 2.0
( +
0
hyperbolic elliptic hyperbolic
-1
-2
-3
parabolic
-4
-5
-5 -4 -3 -2 -1 0 1 2 3 4 5
-1
( + )
a−d
z0 = . (2.202)
2c
If c = 0, then A is necessarily of the form Eq. (2.70) and its fixed point is
∞ corresponding to the north pole n = (0, 0, 1) of the sphere. If A is not
parabolic, then A has exactly two fixed points. If c = 0, then the fixed points
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 78/2
are
a−d+ Tr 2 (A) − 4
z1 = , (2.203)
2c
a−d− Tr 2 (A) − 4
z2 = . (2.204)
2c
If c = 0, then one of the fixed points is
b
z1 = , (2.205)
d−a
the second one is
z2 = ∞. (2.206)
If we use the stereographic projection Eq. (2.112) onto the complex plane
z = x + iy, we get
sin θ cos φ
x=
1 − cos θ
sin θ sin φ
y= (2.212)
1 − cos θ
From this we can calculate the Jacobian determinant
∂x ∂x
∂θ ∂φ sin θ
dxdy = ∂y ∂y dθ dφ = dθ dφ. (2.213)
∂θ ∂φ (1 − cos θ)2
Proposition 2.8.
(1) Let A = ac db be a GL(2, C) matrix. Let us denote
D = det(A) = ad − bc = 1.. (2.217)
Let A : z → z = A · z = az+b
cz+d
be the corresponding linear fractional
transformation (Möbius transformation) of the complex plane. The
transformation induces the associated transformation of the sphere S 2
via stereographic projection. Let dS be the transformed surface area
element of the sphere. Then
2
(1 + |z|2 )
dS = D2 dS. (2.218)
|az + b|2 + |cz + d|2
In particular, if det(A) = 1, then
dS 1
= . (2.219)
dS λ(A, z)2
where λ(A, z) is given by Eq. (2.160).
(2) Denote by α, β, β̄, δ the matrix elements of the Hermitian and positive
matrix A∗ A:
αβ
A∗ A = . (2.220)
β̄ δ
Then
2
dS 1 + |z|2
= . (2.221)
dS α|z|2 + β̄z + β z̄ + δ
Therefore dS /dS depends only on the matrix A∗ A and it is invariant
under the replacements of the type A → U A, where U is in SU (2).
Proof.
(1) Let z → f (z) be the linear fractional transformation of the complex
plane determined by A
az + b
.
f (z) = (2.222)
cz + d
Then the complex Jacobian JC of the transformation is
a(cz + d) − c(az + b) ad − bc D
JC = f (z) = 2
= 2
= . (2.223)
(cz + d) (cz + d) (cz + d)2
The complex Jacobian can be also considered as a real Jacobian JR ,
where we express the derivative with respect to the complex variable z
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 81/2
D2 (1 + |z|2 )2
= dS (2.226)
(|cz + d|2 + |az + b|2 )2
The result follows now by comparing with Eq. (2.160).
(2) The second statement follows by noticing that
ā c̄ ab |a|2 + |c|2 āb + c̄d
A∗ A = = . (2.227)
b̄ d¯ cd ab̄ + cd¯ |b|2 + |d|2
Therefore
α = |a|2 + |c|2 ,
β = āb + c̄d, (2.228)
¯
β̄ = ab̄ + cd,
δ = |b|2 + |d|2 ,
while
|az + b|2 + |cz + d|2 =
(2.229)
¯ + (āb + c̄d)z̄ + |b|2 + |d|2 .
(|a|2 + |c|2 )|z|2 + (ab̄ + cd)z
Corollary 2.1. Given A ∈ SL(2, C), and with the notation as in proposi-
tion 2.8 let
w(z) ≡ dS /dS. (2.230)
Then w(z) ≡ 1 if and only if A is unitary, i.e. if and only if A ∈ SU (2).
June 12, 2014 16:56 World Scientific Book - 9in x 6in QuantumFractals3 pg. 82/2
Proof. We have
D(1 + |z|2 )
w(z) = . (2.231)
α|z|2 + β̄z + β z̄ + δ
If A is unitary, then A∗ A = I, therefore α = δ = 1, β = 0. It follows that
w(z) ≡ 1. Conversely, assume that w(z) ≡ 1. In fact it is enough to assume
that w(z) = 1 at three points, namely z = 0, z = 1, z = −1. Therefore
w(z) = 1 is equivalent to
(1) If A is not unitary, then the function w(z) has maximum and minimum
at the points z1 , z2 which are fixed points of the matrix A∗ A. If det(A) =
1, then the extremal values w+ , w− of w(z) are equal to the eigenvalues
of A∗ A.
(2) Assuming det(A) = 1 and w1 ≤ w ≤ w2 , the loci of points satisfying
the equation
w(z) = w, (2.235)
√
α − δ + τ2 − 4
z− = . (2.246)
2β̄
The reason for such correspondence will become clear from the second part
of the proof.
2) The equation w(z) = w can be written as
wβ̄ wβ D − wδ
|z|2 − z− z̄ + = 0. (2.247)
D − wα D − wα D − wα
This is the same as the equation of a circle of radius R and center z0 :
|z − z0 |2 = R2 , (2.248)
or
z 2 − z¯0 z − z0 z̄ + |z0 |2 − R2 = 0, (2.249)
if we identify:
wβ
z0 = . (2.250)
D − wα
D − wδ
R2 = |z0 |2 − . (2.251)
D − wα
Putting now w = w+ and w = w− in Eq. (2.250) we get, after some
calculation and taking into account that D = 1, δ = τ − α, the formulas
Eq. (2.246). Let us first analyze the case when R = 0. These should be
the extremal points of w(z). And indeed, we get exactly the Eq. (2.250).
Otherwise, assuming D = 1, we get the formula for the radius:
1 − wδ
R(w) = |z0 |2 −
1 − wα
w(α + δ) − w2 − 1
= . (2.252)
|1 − wα|
Notice that the expression under the square root is always nonnegative.
This follows from the fact that R(w) vanishes only at the extremal points
and it is positive at w = τ /2.
3
3.6
2
1
4.7
5.3
0 5.8 0.2
4.1
-1
-2 0.7
-3
-4 3.0
-5 2.4
-5 -4 -3 -2 -1 0 1 2 3 4 5
We will show now that the vector n has the physical meaning of the direc-
tion from which the transformed reference frame is running away, while k
is a simple function of the velocity v of the boost described by X.
Proposition 2.12. Let X = ac db , a, d > 0, c = b̄ be a non-trivial (i.e.
X = I) positive matrix from SL(2, C), and let us write X 2 as
αβ
X2 = . (2.266)
β̄ δ
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 89/2
Let
s = Tr (X 2 ) = α + δ. (2.267)
x = Lμν xν , (μ = 0..3).
μ
(2.270)
x = L00 x0
0
(2.271)
x = Li0 x0 , (i = 1, 2, 3)
i
(2.272)
x
i
Li0
vi = = , (2.273)
x 0 L00
and its square is
(L10 )2 + L20 )2 + L13 )2
v2 = . (2.274)
(L00 )2
Now, owing to the equation Lt ηL = η we have
Therefore
(L00 )2 − 1
v2 = . (2.276)
(L00 )2
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 90/2
Therefore
2(β)
v1 = (2.283)
s
and
v1 2(β)
n1 = =√ . (2.284)
v s2 − 4
Similarly11 : v 2 = L20 /L00 , and
the second component of the velocity vector, or the square of its norm. The intended
meaning should, however, always be clear from the context.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 91/2
iϕ
with a = e 2 , b = 0. From Eq. (2.91) we get the corresponding Lorentz
transformation:
x = x1 cos ϕ − x2 sin ϕ,
1
(2.296)
2 1 2
x = x sin ϕ + x cos ϕ, (2.297)
3 3
x =x , (2.298)
x = x0 .
0
(2.299)
This is an anticlockwise rotation around the axis n = (0, 0, 1) by the angle
ϕ.
This is a relativistic boost in the negative direction of the third axis, that is
in the direction of the vector (0, 0, −1). The corresponding transformation
of the sphere (cf. Eq. (2.61)) reads now
√
1 1 − v2 1
n = n , (2.303)
1 + vn3
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 93/2
√
2 1 − v2 2
n = n , (2.304)
1 + vn3
n3 + v
n =
3
. (2.305)
1 + vn3
Now, the cosine of the angle θ between the vector n and the boost direction
(0, 0, −1) is −n3 , while the cosine of the angle θ between the transformed
3
vector and the boost direction is −n = √n1+vn
3 +v
3
. Therefore we obtain the
well known formula for the relativistic aberration:
cos θ − v
cos(θ ) = . (2.306)
1 − v cos θ
As an example, the result of the aberration corresponding to the boost
velocity v = 0.992 are shown in Fig. 2.33. The denominator in Eq. (2.306)
is responsible for the relativistic correction of the pre-relativistic, Galilei-
Newton, aberration formula based on simple adding of velocities. As the
result all incoming rays directions of the stars (except the one exactly at the
south pole) move towards the boost direction. In their book “Relativistic
Celestial Mechanics of the Solar System” S. Kopeikin and M. Efroimsky
put it this way [Kopeikin and Efroimsky, 2012, p. 150]:
“One astronomical consequence of this is that if all stars in
the sky were distributed uniformly over the celestial sphere, the
observer moving with ultra-relativistic speed would see the stars
displaced toward the point on the sky in the direction of its motion.
In the limit of V → c, the entire stellar sky of the observer would
shrink to a single bright point embracing all stars in the sky. It is
really impossible to use stars for navigating the spaceship moving
with such an ultra-relativistic speed!
Fig. 2.33 Relativistic aberration. Boost with velocity v = 0.992 towards the north pole.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 94/2
Proposition 2.14. Each matrix A(z) has the following explicit polar de-
composition A(z) = U (z)T (z), with U, T ∈ SL(2, C), where U is unitary
and T is positive:
1 2 z
U (z) = , (2.311)
4 + |z|2 −z̄ 2
1 2 z
T (z) = . (2.312)
4+ |z|2 z̄ 2 + |z|2
1 2 + |z|2 −z
T (z)−1 = . (2.316)
4 + |z|2 −z̄ 2
We can now easily compute U (z) = A(z)T (z)−1 with the following result:
1 2 z
U (z) = . (2.317)
4 + |z|2 −z̄ 2
Now U (z) ∈ SU (2), T (z) ∈ SL(2, C) is positive, and A(z) = U (z)T (z).
⎜ 2xy ⎟
⎜ 4+x2 +3y 2 y|z|2
− 4+|z|2 y ⎟
⎜ 4+|z|2 4+|z|2 ⎟
⎜ ⎟ (2.323)
⎜ x|z|2 y|z|2 8+x4 +2y 2 +y 4 +2x2 (1+y 2 ) |z|2 ⎟
⎜ − 4+|z|2 − 4+|z|2 − ⎟
⎝ ⎠
4+|z| 2 2
|z|2
1 + |z|2
2
x y − 2
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 96/2
By using Eq. (2.61) we find that it transforms the north pole unit vector
2 (4x, 4y, 4 − |z| ). The cosine of the angle α between the
1 2
(0, 0, 1) into 4+|z|
north pole and the transformed direction is then given by:
4 − |z|2
cos α = , (2.324)
4 + |z|2
We can now find the angle of rotation of the unitary transformation follow-
ing the boost. We use for this purpose Eq. (2.289):
2
ϕ(z) = 2 arccos . (2.325)
4 + |z|2
Using the formula cos ϕ = 2 cos2 ϕ2 − 1 we obtain
4 − |z|2
cos ϕ(z) = . (2.326)
4 + |z|2
The axis nr of rotation is computed using Eq. (2.292).
It is seen that nr is a unit vector whose components are proportional
to (sin(ψ), − cos(ψ), 0), therefore:
n1r = sin(ψ), (2.327)
n2r = − cos(ψ), (2.328)
n3r = 0. (2.329)
3
We notice that the rotation axis nr is in the equatorial plane x = 0 and
that it is perpendicular to the boost direction nb . The boost T (z) moves
the north pole by the angle ϕ, the rotation U (z) moves it back through
rotating by the same angle with respect to the axis that is orthogonal to
both: the north pole and its image under T (z). That is why the north pole
is invariant under the composition A(z) = U (z)T (z).
As an example Fig. 2.34 shows the deformation of the spherical coor-
dinate system by the boost alone, and by the complete transformation for
the case of A(1).
Fig. 2.34 On the left: boost T (1) extracted from the parabolic matrix A(1). The black
dot indicates boost’s direction. On the right: The unitary rotation U (1) with respect to
the y-axis returns the north pole to its original position.
(3, 4, 5), and then applying successively one of the following three SL(2, R)
matrices — see Fig. 2.35.
⎛ ⎞ ⎛ ⎞ ⎛ ⎞
1 −2 2 1 2 2 −1 2 2
A1 = ⎝2 −1 2⎠ , A2 = ⎝2 1 2⎠ , A3 = ⎝−2 1 2⎠ . (2.332)
2 −2 3 2 2 3 −2 2 3
Fig. 2.35 Pythagorean genealogical tree based on three matrices A1 , A2 , A3 and the
starting triple (3, 4, 5).
It follows that the remainder from the division of the square of any odd
number by 8 is always 1. Therefore also the remainder from the division of
the square of any odd number by 4 is also 1.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 100/2
What can be said about the remainder from the division by 4 of any
even number? If n = 2p, then n2 = 4p2 , therefore the remainder from the
division by 4 of any even number is always 0.
Let us return to the proof of the proposition. First of all we exclude the
possibility of all three numbers x, y, z being even. Indeed, if x, y, z are even,
then x2 , y 2 , z 2 are even, therefore t2 is also even, thus t must be even as well.
It would follow then x, y, z, t are all divisible by 2 — a contradiction with
the assumption that the Pythagorean quadruple (x, y, z, t) is primitive.
Next we exclude the possibility that (x, y, z) are all odd. Since, if we
assume it being the case, then
x2 = 8p + 1,
y 2 = 8q + 1,
z 2 = 8r + 1,
therefore
x2 + y 2 + z 2 = 8(p + q + r) + 3 = t2 . (2.336)
x2 = 4k + 1,
y 2 = 4p + 1,
z 2 = 4q,
therefore
t2 = 4(k + p + q) + 2,
Remark 2.14. The set {h(i) : i = 1, ..., 6} contains, with each matrix h(i),
its inverse matrix h(j), where we have ordered our six matrices in such a
way that h(j) = h(i)−1 for i + j = 7.
For a, b, c we allow all integers here, including negative and two zeroes.
Therefore the standard Pythagorean quadruples and also triples (when one
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 102/2
of the four numbers is zero) belong to this set. We introduce the following
generating set of primitive degenerate quadruples:
q1 = (1, 0, 0, 1)
q2 = (0, 1, 0, 1)
q3 = (0, 0, 1, 1)
Theorem 2.3. The set of 6 matrices h generates, from the generating set
(q1 , q2 , q3 ), all primitive generalized Pythagorean quadruples.
Proof. We first show that acting with the matrices h(i), (i = 1, ..., 6) on
a primitive GPQ produces again a primitive GPQ. Owing to the symmetry
it is enough to consider h(1). Other cases will differ only by permutation
and sign changes that bear no influence on the final result.
We have
h(1) : (a, b, c, d) → (−a − 2b + 2d, 2a + b − 2d, c, −2a − 2b + 3d). (2.339)
Suppose the resulting GPQ has a common divisor k, that is: −a− 2b + 2d =
km, 2a + b − 2d = kn, c = kp, −2a − 2b + 3d = kq, all integers. These
four equations for a, b, c, d solve to a = −k(m − 2n − 2q), b = k(−2m +
n + 2q), c = kp, d = k(−2m + 2n + 3q). Thus k would be then a common
divisor for a, b, c, d. Therefore the matrices h generate only primitive GPQs.
We will prove now that the matrices h, starting with the three generating
quadruples, generate all primitive GPQs.
We consider first the case of d = 1. Let (a, b, c, d) be a primitive GPQ.
If d = 1, then, since a2 + b2 + c2 = 1, and a, b, c are integers, two of a, b, c
must be zero, the third one must be ±1. We have
h(5)q1 = (−1, 0, 0, 1), (2.340)
h(1)q2 = (0, −1, 0, 1), (2.341)
h(3)q3 = (0, 0, −1, 1). (2.342)
It follows that among all six GPQs with d = 1 three are the generators and
the other three are obtained from them using h(5), h(1), h(3). Therefore it
will be enough to prove that starting with any GPQ with d > 1, we can
always reach one of the three elements of the generating set q1 , q2 , q3 . If this
is the case, we can take the complementary inverse elements (cf. Remark
2.14) to reverse the path.
To prove that it will be enough to show that, unless two numbers are
zero and the third is greater or equal to 1 (what implies d = 1), we can
always find a transformation in our set that strictly decreases the value
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 103/2
we have
⎛ ⎞ ⎛ ⎞ ⎛ ⎞
1 1 −1
⎜0⎟ ⎜0⎟ ⎜ 2 ⎟
h(2)h(3) ⎜ ⎟ ⎜ ⎟ ⎜ ⎟
⎝0⎠ = h(3)h(2) ⎝0⎠ = ⎝ 2 ⎠ . (2.350)
1 1 3
Also the results of the IFS based on the six generators h(i) are not visually
pleasing — see Fig. 2.36.
i) n, p ≥ 1, m, q ≥ 0, m + q ≥ 1,
ii) mn > mq, m2 + n2 > p2 + q 2 ,
iii) m + n + p + q ≡ 1 (mod 2),
iv) gcd(m2 + n2 , p2 + t2 , nq + mp) = 1,
v) If q = 0 then n ≤ m, if m = 0 then p ≤ q.
With the conditions above satisfied, the representation of (x, y, z, t) in terms
of (m, n, p, q) is unique.
x = 2(mp + nq),
y = 2(np − mq),
z = m2 + n2 − p2 − q 2 ,
t = m2 + n2 + p2 + q 2 ,
1+i m + in
v+ = . (2.355)
2 p + iq
Then we obtain:
x = = m2 + n2 − p2 − q 2 ,
y = 2(mp + nq),
z = 2np − 2mq,
t = m2 + n 2 + p2 + q 2 .
Similarly, for
1−i m + in
v− = . (2.356)
2 p + iq
x = = m2 + n2 − p2 − q 2 ,
y = 2(mp + nq),
z = 2np − 2mq,
t = m2 + n 2 + p2 + q 2 .
(1) m2 + p2 > n2 ,
(2) gcd(m, n, p) = 1,
(3) If n is odd, then m + p is even.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 107/2
Figure 2.37 and Fig. 2.38 show primitive Pythagorean quadruples obtained
via the above prescription for m, n, p < 30, symmetrized with respect to
the odd element of a, b, c.
Chapter 3
Examples
Two transformations, when the balancing condition is imposed, imply that these trans-
formations commute — therefore we would get just two points as the attractor. Although
three transformations would be enough, we choose four because the unit square has in-
teger coordinates.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 111/3
Examples 111
The matrices M (i) are in the connected component of the identity of the
group O(2, 1), and they preserve the light cone x2 + z 2 − t2 = 0, as well as
the sign of the t-coordinate. Therefore they define the projective action on
the unit circle — the intersection of the light cone with the plane t = 1 —
with the following fractional linear transformation:
M (i)11 x + M (i)12 z + M (i)13 M (i)21 x + M (i)22 z + M (i)23
fi (x, z) = , .
M (i)31 x + M (i)32 z + M (i)33 M (i)31 x + M (i)32 z + M (i)33
(3.7)
2 2
If x + z = 1, then the point fi (x, z) has also this property. Thus fi maps
the unit circle into itself. This way we obtain an iterated function system
on the unit circle.
These four points are the vertices of the regular square inscribed into the
unit circle. In order to find the contracting and expanding regions for each
of our transformations, let us parametrize the circle by the angle:
x = cos φ, z = sin φ, (3.8)
and write the four transformations explicitly in terms of the angle φ. Using
the defining formulas we easily obtain the following transformations (by an
abuse of notation we use the same symbols fi for our four maps expressed
in terms of the angle φ):
f1 (φ) = atan2 k 2 cos(φ) + 2k + cos(φ), 1 − k 2 sin(φ) , (3.9)
f2 (φ) = atan2 1 − k cos(φ), k sin(φ) + 2k + sin(φ) ,
2 2
(3.10)
2
f3 (φ) = atan2 k + 1 cos(φ) − 2k, 1 − k sin(φ) ,
2
(3.11)
2
f4 (φ) = atan2 1 − k cos(φ), k + 1 sin(φ) − 2k .
2
(3.12)
Remark 3.1. One may notice that the arguments of the function atan2
above are not normalized — they are not on the unit circle. That is because
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 112/3
0
-π -π/2 0 π/2 π
φ
Fig. 3.1 Jacobians of the four transformations fi , for k = 0.7. Contracting regions are
those where the value of the Jacobian is smaller than 1.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 113/3
Examples 113
10
8
6
4
2
0
-π -π/2 0 π/2 π
φ
Fig. 3.2 Jacobians of the transformation f3 , for k = 0.5, 0.7, 0.9. Contracting regions
are those where the value of the Jacobian is smaller than 1.
3.1.1.3 Images
The images below were generated each using 100,000,000 points, skipping
the first 100,000. The points on the circle were collected into 1200 beans
in the φ interval (0, 2π). We have run the simulations for three different
values of the parameter k: k = 0.9, 0.7, 0.5. While for k = 0.9 the generated
image (Fig. 3.3) resembles similar images of the Cantor set, the picture in
Fig. 3.5, representing the invariant measure for k = 0.5, does not appear
to be representing a fractal set at all. The invariant measure seems to be
continuous with respect to the Lebesgue measure on the circle. Apparently
Examples 115
there are no regions on the circle that are not being visited. The case of
k = 0.7 (Fig. 3.4) is in the middle between the two other cases. Question:
Do we know if we are getting a fractal set for k = 0.7? Are we sure that
we are getting fractal set for k = 0.9? Or, perhaps, there is some special
value of k — the onset of fractality?
Examples 117
Remark 3.4. There may be other choices of the basis, for instance using
continuous functions, that are better adapted to our particular problem,
and giving a better finite-dimensional approximation.
! CASE 1
IF ( (A < B) .AND. (A1 < B1) ) THEN
TM = MM0(A,A1,B,B1)
! CASE 2
ELSE IF ( ( A > B ) .AND. ( A1 < B1 ) ) THEN
TM = MM1(A,A1,B,B1) !Done
!CASE 3
ELSE IF ( ( A < B ) .AND. ( A1 >= B1) ) THEN
TM = MM2(A,A1,B,B1) !Done
!CASE 4
ELSE IF ( (A1 < Pi) ) THEN
IF ( B1 > 0 ) THEN
TM = TWOPI - A + MIN( B,B1 )
ELSE
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 119/3
Examples 119
TM = MIN (B,A1) - B1
END IF
ELSE
TM = TWOPI - MAX( A, A1 ) + MIN( B,B1 )
END IF
MM = TM/DELTA
END FUNCTION MM
Examples 121
Fig. 3.6 Eigenvalues of the Frobenius-Perron matrix for k = 0.5. Lower graphics con-
cerns the case of uniform probabilities.
Fig. 3.7 Eigenvalues of the Frobenius-Perron matrix for k = 0.7. Lower graphics con-
cerns the case of uniform probabilities.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 122/3
Fig. 3.8 Eigenvalues of the Frobenius-Perron matrix for k = 0.9. Lower graphics con-
cerns the case of uniform probabilities.
Examples 123
Below is the list of vertices of the five Platonic solids. We have cho-
sen the directions in such a way that in each case the north pole, with
coordinates (0, 0, 1), of the sphere is occupied by one of the vertices.
Examples 125
where the array of real numbers a[i], i = 1, . . . , 17, is given in the following
table.
√ √ √
3− 5 5− 5 1 5−1
√
a[1] = 6 a[2] = 10 a[3] = 3 a[4] = 2 3
√ √
a[5] = √1 a[6] = 2
a[7] = 5− 5
a[8] = √1
5 3 10 3
√ √
2 5+ 5 5 2
a[9] = 3
a[10] = 10
a[11] = 3
a[12] = 3
√ √ √
5+ 5 3+ 5 √2 3+ 5
a[13] = 10 a[14] = 6 a[15] = 5
a[16] = 6
√
2 2
a[17] = 3
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 126/3
For each of the five solids the center of mass is at the origin:
N
n[i] = 0. (3.29)
i=1
Therefore, for each of the solids, and a real parameter 0 < k < 1, we can
construct a hyperbolic QIFS using the formula Eq. (2.262) on p. 88. For a
given unit length vector n it is convenient to introduce vector k of length
k:
k = k n. (3.30)
Then
1
Ak = √ (I + k · s), (i = 1, ..., N ), 0 < k < 1. (3.31)
1 − k2
Notice that
k12 + k22 + k32 = k 2 . (3.32)
The parameter k tells us how close the given matrix is to a projection.
For k = 0 we have the identity transformation, for k close to 1 we have a
transformation that approximates the orthogonal projection on the one di-
mensional subspace spanned
by the vector k. Matrices Ak of this form have
real trace equal to 2/ (1 − k 2 ). This number is always contained outside of
the interval [0, 2]. Therefore they define hyperbolic Möbius transformations.
By using Eq. (2.91), we can calculate the Lorentz matrix corresponding
to Ak . The result is given by:
⎛ ⎞
(1 − k 2 ) + 2k12 2k1 k2 2k1 k3 2k1
1 ⎜ ⎜ 2k1 k2 (1 − k 2 ) + 2k22 2k2 k3 2k2 ⎟
⎟
Lk = ⎝
1−k 2 2k1 k3 2k2 k3 (1 − k ) + 2k
2 2
3 2k3 ⎠
2k1 2k2 2k31 + k2
(3.33)
The corresponding transformation wk of the sphere is now simply calculated
(1 − k 2 )x + 2(1 + k · x) k
x = wk (x) = . (3.34)
1 + k2 + 2 k · x
The inverse transformation is obtained from the above one by replacing k
with −k:
(1 − k2 )x − 2(1 − k · x) k
wk −1 (x) = . (3.35)
1 + k2 − 2 k · x
Remark 3.5. In numerical calculations it is better to express Eq. (3.34)
in a different, though equivalent form:
(1 − k 2 )x + 2(1 + k · x) k
x = wk (x) = . (3.36)
||(1 − k 2 )x + 2(1 + k · x) k||
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 127/3
Examples 127
The point is that the denominator of Eq. (3.34) contains the term
2 k · x, which can be negative. Numerically it is more stable to replace
the denominator by the norm of the numerators, especially when the for-
mula is being iterated many times. This way we are making sure that we
are not departing from the unit sphere.
Using Eq. (2.268), we find the velocity of the boost described by the trans-
formation Eq. (3.34):
2k
v(k) = . (3.37)
1 + k2
The increase of v(k) with k becomes very slow as k → 1:
Fig. 3.12 Dependence of the boost velocity v(k) on k for positive SL(2, C) matrices of
the form Ak = √ 1 2 (I + k · s).
1−k
For the measure μ in this formula we choose the natural rotation invariant
measure on the sphere, while for the transformations wi we choose the trans-
formations implemented by the SL(2, C) matrices of the form Eq. (3.31).
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 128/3
Examples 129
. N
d (wi (x), wi (y))
M ax(w, p) = sup pi (x) < 1. (3.49)
x=y i=1 d(x, y)
1−2
In our case wi (x) and pi (x) are analytic, with pi (r) ≥ N (1+2 )
.
June 12, 2014 16:56 World Scientific Book - 9in x 6in QuantumFractals3 pg. 130/3
-0.5
-1.0
-1.5
g(k)
-2.0 Tetrahedron
Octahedron
-2.5
Cube
-3.0 Icosahedron
-3.5 Dodecahedron
Tetrahedron SQIFS
-4.0
0.0 0.2 0.4 0.6 0.8 1.0
k
Fig. 3.13 Numerical estimates of the log-average function g(k) for all five Platonic
quantum fractals. Uniform probabilities are used, except for the Tetrahedron, where
the results for both uniform and place dependent probabilities according to the SQIFS
formula are plotted.
time ago from some site on the internet. The file has no title and no author, Google
search by keywords returns nothing. Nevertheless the input from the anonymous author
is acknowledged! The interpretation for probabilities is my own addition.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 131/3
Examples 131
p(x)k
x x+k
x · x = 1, x · (x + k) = x · (x + k). (3.50)
function p(x) given by Eq. (3.41)? The values of probabilities in the iter-
ated function system depend on the other transformations; so here, when
we are discussing only one transformation, we can only talk about the de-
pendence of the probability p(x) on x — up to a scale. We will show that
the function p(x) of Eq. (3.41) with c = 1, which is the inverse square root
of the Jacobian, also has a simple geometric interpretation.
First consider the vector Lk (x) defined by
3
Lk (x)i = (Lk )i j xj + (Lk )i 0
i=1
i
= (1 − k 2 )x + 2(1 + k · x) k . (3.52)
1 + k2 + 2 k · x
λ= . (3.55)
1 − k2
It is exactly our probability function. The geometric interpretation follows
at once: from
λx = x + k + λk (3.56)
we deduce that λ is the unique factor for which the sum of x + k and λk is
on the same line as the vector x . This geometric interpretations is depicted
in Fig. 3.14.
We will now give explicit formulas for the vertices and probabilities of
QIFS based on the five Platonic solids, as well as images resulting from the
Chaos Game for different values of the parameter k.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 133/3
Examples 133
Vertices
⎛ ⎞
√
0 0 1.
⎜ 2 2
⎜ 3 0 − 13 ⎟
⎟
⎜ √ ⎟
⎜ ⎟ (3.57)
⎜ − 32 2
− 13 ⎟
⎝ √ 3 ⎠
− 32 − 2
3 −3 1
Probabilities
prob(1) = 1/4 + 0.5 k z/(1 + k 2 )
prob(2) = 1/4 + k (0.471405 x − 0.166667 z)/(1 + k 2 )
prob(3) = 1/4 + k (−0.235702 x + 0.408248 y − 0.166667 z)/(1 + k 2 )
prob(4) = 1/4 + k (−0.235702 x − 0.408248 y − 0.166667 z/(1 + k 2 )
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 134/3
Fig. 3.15 Quantum tetrahedron for k = 0.2, 109 iterations. With this value of k we see
mainly chaos.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 135/3
Examples 135
Fig. 3.16 Quantum tetrahedron for k = 0.3, 109 iterations. Somewhat unexpected
pattern appears on the sphere.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 136/3
Fig. 3.17 Quantum tetrahedron for k = 0.4, 109 iterations. The pattern gets more
intricate.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 137/3
Examples 137
Fig. 3.18 Quantum tetrahedron for k = 0.4, 109 iterations. The southern hemisphere.
where the three other vertices are located.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 138/3
Fig. 3.19 Quantum tetrahedron for k = 0.5, 109 iterations. The pattern becomes more
intricate.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 139/3
Examples 139
Fig. 3.20 Quantum tetrahedron for k = 0.6, 109 iterations. Vertices becomes more and
more attractive.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 140/3
Fig. 3.21 Quantum tetrahedron for k = 0.7, 109 iterations. Vertices become more and
more attractive.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 141/3
Examples 141
Fig. 3.22 Quantum tetrahedron for k = 0.8, 109 iterations. Vertices are strongly at-
tractive.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 142/3
Examples 143
Fig. 3.23 Quantum octahedron for k = 0.3, 109 iterations. Mainly chaos.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 144/3
Fig. 3.24 Quantum octahedron for k = 0.4, 109 iterations. First circles become visible.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 145/3
Examples 145
Fig. 3.25 Quantum octahedron for k = 0.5, 109 iterations. More circles.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 146/3
Fig. 3.26 Quantum octahedron for k = 0.6, 109 iterations. Black (small probability of
hits) circularly shaped regions appear.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 147/3
Examples 147
Fig. 3.27 Quantum octahedron for k = 0.7, 109 iterations. Black circular regions grow.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 148/3
Fig. 3.28 Quantum octahedron for k = 0.8, 109 iterations. Almost all hits are concen-
trated near the vertices.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 149/3
Examples 149
Fig. 3.29 Quantum cube for k = 0.5, 109 iterations. First features appear.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 151/3
Examples 151
Fig. 3.30 Quantum cube for k = 0.6, 109 iterations. Circular regions appear.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 152/3
Fig. 3.31 Quantum cube for k = 0.7, 109 iterations. Pattern becomes more intricate.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 153/3
Examples 153
Fig. 3.32 Quantum cube for k = 0.8, 109 iterations. Big circular, overlapping empty
regions.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 154/3
Examples 155
Fig. 3.33 Quantum icosahedron for k = 0.6, 109 iterations. Five fold symmetry becomes
identifiable.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 156/3
Fig. 3.34 Quantum icosahedron for k = 0.7, 109 iterations. Patterns become more
apparent.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 157/3
Examples 157
Fig. 3.35 Quantum icosahedron for k = 0.8, 109 iterations. Circular regions appear.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 158/3
Fig. 3.36 Quantum icosahedron for k = 0.85, 109 iterations. Five-fold snowflake pat-
terns predominate.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 159/3
Examples 159
Probabilities
Examples 161
Fig. 3.37 Quantum dodecahedron for k = 0.65, 109 iterations. Place independent
probabilities.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 162/3
Fig. 3.38 Quantum dodecahedron for k = 0.65, 109 iterations. Place dependent prob-
abilities. More details can be distinguished.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 163/3
Examples 163
Examples 165
Examples 167
r
r → . (3.63)
||r ||
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 168/3
3 At the time of this writing FD3 package is available for dos, unix and mac platforms
from ftp://ftp.cs.csustan.edu/pub/fd3/.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 169/3
Examples 169
k
Fig. 3.43 Fractal dimensions for Quantum Octahedron estimated by FD3 package. De-
pendence of the dimensions on the “fuzziness” parameter α.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 171/3
Examples 171
Möbius transformations that are at the basis of quantum fractals can be also
defined in higher dimensions. Therefore quantum fractals exist in higher di-
mensions as well. In principle it would be possible to provide several simple
formulas — and we can start computer simulations of higher dimensional
quantum fractals. Some of these formulas have exactly the same form as
in the case of the two-sphere. Some others, however, as we will see, are not
so evident.
Generalizing certain concepts is usually not unique. Often it happens
that one can generalize a given result this way or another way. Different
generalizations may lead to different theories, each one with its own math-
ematical apparatus. For instance Euclidean geometry can be generalized
to an affine geometry (based on affine connection), Riemannian geometry
(based on metric tensor), Finsler geometry (based on Finslerian distance),
symmetric space geometry (based on group action) etc. These different
generalizations may partly overlap, but each one has its own path and
direction.
For quantum fractals two paths seems to be natural. Path one is to
follow the standard mathematical formalism of complex Hilbert spaces.
Quantum fractals generalized along this path would live on complex pro-
jective spaces. But then we lose sight of the growing number of applications
of quantum mechanical ideas beyond physics (cf. [Khrennikov (2008)], and
the corresponding discussion in Sec. 4.1). In physics, for some reasons that
are not completely clear, we are always using complex spaces.4 But in more
general, axiomatized approaches to quantum theory that start with, for
instance, quantum logic, other models are possible, in particular models in
real Hilbert spaces, without complex structure (cf. e.g. [Blank et al., 2008,
Notes to Chapter 13], and references therein).
4 David Hestenes, for instance, cf. [Hestenes (1985)], attributes the appearance of the
imaginary unit i in quantum theory to space-time signature (3, 1) and its Clifford algebra
structure.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 172/3
k = 0.81, Db = 0.78732
20
18
16
14
12
log2 (N ())
10
2
y = 0.82x + 0.53
0
0 5 10 15 20 25 30
log2 (1/)
Fig. 3.44 Estimation of the capacity dimension for k = 0.81. Demonstrates the differ-
ence between the standard least square fit based on a “visual” selection of the linear part
of the log2 of counts versus log2 of the cell sizes, and the one given by FD3 method of
averaging.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 173/3
Examples 173
While every complex Hilbert space carries in a natural way the structure
of a real space, the converse is not true. For quantum jumps and for
quantum fractals complex structure is not needed. It is needed for the
continuous part of the Schrödinger evolution in quantum physics, but not
for the discontinuous transitions. For that reason in our generalization of
quantum fractals we will follow the path pointed out by the formalism of
Clifford algebras — as it seems to be most natural mathematically (even
though it needs a more advanced algebraic apparatus), while also offering
a new insight into possible new applications of the quantum mechanical
formalism.
We will explain now how the mathematical formalism of Clifford alge-
bras enters the scene here.
First of all the simplest generalization of the two-sphere is the n-sphere
S — the one-point compactification of Rn . Like in the case of the two-
n
Definition 3.1. The Clifford algebra C(V, Q) is the free associative algebra
with unit 1, generated by V and such that
v 2 = Q(v)1 for all v ∈ V. (3.70)
The Clifford algebra for R r,s
is often denoted as Cr,s , (sometimes C(r, s)).
Notice that, according to the definition, the vector space V itself becomes
a part of the algebra: V ⊂ C(V, Q). It follows then from the polarization
identity Eq. (3.67) that, within the algebra,
1
(v, w) = (v + w)2 − (v − w)2
4
1 2
= (v + w2 + vw + wv) − (v2 + w2 − vw − wv)
4
1
= (vw + wvw). (3.71)
2
Therefore in C(V, Q) we have
vw + wv = 2(v, w). (3.72)
In particular orthogonal vectors anticommute within the algebra.
Let C = C(V, Q) be the Clifford algebra of (V, Q). The even and the odd
parts of C are denoted as C + and C − respectively. We shall consider R and
V as vector subspaces of C, so that v2 = Q(v) ∈ C, v ∈ V ⊂ C.
The definition of the Clifford algebra contains the word ‘free’. Freeness
means in this case that there are no other relations within the algebra except
of those implied by the defining relations Eq. (3.70). To give an example:
consider the real line R with the standard quadratic form Q(x) = x2 , x ∈ R.
The Clifford algebra C(R) should have in this case one generator, denoted
by x, with the property x2 = 1. In the free algebra this generator should be
different from 1. Yet, if we set x = 1, then the relations Eq. (3.70) are also
satisfied. The free algebra C(V, Q) can be characterized by its “universality
property” as follows:
Theorem 3.2. Let A be a real, associative, algebra with unit 1A , and let
φ : V → A be a linear mapping with the property φ(v)2 = Q(v)1A for all
v ∈ V. Then there exists a unique algebra homomorphism Φ : C(V, Q) → A
that extends φ, that is such that Φ(v) = φ(v) for v ∈ V.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 175/3
Examples 175
Remark 3.6. Some authors adopt a different sign convention. They write
the defining equation as v2 = −Q(v)1. Therefore one has to be careful
comparing different texts. The translation between the two conventions is
easy: Cr,s in one convention corresponds to Cs,r in the other one.
It follows from this universal property that the Clifford algebra C(V, Q) is
essentially unique, i.e. unique up to an isomorphism.
Theorem 3.3. As a (real) vector space the Clifford algebra Cr,s has the
dimension 2r+s . If ei , i = 1, ..., n = r + s, is an orthonormal basis in V,
with e2i = ±1, then 2n elements ei11 ei22 ...einn , ij = 0 or 1, form a basis for
the Clifford algebra C(V, Q).
1 0 01
e1 = e2 = . (3.73)
0 −1 10
01 0 −i 1 0
s1 = , s2 = , s3 = . (3.76)
10 i 0 0 −1
Then the eight matrices 1, i, s1 , s2 , s3 , is1 , is2 , is3 span the whole alge-
bra. As generators we can choose s1 , s2 , s3 which leads to the algebra
C3,0 . On the other hand we can choose is1 , is2 , is3 , which leads to the
algebra C1,2 . One could think that we can also choose s1 , s2 , is3 , but
this is not a good choice as s1 s2 = is3 , so s1 , s2 , is3 are not algebraically
independent.
Table 3.2 gives the table of low-dimensional Clifford algebras Cr,s . R[n],
C[n], H[n] denote the (real) algebras of n × n matrices with entries that
are real numbers, complex numbers, and quaternions respectively. R2 [n]
denotes the algebra of real 2n × 2n block matrices with two n × n matrices
on the diagonal, zeros otherwise. Thus, for instance, R2 [1] denotes the
algebra of 2 × 2 matrices of the form ( a0 0b ) , where a, b ∈ R. Similarly for
C2 [n] and H2 [n].
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 177/3
Examples 177
3.3.1.4 Examples
(1) Consider the algebra R[2] as C2,0 with generators e1 , e2 as in Eq. (3.73).
Denote by C the matrix e1 e2 as in Eq. (3.74). Then C 2 = −1, C −1 =
−C, and Ce1 C −1 = −e1 , Ce2 C −1 = −e2 . Therefore the map A →
CAC −1 is an automorphism of C2,0 = R[2] that maps v ∈ V into −v.
Thus, in C2,0 realized as R[2], we have that π(A) = CAC −1 .
On the other hand the matrix transpose operation A → AT is an
automorphism of R[2]. Moreover, the matrices e1 , e2 are symmetric,
therefore eT1 = e1 , eT2 = e2 . It follows that τ (A) = AT , and ν(A) =
CAT C −1 .
(2) Now let us consider R[2] as C1,1 with generators e1 , e2 as in Eq. (3.75).
Let B = e1 , C = e1 e2 . Then π(A) = CAC −1 , τ (A) = BAT B −1 , ν(A) =
e2 AT e−12 .
(3) Consider the algebra C[2] as a realization of C3,0 with generators
e1 = s1 , e2 = s2 , e3 = s3 as in Eq. (3.76). The matrices e1 , e2 , e3 are
Hermitian, and the Hermitian conjugation is an anti-automorphism in
C[2]. Therefore in C3,0 realized as C[2] we have τ (A) = A∗ . Now, let
C = s2 . Then C 2 = 1, C̄ = −C, C T = −C. It follows that A → C ĀC −1
is an automorphism of C[2] that acts as multiplication by −1 on all
three generators. It follows that π(A) = C ĀC −1 . For the conjugation
in this Clifford algebra we then get ν(A) = CAT C −1 .
(4) On the other hand consider C[2] as C1,2 with generators e1 = s1 , e2 =
is2 , e3 = is3 . This time π(A) = C ĀC −1 , with C = e3 , τ (A) = e1 A∗ e−1
1 ,
T
ν(A) = s2 A s2 .
Δ(a) = aν a. (3.77)
Examples 179
Theorem 3.6.
2.4.2], and as Spin0 in [Gilbert and Murray (1991)]. The case of (r, s) = (1, 1) is special,
as in this case the group Spin+ has two disconnected components — cf. [Deheuvels,
1981, p. 369]
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 180/3
3.3.1.8 Paravectors
3.3.1.9 Example
In the case of C3,0 realized as C[2] the subspace of paravectors consists of
all Hermitian matrices. Every Hermitian matrix can be decomposed into a
sum of (real) multiples of the identity matrix, and the traceless part. Thus
we can write:
x0 + x3 x1 − ix2
A = x0 · 1 + x1 s1 + x2 s2 + x3 s3 = (3.81)
x1 + ix2 x0 − x3 .
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 181/3
Examples 181
(i) Φ(1) = 1,
(ii) Φ(aτ ) = Φ(a), ∀a ∈ C,
(iii) Φ(ab) = Φ(ba), ∀a, b ∈ C,
df
(iv) (a, b) = Φ(aτ b) is a nondegenerate, symmetric, bilinear form on
C, that is positive definite if the original quadratic form on V
is positive definite. We have Φ(a) = (1, a) = (a, 1), ∀a ∈ C.
(v) (ab, c) = (b, aτ c) = (a, cbτ ), ∀a, b, c ∈ C.
Proof. (i) and (ii) follow immediately from the definition. In order to
prove (iii) notice that if {ei }, i = 1, . . . , n, is an orthonormal basis in
V, {eI }, I = {i1 < . . . < ip } is the corresponding basis in C, and a =
I
I aI e ,
b = I bI eI are the decompositions of a and b in the basis eI , then
Φ(ab) = I aI bI Φ(eI eI ) = Φ(ba). From the very definition of the scalar
product (a, b) it follows that (a, b) = Φ(aτ b) = Φ((aτ b)τ ) = Φ(bτ a) = (b, a).
Moreover, we have (eI , eJ ) = 0 if I = J, and also (eI , eI ) = ei1 2 . . . eip 2 =
(−1)s(I) , where s(I) is the number of negative norm square vectors in I. In
particular eI is orthonormal with respect to the scalar product in C, and so
(iv) holds. We have (ab, c) = Φ((ab)τ c) = Φ(bτ aτ c) = Φ(aτ cbτ ) = (a, cbτ ),
which establishes (v).
Notation: In what follows we will use the notation C = C(V, Q), and
C 1 = C(V 1 , Q1 ).
C×C
A - Im(A)
QQA
3
Ã= γ̃ −1 ◦A γ̃
? γ QQ
s ?
C1 - R(2, C)
6 QQ ψ
Q pr11
Q
s ?
ψ+ Q
Q
1+ - C
C
Fig. 3.45 Maps between the important algebras.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 183/3
Examples 183
Theorem 3.8.
(i) Let us realize the Clifford algebra C(1, −1) as the matrix algebra R[2]
using the following basis
0 1 01 −1 0
f0 = , f1 = , f01 = , (3.84)
−1 0 10 0 1
so that we have
f02k = 12 , f02k+1 = f0 , f12k = (−1k )12 , f12k+1 = (−1)k f1 . (3.85)
Let {e0 ∈ R, ei ∈ V, i = 1, . . . , n + 1} be an orthonormal basis of V 1 .
Then, in terms of this basis the map γ : C 1 −→ M at(2, C) reads:
γ(1) = 12 ⊗ 1C
γ(e0 ei1 . . . ei2k ) = (−1)k f0 ⊗ ei1 . . . ei2k ,
γ(e0 ei1 . . . ei2k+1 ) = (−1)k f01 ⊗ ei1 . . . ei2k+1 ,
γ(ei1 . . . ei2k ) = (−1)k 12 ⊗ ei1 . . . ei2k ,
γ(ei1 . . . ei2k+1 ) = (−1)k f1 ⊗ ei1 . . . ei2k+1 .
−
(ii) ker(ψ) = C 1 , and ψ restricts to the algebra isomorphisms ψ + from
+
C 1 onto C. In terms of the basis we have:
⎫
ψ + (1C 1 ) = 1C , ⎬
ψ+ (ei1 . . . ei2k ) = (−1)k ei1 . . . ei2k , (3.86)
⎭
ψ+ (e0 ei1 . . . ei2k+1 ) = (−1)k ei1 . . . ei2k+1 .
(iii) With the notation as above, we have
A(a, b)A(a , b ) = A(a , b ), where
a = aa +bπ(b ), b = ab +bπ(a ).
(3.87)
The principal involution π and the principal anti-involution τ of C 1
can be expressed through their corresponding operations in C as
π(Ã(a, b)) = Ã(a, −b), (3.88)
+
The even subalgebra C 1 of C 1 can then be identified with the set of all
A(a, b), with b = 0, that is, using the map pr11 , with C.
(iv) Denoting by Φ1 (resp. Δ1 ), and Φ (resp. Δ) the trace (resp. norm
function) of C 1 and C respectively, we have
Φ1 = Φ ◦ ψ, (3.90)
A(a, b)A(a , b ) = A(a , b ), where a = aa + bπ(b ), b = ab + bπ(a ).
(3.93)
It follows that the range (image) of the map A is an algebra and, because
it has the right dimension 2 × dim(V ), the Clifford map γ extends to the
isomorphism of C 1 onto Im(A). It is also clear that the even subalgebra
of C 1 is represented by the matrices A(a, 0), while the odd subspace is
represented by matrices A(0, b).
It follows from the very definition that π and τ defined by Eq. (3.88)
and Eq. (3.89) are involutions, and that π(ψ(w)) = ψ(−w), τ (γ(w)) = γ(w)
for w ∈ V 1 . Therefore we need to show that π, defined by Eq. (3.88), is an
automorphism, and that τ, defined by Eq. (3.89), is an anti-automorphism.
(Notice that although, by abuse of the notation, we denote by the same
symbol π the main automorphisms of C and C 1 , the meaning is always clear
from the context.)
1 0
Let C be the matrix7 : C = , then
0 −1
Examples 185
S n = {n ∈ V : n2 = 1}. (3.99)
We will denote by C the Clifford algebra C(V, Q), by Spin+n+1 the group
+
Spin+(V, Q), and by Spin1n+1 the group ψ + (Spin+ (V1 , Q1 )), described
by the conditions a) and b) in Theorem 3.8, (v). We define the Clifford
group Γ(V) as
Examples 187
Theorem 3.9. The set of all transformers T is closed under the principal
automorphism π. Moreover, for every a ∈ T , Δ(a) ∈ R, and if Δ(a) = 0,
then also aτ ∈ T . The set of all invertible transformers coincides with
Clifford group Γ(V).
Examples 189
The following proposition and its corollary describe the set of spin-boosts
G+ , and the Iwasawa-type decomposition of G.
Let us now describe the action of the group G on B̄ n+1 . We will need the
following lemma, which is the result of a simple, though somewhat lengthy,
calculation in the Clifford algebra C.
√
Lemma 3.3. If m = P (kn)/ 1 − k2 ∈ G+ , then for all x ∈ B̄ n+1 we have
P (kn)(1 + x)P (kn) = (1 + k 2 + 2k (n · x))(1 + x ), (3.118)
1 + α2 + 2α(n · x)
m(1 + x)m = (1 + x ), (3.119)
1 − k2
where
(1 − k 2 )x + 2k(1 + k (n · x))n
x = . (3.120)
1 + k 2 + 2k (n · x)
Proof. Straightforward calculation.
Before stating the next theorem let us notice that if x2 ≤ 1, then P (x) =
1 + x > 0. If g ∈ G, then also gP (x)g τ > 0 and, therefore, Φ(gP (x)g τ ) > 0.
Since G ⊂ M, and since M is a multiplicative semigroup, it follows that
gP (x)g τ ∈ M, and therefore gP (x)g τ /Φ(gP (x)g τ ) ∈ M̄1+ .
We also recall the definition of a conformal transformation (see e.g. Ref.
[Goldberg, 1998, Ch. 3.7].
Examples 191
Theorem 3.10.
If the map Eq. (3.120) is applied to the ball B (n+1) (rather than to its
boundary S n ), and if dV denotes the standard Euclidean volume form
of V 1 , then
n+2
dV 1 − k2
= . (3.126)
dV 1 + α + 2α(n · x)
2
Now, multiplying by g τ from the left, and by g from the right, and taking
into account the fact that Δ(g) = g ν g = Δ(g τ ) = g τ π(g) = 1, we find
g τ (1 − n)g = (1/λ)(1 − n); and, since n ∈ S n is arbitrary, g τ ∈ kerφ. Now,
assuming that g ∈ kerφ, let g = mu be the decomposition of g into a spin-
boost m ∈ G+ and a rotation u ∈ GR . Then g τ = uτ m ∈ kerφ; and, since
the kernel of a group homomorphism is a group, we get m2 =√gg τ ∈ kerφ,
i.e. φm2 (x) = x, x ∈ S n . Let us write m2 as m2 = (1 + kn)/ 1 − k 2 and,
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 193/3
Examples 193
since we have assumed that dim(V ) ≥ 2, we can choose for x a unit vector
in V, orthogonal to n. Then, from Eq. (3.120) we get
(1 − k)2 x + 2kn
x = φm2 (x) = ,
1 + k2
4k 2 (x2 − 1) 2k
G∗ij = ρ2 δij + 2
ni nj − (ni xj + nj xi ) (3.127)
f f
where
1 − k2
f = 1 + k2 + 2k(n · x), ρ= . (3.128)
f
9 The same way one gets Eq. (3.126) also for xn. An alternative method of proving
Eq. (3.125) and Eq. (3.126), using (n + 1)-dimensional polar coordinates can be found
in a previous version of this paper, available as an arxiv preprint [Jadczyk (2007)].
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 194/3
Examples 195
N
N
∗
(T f )(x) = pα (x)(wα∗ f )(x) = pα (x)f (wα (x)). (3.136)
α=1 α=1
Examples 197
Proposition 3.5. With the notation as in the beginning of this section, let
0 < k < 1, nα ∈ S n , α = 1, 2, . . . N, and wα as in Eq. (3.139). Suppose
that
1)
N
nα = 0, (3.141)
α=1
2)
1 + k 2 + 2k(nα · x)
pα (x) = , (3.142)
Z(k)
where
N
Z(k) = (1 + k 2 + 2k(nα · x)) = N (1 + k 2 ),
α=1
1 N
V (b) = P (knα ) b P (knα ). (3.143)
N (1 + k 2 ) α=1
Proof. From Eq. (3.119) it follows that if α nα = 0, then
.
Z= 1 + k 2 + 2k(nα · x) = N (1 + k 2 )
α
is a constant, independent of x.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 198/3
Examples 199
given by
(1 − k2 )n+2 fr wα−1 (x)
N
fr+1 (x) = , (3.146)
N (1 + k2 ) α=1 (1 + k 2 − 2k(nα · x))n+1
where
(1 − k2 )x − 2k(1 − α(nα · x))nα
wα−1 (x) = . (3.147)
1 + k2 − 2k(nα · x)
Proof. The proof follows from the definitions, using the following, easily
verifiable, algebraic property: if
g(x) = 1 + k2 + 2k(nα · x),
and if
(1 − k 2 )x − 2k(1 − k(nα · x))nα
wα−1 (x) = , n2α = 1,
1 + k 2 − 2k(nα · x)
then
(1 − k 2 )2
g(wα−1 (x)) = .
1 + k 2 − 2k(nα · x)
There are two methods of generating the data set for graphical representa-
tion of hyperbolic quantum fractals: one is through the Chaos Game, the
other one is through the Frobenius-Perron operator. We give both of them
here, adapted to a general case of n-sphere. For the standard two-sphere
n = 2. In both cases it is possible to render the data points either on the
sphere or on its stereographic projection. In the algorithms below x · y
stands for the standard Euclidean scalar product of two vectors, while ||x||
stands for the standard Euclidean norm of a vector.
In addition to the pseudocodes, Fig. 3.46 shows the output of the For-
tran code listed in Sec. 3.4.1.1, while Fig. 3.47 shows the output of the
Fortran code listed in Sec. 3.4.2.1. Both codes should run under Linux
gfortran. For the graphics part we used DISLIN package available from
http://www.dislin.de.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 200/3
Fig. 3.46 Quantum octahedron generated by the Fortran code listed in Sec. 3.4.1.1.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 201/3
Examples 201
Fig. 3.47 Fourth level iteration of the Frobenius-Perron operator for Quantum Do-
decahedron (with stereographic projection) generated by the Fortran code listed in
Sec. 3.4.2.1.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 202/3
Examples 203
! REAL*4 XS(NIT,3)
! On the other hand we can choose a given
! resolution RES and divide the unit square on the
! equatorial plane into a grid of RESxRES small
! squares. Then to each square we add a counter.
! Whenever XS,YS,ZS vertically projected falls
! into a given square we add 1 to the counter of
! this square. Then we process XS,YS,ZS to
! get new ones. So we do not have to store all the
! points on the sphere, we store only the counters.
! One counter for the density of hits, another
! counter for logarithms of these hits. Logarithmic
! counters are often used in the fractal community.
! They allow us to see more details.
INTEGER DENSITY(RES,RES)
REAL*4 DENSITYL(RES,RES)
! Dummy variables used in calculations
INTEGER*4 M,N
REAL*4 MAXL
! Then we need random numbers:
REAL*4 RR ! For random number between 0 and 1
INTEGER R ! Integer random in 1,...,NVERT
INTEGER*8 I,J !(to count iterations etc.)
REAL*4 P !To be used for place dependent
! random choice of an active vertex
V = RESHAPE((/0.D0, 0.D0, 1.0D0,&
1.D0, 0.D0, 0.D0,&
0.D0, 1.D0, 0.D0, &
-1.D0, 0.D0, 0.D0,&
0.D0, -1.D0, 0.D0,&
0.D0, 0.D0, -1.0D0/),(/3,NVERT/))
Q = k*V
s = 0
DO M=1,NVERT
k2(M) = sc(Q(:,M),Q(:,M))
s = s + 1.0D0 + k2(M)
ENDDO
! We choose the starting point on the sphere at
! random. It really does not matter which one we
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 205/3
Examples 205
END DO
X = JUMP(R,X)
! The line below should be commented out
! if we do not need to store the points
! on the sphere.
! XS(I,:) = X
! Here we classify the point according to the
! little square into which it falls. Since
! this is vertical projection, only x,z
! coordinates count.
IF (X(3)>0D0) THEN
! IF (X(3)<0D0) THEN !For the southern hemisphere
M = MAX(CEILING((REAL(X(1))+1.0)&
&*REAL(RES)/2.0),1)
N = MAX(CEILING((REAL(X(2))+1.0)*&
&REAL(RES)/2.0),1)
DENSITY(M,N)=DENSITY(M,N)+1
END IF
END DO
! Calculate log of the density (+1) and its
! maximum value:
MAXL = 0
DO I=1,RES
DO J=1,RES
DENSITYL(I,J)=LOG10(REAL(DENSITY(I,J)+1.0))
IF (DENSITYL(I,J)>MAXL) THEN
MAXL = DENSITYL(I,J)
END IF
END DO
END DO
! Normalize to values in [0,1]:
DENSITYL(1:RES,1:RES) = DENSITYL(1:RES,1:RES)/MAXL
! Graphics part:
CALL FILMOD ("VERSION")
CALL winsiz(1000,1000)
CALL PAGE(1440,1440)
CALL sclmod("full")
CALL METAFL(’CONS’)
!CALL SCRMOD (’REVERSE’)
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 207/3
Examples 207
CALL DISINI()
CALL SETGRF ("NONE", "NONE", "NONE", "NONE")
CALL SETVLT (’SPEC’)
!CALL SETVLT (’GREYR’)
CALL AUTRES(RES,RES)
CALL AXSPOS(25,1410)
CALL AX3LEN(1390,1390,1000)
CALL NOBAR
CALL GRAF3(-1.,1.,-1.,0.5,-1.,1.,-1.,0.5,0.,1.0,0.,&
&1.0)
CALL CRVMAT(DENSITYL,RES,RES,1,2)
CALL RBMP(’image.bmp’)
CALL NOLINE(’X’)
CALL NOLINE(’Y’)
CALL DISFIN()
STOP
CONTAINS
! Scalar product and norm in double precision
! In single precision we can also use standard
! Fortran 90 functions. Or we can use some other
! library.
REAL*8 FUNCTION SC(V1,V2) ! Scalar product
REAL*8 V1(3),V2(3)
SC = V1(1)*V2(1) + V1(2)*V2(2) + V1(3)*V2(3)
END FUNCTION SC
! Norm in double precision
REAL*8 FUNCTION N2(W)
REAL*8 W(3)
N2 = DSQRT( W(1)*W(1) + W(2)*W(2) + W(3)*W(3) )
END FUNCTION N2
! Place dependent probabilities
REAL*4 FUNCTION PROB(J,X)
REAL*8 X(3)
INTEGER*4 J
PROB = (1.0 + 2.0*REAL( sc(X,Q(:,J)) ))/s
END FUNCTION PROB
! Jump to the next point on the sphere
FUNCTION JUMP(M,X)
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 208/3
REAL*8 X(3),Y(3)
REAL*8, DIMENSION(3) :: JUMP
INTEGER*4 M
Y = (1.0D0 - k2(M))*X + &
2.0D0*(1.0D0 + sc(Q(:,M),X))*Q(:,M)
JUMP= Y(1:3)/N2(Y)
END FUNCTION JUMP
END PROGRAM sphere
Examples 209
Examples 211
end do
end do
call cpu_time(clock_finish)
write (*,’(A)’) "--------------------------------------"
write (*,’(A)’) " "
write (*,*) "CPU Time = ",(clock_finish - clock_start), &
" seconds"
picl = picl/maxm
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
CALL METAFL(’CONS’)
CALL PAGE(1300,1300)
CALL winsiz(1040,1150)
CALL sclmod("full")
CALL DISINI()
CALL SETVLT (’GREY’)
CALL HWFONT()
CALL INTAX()
CALL AUTRES(RES,RES)
CALL AXSPOS(150,1160)
CALL AX3LEN(1100,1100,1100)
CALL NOBAR
CALL LABDIG(1,’XYZ’)
CALL LABELS(’FLOAT’, ’XYZ’)
CALL GRAF3(real(xymin),real(xymax),real(xymin),&
real(xysize)/10.0,real(xymin),&
real(xymax),real(xymin),real(xysize)/10.0,0.,1.0,0.,1.0)
CALL CRVMAT(picl,RES,RES,1,2)
CALL RBMP(’dodecahedron_fp_06_3.bmp’)
CALL DISFIN()
STOP
CONTAINS
else
b = 0.D0
do i=1,nn
do j=1,3
vq(j) = q(j,i);
end do
dot = vq(1)*v(1)+vq(2)*v(2)+vq(3)*v(3)
den = 1.0D0/(k3-2.0D0*dot)
den3 = den**3 ! nonuniform
! den3 = den**2 !uniform
w = den * (k1 * v - 2.0D0 * (1.0D0 - dot) * vq)
b = b + fp(n-1,w)*den3
end do
b = fac * b
end if
end function fp
END PROGRAM DODECAFP
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 213/4
Chapter 4
Foundational Questions
213
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 214/4
In another paper [Scarani and Kurtsiefer (2009)] we can find a bit more of
an explanation:
But we know that every theoretical scheme in physics has a limited do-
main of application. Beyond these domain the underlying assumptions,
and therefore also the model, are no longer valid. Why would quantum
theory be different?
Nevertheless, writing about the importance of problems of randomness
in physics three British educators, Jon Ogborn, Simon Collins and Mick
Brown wrote [Ogborn et al. (2003b)] (see also continuation in [Ogborn
et al. (2003a)]):
So, what is it? Do we know for sure? Do we just “believe”? The internet
site “random.org” advertises as follows
deal with these events as processes of infinite complexity, without any sharp
beginning or end. These comments concern the theory. But what about
experiments? What can we learn from experiments?
As we have mentioned before, the process of radioactive decay is one of
the most typical examples of physical processes that are considered to be
of “truly random” character. Mathematical modeling of this process starts
with counting the data which are individual “events”. An extract from a
typical history of such counts may look as in Fig. 4.1.
Counting events
9
5
Events
1
t1 t 2 t3 t4 t5 t6 t7 t8 t9
0
0 1 2 3 4 5 6 7 8
Time
e−λ λn
Poisson distribution Pλ [n] = n!
λ = 1.0 λ = 5.0
Probability
n n
λ = 10.0 λ = 15.0
Probability
n n
Fig. 4.2 Poisson distribution for λ = 1, 5, 10, 15. Probability of n counts in a unit time
interval.
e−λt (λt)n−1
fλ,n (t) = λ . (4.3)
(n − 1)!
Plots of the Erlang distribution for λ = 1, 5, 10, 15 are shown in Fig. 4.3.
−λt (λt)n−1
Erlang (Gamma) distribution fλ,n [t] = λ e (n−1)!
n=1 λ = 1.0
n=2
n=3
n=4
n=5
n=6
From the above we easily obtain that the expected number of events in
the time interval t is given by:
∞
(λt)n
ne−λt = λt. (4.4)
n=0
n!
We also have:
∞
(λt)n
n2 e−λt = λt + λ2 t2 . (4.5)
n=0
n!
A series of experiments with 2000 counts may result in a graph like the one
shown in Fig. 4.4 that was produced by a computer simulation for λ = 0.5.
Five series of experiments with 2000 counts (λ = 0.5) show fluctuations
as in Fig. 4.5.
For a Poisson counting process with the rate λ we expect λΔt counts
in each interval of length Δt. But a real experiment will show fluctuations
around this expectation value. Computer simulation of 1 mln counts for λ =
0.5, that are binned in successive intervals of length Δt = 1000 produces
the graph, shown in Fig. 4.6, of fluctuations around the expected value that
has been normalized to 1.
But in the real world of experiments the situation is not that simple. For
a long time it was taken for granted that nuclear decays, governed somehow
by quantum processes, are truly “spontaneous” and “uncontrollable”. Re-
cently this belief has been seriously questioned. So, for instance, in recent
800
Events observed
600
400
200
0
0 500 1000 1500 2000
Time
Fig. 4.4 Poisson process, λ = 0.5. Number of counts versus time. 2000 counts.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 222/4
1500
Events observed
1000
500
0
0 500 1000 1500 2000 2500 3000 3500 4000 4500
Time
Fig. 4.5 Poisson process, λ = 0.5. Number of counts versus time. Five runs, each of
2000 counts.
Fluctuations
1.2
Variation of the count rate
1.15
1.1
1.05
1.0
0.95
0.9
0.85
0.8
0 500 1000 1500 2000
Time
Fig. 4.6 Poisson process. Fluctuations of the normalized decay rate for λ = 0.5. Com-
puter simulation with 1 mln events.
years it was discovered that radioactive decay rates show periodicities and
variations of the cosmic origin.
Probably the first scientific paper documenting unexplained annual
changes in the rates of radioactive β-decay processes was published in 2001
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 223/4
The American team was using rather sophisticated statistical tools for an-
alyzing the data for periodicities. The two teams, American and Russian
1 Thanks are due to A. G. Parkhomov for bringing this reference to my attention.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 224/4
joined together and reanalyzed the decay data collected by the Lomonosov
State University. They produced a joint paper [Sturrock et al. (2013)] in
which they concluded:
Fig. 4.7 Count rates for 60 Co and 90 Sr–90 Y β sources measured by GM counters,
adjusted for a decrease in source activity with half-lives of 5.27 and 28.6 years, and count
rate for 239 P u α source measured by the silicon detector. Of course the fluctuations of
counts in the real data graphs are much smaller than those shown in Fig. 4.6. This is
due to the fact that the counters analyzed by Parkhomov counted 10–40 mln events per
day!
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 225/4
processes” [Parkhomov (2006)] Parkhomov notes that the very level of ran-
domness of certain random processes can also change. In the conclusions
he writes (translated from Russian):
Regulated Chaos
13.8
13.6
13.4
13.2
imp/s
13.0
12.8
12.6
12.4
12.2
14.5 15.0 15.5 16.0 16.5 17.0 17.5 18.0 18.5 19.0
Time
Fig. 4.8 An example of the variation of the fluctuations width of the data registered
by a Geiger counter. The source is a radioactive sample of 60 Co with the mean data
count of 13.5 impulses per second, with standard deviation of 0.3 imp/s. During the
time interval of about 15 minutes an external “device” has been turned on. During this
time the rate of the counts did not change, but the fluctuations around the mean value
became significantly smaller.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 226/4
John Bell [Bell (2004)]unhappy with the discrepancies between the math-
ematical formalism and applications of quantum theory popularized two
different “enhancements” of the standard quantum theory: “Bohmian me-
chanics” and Ghirardi-Rimini-Weber (GRW) “spontaneous localization”.
As two representatives of the “standard” formulation he selected the
popular textbook “Quantum Mechanics” by K. Gottfried [Gottfried (1966)]
and the review paper “Ten theorems about quantum mechanical measure-
ments” by N. G. van Kampen [van Kampen (1988)]. Bell began his article
“Are there quantum jumps?” by attributing (without giving a reference) to
Erwin Schrödinger the often quoted sentence:
The title of Bell’s paper is the same as Schrödinger’s 1952 article “Are there
quantum jumps?” [Schrödinger (1952)]. Here is what Schrödinger wrote in
another 1952 paper, “What is Matter?” [Schrödinger (1953)]:
This is evidently the problem that later on troubled John Bell. Quantum
theory is not easy to learn. One has to practice it. This practice is often
far away from the theoretical principles that one learns from “good books”.
And so Bell noticed that “conventional formulations of quantum theory,
and of quantum field theory in particular, are unprofessionally vague and
ambiguous.” “Professional theoretical physicists ought to be able to do bet-
ter.” Indeed, when learning an advanced course of quantum mechanics, we
learn about Hilbert spaces, operators, ‘observables’, eigenvalues, eigenvec-
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 229/4
tors, scalar products, Fourier transforms, etc. Yet we are not told which of
these things has “real existence”. We can only guess that atoms are real,
space is real, time is real, but all these real things are just the arena, they
are not a part of quantum dynamics. In experiments we measure time of
events. But is ‘time of event’ a quantum-mechanical observable? Is the
age of the universe an eigenvalue of some quantum mechanical Hermitian
operator? What about the distance between two points? What about the
number of dimensions of our space? What about circumference to radius
ratio of a circle?
The new science (q.m.) arrogates the right to bully our whole
philosophical outlook. It is pretended that refined measurements
which lend themselves to easy discussions by the quantum me-
chanical formalism could actually be made. (I am alluding to the
gamma-ray-microscope, to the location of the electron in a ‘given’
hydrogen atom, and the sort). Actual measurements on single indi-
vidual systems are never discussed in this fundamental way, because
the theory is not fit for it. This in itself is no blame. What is objec-
tionable is the philosophical presumption, which claims reality for
anything the quantum theorist chooses to imagine as measurable,
while he closes his eyes to the fact that few, if any, actual measuring
devices are amenable to discussion under his scheme [Schrödinger,
1955, p. 565].
One can certainly make a case for the view that the sum to-
tal of all observations which have been and ever will be made is
after all the only reality, the only thing that physical science is
concerned with. This view is not self-evident, but it is worth dis-
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 230/4
One such issue is, for instance, the tunneling time. According to quan-
tum mechanics, as we are being taught in almost every course, a quantum
particle, say, electron, can tunnel through an extended barrier even if its
energy is, according to the classical physics, insufficient for overcoming the
obstacle. The same phenomenon is observed with photons. But then the
question arises: “How long it takes to tunnel?” Textbook quantum mechan-
ics does not have “time observable”, but tunneling time can be measured.
The problem of tunneling time and arrival time have been discussed in
many papers and causes a lot of controversies. In 1972, ten years after
receiving the Nobel Prize ‘for his contributions to the theory of the atomic
nucleus and the elementary particles, particularly through the discovery
and application of fundamental symmetry principles’, E. P. Wigner ad-
dressed the issue of time in his paper “On the Time-Energy Uncertainty
Relation” [Wigner (1972)]. However his results were inconclusive and his
paper contains errors (cf. [Blanchard and Jadczyk (1997)]). In 1974 J. Ki-
jowski addressed the question of ‘time of arrival’ in his paper “On the time
operator in quantum mechanics and the Heisenberg uncertainty relation
for energy and time” [Kijowski (1974)]. He derived a natural solution for
a self-adjoint “time of arrival” operator for a free Schrödinger particle. In
1994 B. Mielnik re-analyzed the “waiting screen problem” [Mielnik (1994)]
to conclude that “the problem is still open”. In 1999 Kijowski replied to
critics of his solution pointing out that he is not using “unconventional
quantum mechanics” as has been suggested by those authors who did not
study his first paper carefully. In his 2005 paper “ ‘Time Operator’: the
Challenge Persists” [Mielnik and Torres-Vega (2005)] Mielnik and Torres-
Vega notice that “Quite obviously, the waiting detectors form a new class
of measurements, which have rather little to do with traditional Dirac–v.
Neumann observables”. Kijowski replies [Kijowski (2005)]: “Unfortunately,
at the moment there is no measurement theory, which could replace this
(naive and very unsatisfactory!) [conventional] picture.”
Concerning the time needed for a quantum signal to traverse a barrier
there is also an ongoing controversy. For instance in the two volumes of
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 231/4
These are just a few examples illustrating the point made above by
Schrödinger, who continues as follows:
value of the initial state or that of the final state, the probabil-
ity of finding the latter rather than the former increases with time
continuously in a way that the theory foretells.
The answer to the question of how long it takes to change the quantum state
depends on the model accepted theory of quantum measurement. Today
we are more prepared to address such questions than we were fifty years
ago. Of course there are always textbook answers, but these textbooks are
not addressing the problem directly for the very reason that it is impossible
to describe state-transition using Schrödinger’s continuous evolution alone.
Without approximations the standard quantum mechanics gives us a not
very satisfactory answer: “At best infinite time”.
Another example: our bright disciple may find out for himself,
that according to his theoretical instructions nothing prevents the
velocity of a particle being measured by the time-honoured method
which is practiced on the race-course and by the police (to trace
offenders against the speed-limits), viz. by recording the time taken
by the particle to cover a known distance; and he is perturbed in
noticing that nothing is in the way of carrying the accuracy of
this measurement far beyond the limit imposed by the Uncertainty
Principle. The answer he gets from the initiates is, that this is
indeed so, but causes no worry, since the conflicting data refer to a
bygone moment and cannot be used for predicting the future.
The idea of “Bohmian mechanics” has been around for so. What is nowa-
days called ‘Bohmian mechanics’ was created and described in detail by
Louis de Broglie. Chapter 15 of his 1930 book “An Introduction to the
Study of Wave Mechanics” [De Broglie (1930)] contains a complete de-
scription of this “mechanics”, even more general than it is done nowadays,
because de Broglie writes his equations for a general, geometrically inho-
mogeneous medium rather than just for a homogenous empty space. Why
then is it called “Bohmian mechanics”? One of the reasons may be the
fact that de Broglie himself considered this particular formalism and ac-
companying “causal interpretation” as too primitive to be true. He was
looking for a more satisfactory solution, which he called “The Double So-
lution”, a solution that would include nonlinearity. This is what he wrote
in the Preface to his 1960 book “Non-linear Wave Mechanics. A Causal
Interpretation”[De Broglie (1960)]:
“Such was the idea that had taken shape in my mind, and its
curious subtlety astonishes me to this day. I called it the “theory of
the Double Solution,” and it was that idea which translated my real
thinking in all its complexity. But, in order to facilitate explaining
it, I had sometimes given it a simplified form, much less profound,
to my way of thinking, which I had named ‘the pilot-wave theory’
in which the particle, assumed given a priori, was considered to be
piloted by the continuous wave.”
In 1952 David Bohm [Bohm (1952)] took de Broglie’s idea, the idea that de
Broglie himself considered as “simplified” and “not profound enough”, and
developed it here and there. Other physicists, for some reasons, decided to
call the whole idea “Bohmian mechanics”. Bohm, writes in his 1952 paper
[Bohm (1952)]:
of Quantum Theory, twenty years before! In his review of the theory [Bell
(1982)] John Bell makes this simple comment:
“Moreover, the essential idea was one that had been advanced
already by de Broglie in 1927, in his pilot wave picture.
But why then had Born not told me of this pilot wave?”
Apparently, for some obscure reasons, de Broglie’s name, as well as his
ideas, were not worth attention among other western quantum physicists.
The idea described by de Broglie is indeed a simple one. We have a
wave function Ψ(t, x) satisfying the standard Schrödinger equation (suppose
without magnetic field and just for one particle):
∂Ψ 2 2
i =− ∇ ψ + V (x)Ψ. (4.8)
∂t 2m
At a given time t consider those points x in which Ψ(t, x) = 0. In a generic
case it will be “almost the whole space” — exceptional points must be
excluded, the formalism fails at those exceptional points, they need a special
treatment. But at those points where Ψ is non-zero, we can decompose Ψ
into its modulus and phase. De Broglie [De Broglie (1930)] writes it as
2πiφ
Ψ = ae h , (4.9)
while Bohm [Bohm (1952)] as
Ψ = R exp(iS/). (4.10)
Notice that formally
S
= log Ψ.
Then, as John Bell terms it in [Bell (1980)]:
... the particle rides along on the wave at some position x(t)
with velocity
1 ∂
ẋ(t) = log Ψ(t, r)|r=x . (4.11)
m ∂r
This equation has the property that a probability distribution for
x at time t
d3 x|Ψ(t, x)|2 (4.12)
evolves into a distribution
d3 x|Ψ(t , x)|2 (4.13)
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 235/4
[Bell (1990)], yet ignore completely his criticism concerning the use of un-
defined concepts such as “macroscopic”. The term “macroscopic” appears
more than 100 times in [Dürr and Teufel (2009)] and is being used in their
arguments supposedly supporting ‘typicality of quantum equilibrium’.
Today quantum trajectories are being used in quantum chemistry. Ev-
idently they are of help in visualization of certain quantum phenomena.
On the other hand quantum opticians seem to be rather critical concerning
the improper use of these trajectories. In 1991 Scully, Englert and Walther
published a paper entitled “Surrealistic Bohm trajectories” [Englert et al.
(1992)]. In 1998 Marlan O. Scully published another paper, this time with
the title “Do Bohm Trajectories Always Provide a Trustworthy Physical
Picture of Particle Motion?” [Scully (1998)], with his short answer in the
abstract:
Abstract
“No. When particle detectors are included particles do not form
trajectories as we would expect from a classical type model.”
He also wrote:
“(...) But the aspect of the talk which precipitated the most
spirited discussion was the contention of Englert, Scully, Süssman
and Walther [Englert et al. (1992)] (ESSW) that the Bohm tra-
jectories can be shown to be ‘surrealistic’ by using a micromaser
which way or Welcher Weg (WW) detector. That this conclu-
sion should precipitate debate is understandable since Bohmian
mechanics (BM) has undeniable charm. It provides an interesting
perspective into quantum phenomena in that the Bohmian trajec-
tories seem to provide more information and insight than quantum
mechanics (QM) typically allows, see Fig. 1. Furthermore, it is
widely held that BM always agrees with QM; so it would not, one
would think, lead us into error.”
“To make this clear it was necessary to recall that the Bohm
trajectories were none other than the streamlines of probability.”
The picture resulting from these debates may indeed look somewhat ‘sur-
realistic’.
Fig. 4.9 ‘Bohmian trajectories’ for the double slit configuration. Instead solving of
Schrödinger equation for this very problem (which can be done only numerically) a
number of free Gaussian moving packets, with origins at selected points inside the slits,
are superposed.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 240/4
the classical framework. We, human beings, are partly quantum and partly
classical. Why should we deny this observation?
In a sense quantum theory “explains” why it is so difficult to have
quantum phenomena on a macroscopic scale. But is it a real explanation
when quantum theory itself remains unexplained? As Richard Feynman
succinctly puts it: “Nobody understands quantum theory”.
Usually quantum physicists blame the “environment” for the fact that
quantum phenomena are not a part of our everyday experience. But what
exactly is this “environment”? Splitting the universe into “a system under
observation” and “environment” is subjective. Attempts to make it objec-
tive have failed, and they must fail, because the very concept of a hard
“splitting” is classical. Why not accept this fact from the very beginning?
Talking about the system and its environment may be useful, may be even
good FAPP (“for all practical purposes”), but it does not belong to “fun-
damental physics”. It has nothing to do with “Laws of Nature”, it has
everything to do with what is convenient. It is certainly not in the spirit
of, as the French philosopher Bernard d’Espagnat terms it, “objectizing
physics”. Therefore why not try the “Columbus solution”?
Christopher Columbus, when challenged with the problem of how to
make an egg stand vertically, the problem that others could not solve despite
their efforts, simply broke the shell from one end — the simple and bold
idea that did not occur to others, but which was still within the unspoken
rules of the game. Therefore, in simple terms: Not all is quantum.
While the future is uncertain and may need quantum description, the
past is rather well set and can be described in classical terms. Even if the
past can be partly erased, nevertheless it belongs to the classical world.
Facts and events are classical, and their formal description should be based
on classical concepts. Possibilities (or “propensities”) belong to the quan-
tum world.
The past is evidently coupled to the future. Past events can influence
future possibilities and probabilities. Probabilities, when they actualize,
create events that form the past. EEQT, the Event Enhanced Quantum
Theory, is a mathematical model that describes such a coupling through
equations and algorithms. Equations describe the continuous time evolu-
tion of statistical averages. Algorithms describe creation of histories which
then can be statically averaged over.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 242/4
expect that they will necessarily have an inverse. Even if they have an
inverse, the inverse does not have to be defined for all functions under con-
sideration. Therefore suppose we have a semigroup of transformations σt
acting, by linear transformations, on the space of such functions. We can
define then the infinitesimal generator of the semigroup by
1
(Df )(ξ, α) = lim (σt f − σ0 f )(ξ, α), (4.21)
t↓0 t
Q(ξ, α; dξ , β) = 1, (4.23)
β Mβ
and also
Q(ξ, α; dξ , α) = 0, (4.24)
{ξ}
Then, as it is shown in Refs. [Davis (1984, 1993)], one can associate with
this generator D a piecewise-deterministic stationary Markov process that
is described as follows.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 244/4
Mα0
Mα1
φα0 (ξ0 , t1 )
ξ0
Mα2
ξ2 φα1 (ξ2 , t3 )
φα2 (ξ1 , t2 )
ξ1
Suppose the process starts at some point (ξ0 , α0 ). Then ξ evolves con-
tinuously along the vector field Zα , ξt = φα (ξ0 , t), while α0 remains con-
stant until a jump occurs at a certain random time t1 . The time of this
jump is governed by a (inhomogeneous) Poisson process with rate func-
tion λ(t) = λ(ξt , α0 ). When jump occurs at t = t1 , then (ξt1 , α0 ) jumps
to (ξ , α) with probability density Q(ξt1 , α0 ; dξ , α) and the process starts
again.
Remark 4.1. Notice that the probability that the jump will occur between
t and t + dt, provided it did not occur yet, is equal to
t+dt
1 − exp − λ(s)ds ≈ λ(t)dt. (4.26)
t
Then, choosing the Dirac measure δξ0 ,α0 concentrated at (ξ0 , α0 ) as the
initial point μ0 in the space of measures, we apply to it σ t to get μt = σt (μ0 ).
The resulting measure μt is then characterized by the fact that dμt (ξ, α)
is equal to the probability density that the process starting at t = 0 from
(ξ0 , α0 ) will end, at time t, at the point (ξ, α).
A detailed and precise description of the above correspondence should
include specification of the involved measure structures and domains of
definition. These are given in detail in Refs. [Davis (1984, 1993)]. Here
let us only notice the following important relation: let K(t; ξ, α; dξ , β) be
the transition function for the process. That means K(t; ξ, α; dξ , β) is the
probability that the process starting at time t = 0 at (ξ, α) will reach, after
time t the volume element dξ on the manifold Mβ . Then the semigroup σt
is given by the formula
(σt f )(ξ, α) = K(t; ξ, α; dξ , β)f (ξ , β). (4.28)
β
Of course, if the index α is continuous, then the sum in the above formula
should be replaced by an integral.
The star operation in the algebra is either the hermitian (or, in case
of indefinite scalar product, pseudo-hermitian) conjugation or, in real case,
the operation of taking the transpose.
For historical reasons A is called an ‘algebra of observables’, even if
only normal operators, that is, those which commute with their adjoints,
are believed to be directly related to observable physical quantities.
In EEQT the elements of A, even if they can represent ‘physical quanti-
ties’, can neither be observed nor do they represent, as it is assumed within
the standard interpretation, ‘observational procedures’ — except in a limit
that is rather unrealistic. In EEQT the operators in A do exactly what
they are supposed to do: they operate on states to produce new states that
result from quantum events. They implement quantum jumps that ac-
company any event and any process of information transfer related to the
quantum system.
It should be noted that in EEQT we do not import any a priori proba-
bilistic interpretation of the standard quantum theory. All interpretation is
being derived from the Piecewise Deterministic Process (PDP) introduced
above. Interpretation of eigenvectors, eigenvalues, mean values of observ-
ables, etc. should be derived from the dynamics of EEQT. A major part
of the standard wisdom about eigenvalues and eigenvectors can, in fact,
be justified within EEQT, and so it can be used as a heuristic tool for
constructing mathematical models of ‘real world’ situations.
The algebra A is usually assumed to be a C or a von Neumann algebra,
but EEQT can work also in spaces with indefinite scalar product or within
a Clifford algebra framework.
i) (A ) = A.
ii) (A + B) = A + B .
iii) (AB) = B A .
iv) (αA) = αA , α ∈ R,
v) 1 = 1.
If A is over C, we require that
iv’) (αA) = ᾱA , α ∈ R,
where α → ᾱ is the complex conjugation. A Banach algebra with involution
is called a Banach algebra if
vi) ||A || = ||A||.
In a Banach algebra the involution is automatically continuous. A Banach
algebra is called a C algebra if, additionally,
vii) ||A A|| = ||A||2 .
If, additionally, a C algebra A can be realized as an algebra of operators
on some (real or complex) Hilbert space, and if A is closed in the weak
operator topology, then A is called a von Neumann algebra.
of freedom are, in fact, insisting on the idea that only factors should be
used for an algebraic description of quantum systems. While it is true that
every algebra can be decomposed, essentially uniquely, into a direct sum (or
integral) of factors, restricting to factors alone is like restricting to prime
numbers alone.
While it is true that any integer can be decomposed into a product
of prime numbers, insisting on the idea that only prime numbers should
be used would be simply silly. Atoms build molecules. There would be no
life without molecules. Similarly factors build more complex non-factors.
According to our definition below, there would be no ‘events’ without non-
factors! Thus there would be no data (recording a datum is an event) that
could be used in experiments.
Every Abelian (i.e. commutative) algebra has only one-dimensional ir-
reducible representations. These are called characters, and the set of all
characters of Z is called the spectrum of Z. The above is not a very precise
definition — some assumptions are missing. In order to get an idea about
this important subject (Abelian algebras, after all, represent the classical
world) let us give an illustrative example.
Example 4.1. consider the algebra C(K) of all functions (real or complex
valued) on a set K. To be precise, we may assume that K is a compact
Hausdorff space, the functions are continuous, and the norm on C(K) is
defined as the sup norm:
||f || = sup |f (x)|. (4.31)
x∈K
Then C(K) is a C algebra. Suppose now that K is the unit disk in the
complex plane:
K = {z ∈ C : |z| ≤ 1}.
The set D(K) of all continuous complex valued functions on K that are
analytic inside K is a Banach subalgebra of C(K). If z is a point in K, then
the map σz : D(K) → C defined by
σz (f ) = f (z) (4.32)
is a continuous algebra homomorphism (a character) from D(K) to C.
Moreover, every character on D(K) is of such a form. In other words:
given the algebra of functions D(K), with all its topology and algebra
structure, we can rediscover the space K. It is this idea that motivates
non-commutative geometry. Sometimes the ordinary concept of “space”
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 249/4
may become too restrictive. For instance the space may have some fractal
properties, may cease to have a well defined dimension or even topology.
The hope is that the algebra of space can be somehow handled better than
space itself. Even if the algebra happens to be noncommutative, in which
case it can not be simply interpreted as a space of functions on some un-
derlying set.
When the set of classical states is discrete, then any change of the state is
discrete. But, for instance, in models with a continuous spectrum (as, for
instance, when C is a phase space {q, p}) we will have a continuous evolution
of the state of C that is interrupted by events, for instance jumps in the
momentum p (instantaneous boosts) in C. It is important to observe at this
place, that in such models we may have discontinuity in the momentum
(or velocity) without discontinuity in space. Thus the classical trajectory
will suddenly change the direction, but will not jump to another point in
space. Somehow such jumps are (philosophically) more acceptable than
jumps from one point in space to another.
Amplifier
detector electronics
μ
Josephson Junction
coupling loop
Φ̂, L LT CT
SrTiO3
(a) (b)
Fig. 4.11 SQUID — a model for quantum-classical coupling. (a) A schematic view of
the quantum-classical coupling as implemented in a SQUID (Superconducting Quantum
Interference Device) magnetometer. The flux in the macroscopic (of the size of about
1000 nm) superconductive ring is governed by the quantum laws. The coupled radio-
frequency circuit is governed by the classical laws. (b) Using substrate resonators, the
performance of a SQUID can be greatly enhanced. A standard SrTiO3 substrate with
dimensions 10 × 10 × 1 mm3 serves as a tank circuit (resonator), a YBCO thin film
SQUID washer structure is patterned on it. On the resonator substrate, a small RF
washer SQUID with a step-edge junction is positioned in flip-chip geometry, thus forming
a magnetometer sensor. At 77 K, the field sensitivity of this SQUID magnetometer
reaches 24 fT/root(Hz) in the white noise range. (Courtesy of www.jsquid.com)
any understanding of why, how, and when they happen. That is why the
standard theory is incomplete.
In 1986 John Bell, envisioning a possibility of creating a new, more
complete theory wrote [Bell (1987b)]:
“And surely in fundamental theory this merging [of classical and quan-
tum] should be described not just by vague words but by precise math-
ematics? This mathematics would allow electrons to enjoy the cloudi-
ness of waves, while allowing tables and chairs, and ourselves, and
black marks on photographs, to be rather definitely in one place rather
than another, and to be described in ‘classical’ terms. The necessary
technical theoretical development involves introducing what is called
‘nonlinearity’, and perhaps what is called ‘stochasticity’, into the basic
‘Schrödinger equation’.”
φ:A→B
is Hermitian if
φ(A ) = φ(A) .
Mn (A) = Mn ⊗ A
(Aij ) = (Ai Aj ), Ai ∈ A.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 253/4
or, equivalently, to
(Ψi , Aij Ψj ) ≥ 0 for all Ψ1 , . . . , Ψn ∈ H. (4.34)
i,j
5) Set
gα1 α0 (t1 )ψ(t1 )
ψ1 = . (4.46)
gα1 α0 (t1 )ψ(t1 )
Time evolution of an individual system is described by repeated appli-
cation of the above algorithm, using its output as the input for each next
step. If we want to study time evolution in a given interval [tin , tf in ], then
we apply the algorithm by starting with t0 = tin , repeating it until we reach
t = tf in somewhere in the middle of the propagation in step 2). Then we
normalize the resulting state.
According to the theory developed in [Davis (1993)] the jump pro-
cess is an inhomogeneous Poisson process with intensity function λα (t) =
(ψ(t), Λα (t)ψ(t)). One way to simulate such a process is to move forward
in time by small time intervals Δt, and make independent decisions for
jumping with probability λα (t)Δt. This leads to the probability p of the
first jump to occur in the time interval (t0 , t) given by
t
p = 1 − exp(− λα (s)ds). (4.47)
t0
By using the identity
t
f˙(s)
log f (t) − log f (t0 ) = ds,
t0 f (s)
2 Note that, as can be seen from the equation Eq. (4.47), the norm of ψ(t) is a mono-
tonically decreasing function of t.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 258/4
.
with f (s) = ||ψα (t)||2 , it is easy to see that
p = 1 − ψα (t)2 , (4.48)
which may sometimes to simplify computer simulations — as we did in the
step 2) above. This observation also throws some new light upon those
approaches to the quantum mechanical description of particle decays that
were based on non-unitary evolution.
By repeating the above event generating algorithm many times, always
starting with the same state at the same initial time t0 , and ending it at
the same final time t, we will arrive at different final states with different
probabilities.
Let α0 , ψα0 , t0 be the initial state, and let μ(α0 , ψα0 , t0 ; α, ψα , t) be the
probability density of arriving at the state (α, ψα ) at time t. We may
associate with this probability distribution a family of density matrices:
ρα (t) = μ(α0 , ψα0 , t0 ; α, ψα , t)|ψα >< ψα |dψα , (4.49)
so that α Tr ρα (t) = 1. This association is many to one. We lose in this
way information. Nevertheless, as shown in [Jadczyk et al. (1996)], the
following theorem holds:
Theorem 4.2. The family ρα (t) satisfies the Liouville linear differential
equation Eq. (4.41). Conversely, the PDP process with values in the pure
states α, ψα described above is the unique one leading to Eq. (4.41).
The Liouville equation Eq. (4.41) describes the time evolution of the sta-
tistical states of the total system. This is the standard, linear, Master
Equation of statistical quantum physics, an equation that describes infi-
nite statistical ensembles, not individual systems. Although the theorem
quoted above tells us that the event generating algorithm follows essentially
uniquely from the Liouville equation, we believe that it is the PDP process
rather than the statistical description that will lead to future generaliza-
tions and extensions of the applicability of quantum theory.3
For instance, in the above formalism it is assumed that the operators gαβ
are linear. But they do not have to be. The operators gαβ represent cou-
plings between the quantum system and a classical ‘detector pointer’, and
jumps represent ‘events’ i.e. changes of the pointer state. The formalism
has been, in particular, applied to the calculation of arrival times [Blanchard
3 Individual description gives us a deeper insight into the real mechanism, and also is
closer to reality, where some experiments can be repeated only a few times, or even only
once, as it is with the Universe between Big Bang and Big Crunch.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 259/4
and Jadczyk (1966)] and tunneling times for quantum particles tunneling
through a potential barrier [Palao et al. (1997); Muga et al. (2002a)], to the
calculation of relativistic time of arrival [Ruschhaupt (2002a,b)], and also
for studying classical interventions in quantum systems [Peres (2000)].
In fact not only in the pilot wave picture, but in the whole quantum theory
as it is being taught, the wave function itself is “the hidden variable”. It
lives in a world that is not ours, in some infinite dimensional Hilbert space,
or in some abstract “space of quantum states” or “complex probability
amplitudes”.
Ghirardi, Rimini and Weber (as well as almost all other physicists work-
ing in this direction) did not pay any attention to this fact. Later on
Roderich Tumulka [Tumulka (2006)] (cf. also [Allori et al. (2012); Covan
and Tumulka (2013)]) understood that something is rotten in the Kingdom
of Dynamical Reduction Models and proposed, what he has called “the flash
ontology”. Yet he stopped half-way admitting that there must be some-
thing that is “real” — he called it “flashes”, but he did not dare to come
to the logical conclusion that these “flashes” are nothing else but “events”
that can have their own dynamics, dynamics that can be formulated in the
everyday language of “classical physics” and, this way, bring new insights
into the whole structure of theoretical physics and its relation to the world
as we perceive it and try to describe.
Although this will be out of synch with the true historical development,
we will describe the GRW theory as a particular case of EEQT. This has
the advantage that what is hidden within the old GRW or the newer “flash”
ontology, will be made clear and explicit.
Another advantage is that the non-uniqueness of the jump process of the
GRW theory (that was sometimes noted and criticised) is gone — within
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 261/4
EEQT the algorithm for the piecewise deterministic evolution of the wave
function uniquely follows from the Master Equation for the density matrix
of the total system.
In order to make the derivation of GRW from EEQT as simple as pos-
sible let us restrict ourselves to the case when space is discrete and even
finite. The formulas derived under these assumptions can be easily gener-
alize to the case of a continuous space, though the rigorous mathematics,
here and there, is more complicated in the continuous case. The continuous
case is discussed in more detail in [Jadczyk (1995b)], though even there not
to a satisfactory end. For instance “continuous tensor products” of Hilbert
spaces are mentioned in [Jadczyk (1995b)], but the work in this direction is
still to be done. We will touch this problem again at the end of this section.
Consider a quantum particle and a finite number N of detectors at
positions ri ∈ Rn , i = 1, .., N. Each detector is described by a function
gi (x). It should be noticed at this point that although in our derivation of
the GRW model we will assume that the functions gi are Gaussian, in fact,
that they all have the same shape
gi (r) = g(r − ri ), (4.50)
there is no need for the functions gi to be positive, or even real, and they
do not need to be (square) integrable. For instance, we could choose, in a
compact version of the GRW model (where space is the sphere S 3 instead
of non-compact R3 ), the function g to be a function of Airy type (cf. eg.
[Fernandez and Varadarajan (2008)]). What we need is that squares of the
absolute values of the functions gi form a“partition of unity”, that is:
gi (r)∗ gi (r) = λ, (4.51)
where λ is a positive constant, thus it does not depend on r.
The constant λ will be later on interpreted as the “reduction” rate. In
the GRW model it is assumed that λ is a universal physical constant, and
that its value is about:
λ ≈ 10−16 s−1 . (4.52)
We have now a quantum system (one “quantum particle”), and a classical
system — N detectors. We assume that each detector can be in one of the
two possible states: 0 or 1. We will furthermore assume that originally all
detectors are in the state 0. Then, with time, some of them one by one, can
flip their state from 0 to 1 or from 1 to 0. Such a change will constitute an
“event” — the “detection of the particle”.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 262/4
The actual state of the classical system (of N detectors) can be therefore
identified with a sequence consisting of N zeros or ones. We have therefore
2N possible states. Let us denote by S the set of all these states:
S = 2N . (4.53)
N
2
Tr ρα = 1. (4.54)
α=1
Since at the end we are going to assume that detectors are uniformly dis-
tributed all over the space, we assume that all Hα are identical: Hα = H
for all α ∈ S. The Hamiltonian H will be responsible for the evolution
of the wave packets between detecting events. The events themselves will
consist of flipping the state of one of the detectors from 0 to 1 or from 1
to 0.
There is a small difference here between the GRW type model and the
particle track modeling scheme. If we want to model the particle track (in a
nuclear emulsion or in a cloud chamber), we assume that the detectors can
only change their state from, say, 0 to 1. After such a change the detector
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 263/4
is not active anymore. In the continuous limit such a change in the GRW
modeling scheme is of no importance, because just one point is of measure
zero in the continuum. But for a finite number of detectors the two schemes
would show a difference.
According to the general scheme of EEQT we need a family gαβ of op-
erators that implement quantum jumps when the classical system changes
its state from β to α. So, we take:
if α differs from β just in one place — the ith place. Otherwise we set gαβ
to zero. Here ĝ is the multiplication operator:
We then have
N
∗
Λα = gαβ gαβ = gi2 = λ, α = 1, ..., 2N . (4.57)
β i=1
Remark 4.2. We have seen that for N detectors we have 2N states of the
classical system. When we go to the continuum limit, we will have to deal
with a classical system of an enormous set of states — which will lead,
mathematically, to the advanced theory of continuous tensor products (cf.
e.g. [Napiorkowski (1971); Arveson (2003)] and references therein), with
possible different phases of the medium and phase transitions. Such effects
may be important for cosmology.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 264/4
A(Δ × R1 ) = E Q (Δ),
A(R1 × Δ) = E P (Δ),
for Δ ⊂ B(R1 ). However, that does not mean that quantum me-
chanics excludes the possibility of a simultaneous measurement of
P and Q. In experimental technique we are dealing with a simulta-
neous measurement of the momentum and position. For instance,
we observe a particle in a Wilson chamber. From the observation
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 267/4
modeling detectors with sensitivity dependent not only on particle’s location but also on
its energy, or momentum, or spin, is not a problem within EEQT.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 270/4
In the sharp detection limit of σ → 0, when gt2 (x) → κ δ(x − a(t)), we get
p ≈ κ|ψ0 (a(t0 ))|2 Δt.
Thus, when Δt << 1/κ, we approximately recover the usual Born in-
terpretation, with the evident and necessary correction that the probability
of detection is proportional to the length of exposure time of the detector.
These words, written more than twenty years ago, suggested that one should
expect chaotic behavior, and that this chaos and its characteristics ought
to be studied, both theoretically and experimentally. Yet, for some reason,
either no one noticed, or no one was interested in looking into the problem
quantitatively.
Of course the main theoretical obstacle was the unsolved quantum-
mechanical measurement problem. A good, critical, discussion of the issues
involved here, can be found in [Landsman (1995)]. In the abstract of his
paper Landsman states:
he does a pretty good job in taking apart different approaches and in ana-
lyzing their weaknesses.
model — technically almost trivial, and yet demonstrating well the main
idea.
The simplest, nontrivial “space” has just two points, we will denote
them ‘-1’ and ‘1’. The “translation group” which operates on these two
points will have two elements: the identity element and the “flip” that
exchanges these two points. We realize this simple “imprimitivity system”5
in a two-dimensional Hilbert space H = C2 .
With Pauli’s matrices s1 , s2 , s3 defined in Eq. (2.76), p. 51 we represent
the ‘position operator’ by s3 , and the ‘momentum operator’ by s1 . Note
that in our case s1 represents the unitary ‘flip’, while (I + s1 )/2 represents
the ‘momentum’.
For symmetry we will use four detectors, two for detecting the position
eigenvalues q = −1 and q = +1, and two for detecting the momentum
eigenvalues p = 0 and p = +1.
Formally, this is a particular case of a more general situation, when we
model a monitoring of several non-commuting spin projections, therefore
let us discuss this more general situation. As with the simple choice above,
with four detectors, we may consider a simple, highly symmetric geometric
pattern, so that the fractal and self-similarity effect are easily recognizable.
Our quantum system will be therefore a single spin 1/2, with no spatial
degrees of freedom.
In order to construct a model within the framework of EEQT we need
to specify the classical system, its states, and the operations implementing
transitions between the states. Thus we will have a family of n detec-
tors, each of them can be excited independently of the others, so that the
probability of two detectors being excited at the same time is zero.
Therefore a state of the classical system will be a sequence of n numbers,
each number being 0 or 1. There are 2n of such states, and a possible change
of state consists of adding 1 mod 2 at i-th place.
For instance, if we have three detectors, a possible transition between
states can be α = (1, 0, 1) −→ β = (0, 0, 1) — a flip of the first detector.
Only one detector can flip at a time.
As for the spin system, we will identify the Hilbert spaces Hα ≡ H ≡
C2 , α = 1, . . . , 2n , corresponding to different states of the classical subsys-
tem. In this way the total algebra A will be represented as a tensor product
A = Aq ⊗ Ac of its quantum and classical parts.
5 An imprimitivity system consists of a spectral measure, and covariantly acting on this
Fig. 4.12 One frame from the computer simulation of particle track formation according
to the EEQT model. Part of the wave function gets reflected from one of the detectors
and starts moving back.
We will describe now a sample path of the process. Let us first dis-
cuss the algebraic operation that is associated with each quantum jump.
Suppose before the jump the state of the quantum system is described by
a projection operator P (r), r being a unit vector (spin direction) on the
sphere. That is, suppose, before one the detectors flip, the spin “has” the
direction r. Now, suppose that the detector P (n, ) flips, and the spin right
after the flip has some other direction, r . What is the relation between r
and r ?
We know the answer from, for instance, Eq. (3.120):
(1 − 2 )r + 2(1 + (n · r))n
r = , (4.68)
1 + 2 + 2(n · r)
where (n · r) denotes the scalar product,
n · r = n1 r1 + n2 r2 + n3 r3 . (4.69)
According to EEQT the probabilities pi are computed from the formula
Eq. (4.42) which, in our case, translates to
1 + 2 + 2(ni · r)
pi = . (4.70)
N (1 + 2 )
N N
Notice that, owing to the fact that k=1 n[k] = 0, we have i=1 pi = 1, as
it should be. Assume that at time t = 0 the quantum system is in the state
r(0) ∈ S 2 (we identify here the space of pure states of the quantum system
with a two-dimensional sphere S 2 with radius 1). Under time evolution it
evolves to the state r(t) which is given by the rotation of r(0) with respect
to the z-axis. Then, at time t1 a jump occurs. The time rate of jumps is
governed by a homogeneous Poisson process with rate constant κ. When
jumping r(t) moves to
(1 − 2 )r(t) + 2(1 + r(t) · ni )ni
ri =
1 + 2 + 2r(t) · ni
with probability
1 + 2 + 2r(t) · ni
pi (r(t)) = ,
4(1 + 2 )
and the process starts again.
The resulting fractal pattern in the case of six detectors placed at the
vertices of the regular octahedron, with no external magnetic field, are
shown in Fig. 3.46. If there is an external magnetic field, the state will
rotate between jumps by Poisson distributed random angle. As the result
the fractal pattern will become fuzzy. The resulting fuzziness depends then
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 277/4
on the rotation speed and on the value of the constant κ that determines
the length of the random intervals between jump. If we set rotation speed
ω = 1, and κ = 100, we obtain a fuzzy version of Fig. 3.46 obtained from
the modified algorithm of Sec. 3.1, namely Fig. 4.13.
Removing two vertices of the octahedron we get four points that repre-
sent our ‘position-momentum’ simultaneous measurement toy model. Since
the four remaining vertices are in a plane (we choose the plane x = 0), which
intersects the sphere along a great circle, it is clear that the attractor will
be on this circle, and that the fractal pattern will be, in this case, one-
dimensional. In Fig. 4.14 we show the path to the attractor, starting with
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 278/4
a randomly chosen initial point (left upper corner). The resolution con-
stant chosen , had to be very small, = 0.0045, since otherwise the state
reaches the attractor set on the circle in just few steps. With a much higher
resolution ( = 0.7) the Cantor set-like fractal structure on the circle can
be seen. Figure 4.15 shows one million jumps, first the whole picture, and
then ×1000 zoom into the fractal attractor set.
Fig. 4.15 Quantum Square. First 200 steps of the random walk. The square is located
on the plane perpendicular to the viewing plane. One of the four vertices is in the center
in front.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 279/4
Yet there are various degrees of being real. For instance it is better when
the strength and the frequency of kicking back depends on how we kick.
Otherwise reality can be quite dull.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 280/4
So, are quantum fractals real? As far as we know, we do not have a direct
access to the reality of quantum waves. We can model them mathematically,
but they seem to be living outside of space and time. Nevertheless we can
try to kick them, and see if they kick back. We can try to kick them one
way or another, and see if the response, if any, changes according to our
predictions. If it does, we can learn how to associate our mathematical
models with experimental arrangements. However, since we are in the
quantum domain, we need statistics.
Quantum fractals are real if we can detect them. But detecting is not
enough. A higher degree of reality can be acquired by objects that we can
produce, manipulate, and examine the results of these manipulations. So,
are quantum fractals real, and if so, to what extent?
Quantum fractals are patterns on the state space. These patterns are
made of pure states. Let us take a simple example: the classical die — see
Fig. 4.16. The die has six faces. The sums of the numbers of dots on the
opposite sides of a standard die are all equal to seven. The quantum spin
1/2 is similar, except that instead of six faces it has infinitely many faces.
It is a sphere rather than a cube! Each point on the sphere represents
one face — the spin direction. One face of the classical die is marked
with a number of dots. Each face of the quantum spin die is marked with
three real numbers nx , ny , nz — the three coordinates of a unit vector n
— the direction of the spin. Its opposite face is marked with the vector
n. A pure state of the standard die is one of the six numbers 1, 2, ..., 6,
n
−n
n
−n
Fig. 4.17 Quantum spin die. Four pure spin states (“faces”) are drawn here. Face −n
is opposite to n, face −n is opposite to n . For simplicity the circle is drawn instead of
the sphere.
as in Fig. 4.16. A pure state of the quantum spin die is the unit vector
(direction in three dimensional space) n, as in Fig. 4.17. When we shake
the die in our hands and then toss and let it roll across the table, the
result is unpredictable. If the die is not biased, each face can come with
equal probability 1/6 We start with a pure state, say 6 at the top, and
end with a mixed state: each of the six numbers with probability 1/6. In
the case of the classical die this final state is independent of the starting
state. Let us try to make an analogy, this time with the quantum spin
die. Suppose that the initial spin direction n0 is fixed by an appropriate
preparation procedure and that after that there are no forces (thus no
magnetic field) that would force this direction to precess or to change the
initial direction. After that we do not have to “shake” and toss. Just
“looking” at it “shakes” the quantum spin die. Using quantum physics
terminology we “perform spin direction measurement”. Suppose we do not
know the initial spin state. Then a typical elementary spin measurement
answers the following alternative: is the spin direction oriented along a
given direction n? Or is it oriented in the opposite direction −n? According
to the simplest and standard quantum mechanical interpretation, if the
answer was “yes” to the question “is the spin direction oriented along a
given direction n?” right after the measurement the spin is indeed aligned
with n direction. All that assuming that we can measure the spin direction
sharply. In reality there are no sharp measurements. Every measurement in
the laboratory is to some extend smeared up, fuzzy. Therefore the simplest
algorithm needs to be adjusted in order to allow for fuzzy determinations
of the spin direction. To this end we introduce the fuzzy spin direction
operators P (n, k), 0 < k < 1. For k → 1 we obtain the standard sharp
spin measurement operator, while for k → 0 no information about the
June 12, 2014 16:56 World Scientific Book - 9in x 6in QuantumFractals3 pg. 282/4
9
3 1
4 10 8 0
5 7
11
Fig. 4.18 Are quantum fractals real? Proposed experiment: Eight weak detectors acting
as monitors. Four strong detectors interacting with the quantum spin system.
t = 0, β = 0.7
log 10 of bin counts
Angle
the circle — the result of the computer simulation for this particular case
are shown in Fig. 4.20. In fact, as we will describe it in the sequel, we will
be playing with some variations of the linear (in cos(φ) = n · r) formula by
deforming it to
pβ (r) = const (1 + k 2 + 2k cos(n, r))β . (4.73)
The resulting fractal measure for unorthodox β = 0.7 is almost indistin-
guishable from the orthodox one, β = 1.0 — see Fig. 4.20. For the moment
we are interested in the case where only the eight monitoring detectors are
turned on. This corresponds to the value t = 0 of the parameter t repre-
senting the relative sensitivity of the main four (inner) detectors and the
monitoring eight (external) detectors. In the next step we will turn the four
inner detectors on and we will let them be t = 1000 times more sensitive
than the monitors. The fact that the fractal measures for β = 1.0 and
β = 0.7 show essentially the same pattern can be understood by comparing
the corresponding probability functions — see Fig. 4.21.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 285/4
β
p(φ) = 1 + k2 + 2k cos(φ)
4.0
3.5
3.0
2.5
2.0
p
1.5
1.0 β = 1
β = 0.75
0.5 β = 0.5
β = 0.25
0.0
0 π/4 π/2 3π/4 π 5π/4 3π/2 7π/4 2π
φ
When only the detectors 1–7 are on, the detectors count in a random
way — according to the EEQT algorithm. That is all that we can see
— we can only register detector’s counts, we can’t see the fractal that is
made of jumping quantum spin states. Owing to the symmetry of the
arrangement we expect that, on average, each of the detectors will register
the same number of counts, therefore no useful information can be obtained
by these simple counts. As can be seen in Fig. 4.22 simple counts give slight
variations (within two standard deviations) from the average — as can be
expected from the symmetry of the detectors geometrical configuration.
Instead of just analyzing the counting statistics of each counter separately,
we could also analyze the statistics of consecutive pairs (i, j). We will do it
in the next step, but only after we turn on the four primary detectors, so
that we can compare the results with the primary detectors 8, ..., 11 turned
off and on.
When the four primary spin direction detectors 0, ..., 3 are turned on,
they also start causing the spin state to jump. In the simulation they are
strongly coupled to the spin, so that, on average, they act t = 1000 more
often than the monitoring weakly coupled detectors. The theoretical fractal
pattern of spin states on the circle changes — see Fig. 4.23. We can see
now all four strong peaks. Notice that the vertical axis is in a logarithmic
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 286/4
t = 0, β = 1.0
2σ
−σ
−2σ
t = 0, β = 0.7
2σ
−σ
−2σ
Fig. 4.22 Monitors counting statistics with the primary system disconnected.
scale. The main question concerning our issue of reality of quantum fractals
becomes: will the monitoring detectors be able to “feel” the action of the
primary detectors? It is the primary detectors that are mainly responsible
for the fractal pattern. Can these strongly coupled detectors be detected
by the system of weakly coupled monitors interacting with the spin sys-
tem? Let us first look at the statistics of pairs of consecutive counts of
the monitoring system — Fig. 4.24. When all twelve detectors are turned
on, then the events registered by monitoring detectors are interspersed by
(on average) 1000 events registered by the primary counters. Neverthe-
less, once in a while, there will be two events registered one immediately
after another by the weakly coupled counters. The analysis of such pairs
is shown in Fig. 4.24. We can see that the very presence of strongly cou-
pled detectors disturbs the original pattern of pairs. That is, even with the
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 287/4
t = 1000, β = 0.7
log 10 of bin counts
Angle
Fig. 4.23 Circle fractal measure for the joint system: four primary and eight secondary
detectors.
t = 0, β = 1.0
σ = 1240.2
t = 1000, β = 1.0
2σ
−σ
−2σ
i×j
about the quantum system at all! But this is too crude an observation. We
may want to understand the details — how does it happen? When both
systems, the primary and the monitoring one, are turned on, the quantum
state starts jumping and most of the time it will be close to the position of
one of the four primary detectors. Therefore, we may expect, that the four
monitoring detectors located at the same positions as the primary ones will
count more often than those positioned in between the primary ones. Yet
this is not what happens, and that is because of the particular linear prob-
ability law. Let μ(x) denote the density of the fractal measure depicted
in Fig. 4.20. Owing to the symmetry of the pattern the moments of this
probability distribution are zero:
x μ(x) = 0,
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 289/4
that is:
2π 2π
μ(φ) cos(φ) = μ(φ) sin(φ) = 0. (4.74)
0 0
Thus we should not expect any difference in the counting rates of even
and odd monitoring counters. The change of the distribution of pairs re-
flects only the disturbance being present, but tells us nothing about the
geometrical configuration of the disturbing primary detectors.
But is quantum theory necessarily linear? Must it be so? And here
we are discussing not just the orthodox quantum mechanics as formulated
axiomatically by a mathematician, John von Neumann. Here we go a bit
beyond the standard quantum mechanical formalism assuming that the
EEQ algorithm is more fundamental than the standard statistical descrip-
tion. Why is it so that the probability formula must be linear (or, in a
formulation with state vectors, bi-linear)? Can it be changed? We know
that while this particular formula reproduces the standard Master Equation
for the density matrix, in other areas where iterated function systems are
studied, as for instance in fractal compression of images, a different formula
is used. If we just change the probability formula in the algorithm, the alge-
braic framework will still be preserved: the linear Schrödinger’s equation for
the evolution of wave packets between jumps will be unchanged; quantum
mechanics will still be mostly linear; only the additional quantum mechan-
ical postulate concerning the probability interpretation would change. We
will probably lose the nice “probability current”, but why should we pay
so much attention to a current that does not really flow? So, here, let
us see what happens if we just deform the linear formula by allowing the
exponent β to oscillate below the standard quantum mechanical value of
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 290/4
β
p(φ) = 1 + k 2 + 2k cos(φ)
Fig. 4.25 Linear and nonlinear probability sums for even and odd counters.
β = 1.0. The probability curves for β = 1.0 and β = 0.7 are shown in
Fig. 4.25. Running the simulation with β = 0.7 we get the statistics of
the monitoring counters shown in Fig. 4.26 Evidently the counting statis-
tics shows now that the four monitoring counters placed at the positions
of primary detectors register significantly more counts (by seven standard
deviations) than the other four placed at the intermediate positions. We
can also see a somewhat better organization of pairs, but the message from
these statistics is not that obvious — see Fig. 4.27. To sum up: While it is
not clear whether within the standard quantum mechanical formalism the
monitoring detectors can detect the geometric configuration of the primary
detectors (though they can detect the disturbance), it is possible to read
such information if the standard quantum mechanical formula for proba-
bilities is slightly deformed. Such a possibility would, of course, change
our estimates of security codes for quantum cryptography. The decisive
role will be played, of course, by experiments. But experiments in this
direction should be performed without prejudices. There may be surprises
there, similar to those found in nuclear decay rate fluctuations [Parkhomov
(2009)]. Checking quantum probability rules in direct measurements may
not be easy. As stated in [Sinha et al. (2010)]:
A double slit experiment could be used to test Born’s rule, but
then one would have to measure the non-zero double slit interfer-
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 291/4
Quantum theory, although created some 100 years ago, only now begins
to bear real fruits. We are entering the age of quantum technological rev-
olution, the results of which we can’t imagine or predict. According to
some experts the Universe is a Quantum Computer [Lloyd (2013b)]. It is
not exactly clear what is meant by this statement since it is accompanied
by another statement: it processes quantum information. The concept of
t = 1000, β = 1.0
2σ
−σ
−2σ
t = 1000, β = 0.7
7σ
2σ
σ
−σ
−2σ
−7σ
Fig. 4.26 Monitors counting statistics with the primary system connected.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 292/4
t = 0, β = 0.7
σ = 1240.2
t = 1000, β = 0.7
2σ
σ
−σ
−2σ
i×j
information is, also, not very clear in itself. Imagine there are no sentient
beings in the Universe — how shall we define “information”? There are
many different mathematical kinds of information, usually they depend on
the concept of “probability”, but is there such a thing as an “objective
probability”? And if there is, does it belong to the quantum universe or
just to “its interpretation”? These questions are usually not confronted
by the enthusiasts of quantum computing. This is understandable because
quantum computing indeed opens the window to new and extremely pow-
erful technologies, therefore it creates new jobs and new perspectives. It
certainly leads us into a whole new world, beyond our imagination. The
limits for quantum computations, as assessed today [Lloyd (2000)] may eas-
ily prove to be unrealistic, one or another way, since “It seems to be as hard
for classical computers to simulate quantum weirdness as it is for human
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 293/4
beings to comprehend it.” [Lloyd (2013a)] Very few authors, taken over by
the quantum excitement, pause to think about the limitations of quantum
theory itself. And even if they do, they do so only on odd days of the week,
forgetting it completely on even days.
Jonathan P. Dowling of Quantum Science & Technology Group and
Hearne Institute of Theoretical Physics at Louisiana State University pre-
dicts that some day, in a not so distant future, perhaps, there will arise a
quantum mind [Dowling (2013b)].
While there is certainly such a possibility, the same author, when in a more
relaxed mode, admits that there are some bizarre things about quantum
theory and relativity that cause him to contemplate the idea that [Dowling
(2013a)]
why would they care at all about matter restricted to just three dimensions of space
and, perhaps, only one dimension of time? Unless it is exactly “time” that they can’t,
in spite of their super-exponential capabilities, fit into their Hilbert space?
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 294/4
are right under our noses? George Francis Rayner Ellis, Emeritus Distin-
guished Professor of Complex Systems in the Department of Mathematics
and Applied Mathematics at the University of Cape Town in South Africa,
in his paper on the limits of quantum theory recognizes the difficulty and
admits [Ellis (2012)]:
Unitary quantum physics is fundamental in that it applies to
everything at a foundational level in the hierarchy of complexity,
except when state vector reduction takes place in consequence of a
process that is yet to be determined.
So, here we have it: there is still the mysterious state vector reduc-
tion. Louisiana State University physicist and NASA Space Act awardee
Jonathan P. Dowling, quoted above, laughs loudly at Roger Penrose with
his ideas of gravity induced wave collapses [Dowling, 2013b, p. 417]:
What is Penrose’s beef with the classical computer? From read-
ing The Emperor’s New Mind, it is difficult to tell as that book is all
over the map. The reader is introduced to a wildly disparate collec-
tion of topics such as Newtonian mechanics, quantum mechanics,
cosmology, and quantum gravity before Penrose attacks the strong
AI hypothesis in the last couple of chapters. No physicist in his
or her right mind would think quantum gravity has anything to do
with human consciousness.
And yet he comes close, though by a different way, to essentially the same
conclusion as Penrose: gravity may be important for understanding some of
the puzzling features of quantum mechanics. The idea is not new. The first
rough formulation belongs probably to a Hungarian physicist F. Karoly-
hazy who suggested that uncertainties of the gravitational field may cause
reduction of wave functions for sufficiently massive bodies. In a 1966 paper,
[Karolyhazy (1966)], he sketched just such a general idea without even using
explicitly the notion of quantum jumps. Twenty years later, F. Karolyhazy,
A. Frenkel and B. Lukacs [Karolyhazy et al. (1986)] suggested a stochas-
tic influence of the gravitational field, based on the ideas by Ph. Pearle
[Pearle (1984)]. Diosi and Lukacs [Diosi and Lukács (1987); Diosi and
Lukacs (1989)] then suggested the need to create a unified theory of New-
tonian Quantum Mechanics and Gravity, while Holba and Lukacs [Holba
and Lukacs (1991)] pointed out the elusive phenomenon of the anomalous
Brownian motion as a possible result of gravity related stochasticity in
quantum wave packet dynamics.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 295/4
Yet there are no convincing reasons why it is gravity and not something
else that participates in the processes of transformation of the quantum
potentiality into classical actuality. Usually it is stated that gravity is a
universal interaction, and quantum wave packet reduction processes seem
to be also a universal phenomenon. Yet such thinking may also distract us
from looking for other reasons. For instance, if the experiments described
by A. G. Parkhomov [Parkhomov (2009)] are to be confirmed in different
experimental environments, then it is, perhaps, another long range weak
interaction, not yet known, that can be responsible for the control and
regulation of quantum randomness and stochasticity. If so, then, while the
standard linear quantum predictive schemes may be perfectly justified for
making predictions about averages, they may be inadequate for other goals
involving one-shot (or several-shots) processes.
Essential nonlinearity of the involved processes may be necessary for
their understanding. Nonlinearity in quantum phenomena is usually dis-
missed by invoking its incompatibility with Einstein’s causality [Gisin
(1989); Polchinski (1991); Czachor (1991)]. These arguments, as is usual
with no-go theories, can be circumvented (for instance, as in [Kent (2005)]).
Nonlinearity in quantum theory would have serious consequences for
quantum cryptography, and also for quantum computation [Abrams and
Lloyd (1998)]. Yet nonlinear deformations of quantum mechanics can have
more than just one form. Usually, when discussing nonlinearity, only a
mild form of Weinberg’s type nonlinearity [Weinberg (1989a,b)] is being in-
voked — nonlinear evolution of pure quantum states (nonlinear Schrödinger
equation) or density matrices (nonlinear Liouville equation).
But there exist other types of nonlinearities. For instance we may keep
the Schrödinger equation linear, but admit some nonlinear “observables”.
This is similar to the type of nonlinearity we have introduced in the section
“Are quantum fractals real?”, where the Schrödinger equation is linear,
but the transition probabilities in jump processes are of the form |(x, y)|2β ,
with β not necessarily being equal to one. This is similar to what we see
in Nature when studying 1/f noise: there are natural phenomena of self-
organized criticality with power spectrum of the type 1/f α , with α near one,
but α = 1 [Bak (1996); Jensen (1988); Buchanan (2000); Milotti (2002)].
Whether such a tweaking of the standard probabilistic interpretation of
quantum theory is of any use can be answered only by experiments, but
before making any experiment at least an outline of a theory should be
available.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 296/
Appendix A
Mathematical Concepts
The spaces Rn and Cn with the standard Euclidean distance function de-
fined as
1/2
n
d(x, y) = |x − y |
i i 2
(A.1)
i=1
An isometry is necessarily 1 − 1.
297
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 298/A
such that
The spaces Rn and Cn equipped with their standard distances are complete
metric spaces. Every closed subset of a complete metric space is a complete
metric space. In particular the cube and the sphere in R3 are complete
metric spaces.
Theorem A.3. Given a metric space (X, d) there exists a complete metric
˜ and an isometry φ from X onto a dense subspace φ(X) of X̃.
space (X̃, d)
˜ is called the completion of (X, d).
The space (X̃, d)
There are other, equivalent definitions of a compact set and compact space,
but this one is probably the one that is most easy to visualize and check in
practical applications. Notice that every closed subset of a compact space
is compact. In Rn a set is compact if and only if it is closed and bounded.
Theorem A.9. Let (X, dX ) and (Y, dY ) be two metric spaces, with X being
compact. Then the following formula defines metric on the space C(X, Y ):
(1) ∅ ∈ Σ and X ∈ Σ
(2) If A is in Σ, then the complement Ac = X \ A of A is in Σ.
(3) A countable union of sets from Σ is in Σ.
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 303/A
In other words: B(X) is the intersection of all σ-algebras that contain all
open sets. This collection is non-empty since 2X is its member. All open
sets and all closed sets are Borel sets. Every continuous mapping from one
metric space to another is Borel-measurable.
A.3.2 Measure
Rn and Cn , endowed with their natural Borel structures and the standard
Lebesgue measure are s-finite.
ν μ,
if, for every A ∈ Σ with μ(A) = 0, we have ν(A) = 0. If μ and ν are two
measures on Σ, and both ν μ and μ ν hold, we say that μ and ν are
equivalent and write μ ∼= ν.
A.3.3 Integral
A.3.4 Lp spaces
and the space L (μ) as consisting of all functions f for which ||f ||p is finite.
p
Theorem A.12. For every 1 ≤ p < ∞, Lp (μ), is a vector space. ||f ||p is
norm on Lp (μ). Lp (μ) equipped with its norm is a Banach space.
Theorem A.14. Hölder inequality Assume 1 < p < ∞ and q < q < ∞
are dual to each other.If f ∈ Lp (μ), g ∈ Lq (μ) then f g ∈ L1 (μ) and
||f g||1 ≤ ||f ||p ||g||q . (A.25)
p q ∞
The spaces L (μ) and L (μ) are dual to each ether. The space L (μ) is
dual to L1 (μ).
The completion of the space C(X) with respect to ||·||1 is denoted L1 (X, μ).
When μ is understood, we write simply L1 (X).
Theorem A.17. The function f → f dμ extends to a unique continuous
function on L1 (X). It is written the same way, as f → f dμ.
i) P f ≥ 0
i) ||P f ||1 = ||f ||1 .
Theorem A.21. [Lasota and Mackey, 1985, p. 42] Let (X, Σ, μ) be a mea-
sure space and let S : X → X be a measurable invertible non-singular
transformation. Let P be the Frobenius-Perron operator on densities asso-
ciated with S. Denote by J −1 the Radon-Nikodym derivative
dμ(S −1 (x))
J −1 (x) = . (A.36)
dμ(x)
Then for every integrable essentially bounded function f ∈ L1 (μ) ∩ L∞ (μ)
we have
(P f )(x) = f (S −1 (x))J −1 (x). (A.37)
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 310/A
Appendix B
It is clear that σ is nonnegative and θ has the sign of u, where the sgn is
defined to be right continuous, that is sgn(0) = 1. The eigenvalues of F
are the zeros of the characteristic polynomial, they are ±σ and ±iθ. The
311
May 29, 2014 10:6 World Scientific Book - 9in x 6in QuantumFractals3 pg. 312/B
matrix groups and their applications‘ by Andrew Baker, Springer 2002, Theorem 2.17,
also available online, the same title and author, Theorem 2.5: http://www.maths.gla.
ac.uk/~ajb/dvi-ps/lie-bern.pdf.
June 12, 2014 16:56 World Scientific Book - 9in x 6in QuantumFractals3 pg. 314/B
Remark B.1. Since we are dealing with commuting matrices, the prob-
lem reduces to a simple commutative symbolic algebra. Using computer
software able to do commutative symbolic operations can therefore save
time.
entail
Tr (Λ(A)) = |Tr (A)|2 . (B.24)
Taking the derivative of Eq. (B.22) we arrive at the linear relation (isomor-
phism) between infinitesimal generators f (traceless 2×2 complex matrices)
from the Lie algebra SL(2, C) to the Lie algebra elements F in SO(3, 1):
1
F μν = Tr (f σ μ σν + σ μ f † σν ). (B.25)
2
With f defined by
1
3
def
f = (ei + ibi)σi (B.26)
2
i=i
def
we arrive at F given by (B.1), while f˜ = −if gives F̃ . The characteristic
polynomial for f is: det(f − λ I) = λ2 − 12 (v + iu), with two roots ±ω.
8 By abuse of notation σ μ constitute exactly the same set matrices. Their
μ and σ
components are σμAB and σμAB , (μ = 1, ..., 4), (A, B = 1, 2).
June 13, 2014 9:0 World Scientific Book - 9in x 6in QuantumFractals3 pg. 315/B
Bibliography
317
June 13, 2014 9:0 World Scientific Book - 9in x 6in QuantumFractals3 pg. 318/4
Balzer, C., Hannemann, T., Reiß, D., Wunderlich, C., Neuhauser, W. and
Toschek, P. E. (2002). A relaxationless demonstration of the quantum zeno
paradox on an individual atom, Optics Communications 211, pp. 235–241.
Barning, F. J. M. (1963). Over Pythagorese en bijna-Pythagorese driehoeken en
een generatieproces met behulp van unimodulaire matrices, Master’s thesis,
Stischting Mathematisch Centrum Amsterdam, URL http://oai.cwi.nl/
oai/asset/7151/7151A.pdf.
Barnsley, M. F. (1988). Fractals Everywhere (Academic Press).
Barnsley, M. F., Demko, S. G., Elton, J. H. and Geronimo, J. S. (1988). Invariant
measures for Markov processes arising from iterated function systems with
place-dependent probabilities, Ann. Inst. H. Poincaré (B) 24, 3, pp. 367–
394.
Barnsley, M. F. and Vince, A. (2011). The chaos game on a general iterated
function system, Ergodic Theory and Dynamical Systems 31, 04, pp. 1073–
1079.
Bell, J. (1980). de Broglie-Bohm, delayed-choice double-slit experiment, and den-
sity matrix, Int. J. Quant. Chem. 14, pp. 155–159.
Bell, J. (1982). On the impossible pilot wave, Found. Phys. 12, pp. 989–999.
Bell, J. (1987a). Beables for quantum theory, in Speakable and Unspeakable in
Quantum Mechanics (Cambridge University Press), pp. 173–180.
Bell, J. (1987b). Six possible worlds of quantum mechanics, in Speakable and Un-
speakable in Quantum Mechanics (Cambridge University Press), pp. 181–
195.
Bell, J. (1989). Towards an exact quantum mechanics, in Themes in Contempo-
rary Physics II. Essays in honor of Julian Schwinger’s 70th birthday (World
Scientific), pp. 1–26.
Bell, J. (1990). Against measurement, Physics World August, pp. 33–40.
Bell, J. S. (2004). Speakable and Unspeakable in Quantum Mechanics, 2nd edn.
(Cambridge University Press).
Blanchard, P. and Jadczyk, A. (1966). Time of events in quantum theory, Helv.
Phys. Acta 69, pp. 613–635.
Blanchard, P. and Jadczyk, A. (1993). On the interaction between classical and
quantum systems, Phys. Lett. A 175, pp. 157–164.
Blanchard, P. and Jadczyk, A. (1994). How and when quantum phenomena be-
come real, in Z. Haba et al. (eds.), Stochasticity and Quantum Chaos, Vol.
Proc. Third Max Born Symp., Stochasticity and Quantum Chaos (Kluver),
pp. 13–31.
Blanchard, P. and Jadczyk, A. (1997). Time of arrival in event enhanced quantum
theory, in H. D. Doebner, P. Nattermann, and W. Scherer (eds.), GROUP
21: Proceedings of the XXI International Colloquium on Group Theoretical
Methods in Physics, Vol. 1 (World Scientific), pp. 314–320.
Blanchard, P., Jadczyk, A. and Olkiewicz, R. (2001). Completely mixing quantum
open systems and quantum fractals, Physica D: Nonlinear Phenomena 148,
3–4, pp. 227–241.
Blanchard, P. and Olkiewicz, R. (1999a). Interacting quantum and classical con-
tinuous systems I. The piecewise deterministic dynamics, J. Stat. Phys. 94,
p. 913.
June 13, 2014 9:0 World Scientific Book - 9in x 6in QuantumFractals3 pg. 319/4
Bibliography 319
Bibliography 321
Bibliography 323
Ogborn, J., Collins, S. and Brown, M. (2003b). Randomness at the root of things
1: Random walks, Physics Education 38, pp. 391–397.
Olkhovsky, V. S. (2009). Time as a quantum observable, canonically conjugated
to energy, and foundations of self-consistent time analysis of quantum pro-
cesses, Advances in Mathematical Physics 2009, p. 83.
Olkiewicz, R. (1997). Some mathematical problems related to classical-quantum
interactions, Rev. Math. Phys. 9, p. 719.
Olkiewicz, R. (1999). Dynamical semigroups for interacting quantum and classical
systems, J. Math. Phys. 40, p. 1300.
Ozawa, M. (2001). Controlling quantum state reduction, Phys. Lett. A 282, p.
336.
Ozawa, M. (2002). Position measuring interactions and the Heisenberg uncer-
tainty principle, Phys. Lett. A 299, p. 1.
Ozawa, M. (2003). Universally valid reformulation of the Heisenberg uncertainty
principle on noise and disturbance in measurement, Phys. Rev. A 67,
p. 042105.
Ozawa, M. (2004a). Uncertainty principle for conservative measurement and com-
puting, URL http://arxiv.org/abs/quant-ph/0310071v1.
Ozawa, M. (2004b). Uncertainty relations for joint measurements of noncommut-
ing observables, Phys. Lett. A 320, pp. 367–374.
Palao, J. P., Muga, J. G. and Jadczyk, A. (1997). Barrier traversal times using a
phenomenological track formation model, Phys. Lett. A 233, pp. 227–232.
Palmer, J. (2012). Heisenberg uncertainty principle stressed in new test,
BBC News, Science & Environment, URL http://www.bbc.co.uk/news/
science-environment-19489385.
Parkhomov, A. G. (2006). Tri tipa izmenchivosti hoda razlichnyh processov, URL
http://www.chronos.msu.ru/RREPORTS/
parhomov_tritipaizmenchivosti.pdf.
Parkhomov, A. G. (2009). Upravljaemyj haos, in Materialy konferencii “Tor-
sionnye polja i informacionnye vzaimodejstvija - 2009, pp. 259–265, URL
http://www.second-physics.ru/sochi2009/pdf/p259-265.pdf.
Parkhomov, A. G. (2010). Periodic changes in beta decay rates, URL http:
//www.chronos.msu.ru/EREPORTS/PeriodicEng.pdf.
Pearle, P. (1984). Experimental tests of dynamical state-vector reduction, Phys-
ical Review D 29, 2, pp. 235–240.
Peitgen, H. O., Hartmut, J. and Saupe, D. (1992). Chaos and Fractals. New
frontiers of science (Springer).
Penrose, R. and Rindler, W. (1986). Spinors and Space-Time, Vol. 2 (Cambridge).
Peres, A. (1993). Quantum Theory: Concepts and methods (Kluwer).
Peres, A. (2000). Classical interventions in quantum systems, Phys. Rev. A 61,
p. 022117.
Pironio, S., Acin, A., Massar, R., Giroday, A. B. D. L., Matsukevich, D. N.,
Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T. A. and Monroe,
C. (2010). Random numbers certified by Bell’s theorem, Nature 464, pp.
1021–1024.
June 13, 2014 9:0 World Scientific Book - 9in x 6in QuantumFractals3 pg. 325/4
Bibliography 325
Bibliography 327
Index
329
June 13, 2014 9:0 World Scientific Book - 9in x 6in QuantumFractals3 pg. 330/4
Index 331
Index 333
Index 335
fractal, 1, 4, 9, 11, 15, 17, 18, 30, 32, fundamental physics, 241
285 fuzzy projection, see projection, fuzzy
3D, 18, 68, 109
analysis of Saturn’s rings, 12 γ ray microscope, 229, 268
antenna, 9, 10 gauge
attractor, 254, 278 invariance, 66
behavior transformation, 61
control of, 167–171 gauge symmetry, 240
community, 203 Gaussian distribution, 219
compression, 289 Gaussian function, 261, 269, 275
dimension, see dimension, fractal, Gaussian integers, 33
168, 169 Gaussian packet, 239
effect, 273 Gedankexperimente, 229
image, 17 Geiger counter, 215, 225
industry, 4 Gelfand triples, 242
measure, 168, 169, 284, 287, 288 generalized Pythagorean quadruples,
circle, 284 102, 103
pattern, 6, 8, 37, 133, 267, 276, geometric interpretation, 60, 61
277, 285–287 Ghirardi-Rimini-Weber model, 3, 227,
properties, 195, 249 232, 259–263, 269, 270
quantum, 2–6, 8, 11, 13, 18, 19, 25, Gilbert, J. E., 186
29–31, 46, 47, 53, 55, 66–68, God, 11
109, 171, 173, 196, 254, 279, Gödel’s incompleteness theorem, 216
280, 282, 286 Golden Ratio, 33, 34
algorithms, 7 Goldstein, S., 237
higher dimensional, 68, 171 Good, I. J., 9
hyperbolic, 109–167 Góra, P., 117
parabolic, see parabolic Gorini, V., 254
quantum fractal GPQ, see generalized Pythagorean
set, 115 quadruple
structure, 278 Grabowski, M., 271
true, 9 Grassberger, P., 168
fractal-like patterns, 167, 282, 296 gravitational field, 263, 294
fractional linear transformation, 110, gravity, 67, 294, 295
111 quantum, 293, 294
Frenkel, A., 294 greatest common divisor, 104
frequencies of pairs, 39–41, 42 group
Frobenius-Perron operator, 22–25, O(2, 1), 111
115–117, 120, 121, 122, 125, SL(2, C), 32, 48–50, 67, 70, 110,
127–129, 195–199, 201, 208, 209, 314
308–310 action on S 2 , 50–55
band structure, 26 SL(2, R), 97
eigenvector, 27 SO(3, 1), 45
fixed point, 121, 123, 124 SO+ (3, 1), 85
function, measurable, see measurable, SU (2), 31, 32, 49, 55, 80, 81, 85,
function 86, 91, 95, 186
June 13, 2014 9:0 World Scientific Book - 9in x 6in QuantumFractals3 pg. 336/4
Index 337
Index 339
Index 341
Index 343
Index 345