Linear operators and the spaces on which they act can in general be represented by matrices and vectors, respectively. Having constructed the Laplacian operator both on finite lattices and in the continuum limit, we will now show how to represent it in matrix form on finite lattices. We will have in this way a very concrete representation both of the operators and of the vectors that constitute the space on which they act. This representation is very useful as a concrete mental image of the objects under study, as well as a computational tool, which can be used to good advantage in the context of the stochastic methods which constitute the main calculational approach to the quantum theory.
In order to do this we will introduce and develop to some extent the
concept of the space of field configurations, which will be of great
importance for the quantum theory. The space of configurations, as
previously defined, is the space of all possible field-functions on the
lattice. This is in fact a different space for each lattice size, so we
are actually talking here of a set or sequence of spaces. For a real
field with a single component on a lattice of sites in
dimensions this space is
.
For simplicity we will do the construction for the case of periodical
boundary conditions. We shall start with the case , which is very
simple. In this case we can represent each configuration of the field by
the collection of its values at the sites along the lattice, in the order
in which they appear on the linear chain defined by it,
Any function defined on the lattice can be represented by a vector like
this one, with absolutely no additional restriction imposed on the nature
of the functions. The components of the vector are the
values assumed by the function on the
sites existent on the lattice.
In this simple case the index
of the vector that represents the field
is simply the integer coordinate
of the one-dimensional lattice.
Further along the development of the theory one may have scalar fields
with more than a single component, that is, vectors
in some internal symmetry space of the fields, but one
may still use this kind of representation for the fields in the space of
configurations. One will simply have several vectors like the one
illustrated above, one for each field component in the internal space.
The ideas involved in the representation of the field as a function over
the lattice do not change, the field simply acquires an additional index
that does not mix with those referring to space-time.
Is is not difficult to verify that the Laplacian operator is represented by the following matrix in this space formed by the vectors containing the values of the fields at the sites,
Note that almost all elements are zero, thus indicating the absence of long-range couplings on the lattice. The only non-zero elements are the three central diagonals indicated and the two elements at the corners along the anti-diagonal. These two elements are the ones that establish the periodical boundary conditions. It suffices to apply this matrix to the vector that represents the field to verify that it reproduces the definition of the Laplacian on finite lattices given in (2.1.2).
The same procedure can be realized on lattices with dimensions larger
than , however in this case there is a slight complication because if
the lattice is not one-dimensional then it does not establish a natural
order for the sites. We will establish here a standard order for writing
the components of vectors and matrices in the space of field
configurations, which will also be very useful for computer
simulations. Starting with a two-dimensional lattice with integer
coordinates
, where
,
consider the integer
defined by
Observe that varies from
to
when
and
assume all the possible values, from
to
. The interesting thing is
that this operation is invertible, that is, given a certain value of
between
and
it is possible to determine uniquely the
values of
and
that correspond to it. Hence,
enumerates all the sites in a definite way. This operation, which we call
the indexing of the lattice by the index
, is similar
to the operation of writing integers in the base
. The inversion of
the operation is realized by means of integer division. One can show
(problem 2.4.1) that
where the division is integer division, that is, there is truncation of
the result as is usual in the integer arithmetic of digital computers.
Note that due to this the order of operations is important here. Once
is obtained, we have for
In this way we see that both the pair and the index
determine uniquely a site. We may now use
as the index of
the vector that will represent the field on a two-dimensional lattice,
that is, we may represent the function
by the vector
with components
.
This method can be immediately generalized to any dimension . For
example in three dimensions, with integer coordinates
, the index is given by
and the inversion operations are (problem 2.4.2)
At this point it is already possible to see the pattern and imagine how
to generalize this. In general the index, on a lattice in dimensions
with integer coordinates
, will be given by
where varies from
a
along all the extent of the
lattice and the recursive inversion operations are an immediate
generalization of the relations for the three-dimensional case, given
above. For
we immediately have
and for
we have
, as we may verify by
inspection,
As one can see, the relation between the index and the integer
coordinates is in fact a bijection because, besides defining
from
a set of integer coordinates
, given a value for
we may
also solve for all the coordinates
, dividing
successively by
, so as to recover
each one of the
as the complements of the remainders of the
successive divisions. This is, therefore, an unequivocal way to pile up
all the sites of a
-dimensional lattice into a single vector of size
. The same ordering procedure can and should be used for the
elements of the matrices acting on these vectors.
The linear operators that act on this space are representable, of course,
by matrices, as we saw before for the Laplacian in one
dimension, with periodical boundary conditions. One can verify that the
determinant of that matrix is zero (problem 2.4.3),
which is a consequence of the fact that the operator
has a
null eigenvector, or a zero mode, on the torus. The matrix form of
the operator has a global character, including in its structure the
boundary conditions which are adopted. For example, the Laplacian in one
dimension with fixed boundary conditions, where each integer coordinate
varies from
to
and we have a total of
sites, is
represented by the
matrix
In this case the operator is, in fact, an operator that acts on a space
of dimension with values in a sub-space of dimension
,
since it does not make sense to calculate the Laplacian at the sites of
the fixed border, at which we defined it to act as the identity, in order
to complete the square matrix above. On the other hand, one can verify
(problem 2.4.4) that the determinant of this
matrix is not zero, but
instead, reflecting the fact
that there is no zero-mode for fixed boundary conditions.
Back to the case of periodical boundary conditions, the Euclidean
Klein-Gordon operator
is represented in this
case by the matrix
which has a non-zero determinant so long as the mass is not zero. This
corresponds to the fact that only the theory of the free field with zero mass has a zero mode on the torus and, potentially, problems due to
the occurrence of divergences in the infra-red limit, in which one makes
the size of the box tend to infinity, thus including into the
structure of the models arbitrarily large wavelengths and, therefore,
arbitrarily low frequencies.
Still for periodical boundary conditions, the forward difference operator
has the matrix representation
and the backward difference operator
the
representation
It can be easily verified (problem 2.4.5), in this
one-dimensional case, that they are related to by
In this way the treatment, both of the fields and of the action on them of linear operators such as the Laplacian, can always be reduced in an explicit way to operations with vectors and matrices in a space with a large but finite dimension, the space of field configuration on the lattice. This is specially useful in programs for the execution of stochastic simulations of models in the quantum theory.
in the indicated order, where the division is an integer division, that is, there is truncation of the result as is usually the case in the integer arithmetic of digital computers.