All articles published by MDPI are made immediately available worldwide under an open access license. No special
permission is required to reuse all or part of the article published by MDPI, including figures and tables. For
articles published under an open access Creative Common CC BY license, any part of the article may be reused without
permission provided that the original article is clearly cited. For more information, please refer to
https://www.mdpi.com/openaccess.
Feature papers represent the most advanced research with significant potential for high impact in the field. A Feature
Paper should be a substantial original Article that involves several techniques or approaches, provides an outlook for
future research directions and describes possible research applications.
Feature papers are submitted upon individual invitation or recommendation by the scientific editors and must receive
positive feedback from the reviewers.
Editor’s Choice articles are based on recommendations by the scientific editors of MDPI journals from around the world.
Editors select a small number of articles recently published in the journal that they believe will be particularly
interesting to readers, or important in the respective research area. The aim is to provide a snapshot of some of the
most exciting work published in the various research areas of the journal.
A rigorous implementation of the Wheeler–Dewitt equations was derived in the context of Loop Quantum Gravity (LQG) and was coined Quantum Spin Dynamics (QSD). The Hamiltonian constraint of QSD was criticised as being too local and to prevent “propagation” in canonical LQG. That criticism was based on an algorithm developed for QSD for generating solutions to the Wheeler–DeWitt equations. The fine details of that algorithm could not be worked out because the QSD Hamiltonian constraint makes crucial use of the volume operator, which cannot be diagonalised analytically. In this paper, we consider the U(1) model for Euclidean vacuum LQG which consists of replacing the structure group SU(2) by U(1) and otherwise keeps all properties of the SU(2) theory intact. This enables analytical calculations and the fine details of the algorithm ingto be worked out. By considering one of the simplest possible non-trivial classes of solutions based on very small graphs, we show that (1) an infinite number of solutions ingexist which are (2) generically not normalisable with respect to the inner product on the space of spatially diffeomorphism invariant distributions and (3) generically display propagation. Due to the closeness of the U(1) model to Euclidean LQG, it is extremely likely that all three properties hold also in the SU(2) case and even more so in physical Lorentzian LQG. These arguments can in principle be made water tight using modern numerical (e.g., ML or QC) methods combined with the techniques developed in this paper which we reserve for future work.
One of the most important unsettled research questions in Loop Quantum Gravity (LQG) [1,2,3,4] is the precise implementation of the quantum dynamics, i.e., the quantum Einstein equations or Wheeler–DeWitt equations. A concrete derivation of such equations has been given in [5,6]. It starts from the classical Hamiltonian constraint, which is then discretised in terms of non-Abelian magnetic holonomy and electric flux variables familiar from lattice gauge theory [7], which allow to to define a regularised operator on the dense domain of the kinematical Hilbert space consisting of the span of spin network functions [8,9,10]. The corresponding regulator is essentially the spatial extension of loops associated to vertices and pairs of adjacent edges of the graph on which the operator acts, and the corresponding Wilson loop functions is an approximant to the curvature that appears in the Hamiltonian constraint. It is possible to remove the regulator using an operator topology (coined URST in [5,6]) that exploits the fact that a solution to all quantum constraints must be spatially diffeomorphism invariant and that therefore the subspace of spatially diffeomorphism invariant vectors in the algebraic dual of is naturally available in order to define a kind of weak−topology. An important property of the classical Hamiltonian constraint is that it is a scalar density of weight, one which is kept in the quantum theory and grants the associated covariance conditions.
Thus, ref. [5,6] provides a concrete proposal (modulo the axiom of choice) for the Hamiltonian constraint of vacuum quantum gravity with a Euclidean or Lorentzian signature in the continuum, which is densely defined on . It is free of anomalies in the sense that the action of its commutators on the algebraic dual annihilate spatially diffeomorphism invariant elements. However, the Hamiltonian constraint operator constructed in [5,6] is not yet entirely satisfactory for the following reason: While the dual of its commutators annihilate spatially diffeomorphism invariant distributions and thus must be a linear combination of spatial diffeomorphism constraints [8], that linear combination does not qualify as the linear combination that one would expect from a direct quantisation of the corresponding classical Poisson bracket [11] performed by the same methods. Using the analogy of Lie algebras (or algebroids), the quantum constraint algebra closes, but it closes with the wrong structure constants (or functions), the correct ones representing the hypersurface deformation algebra.
Correspondingly, several methods for improvement have been suggested in the literature. These efforts can be subdivided into two classes: In the first class, the issue of the structure functions is avoided altogether; in the second, the correctness of the structure constants is used as a guiding principle to adjust the fine details of the construction proposed in [5,6]. In historical order, the first class comprises the master constraint approach [12] and the reduced phase space quantisation approach [13], while the second class comprises the electric shift approach [14,15] (see also [16] for a preliminary attempt) and the Hamiltonian renormalisation approaching [17] to both the constraint of [5,6] and the physical Hamiltonian of [13] (see also the references in all four manuscripts). Common to the [5,6,14,15] versions of the Hamiltonian constraint is that the Hamiltonian constraint acts non-trivially only at the vertices of the graph, and its action on a given vertex deforms the graph in an open neighbourhood of that vertex while not modifying the graph in neigbourhoods of the other vertices (in [5,6,14,15], this deformation is encoded by the loop approximant to the curvature that one uses). By contrast, in [12,13,17], such a deformation is not considered, as the loops involved are part of the same lattice on which the graph in question is defined where the lattice plays the role of a resolution scale in the sense of the Wilsonian point of view of renormalisation. At that scale, one computes the matrix elements of the Hamiltonmain (constraint) (the continuum operator is then some kind of inductive limit of these quadratic forms).
In that sense, the criticism conveyed in [18] should apply to the works [5,6,14,15]: the arguments in [18] are based on [19], where an algorithm is sketched for how to construct solutions in the algebraic dual of both the spatial diffeomorphism constraint of [8] and the Hamiltonian constraint of [5,6]. The construction [19] can be sketched as follows: A solution of the spatial diffeomorphism constraint is a linear combination of the diffeomorphism group averagings of spin network functions (SNWF) S (moulo graph symmetries—see [8] for details) which forms an orthonormal basis of the kinematical Hilbert space. Given such an element , one must impose that its evaluation on vanishes for all where is the Hamiltonian constraint with lapse function (smearing function of the Hamiltonian constraint) N and S is any spin network function. Since N can be chosen to be supported only in the vicinity of a vertex v of the graph on which S is supported and since acts non-trivially only at those vertices (with action ), we have equivalently that for all S and all (vertex set of the graph underlying S). Since modifies and the colourings of (by spin quantum numbers on edges and intertwiners at vertices) only in the vicinity of v leaving the rest of S unmodified (modulo diffeomorphisms), the following strategy suggests itself: can be decomposed into SNWF over new graphs . Due to the details of the graph deformations of [5,6] which adds “extraordinary edges”, there are graphs which can never be of the form , and thus, the diffeomorphism group averagings of SNWF over such are exact solutions to all constraint equations. We call these solutions “topological” because they are even normalisable with respect to the inner product on the space of solutions to the spatial diffeomorphism constraint which is not to be expected for generic solutions. To construct more interesting solutions, we are thus led to consider (diffeomorphism averages) of graphs which are of the form ; from those graphs, we generate graphs of the form , and proceeding inductively, we generate graphs of the form . We may develop genealogical language and call graphs of the respective form primordial, descendants of generation n, and children of the parents . To classify solutions of the Hamiltonian constraint, it is therefore useful to keep track of the generation n of a (diffeomorphism average of a) graph descending from a primordial one. Similarly, we have a genealogy of SNWF which is different from that for graphs because also the colourings are involved. No confusion arises if we explicitly say child graph or child SNWF, etc.
A particular feature of the operator [5,6] is that the action of on SNWF over is trivial for and for , it equals the action of on SNWF over (modulo diffeomorphisms). It is precisely this feature which makes the action of anomaly free. Thus, regarding modulo diffeomorphisms, all one needs to know in order to let the Hamiltonian constraint act on a SNWF, when evaluated on a diffeomorphism invariant distribution, is a neigbourhood of S (graph and colourings) of each vertex whose modulo diffeomorphisms can be chosen arbitrarily “small”. For the same reason, it is irrelevant that the axiom of choice is involved in the definition of C because different choices are washed away by the diffeomorphism averaging and the diffeomorphism invariant characteristics do not need the axiom of choice.
As shown in [19], the space of solutions to all constraints for the Euclidean version acquires the following structure1:
i
It is a linear combination of solutions of generation n for Here, a solution of generation n is a linear combination of diffeomorphism averages of SNWF of generation n.
ii
Such a solution of generation n is itself a linear combination of elementary solutions of generation n. An elementary solution of generation n is a linear combination of diffeomorphism averages of SNWF which are the n-th generation children of SNWF with the same primordial parent graph 2 In this paper, as we use the non-symmetric version of the Hamiltonian constraint [5,6], and we take this effect into account when we construct our solutions. We discuss these matters further in Section 3.4.
For the Lorentzian version property, (i) does not hold, as the solutions cannot be built from elementary solutions of constant generation n, necessarily more generations are involved and it cannot be excluded that a non-trivial typical solution is a linear combination of diffeomorphism averages of SNWF of unbounded generation. On the other hand, property (ii) still holds: elementary solutions are built from the same primordial graph.
Now, assume that in addition, the following property also holds [18] (irrespective of considering the Euclidean or Lorentzian version):
iii
For an elementary solution where is of the form and is some descendant of the same primordial graph , the label set L can be partitioned into susbsets with such that the constraint equations resulting from have non-trivial influence only on for .
If this property, which due to the local action of appears to be obvious, would hold, then a local perturbation of the solution, i.e., a variation of the for has no influence on the . That is [18], the conclusion would be that there is no propagation or absence of long-range correlations in the space of solutions to the Hamiltonian constraint of [5,6] in the sense that the structure of the solution at vertex v is local to v and has no effect at any other vertex . Similar remarks would hold for the Hamiltonian constraint of [14,15].
In what follows, we focus on the property of propagation in the context of the constraint action of [5,6]. With regard to propagation in the context of the constraint action of [14,15], we restrict ourselves to a few remarks in Section 3.4, these remarks being indicative of a reasonable expectation that this constraint action does display propagation. A detailed analysis of propagation in the context of the constraint [14,15] is left for future work.
Accordingly, the main purpose of the present paper is twofold:
I
First, we show that assumption (iii) above is generically violated in LQG, independent of the signature. In fact, this was implicitly known since the appearance of [5,6].
II
Second, even if assumption (iii) is violated, the conclusion stated in [18] may still hold, as assumption (iii) is not obviously a necessary condition to hold for the absence of propagation to occur. However, we will show that also the conclusion is extremely likely to be false in LQG independent of the signature.
In that sense, propagation in QSD was present ever since it was proposed.
Let us explain this in more detail:
The mechanism behind the violation of condition (iii) is the diffeomorphism averaging that occurs in the solution to all constraints which prohibits a partition labelled by vertices of the underlying primordial graph as described above and leads to non-unique parentage at the level of diffeomorphism averages of SNWF. The fact that non-unique parentage is the key ingredient for propagation in the context of LQG constraint quantisation methods was first realised in the toy model context of Parameterised Field Theory [21]. In fact, the mechanism of non-unique parentage can also seen to be responsible for the absence of anomalies [5,6] in the sense described above and does not rely on the details of the action of the Hamiltonian constraint.
Still, it may accidently happen that long-range correlations are absent in solutions to the Hamiltonian constraint, and it is here where details matter. The reason why in contrast to (i), we cannot make a statement with certainty in (ii) is due to the fact that the volume operator is a central ingredient of the operators [5,6] whose spectrum cannot be computed analytically. Accordingly, precise computations and estimates are not possible, thus prohibiting explicit solutions. To make progress, in this paper, we consider the model of Euclidean quantum gravity invented in [22] which shares almost all of its features except that the non-Abelian group SU(2) is replaced by U(1). We do this for the sole purpose of being able to compute the corresponding volume spectrum analytically. We are then able, for sufficiently simple primordial graphs, to solve the Hamiltonian constraint equations analytically, thus allowing to compute the linear combinations of diffeomorphism invariant distributions that define the solutions explicitly together with the complete parametrisation of the freedom involved. This parametrisation freedom manifests the presence of long-range correlations or propagation. While the explicit calculations are confined to a particularly simple primordial graph, it follows from the solution-generating technique that we develop that propagation happens also for higher generations and for arbitrarily long iterations and gluings of those simple graphs filling all of a Cauchy surface arbitrarily densely. It will also become clear from the example how to compute the solutions explicitly in the general case. These strong statements can so far not be made within the SU(2) theory due to the complexity of the volume spectrum. However, and this is the sense in which we use the term “extremely likely” above, it is beyond reasonable doubt that the spectrum of the SU(2) volume operator does not conspire in such a way as to render the conclusions derived for the U(1) model invalid. Since the Lorentzian Hamiltonian constraint uses the Euclidean version and multiple commutators thereof with the volume operator [5,6], the same conclusion is extremely likely to hold for Lorentzian LQG.
As a by-product of our computations, we are also able to show that an infinite number of non-trivial solutions exist which are not normalisable with respect to the inner product on the space of spatially diffeomorphism invariant distributions [8]. The possibility of non-existence of non-trivial (i.e., non-topological) or absence of non-normalisable solutions can again not be ruled out for the SU(2) theory of [19] with certainty but is again beyond reasonable doubt.
The lesson learnt from the present work is that, modulo the reservation just spelled out, at least with respect to the existence, normalisability and propagation aspect, the constraint operator [5,6] does not suffer from pathologies, and we expect that modifications thereof that faithfully implement the hypersurface algebra will share this property.
The architecture of this article is as follows:
In Section 2, we recall the essential ingredients of LQG necessary for the understanding of the present work, sketch the structure of the solutions of the Hamiltonian constraint and define the notion of propagation desired of solutions of the Hamiltonian constraint in LQG.
In Section 3, we define the simple primordial graph and its descendants of generation, one for which we perform explicit calculations in the U(1) model of Euclidan LQG. We establish existence, non-normalisability and the presence of long range correlations in its solution space.
In Section 4, we conclude and give an outlook into further study. We state in more detail why these features extend to generic arbitrarily large graphs and are extremely likely to the SU(2) case in both Euclidean and Lorentzian signatures. In particular, we encourage the application of numerical methods in LQG [23,24,25,26] perhaps combined with modern machine learning [27,28] or quantum computing [29,30,31] techniques in order to perform an actual SU(2) calculation involving the SU(2) volume operator at least numerically using the explicitly known matrix elements of its fourth power [32] in order to complete the rigorous proof in the SU(2) theory.
2. LQG, Quantum Einstein Equations and Propagation
We begin by recalling the essential notions from LQG and the corresponding U(1) model. See [5,6] for details on the Hamiltonian constraint, reference [17] for a recent low-technical review of LQG and [33,34,35] for more details on the U(1) model invented in [22]. After that, we review the solution-generating algorithm of [19] and the notion of propagation defined in [18] slightly adapted to our language.
2.1. Essentials from LQG
A closed graph is the union of its semi-analytic [9,10] oriented edges that intersect nowhere except in its endpoints, which are called vertices . Each of its edges e carries a colouring by an irreducible representation of the underlying gauge group G, which is assumed to be compact, that is, a half-integral spin quantum number in case of G = SU(2) and a vector in case of G = U(1). We are interested in solutions to all constraints and thus for reasons of Yang–Mills type of gauge invariance, each vertex v is coloured by an intertwiner that intertwines the tensor product of the represesentations labelling the outgoing edges and the contragredients of the representations labelling the incoming edges with the trivial represention. In case of SU(2), the intertwiners are essentially invariant tensors built from Clebsch–Gordon coefficients, in case of U(1), it is simply a Kronecker symbol that imposes that the sum of incoming charge vectors equals the sum of outgoing charge vectors. A spin network function (SNWF) S is a function of the underlying connection A, which is constructed from the corresponding holonomies along the edges e by plugging them into the matrix element functions of the corresponding irreducible representation and contracting their matrix element indices with the intertwiner indices. They are normalised with respect to the product Haar measure where the number of factors euqals the number of edges. The kinematical Hilbert space can be defined by declaring the SNWF to be an orthonormal basis. For SU(2), we would label where stands for the collection of spins and intertwiners, respectively, for U(1), we write , dropping the trivial intertwiner label and assuming that the constraints on the collection of charges m hold. To have a unified notation, we introduce the compound label also in the SU(2) case. The span of SNWF defines a dense and invariant domain for the Hamiltonian constraint [5,6]. We define .
The group of spatial diffeomorphisms Diff() of the model Cauchy surface underlying the canonical formulation of LQG is represented unitarily on , and acts on SNWF by dragging and its colourings along, i.e., for SU(2) and for U(1). With some care [8], one can “average” SNWF over Diff, resulting in distributions on : that is, elements of the algebraic dual of (linear functionals on without continuity conditions). In case that has no graph symmetries (i.e., diffeomorphisms that preserve as a set but permute the edges), the linear functional is defined by to equal unity when differs by a diffeomorphism and zero otherwise (we will only need S without graph symmetries in this paper). One parameter group of Diff does not act strongly continuously on the kinematical Hilber space so that there is no spatial diffeomorphism constraint operator, but one may still impose the spatial diffeomorphism constraint on in the form for all S and . Thus, the general solution to those constraints are linear combinations of the , and their linear span can be equipped with the inner product (again, modulo details associated with graph symmetries) with respect to which the forms an (almost) orthonormal basis.
The Euclidean Hamiltonian constraint of [5,6] for smearing (lapse) function N is densely defined on and for SU(2) and U(1) has the following general form
We will spell out more details about in the next section. For the current section, it is sufficient to mention that depends on the volume operator localised at v, holonomies along partial segments outgoing from v of edges e adjacent to v and arcs between the endpoints of which do not intersect anywhere else. The arcs form the extraordinary structure of a graph, and a graph without extraordinary edges is called primordial. The endpoints of extraordinary edges are called extraordinary vertices which are co-planar but not co-linear and tri-valent. Repeated actions of the Hamiltonian constraint do not act at the extraordinary vertices but create extraordinary edges ever closer to the vertices of the primordial graph. In addition to adding extraordinary edges, changes the colourings on . Graphs or SNWF with n extraordinary edges that arise in the n-th action of the Hamiltonian action arising from SNWF over a primordial graph are called the n-th generation.
2.2. Solutions of the Quantum Einstein Equations and Propagation
By definition, a physical state is an element of which solves besides the spatial diffeomorphism constraint also for all S and N. By choosing lapse functions of compact support, equivalently, for all . We consider a linear combination of the with complex coefficients where denotes the diffeomorphism orbit of S. It is clear that every with primordial is an exact (we call it topological) solution as increases the number of extraordinary edges by one. Next, we consider linear combinations of with having precisely one extraordinary edge, i.e., graphs in the first generation. The conditions on the complex coefficients are now only non-trivial when in is primordial. We try to construct a simple subset of all those solutions by a picking a single primordial graph and all its first generation descendants and all possible colourings of those forming SNWF . Denote by all for these and consider . Then, the constraint equation reduces to for all , which is still an infinite number of conditions. Similar simplifications can be achieved for solutions of higher generations and also for the Lorentzian constraint; see [19] for details.
Typically, the number of coefficients exceeds the number of for which the constraint equations are not automatically satisfied, at least in a naive counting (both numbers are infinite), simply because the number of children graphs together with all its colourings exceeds the number of parent graphs (in this case only one) together with with all colourings. Hence, one expects a rich number of non-trivial solutions. In the SU(2) theory, this cannot be granted with certainty because the numbers are not analytically available, and the naive counting involving the subtraction of infinities is a dangerous enterprise. Thus, even the question of existence is not entirely trivial to answer in the SU(2) theory. Next, it may or may not be true that there exist solutions with only a finite number of non-vanishing coefficients (besides the topological solutions) which would be normalisable with respect to the diffeomorphism invariant inner product. If such solutions would exist, we would call them bounded, as they have finite norm with respect to the diffeomorphism invariant inner product. On physical grounds, one would expect the interesting solutions to be unbounded as the Hamiltonian constraint at constant lapse is a diffeomorphism invariant unbounded operator on the diffeomorphism invariant Hilbert space so that zero should not be exclusively in its point spectrum. Finally, we come to the central question of the present work:
For simplicity, we consider the problem of constructing solutions involving only diffeomorphism averages of graphs with one extraordinary edge (first generation children). Similar remarks hold for solutions involving only diffeomorphism averages of constant generation n [19]. To further simplify the analysis, we may focus on children graphs which result from a single primordial parent graph via the action of the Hamiltonian constraint. As the action of the Hamiltonian constraint is local to the vertices, is the disjoint union of subsets where is a graph label that appears in the SNWF decomposition of the vectors for some m. Let us denote for a graph by the set of its possible colourings m. Then, the Ansatz for candidate solution reads in more detail
which involves a countably infinite sum3 of diffeomorphism invariant distributions. Then, the quantum Einstein equations reduce to the equations
because for any SNWF over a graph not in the diffeomorphism class , the equation is identically satisfied, and for any graph diffeomorphic to , the equations are strictly identical. Suppose now that
then (3) splits into the independent sets of equations
which only involves the coefficients . That is, the assumption (4) leads to a decoupling of the system (3) with respect to the vertex label, and the sets of equations (5) can be solved independently. In particular, setting for all and solving (5) for would yield a solution. Assuming that non-trivial solutions exist, the solution coefficients will involve (typically infinitely many) free parameters which we collectively denote by and which parametrise the kernel of (5). These therefore correspond to observables4, i.e., gauge invariants which are unconstrained and invariant by the constraints and their gauge motions and which keep some degree of locality as they are associated with the vertex v in the diffeomorphism class of . Let us denote by the complete space of solutions so obtained. Then, perturbing with respect to has no influence on any other . Since the parametrise solutions of the quantum Einstein equations, they parametrise, likely very indirectly, histories of spacetime metrics on the manifold . Then, the discussion suggests that performing a spatially local perturbation of a quantum solution has no global effect. If this picture is correct, then in the Lorentzian theory, we would conclude that the quantum solutions are incompatible with the classical solutions of Einstein’s equations which are known to be well posed in globally hyperbolic spacetimes which are the spacetimes considered in canonical quantum gravity (the perturbation of an entire history does not have compact support and thus has an unbounded domain of dependence). In particular, thinking of the as relational observables that depend on an intrinsic physical time parameter , a variation of should affect all . While these remarks are not entirely conclusive, the absence of propagation or long-range correlations that follows from (4) is at least worrisome.
This potential problem spelled out in [18] rests on the assumption (4), which seems to be quite reasonable, as the Hamiltonian constraint acts arbitrarily closely to v modulo diffeomorphisms. The catch is that the notion of closeness becomes void after diffeomorphism averaging. Thus, it may happen that while and are different graphs for and the corresponding SNWF are orthogonal, still ! The atomic prime example for this effect is a graph with two vertices and four non-co-planar edges between them (to have non-vanishing volume). Pick two of its edges . Then, there are contributions from and that attach arcs and , respectively, to , defining one of the possible , respectively. However, ! Thus, while the arcs labelled by are very “close” to , respectively, they are also very close to modulo diffeomorphisms. Therefore, we may find with but such that the SNWF decompositions of and contains SNWF with although . Abusing the notation, we call this effect the non-unique parentage of SNWF where the abuse refers to the fact that not but only . The effect is triggered by the mechanism of diffeomorphism averaging. Indeed, the same mechanism is responsible for the fact that the algebra of Hamiltonian constraints closes modulo diffeomorphisms [5,6]. Therefore, assumption (4) is false whenever there is non-unique parentage. Whenever there is non-unique parentage, even the Ansatz (2) is strictly speaking incorrect, as there is an over-counting involved: Since some of the for different and certain are in fact identical, the separate coefficients collapse to a single coefficient . This fact is the technical reason for the coupling between the constraint equations resulting from different . Note that non-unique parentage implying the failure of (4) is a generic feature of LQG and does not depend on the fine details of the quantum dynamics.
We finish this section by providing a concrete technical definition for the presence of propagation in a single first-generation solution to the Hamiltonian constraint which is motivated by the above discussion [18], and the further analysis in this paper. Its virtue is that it is free of any details of how one actually finds solutions and thus can be stated rather non-technically. A second more technical definition of propagation in a whole class of solutions which is closer to the actual construction of solutions will be deferred to Section 3.9 after we have illustrated the construction algorithm. Both definitions are to be considered as working definitions that may have to be refined in the future as we gain more experience with propagation in ever more complicated solution classes.
2.3. Working Definition of Propagation
2.3.1. Preliminaries
A candidate first-generation solution of the quantum Einstein equations based on a primordial parent graph can be written as a linear combination with non-redundant coefficients where runs through a subset V of and at given , l runs through a subset of pairs with and taking into account non-unique parentage (i.e., there is no overcounting), that is,
We define as follows:
Fix a vertex and consider the set of elements where if there exists a primordial parent based on on which the action of the constraint at vertex v produces, up to the action of a diffeomorphism, the state .
We define the restriction of to a vertex to be the state obtained by setting to zero in (6), the coefficients of all .
Define the set where if fails to annhilated by the constraint action at .
Define the set to be the set of all in (6) for which (up to the action of a diffeomorphism) is produced by the action of the constraint at as well as at . Define the restriction of to be the state obtained by setting to zero in (6) the coefficients of all .
2.3.2. Definition of Propagation
If there exists such that , we say that encodes propagation. If for some , we say that there is no propagation from v. If for every , we say that the does not encode propagation.
2.3.3. Definition of Propagation Distance
Fix and consider any other . If does not solve the equations at , we say that there is immediate propagation from v to else that there is no immediate propagation from v to . Note that there can be immediate propagation from v to as well as from to v and there could also be ‘one-way’ immediate propagation only from v to but not vice versa.
Note also that solves the constraint equations at for all . This follows immediately from the fact that (a) solves these equations at such and (b) the equations for at any only involve elements of . It follows that for , there is no immediate propagation from v to . It also follows from (b) and the definition of that there is immediate propagation from v to any element of .
A chain of propagation of length n from to is a set of vertices such that there is immediate propagation from to . If there exists a chain , then we say that there is propagation from to . If there is propagation from to , the propagation distance from to is the length of the shortest chain from to .
2.3.4. Comments
The various choices of V (see the discussion before (6)) are a direct consequence of non-unique parentage, and thus, any choice of V as above is a valid choice capturing the idea that the corresponding term in (6) is produced by the action of the constraint at v. Note, however, that the role of the set V is only to provide an explicit labelling index for the coefficients which appear in (6). The set V plays no role in the above definition of propagation.
The definition of propagation is based directly on the coupling between the constraint equations at different vertices. The intuitive picture underlying the definition as formulated above is as follows. We think of a ‘perturbation’ or ‘disturbance’ (roughly speaking, the extraordinary edge between two vertices) as already being present in the solution with each child thought of as the quantum analog of canonical data on a slice. The way we determine how the perturbation ‘evolves’ depends on how we view these ‘quantum slices’. Consider a vertex v with the children obtained through the constraint action at v being viewed as encoding a perturbation/disturbance/signal originating at v. Suppose . Then, this signal, encoded in the precise combination of children with parental vertex v, propagates through to a precise combination of children with parental vertex . If this signal was absent, the effect of its propagation (encoded in the precise coefficients of the children obtained through the insertion of extraordinary edges on edges which do not connect to v) would also be absent (i.e., the combination of children with parental vertex v do not solve the equations at but need to be augmented by the combination of the remaining children with parental vertex at ). Note that since shares some parentage with v, it must be connected to and hence an ‘immediate’ neighbor of v: hence the nomenclature ‘immediate propagation’. On the other hand, if , then either v and are not nearest neighbors (so there is no question of immediate propagation), or they are nearest neighbors, but the presence of children with parental vertex v does not prevent the precise combination of the rest of the children with parental vertex from solving the equations at , i.e., not only does automatically solve these equations but so does . In the latter case, the disturbance between v and (encoded in ) may be viewed as not propagating beyond .
Again, with more wording, it is obvious how to generalise this to solutions of higher generation or to solutions which involve more than one generation. In contrast to the presence of non-unique parentage, the presence of propagation does depend on the details of the dynamics, as we need access to explicit solutions to determine if they encode propagation. These are difficult to construct in a SU(2) calculation for the reason that the volume operator is not analytically diagonalisable. Thus, one has to resort to numerical techniques. To motivate an in-depth numerical analysis for SU(2), we turn to the U(1) theory in the next section and study an almost atomic example for which a multiparameter class of solutions can be constructed.
This example opens up the possibility of an alternate definition of propagation based on a class of solutions rather than a single fixed solution as above. As already mentioned, we shall discuss this alternate definition after we construct the class of solutions alluded to above. Since the definition in this section is based on a single solution, we refer to it as a definition of intrinsic propagation in contrast to the alternative, ‘space of solutions’-dependent definition, which we refer to as a definition of extrinsic propagation. We emphasise again that propagation is a subtle notion, and its capture in a complete definition is expected to rely on experience with a variety of concrete examples. Consequently, both the intrinsic definition and the extrinsic one are to be taken as working definitions to be modified in response to inputs in the future.
3. Demonstration of Existence, Non-Normalisabilty and Propagation
for U(1) Model
In this section, we will study the question of existence, boundedness and propagation for a generation 1 class of solutions descending from a concrete and simple primordial . We work within the theory for which all constraint equations can be solved explicity. Thus, the colourings ⋯ are now valued in . Accordingly, we speak of charge network functions (CNWF) rather than SNWF.
3.1. The Primordial Parent Graph
In what follows, we provide the necessary and sufficient information on the parent graph, such that the action of the Hamiltonian constraint is unambiguously defined:
We consider a closed graph with five vertices, three of which are six-valent and two of which are four-valent, see Figure 1. The graph is chosen so small that it fits into a single chart and, to be very explicit, we choose a right-oriented coordinate frame such that on a piece of paper, the y-axis points to the right, the z-axis points upwards, and the x-axis points towards the observer out of the sheet of the paper plane. The five vertices all lie on the y-axis, and we label them from left to right. There are two edges each between the pairs of vertices , , , and , respectively, and no others that connect different vertices, i.e., there are altogether ten such edges. We choose the pair of edges between and , respectively, to lie in the y,z plane, while we choose the pair of edges between and , respectively, to lie in the x,y plane. The pair of edges between is such that the four edges at Z and D, respectively, have co-planar tangents there. All edges are semi-analytic and are oriented such that the respective pairs point from Z to A, from A to B, from B to C, from C to D and from D to Z. In addition, at vertices there is a semi-analytic loop attached, intersecting the graph nowhere else as specified below.
More specifically, the beginning segments of the pair of edges between lie in the x,y plane, and their end segment lies in the y,z plane, while in between, they wind around accordingly without intersecting or knotting. The other edges also do not knot. The two edges between and , respectively, are such that one of them lies above (“up”) the x,y plane and the other lies below (“down”). Accordingly, we label them and , respectively. Likewise, the two edges between and , respectively, are such that one of them lies above the y,z plane (“front” of the sheet) and the other lies below (“back” of the sheet). Accordingly, we label them and , respectively. Finally, the pairs of edges intersect in both their beginning and final point at a non-vanishing angle (say ), and likewise, the pairs of edges . The edges between will be denoted , respectively, where is of f-type when leaving D and of u-type when entering Z, while is of b-type when leaving D and of d-type when entering Z. The loops are labelled , respectively, and have the following properties: has a beginning analytic segment which is tangent to at A and an end segment tangent to at A and is semi-analytic in between. Likewise, is tangent to in B in its beginning and to at B in its end, while is tangent to at C in the beginning and to at C in its end. The loop is knotted, while are unknotted.
3.2. The Parent Charges
In the U(1) theory, the edges of charge network functions (CNWF) carry a charge vector, i.e., a triple of integers. Note that the charge vector by definition is non-trivial; i.e., at least one of those integers is supposed to be non-vanishing; otherwise, the CNWF is defined over the smaller graph with the uncharged edge dropped. We denote the charge vectors of the edges , respectively, by and of of the edges , respectively, by . The charge vectors of the loops are denoted, respectively, by .
We only consider CNWF, which are solutions to the U(1) Gauss constraint, which imposes the constraint that for all , the vector
is the same vector N, i.e., independent of the label ∗. There is no constraint on the loop charges. Accordingly, the CNWF over is unambigously labelled by nine vectors in , say the five , the three and N.
3.3. Definition of the U(1) Hamiltonian Constraint
The U(1) analog of the (smeared) Euclidean Hamiltonian constraint is defined on a general CNWF up to a state vector independent factor by
where the notation is as follows: is the set of vertices of and is the set of its oriented edges. The natural number is the number of unordered triples of edges adjacent to v which have linearly independent tangents at v, and the second sum in (8) is the sum over those triples of edges. If an edge e is adjacent to v, we define to be a segment of e connected to v but not to the other endpoint of e with an orientation outgoing from v. Given two edges adjacent to v, we consider a loop starting in v along and ending in v along . To complete the loop, there is a connecting arc from the endpoint of to the endpoint of which is unknotted and intersects nowhere else. Thus,
We require so that also . The ordering within the triple is such that the tangents of at v form a right oriented basis if they are linearly independent. The routing of the arc through the edges incident at v is described in detail in [5,6] and reduces for the case that lie in a coordinate plane to let the arc also lie in that plane. Finally, by , we denote the holonomy of the connection along the path p.
The operator appearing in (8) is the U(1) analog of the Ashtekar–Lewandowski volume operator, which reads explicitly up to a state vector independent factor
where is the shorthand for , the integer is the sign of the determinant of the matrix of column vectors and . Note that in (10), we sum over all triples of edges, not only those whose tangents are linearly independent and not only those whose ordered tangents are right oriented. The whole purpose of considering the U(1) truncation of the actual SU(2) theory is that (10) is diagonal on CNWF, while in the SU(2) theory, is replaced by a right invariant vector field on SU(2) so that (10) needs the spectral theorem for an explicit evaluation which except for specific spin configuration is not possible analytically.
Specifically, suppose that an edge e is adjacent to v, carries charge and is outgoing from (incoming to) v so that with () where is disjoint from v. Then, is diagonal on the corresponding CNWF with eigenvalue , and the eigenvalue of the volume operator is given explicitly by
3.4. Notes on Closability
For completeness, although not necessary for the understanding of the rest of this paper, we note that the operator (8) is not symmetric in an obvious way. As mentioned, the arguments of [20] even suggest that the Hamiltonian constraint operator must not be symmetric. Nevertheless, the way it stands, it is not even closable (i.e., its adjoint is densely defined), which would be a prerequisite for having a symmetric operator. This is because it may happen that in the decomposition into CNWF of its action on a CNWF , some appear that contain the extraordinary edges that the Hamiltonian constraint adds but not all of the beginning segments . Clearly, this ‘edge disappearance’ occurs only if these segments in happen to be labelled by charges which are cancelled by the charges carried by the corresponding segments of the loops added by the constraint action. Since such can be produced from an uncountably infinite number of mutually orthogonal (e.g., all that differ from a given by deforming just into ), the adjoint of (8) is not densely defined on CNWF.
In the context of gauge group (i.e., full blown gravity rather than the model), this disappearance of edges with consequent non-closability can occur with the constraint action constructed in the arXiv version of Reference [19] whenever the segments of carry spin . This phenomenon implies that the solutions tracing to a single unique primordial graph do not exhaust the space of solutions. However, one may, as in the work in this paper on the model, restrict attention to the class of solutions from a unique primordial graph. The results of this paper then strongly indicate that even this restricted class contains propagating solutions.
Various proposals have been made in the literature to make the operator closable in the case, which applies immediately to the simpler context of . Perhaps the minimal correction to (9) that makes this possible is as follows (see [36] for details): Simply substitute in (8) by
Here, for and otherwise is the step function and the Laplacian for s. These spectral projections avoid the effect just described. The semiclassical properties of these projections are discussed in [36]; suffice it to say here that we may interpret as the quantisation of where is an arbitrarily small but finite surface intersection s transversally. If the classical 3-metric is non-degenerate, then , and in that sense, the modification is justified.
With this modification, the operator becomes closable and could be symmetrically ordered; see the third reference of [1,2,3,4] for the technical statement. The conclusions of the rest of this paper apply to both the non-closable version (8) and the closable modification just discussed because they both exhibit the phenomenon of non-unique parentage. By contrast, the closable Euclidean operators in the published version of [19] based on so-called double kinks instead of the loops considered here or in [37,38] based on loops which intersect the original graph in only one vertex, both by design have unique parentage and therefore do not exhibit propagation.
Recently, the constraint action construction techniques of [5,6] have been combined with key geometrical insights into the classical constraint action developed in [39]. The resulting constraint action [14,15] 5 differs from the ones mentioned hitherto in several ways. In particular, the loops added by the constraint are labelled by spin representations which are tailored to the labels of the parent state being acted upon. As a result, there are always children in which edge segments disappear. Since a detailed analysis of propagation for the constraint action of [14,15] constitutes an interesting but as yet open problem, we restrict ourselves to the following remarks:
(i)
The constraint action creates children with displaced vertices (called ‘electric diffeomorphism type children’ in [14,15]) and two classes of children obtained by the addition of extraordinary edges. One class of these children has disappearing edges, the second does not. A preliminary analysis suggests that non-unique parentage is associated with both these classes of children but not with electric diffeomorphism type children.
(ii)
As indicated in our introductory remarks in Section 1, while non-unique parentage invalidates the arguments of [18], the existence of explicit solutions to the constraints involving children of non-unique parentage must be established, which is a task that is still incomplete in the context of [14,15].
(iii)
In the context of ‘disappearing edges’, non-unique parents are expected to be labelled, generically, by diffeomorphically distinct graphs. Since our definition of propagation in this work is based on a fixed primordial graph structure, it is necessary to generalise this definition appropriately. We note here that a qualitative and intuitive description of propagation in the context of the variable parental graph structure is provided in [40] in the context of a novel constraint action distinct from the QSD-type action of this paper.
3.5. Evaluation of the Hamiltonian Constraint on the Chosen Parent
CNWFs
By construction, the tangents of all edges adjacent to the vertices are co-planar so that the operator with e adjacent to v vanishes there. Accordingly, the Hamiltonian constraint has non-trivial action only at vertices . At each of these vertices, the Hamiltonian constraint produces children graphs which correspond to gluing in an arc of the above type between pairs of adjacent edges. The non-uniqueness of parentage and the non-trivial correlation between the actions of the Hamiltonian constraint at different vertices when computing solutions to the quantum Einstein equations here can be made explicit and transparent. Specifically, a child CNWF with an arc in between can come from either the action at A or B but originating from two different CNWF over , that is, with different parental charges so that these two parental CNWF cannot be related by a diffeomorphism. The same applies to a child with an arc between . Accordingly, when constructing a solution to the Hamiltonian and spatial diffeomorphism constraint as a superposition of diffeomorphism averages of child CNWF of the above type, the coefficients in that superposition are constrained not by mutually disjoint sets of constraints, one set for each vertex, but rather by a coupled system of equations. In what follows, we will make this explicit and show that the resulting system of equations admits non-trivial solutions.
We will thus consider child graphs and , respectively, where differs from the parental graph by an arc between interior points of and in the x,y plane, respectively, starting from the point on , see Figure 2, while differs from the parental graph by an arc between interior points on and in the y,z plane starting from a point on . The action at B on produces both and types of graphs plus additional ones , while the action at A only produces the type and additional ones , and the action at C only produces the type and additional ones . In what follows, the contributions to the Hamiltonian constraint will be ignored, because we construct distributional solutions out of diffeomorphism averages of CNWF over which, as distributions, have trivial action on CNWF over .
Action atA:
We notice that with the orientation choices made, the following triples of edges adjacent at and outgoing from A are such that their tangents form a right-oriented triple of linearly independent vectors at A
The orientations of those edges coincides with those of the outgoing segments from A whence and . Thus, the volume eigenvalue at A derives as with
where the factor was cancelled because the permutation of edges within the above triples all gives the same contribution. We have exploited that while the tangents of point into the same direction at A for the beginning segment of , the loop is here outgoing, while is ingoing. Likewise, while the tangents of point into the same directions at A for the end segment of , the loop is here ingoing while is outgoing. The number of arguments of the function Q is redundant due to (7), but we will keep it for reasons of more transparent bookkeeping. We will use in what follows.
Thus, the type contribution of the Hamiltonian constraint at vertex A is given by (we drop the common factor in what follows as it can be absorbed into the lapse function and m stands collectively for all charges on all edges of )
where and are the vector with component . In (15), we have considered the beginning segements s of the edges that have linearly independent tangents at A together with the tangents of (that is why there is no contribution from the end segment of ). Their holonomies along s with outgoing orientation and charge enters the commutator with the volume operator explaining the argument shifts by in the functions displayed. Then, the loop or , respectively, becomes attached when the tangents of in this order are right or left oriented, respectively.
Action atC:
The situation here with respect to orientations of edges and charges is exactly as at A with the substitutions of labellings and and . Therefore,
Thus, the type contribution of the Hamiltonian constraint at vertex C is given by
where . We have exploited that it is now the end segment of which contributes.
Action atB:
The tangents of the following triples of edges are right oriented and outgoing from B
The orientations of those edges coincide with those of the outgoing segments from B whence and . Thus, the volume eigenvalue at B derives as where
where it was exploited that while the tangents of and the beginning segment of as well as the tangents of and the end segment of point into the same direction at B, is ingoing while the beginng segment of is outgoing from B and is outgoing while the end segment of is ingoing at B.
Thus, following the same arguments as at vertices , the -type contribution of the Hamiltonian constraint at B is given by
where . We are abusing the notation, since at the level of CNWF, the arc coming from B is generally different from the one coming from A, but after diffeomorphism averaging, they are identified, and this is what matters in what follows.
Likewise, the type contribution of the Hamiltonian constraint at B is given by
where . Again, at the level of CNWF, the arc coming from B is generally different from the one coming from C, but after diffeomorphism averaging, they are identified.
3.6. Properties of the Coeffcients
The twelve coefficients computed in the previous subsection are quite complicated. They have the following general structure: they are linear combinations with coefficients of the differences
where and . For each value of ∗, the function is a function of five charges as follows: Respectively, the variables coincide with the charges for with fixed, for with fixed, for with fixed, for with fixed. The functions themselves are square roots of the modulus of a linear combinations with coefficients of four determinants built from the five charge vectors involved, or equivalently, it is the fourth root of a positive bilinear expression in those four determinants with coeffcients . The more explict form of those coefficients can be found in Appendix A.
In what follows, the charges will be fixed and with due to gauge invariance so that the only variables are . We consider the vector “fields” given by and given by . What we want to show is that all vector fields are non-vanishing at “generic points” and moreover that are linearly independent at “generic points”. By generic points, we mean all of or , respectively, except for “lower dimensional” sublattices of or , respectively, or even better on finite subsets of those, respectively. Here, a lattice of dimension in is a subset of the form with variable and fixed linearly independent (over ) . This would imply that (1) are non-vanishing “almost everywhere” and thus are not compactly supported and (2) that are linearly independent “almost everywhere”.
We will not be able to give a strict proof of these statements, but we will give arguments for why this is very plausible. The subsequent discussion will also show why it is difficult to turn the plausibility arguments into a strict proof: We enter difficult questions of algebraic geometry which can be addressed in principle but require much more work. The arising questions and conjectured answers could benefit from machine learning techniques, which we advertise at this point.
To begin with, the vector condition is a set of three equations for three unknowns and thus will typically have only a finite number of solutions even if we allow . The catch is in the word “typically”. In principle, it could happen that depends on in a sufficiently degenerate way so that the statements that we would like to prove do not hold, although this is intuitively hard to imagine. The reason why this appears unlikely is as follows: To investigate these questions analytically, one would for instance (extending to ) compute the Hessian from whose zeroes one would infer where the map fails to be injective. However, computing that Hessian and its zeroes is even more difficult than determining the zeroes of directly. In order to say more than “by inspection depends on sufficiently non-degenerately”, we consider solving the equations . We may write (see Appendix A) where and has the form where are integers depending on . By inspection (see Appendix A), the co-normals are different for different because they involve charge shifts in different entries of the determinants involved; hence, the affine polynomials have different level hypersurfaces. Accordingly, for each l, these four polynomials and thus the are algebraically independent and the fact that the level hypersurfaces are different suggests that the four cancel for each l at most at finitely many points.
To investigate this further, dropping the index l for notational simplicity, we obtain the condition . As all are not negative, this is equivalent with
which implies upon squaring
and squaring again once more thereby introducing
This equation is still not a polynomial in because of the modulus involved and one cannot get rid of it by squaring once more, the equation is simply not of algebraic type. In order to turn it into a polynomial, we write with . Then, at fixed , (25) becomes a quartic polynomial in . Suppose one finds a solution of (25) at fixed . Then, to make it a valid solution, one has to check that if and for .
With this understanding, we are left with solving the following problem: Let . Then, for each choice of ( possibilities), we are looking for the zeroes of a non-homogeneous quartic polynomial with integer coefficients. In the theory of algebraic geometry, this known as a diophantine equation. The condition defines an algebraic variety (surface) in , and we are looking for its integral points. We simplify the problem and look at the quartic polynomials with coefficients in and for at with coefficients in , which defines agebraic curves C. For this situation, we have the following deep statement in number theory.
Theorem1
(Falting). Let C be a non-singular algebraic curve over the rationals (i.e., a curve in the plane defined by the zeroes of a polynomial equation in x,y with rational coefficients and such that it is not self intersecting). If the curve has algebraic genus , then is finite. Here, the algebraic genus for non-singular C is g=(n − 1)(n − 2)/2 where n is the degree of the polynomial.
The theorem takes a step towards proving that Fermat’s famous equation has at most finitely many positive integer solutions when : After dividing by z, this becomes which has at most finitely many rational solutions with and relative prime. Then, the solution to the original problem is . Note that any homogeneous equation such as Fermat’s has infinitely many if it has one, which is not true for non-homogeneos equations, and the hard part of the proof is thus to show that there is not a single one. The algebraic genus can be extended to algebraic curves with singularities and is generically reduced by them [41].
Note that instead of introducing the , one could momentarily drop the requirement that the integers are not negative and consider the solutions of the quartic (25). If one could argue as above and conclude that the quartic has only finitely many solutions, one would then conclude that it also has only a finite number of solutions with . Then, for each of these leftover configurations, one would be left with solving the twelve equations where we reintroduced the index l. As the are algebraically independent, this system is again very unlikely to have more than a finite number of solutions. In order to run this argument, one would need to have an extension of Falting’s theorem at one’s disposal for algebraic surfaces rather than curves because (25) involves four rather than three . (and for what follows more generally higher dimensional algebraic varieties defined by integer coefficient polynomials). This would also ease the proof in terms of so that one does not have to argue via the curves. Unfortunately, we were not able to find such an extension in the literature.
Applied to our problem, assuming that the algebraic curves in question are singularity free, we would conclude that we obtain only a finite number of solutions of for and of for and thus most only finitely many 1-dimensional sublattices of as solutions (note that only those of these solutions are admissable for which the above condition involving the is met). However, note that this is true for each direction l in charge space separately. As these finitely many discrete lines for different l are unlikely to coincide, we expect that there are at most finitely many solutions of . The same reasoning applies to .
Another qualitative argument would be as follows: Compute the polynomials as above for each l and each choice of the . These define three distinct algebraic surfaces. The intesection of two surfaces is one dimensional unless the two polynomials coincide, which they do not (if they would intersect in a common face, then by analyticity, they would coincide everywhere). The intersection with the third is then also at most one dimensional, more likely a discrete set of points. From that curve or set, one would need to pick the integer points if they exist at all.
To apply this number theoretic argument to is significantly harder. As for the vanishing of , this again leads to a quartic equation but now for a five-dimensional (generalised—as it is no longer defined by an algebraic equation) variety. Using the above heuristic, one would argue that each vanishes at most on the integer points of a four-dimensional, more likely three-dimensional, variety , which is different for the two choices of I. For the points outside of the union of these sets, the condition that be co-linear can be stated as . On , only two of these three equations are algebraically independent. However, this time, it is not possible to cast these into two algebraic equations in six variables by squaring the equations sufficiently often. The equation to be solved is simply not algebraic any more, and almost nothing can be said about its solution structure.
Yet, one expects that these two conditions single out an at most four-dimensional generalised variety of which one would again need to determine the integer points which then very likely reduces this to a finite set.
In summary, the analysis of the singularity structure of the vector fields leads to hard questions in number theory and algebraic geometry which are beyond the scope of this paper. However, the heuristic arguments given, backed up by some results from algebraic geometry, make it appear extremely likely that are nowehere vanishing and that are nowhere linearly dependent except on lower dimensional sublattices and more likely on finite subsets. In other words, the violation of these conditions, if possible at all, appears to be a tremendous number theoretic accident, and moreover, one can exploit the freedom in the choice of to downsize this set of violating points even further.
We will use the assumption of non-singularity and linear independence of the vector fields at generic points in the sense described as a plausible conjecture in what follows. To attempt a strict proof will require deeper methods from algebraic geometry and number theory and could benefit from numerical machine learning techniques.
3.7. Decomposition into CNWF
We must write the functions in terms of CNWF for the loops that appear in (15), (17), (20) and (21). For , we see that the edges are split in halves and that the arc runs from to . We thus need to introduce charge labels for . Likewise, for , we see that the edges are split in halves and that the arc runs from to . We thus need to introduce charge labels for , respectively. Due to gauge invariance, these charges are subject to the constraints
The factor changes the charges of to
in agreement with (26). The other charges are unchanged. We denote the CNWF with the changed labels (27) by .
The consideration for the other loops is similar: The factor leads to the change of charges
We denote the CNWF with the changed labels (28) by .
The factor leads to the change of charges
We denote the CNWF with the changed labels (29) by .
Finally, the factor leads to the change of charges
We denote the CNWF with the changed labels (30) by .
Note that still for
We may summarise the relevant contributions to the action of the Hamiltonian constraint at vertices as
for .
Note that the labelling of the vector states using labels A,B presents an overcounting; i.e., there are linear relations between them. The same applies to with respect to labels C,B. This occurs precisely due to the phenomenon of non-unique parentage and will play a crucial role when solving the Hamiltonian constraint in the next subsections. On the other hand, the labels are taking six distinct possible values labelling the six distinct possible charges on the arcs and are not redundant.
Before closing this subsection, note that the children CNWF arising from the parent CNWF can be such that one of the edges in the pairs or , but not both if can become uncharged in the child by the action of the Hamiltonian constraint if the corresponding charge vector is of the form in the parent. Since our solutions are by defintion such that all segments of in the graphs are charged, we do not need to worry about such solutions with ‘edge evaporation’.
3.8. Statement of Quantum Einstein Equations for an Example
Class of Solutions
The Ansatz for an example solution to the Quantum Einstein Equations exhibiting propagation is the linear functional
The notation is as follows: Consider CNWF over where are the child graphs described above and with fixed values of the data but with variable charges where for
while for
and of course for all . Then, is the diffeomorphism average of normalised such that that for any CNWF , we have
where is the inner product on the kinematical LQG Hilbert space and is the set with Diff denoting the group of semi-analytic diffeomorphisms of the spatial manifold underlying the canonical formulation. Note that we dropped the vertex label in introduced in the previous subsection, thus removing the overcounting. In (36), we exploited that the result vanishes unless the diffeomorphism classes of coincide.
In (36), we have also exploited that cannot have any graph symmetries [8] which would otherwise unnecessarily complicate our discussion so that there is precisely one term in the distribution that contributes. Here, a graph symmetry of a graph is semi-analytic diffeomorphism that preserves as a set but permutes its vertices and edges possibly including orientation reversal. An orientation reversal for an edge e of a CNWF over is equivalent to a charge reflection , and a permutation of edges leads to a corresponding permutation of charges. The existence of graph symmetries implies that CNWF over the same graph but different charges are in the same diffeomorphism orbit, and thus, their diffeomorphism averages are the same. Thus, (36) would have to be corrected by a sum over the corresponding possible charge configurations that are identified under diffeomorphism averaging.
To achieve a trivial graph symmetry group was the reason to add the extra structure to : If we would drop these and connect by lines similar to , then reflection in the y,z plane would exchange and map to , reflection in the x,y plane would exchange and map to and, e.g., rotation by about the z-axis through B was followed by rotation by about the y-axis, which would map to and similar maps for leading to corresponding complicated identifications of charges in . With the extra structure provided, the latter type of identifications and other similar ones are suppressed since a semi-analytic diffeomorphism cannot un-knot a loop. Furthermore, while a semi-analytic diffeomorphism can be local, it still has to be at least . This prevents, e.g., the existence of a local semi-analytic diffemorphism which preserves all parts of say while interchanging for it would have to preserve in particular at B. To see this in detail, consider some parametrisation where is an anylytic segment incident at and outgoing from B, respectively, of the edge e where e is one of or the beginning segment of . Suppose there exists a semi-analytic diffeomorphism with
where are reparametrisations of , in particular . Let M be the matrix and . Taking the derivatives of (37) at gives
where denotes the Cartesian basis of . The first and fifth equation are in contradiction leading to . Without the fifth equation, the first four equations would be satisfied for and M the reflection at the y,z plane. Likewise, a simultaneous interchange of and while preserving would lead to a contradiction between the first and fifth equation. An interchange of preserving all other parts of the graph, in particular also the end segment of , would lead to
and now, the fourth and fifth equation are in contradiction, leading to . Without the fifth equation, the first four equations can be satisfied by and M the reflection at the x,y plane. Finally, a mapping between the pairs and possibly with interchanges within a pair and possibly with orientation reversal would need to map the whole structure to the one with the sequence of vertices reversed preserving B, in particular , but this cannot be a graph symmetry because have different topology.
Even if would have the same topology so that a graph symmetry inducing such a pair exchange would be conceivable, a corresponding identification of charges on these edges possibly including reflections would be accompanied by an associated identification of charges between the pairs of edges and , respectively. Since we have fixed the data , if we pick the pair of charges and , respectively, such that there is no combination of permutation maps or single entry reflection maps between them, then at most, one of these two CNWFs is not annihilated by . The same can be achieved by picking the charges on the loops such that there are no reflection or permutation maps between them. Thus, even in this case, (36) remains valid.
The are complex coefficients that are to be determined by asking that obeys the quantum Einstein equations, that is
Here, U is the unitary representation of Diff densely defined by
from which we see that the first condition in (40) is already satisfied. The are without loss of generality solutions to the Gauss constraint (otherwise, (40) is again trivially solved).
Moreover, is set to zero for those M for which not all edges of are charged in according to (34) and (35). Thus, we impose on the data that and that for and each the coefficient vanishes when
and for and each the coefficient vanishes when
This avoids that there can be child graphs with “erased edges” in addition to the ones considered. Note that (42) and (43) would not be necessary for the closable operator of Section 3.4 because by construction, the closable operator does not have SNWF in its image for which not all edges of the parent graph are charged. In what follows, we consider the non-closable operator for simplicity. In addition, note that child graphs with “erased edges” need to be carefully taken into account among the first generation graphs [19] when constructing higher-generation solutions.
To solve the Hamiltonian constraint, we note that due to our specific Ansatz, is automatically satisfied unless the child graphs of that appear in the CNWF decomposition of lie in the diffeomorphism class of either or . This means that because the Hamiltonian action consists of adding arcs between pairs of edges meeting in at least tri-valent vertices. For , we may choose without loss of generality the representative , and we can choose the support of f solely in mutually disjoint neighbourhoods of the vertices , which means that we obtain the following system of linear equations
for all and . Again, (44) is trivially satisfied unless . To evaluate (44) for such CNWF, we notice
where it is understood that the decomposition of the data contained in m into and the rest matches the data M and respectively. Thus
We thus obtain the following system of non-trivial equations
to be solved for all .
3.9. Solving the Example Class and Discussion
3.9.1. Preparation
The structure of the solutions of the system (47) of course depends sensitively on the coefficients with . We note that depends on , that depends on and that depends on . The dependence on N is via .
To simplify the subsequent discussion, we will drop the dependence of these functions on the fixed structure and introduce the notation in order not to clutter the formulae. Furthermore, following the discussion in Section 3.6, we assume that has been chosen such that the number of configurations for which one or several of the or that are linearly dependent is a finite subset of or , respectively.
3.9.2. Existence and Explicit Construction of Solutions
We note that we have coefficients that depend on indices and , that is, 12 coefficients per point , except for configurations M depending on , which are excluded by (42) and (43). These coefficients are subject to the three constraints (47) for every point except for those such that has an expansion into CNWF over such that for all appearing CNWF not all edges of are charged. Thus, except for those exceptional points, we have roughly counting 12 times a worth of complex variables and three times a worth of equations and thus expect that the system (47) admits a rich (in fact infinite) number of solutions. However, not all of them may display propagation. To see this, let us refer to the third equation in (47) as the “B-equations” and the first and second equations in (47) as the “A-equations” and “C-equations”, respectively. Consider the subspace of solutions derived by setting and call the remaining equations the 1-equations. In a similar manner, we define the 2-equations by setting the coefficients . Note that the 1-equations, respectively, 2-equations only involve the ‘’ coefficients for the child of type 1 and 2, respectively. Next, consider the 1-equations. The C equations are trivially satisfied, and we are left with the A-equations and the B-equations that now impose conditions only on . Likewise, for the 2-equations, the A-equations are trivially satisfied, and we are left with the C-equations and the B-equations that now impose conditions only on . In both cases, we obtain 2 equations for the corresponding 6 left over of coefficients, which should yield 4 solutions to these equations and hence 4 solutions to all and C equations. Altogether, we should thus obtain 8 solutions which are not propagating, because each of them involves only a single child graph. This leaves us with a 9 - 8, i.e., a worth of solutions.
This expectation is indeed borne out by the detailed solution construction method below so that the propagation degree of the solution (to be defined below) class is only unity, i.e., only one complex variable can be accounted for propation rather than nine.
We proceed as follows. Turning to the B-equations, we note that they are ultra-local with respect to both p,q and and can be written more explicitly as
where we have introduced for
It can therefore be solved algebraically for each separately, and we drop the dependence on as far as the B-equations are concerned.
Case 0: Both vanish.
Let be the Cartesian basis of . Then
is the general solution with arbitrary 6 parameters . We arbitrarily set thus deliberatively reducing it to five parameters, although this is not necessary.
Case 1a: Only vanishes.
Let and be any two vectors such that is an orthonormal basis of . Then
is the general solution with five arbitrary parameters .
Case 1b: Only vanishes.
Let and be any two vectors such that is an orthonormal basis of . Then
is the general solution with five arbitrary parameters .
Case 1c: are co-linear but non-vanishing.
Thus, there is such that . Let and be any two vectors such that is an orthonormal basis of . Then
is the general solution with five arbitrary parameters .
Case 2: are linearly independent. We write with and expand
It follows
Using , we find the general solution
depending on five parameters .
To summarise: whatever the coefficients , we find an at least five parameter sets of solutions to all B-equations. Note that case 2, where are non-vanishing and linearly independent, is satisfied at generic points , as argued in Section 3.6. There is necessarily a non-trivial coupling of in cases 1c and 2.
Turning to the A-equations and C-equations, we consider the equivalent set of coefficient functions and where and is now parametrised by a linear combination of the five free functions . Accordingly, we write the A-equations and C-equations in (47) as
We note that the first of these two equations is ultra-local in q and the second is in p. Moreover, are only involved in the first equation, is only involved in the second, while generically, both depend on through which they are coupled in Case 2 (which is expected to be the generic case, see Section 3.6). It is therefore natural to solve the first and second equation, respectively, in terms of and , respectively. We will show that it is possible to solve both equations just in terms of , respectively, thus leaving untouched.
As we wish to keep unconstrained, we consider these as inhomogeneities in the linear discrete PDE problems (60) for the three functions and , respectively. Due to linearity, the general solution is a linear combination of a particular solution to the inhomogeneous problem and of the general solution to the homogeneous problem . If we had only one function of each available, then the construction of the solution to the inhomogeneous problem would read
where
This is the discrete version of two independent PDE’s of the form with a vector field . One would then try to solve the discrete PDE’s by a discrete version of the characteristic method [42] by inverting the logic of solving a PDE numerically using finite difference techniques. As is well known from the continuous version, this can lead to global existence questions depending on the details of .
Fortunately, as we have three functions rather than just one available, an inhomogeneous solution is readily provided explicitly: We simply solve for each l separately
These can be solved explicity by integration if we prescribe “initial values”. We will display this for the direction, while the directions can be treated by cyclic permutation of the roles of . The integration of (63) for requires initial data for at and for at . One finds (we drop dependence on ultra local variables and on two or three components of the remaining charge vectors involved)
Similar for with substituted by .
This proves the existence of an inhomogeneous solution with no restriction on other than that coming from the B-equations, which were already solved. We are free to add a solution of the homogeneous equation
In contrast to the inhomogeneous solution just provided, the general solution of (65) will depend on the discrete “characteristics” (in the sense of PDE theory) determined by the discrete “vector fields” . To see how one would proceed, consider the A-equation, start at and suppose that the component is not vanishing. Then, given an initial datum at for , we can solve along an “ flow line”, in terms of by (64) if we simply redefine . This works until . When that happens, but , we may similarly solve in terms along an “ flow line” as long as until again or both . In the first case, we solve again along the line, in the second, if we keep constant along the line until either again, in which case, we proceed propagating along , or again in which case, we proceed propagating along or . At the zeroes of the vector field, there are obviously no conditions on the , and we must supply additional initial data there in order to extend the solution beyond. This way, one finds the solution along the “lexicographic integral curves” of (i.e., along directions in the charge space of its non-vanishing components ordered lexicographically), which is possible until they cross, which leads to “shocks”. We will not go into further details here but rather remark that as argued in Section 3.6, (i) the vector fields and even their separate components have zeroes at most at isolated points, and (ii) we may always solve the homogeneous equation by the trivial solution. Then, still, the set of solutions to all constraints is infinite consisting of the five free parameters at each that are left over after solving the B-equations and the six parameters parametrising the initial data on two surfaces, that is .
There is one remaining subtlety: the equations (47) were derived under the assumption that (42) and (43) hold, i.e., that vanishes whenever or and that vanishes whenever or . Since , we have that . This in fact couples the B-equations that relate with the A-equations on and with the C-equations on . While this provides an additional propagation effect, it jeopardises the derivation above which rested on the assumption that we can consider the as independent of . In order to avoid this, we impose the stronger, more uniform condition that vanishes whenever p or q lie in the set of six distinct (assuming for ) points . That way, the vanishing condition on no longer depends on the labels and now, the vanishing of on is equivalent to the vanishing of on . To statisfy this stronger condition, we proceed as follows: The B-equations are ultra-local; thus, we simply set all five free coefficients that parametrise to zero on because is homogeneously linear in those. This in fact implies that all vanish at any , not only the components. Considering the A-equations and if we set a possible homogeneous solution to zero, we must ensure that the solutions vanish on . Thus, explicitly, the solution given in (64) must vanish on . Recall that depends on initial data on the hypersurfaces and . Now, ; thus, the points in with and lie on different lines. It is then straightforward to see that we can guarantee the vanishing condition on at those points by simply restricting one of the initial data in (64) on each of the two distinct lines. On the other hand, the points in fill out all of p space at six discrete values of . However, by (58) and by the stronger assumption on also, the function vanishes there identically. We may therefore consistently set on .
Summarising, for , we set for all . For , we can grant by choosing one of the initial data. Similar considerations hold for and the other directions . Note that if we would add a homogeneous solution, we could satisfy the vanishing conditions by similar restrictions. Finally, note that the sets are of “measure zero” in having “codimension” 3.
3.9.3. Non-Normalisability and Further Properties of the Solutions
Even if the free data on which generically depends linearly and homogeneously and the initial data have compact support with respect to both (subject to the above vanishing conditions), the inhomogeneous solution has non-compact support with respect to . The solution just becomes constant, it “freezes”, with respect to for sufficiently large and has compact support with respect to . Similar remarks hold for the inhomogeneous solution with respect to and the free data on which depends linearly and homogeneously and the initial data . Identical remarks hold for . This relies on the non-vanishing of and/or at generic points as argued in Section 3.6, which excludes the possibility that these vector fields have compact support.
The constraint equations at vertex A and C, respectively, only involve and , respectively, and if there was no constraint equation at vertex B, the solution of those equations could be found independently of each other, and there would be no “propagation”. Assembling the various results, the generic solution found above has the structure ()
where are five free functions on and are 12 free functions on (both subject to vanishing constraints on hypersurfaces). The functions are homogeneous linear aggregates of their arguments displayed. Modulo characteristic crossing issues, this is by far not the most general solution; we expect to be able to generically add homogeneous solutions to which depend on four free functions on , but this possibility will not play any role for what follows, because the homogeneous parts can be solved independently at vertices A and C and thus do not contribute to propagation.
The index tells that the degree of freedom is associated to vetex A while the index tells that the degree of freedom is associated to vertex C. The degree of freedom is part of both and and cannot be associated to only one of those vertices. Therefore, depends only on data associated to A if we set and depends only on data associated to C if we set . In this case, and therefore depends only on and thus also does. That is to say, if we set and thus also , then the constraint equations at vertex B are trivially satisfied and the constraint equations at vertices A and C can be solved independently of each other. As soon as one of is non-vanishing, this is no longer the case. In particular, if we perturb 6 the solution by varying the degree of freedom associated to A, this perturbs not only but also associcted to C unless , which will not be the case at generic values of . Likewise, if we perturb the solution by varying the degree of freedom associated to C, this perturbs not only but also associcted to A. A perturbation of affects both and can also not be localised to either of the two vertices A or C.
It is straightforward to check that the solution with one of non-vanishing encodes propagation in the ‘intrinsic’ sense of Section 2.3 and that in such a solution, there is immediate propagation from A to B and C to B but none from B. The maximum propagation distance is then just unity.
Since we not only have access to specific solutions but an entire class of solutions with free parameters, it is also possible to ask for a measure of the strength of ‘extrinsic’ propagation. A more precise definition can be found below, but the idea motivated by our example is as follows. We define the propagation degree of a set of solutions to be the minimal number of its free functions that must be fixed so that the parameters associated to each each vertex depends on mutually disjoint sets of the remaining free parameters. This definition makes sense, because then, the parameters for each vertex completely decouple. We define the propagation co-degree as the set of all free parameters of a set of solutions minus the propagation degree.
In our case, the parameters that are associated to vertex A are the and the parameters that are associated to vertex C are the . By inspection of (66), we see that in the case (i.e., ), the decoupling is achieved by setting . In case , we may write
and consider instead of as free parameter while remains a dependent parameter. Then, we can make only depend on and only depend on by fixing .
We conclude that the propagation degree (to be defined below) of our set of solutions is unity. The co-degree lies between four and eight depending on how many free functions parametrise the set of homogeneous solutions (neglecting the the “measure zero” freedom/restictions provided by initial data/vanishing conditions) to the constraint equations. Thus, at least two functions each can be localised to the vertices A and C, respectively, in the sense that these automatically satisfy the constraint equation at B. However, there is precisely one function that can be considered responsible for non-locality ( in the above parametrisation).
3.9.4. Propagation
The definition of propagation in Section 2.3 is based on the interpretation of the solution at fixed parameter values as already encoding a disturbance or perturbation and may be applied to any fixed solution with fixed parameter values. Since this definition of propagation is dependent on the intrinsic structure of a single solution, we referred to such propagation (see comments at the end of Section 2.3) as intrinsic. In contrast, we now discuss a definition of ‘extrinsic’ propagation based on an alternate ‘extrinsic’ interpretation of perturbations as changes from one solution to another through small changes in free parameters. That ‘extrinsic’ notion of propagation is less abstract and more adapted to the actual construction of solutions about which the ‘intrinsic’ definition gives no information.
Definition1.
1.
Suppose that a candidate first generation solution Ψ of the quantum Einstein equations based on a primordial parent graph is a linear combination with non-redundant coefficients where v runs through a subset V of and at given , i runs through an index set labelling and the labels on the edges and vertices, respectively, of which are not edges and vertices of , respectively. Finally, k runs through a fixed subset L of the labels of SNWF over . It is being understood that gauge invariance is obeyed, and some of the are automatically vanishing. It is also understood that non-unique parentage is taken into account (i.e., there is no overcounting). That is,
Suppose that the general solution to the quantum Einstein equations imposes conditions on the to the effect that they become constrained, at generic points, as follows
Here, are free functions on all of L, while are free functions on proper “lower-dimensional” subsets . As L is discrete, lower dimensional means that is parametrised by less discrete variables than L is, where those missing variables take infinitely many values in L. In addition, for each , is a linear combination of certain for some fixed v and some which label the same . Let be such that for each there exists at least one such that the function with is not identically zero. Then, Ψ is said to display propagation with respect to the choice V if the are not mutually disjoint.
2.
The propagation degree subordinate to a choice V, of a solution parametrised by the label set A, is the number of elements in the smallest set such that the sets are mutually disjoint. The maximal (minimal) propagation degree P(p) is the maximum (minimum) of over all possible choices of V. The propagation co-degree is, respectively, the number of parameters in A minus the respective propagation degree.
3.
A solution is said to be weakly propagating if (i.e., there exists V with ) and strongly propagating if (i.e., for all V we have ).
4.
A vertex is said to be correlated with if the sets are not mutually disjoint. Let be the subset of vertices correlated with v. The correlation length with respect to V is the maximum of the set where is the minimal number of edges in that one needs to traverse in order to reach from v.
This definition is also quite technical; thus, let us explain the intuitive meaning of the functions : As the number of the functions is larger than the number of equations (one for each in and ), one will try to solve the constraint equations by separating the into independent and dependent functions and solve the equations for the dependent functions. The captures those independent functions. However, as we have seen in the context of our example, the Hamiltonian constraint equations imposes conditions on the dependent , which can be considered as discrete partial differential equations (“partial difference equations”). The freedom captured by corresponds to the initial data on measure subsets that one needs to provide in a solution to those PDE’s (we may equivalently define on all of L by extending it trivially to in which case is supported only on measure zero subsets). The fact that we phrase propagation in terms of the set A only rather than also B is that the functions have support on “measure zero subsets” of L. If we would include also B into the definition of propagation, this would increase the propagation degree; hence, using only A could be considered a minimal requirement. The physical significance of this choice is not clear at the moment, and it may turn out in the future that this has to be revisited.
Another potential issue is the dependence of the definition on the choice of parameterisation. We have reduced this choice, based on the structure of our example, so that each is constructed out of in the manner described above. Whether this is too stringent a requirement to be realised in generic solution constructions or not stringent enough to prevent the notion of propagation being dependent on the available choices of parameterisation is also not clear at the moment. To see what the role of the is in our example and how they are expressed in terms of the , we note that in our example, corresponding to , with coordinates and with indices . We confine ourselves to the generic case that the vectors are linearly independent and set a possible homogeneous solution to zero. We pick as the functions which allow us to write as linear combinations of the vectors (which are prescribed by the dynamics) as above in terms of while is a dependent function, see (67). Here, we have abbreviated . Let D be the 2 × 2 matrix with entries which is non-degenerate as . Let also . Then, we can write in terms of as follows using the inverse
Since with , we have
we have demonstrated that can be expressed as linear combinations of the which refer to the graph , while can be expressed as linear combinations of the which refer to the graph . Therefore, for the index , we have the fixed graph associated to and for the index , we have the fixed graph associated to .
As for the definition of intrinsic propagation, let us apply the above definition to our example. Accordingly, interpreting a perturbation of a solution of its free coefficients associated to A that affects its free coefficients associated to C as extrinsic propagation of the perturbation from A to C via B; then, we see that extrinsic propagation is a generic feature in this example class of solutions. The crucial feature of the system (47) responsible for this is the non-trivial coupling between the and coefficients that is displayed in its third equation. The first and second condition, respectively, can be argued to provide a local condition on and , respectively, which solely arise due to the action of the Hamiltonian constraint at vertices A and C, respectively. However, the third equation which arises from its action at vertex B cannot be considered as local to B as it involves both whose “locality was already assigned” to vertex A,C, respectively. The reason for why this happens is due to the mechanism of non-unique parentage. A child vector state of the form is in the image of both and but from different parents. The parent for must adapt the charges according to , while the parent for must adapt the charges according to . Likewise, a vector child state of the form is in the image of both and but from different parents. The parent for must adapt the charges according to , while the parent for must adapt the charges according to . This means that the coefficients cannot be unambiguously associated to vertices in the sense that one has disjoint sets of coefficients that are to be solved for vertex wise with no further conditions.
We conclude that the example studied displays intrinsic propagation in the sense of Section 2.3 (i.e., in the context of a fixed solution) as well as in the extrinsic sense above in terms of perturbations of free parameters, which define the space of solutions.
4. Conclusions and Outlook
It is obvious that the propagation effect sketched above extends to more complicated graphs (e.g., those that are networks made out of arbitrarily long and knotted chains of four valent graphs intersecting in eight valent vertices and possibly with some knotted loops attached to make the graph symmetry group trivial) and will even be enhanced the higher the connectivity of the graphs and the valence of their vertices are, at least in the U(1) theory. That is, we expect that the propagation degree of a solution class, as well as the propagation distance in a (propagating) solution, that is labelled by more and more complicated graphs will drastically increase with the number and complexity of the graphs considered.
As far as the extension to SU(2) is concerned, note that the qualitative features of our example remain the same. The curvature factor in the Hamiltonian constraint now leads to shifts by in the spin quantum numbers on the edges of SNWF, and the arcs become charged with spin rather than . The only difference is that in the SU(2) case, we are not able to compute the eigenvalues of the volume operator so easily, and this was used above to give an easy proof of the absence of the disjointness of sets of coefficients required for the presence of propagation within a solution. However, it is hard to imagine that there should be an accidental symmetry that would render magically all those matrix elements of the volume operator to zero which would lead to the absence of long-range correlations of the solution of the Hamiltonian constraint. At least, the present paper establishes that the burden of proof rests on those that argue that the locality of the action of the Hamiltonian constraint at vertices implies locality of its solution with no propagation. In fact, our paper suggests a numerical proof of propagation both for Lorentzian and Euclidean GR with gauge group SU(2) by diagonalising the volume operator on four valent vertices numerically, which is feasable since the matrix elements of its fourth power are available analytically [32]. We leave this to future work which may benefit from modern numerical [23,24,25,26] methods and machine learning [27,28] and/or quantum computing [29,30,31] techniques.
Finally, in our example, we considered only a tiny subset of solutions as we took only children of “first generation” into account. More generally, one can consider solutions that involve the images of an arbitrary number of applications of the Hamiltonian constraint on CNWF. In the Euclidean theory, the set of conditions to be met by a solution to the constraints does not mix those generations, and in that sense, the analysis is complete when one controls the one-generation case. However, this no longer true in the Lorentzian theory, which does mix generations. Hence, we expect an even stronger notion of propagation for Lorentzian signature. See [19] for details.
We close by stressing again that propagation hinges on the presence of non-unique parentage. This is the case, modulo the above reservations, in QSD [5,6,19] and in the electric shift approach of [14,15] even for the Euclidean part of the constraint but generically not, e.g., for the symmetric Euclidean Hamiltonian constraint operator proposal of [37,38]: There, the the loops created by the Hamiltonian constraint are attached only to the vertex of the original graph, i.e., they intersect the original graph in that single vertex and no other point of the graph. Moreover, they lie in the coordinate plane defined by the tangents of two edges adjacent to that vertex. Accordingly, unless there are graph symmetries, such a child graph has a unique parent graph even after diffeomorphism averaging. Therefore, constraint equations at each vertex are local to that vertex. As the loop attachment does not change the spins of the edges of the parent SNWF, the Euclidean Hamiltonian constraint at a given vertex thus only imposes constraints on the intertwiners associated to that vertex, and that intertwiner space is finite dimensional. Thus, the solutions to the Euclidean Hamiltonian of [37,38] are normalisable with respect to the norm of the diffeomorphism invariant Hilbert space in contrast to the situation in [5,6] and the present paper.
Author Contributions
Conceptualization, T.T. and M.V.; Formal analysis, T.T. and M.V.; Writing—review & editing, T.T. and M.V. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Acknowledgments
We are indebted to Lee Smolin for focussing our attention on the issue of propagation both through his beautiful and remarkable paper [18] which provides a clear articulation of the problem and, subsequently, through his deeply insightful remarks and persistent queries over the years.
Note that the arXiv version of [19] differs from its published version. Both versions discuss non-symmetric and symmetric operators, but these operators are different in the two versions. What follows applies to the non-symmetric operator in the arXiv version, which coincides with the operator of [5,6], which the discussion in [18] refers to. While surprisingly non-symmetric operators are the ones of physical interest due to the arguments given in [20], nevertheless, we will also comment on a symmetric operator which, however, is different from the one discussed in the arXiv version of [19]; see Section 3.4. Both analogs of the non-symmetric and the symmetric operator discussed in this paper display propagation.
2
This property holds only for the published version of [19] and not for the arXiv version. In the arXiv version, the statement in Definition 1.2 (iii) (namely that any spin net has a uniquely identified ‘source’) is in error. As we argue in this paper, the existence of spin nets with non-unique sources is an essential ingredient for propagation.
3
Strictly speaking, only if the graphs in question have no moduli [8] or if we work in a single superselected sector. The graphs that we use in concrete calculations in the next section do not have moduli because its vertices are either 4-valent or 6-valent but with only four distinct tangent directions of the adjacent edges.
4
The exchange operators defined in [18] are (linear) maps of these and since these map solutions to solutions, they provide Dirac observables.
5
The first paper in References [14,15] constructs three such actions. The second paper seeks to demonstrate anomaly-free constraint commutators for one of them, which is referred to as the ‘Mixed Action’ in the first. Our comments here pertain to this Mixed Action.
6
This notion of ‘extrinsic’ perturbation is distinct from the intrinsic disturbance/perturbation discussed in Section 2.3.
References
Rovelli, C. Quantum Gravity; Cambridge University Press: Cambridge, UK, 2004. [Google Scholar]
Thiemann, T. Modern Canonical Quantum General Relativity; Cambridge University Press: Cambridge, UK, 2007. [Google Scholar]
Pullin, J.; Gambini, R. A first Course in Loop Quantum Gravity; Oxford University Press: New York, NY, USA, 2011. [Google Scholar]
Rovelli, C.; Vidotto, F. Covariant Loop Quantum Gravity; Cambridge University Press: Cambridge, UK, 2015. [Google Scholar]
Thiemann, T. Anomaly-free Formulation of non-perturbative, four-dimensional Lorentzian Quantum Gravity. Phys. Lett.1996, 380, 257–264. [Google Scholar] [CrossRef] [Green Version]
Creutz, M. Quarks, Gluons and Lattices; Cambridge University Press: Cambridge, UK, 1983. [Google Scholar]
Ashtekar, A.; Lewandowski, J.; Marolf, D.; Mourão, J.; Thiemann, T. Quantization for diffeomorphism invariant theories of connections with local degrees of freedom. J. Math. Phys.1995, 36, 6456–6493. [Google Scholar] [CrossRef] [Green Version]
Fleischhack, C. Representations of the Weyl algebra in quantum geometry. Commun. Math. Phys.2009, 285, 67–140. [Google Scholar] [CrossRef] [Green Version]
Lewandowski, J.; Okolow, A.; Sahlmann, H.; Thiemann, T. Uniqueness of diffeomorphism invariant states on holonomy-flux algebras. Commun. Math. Phys.2006, 267, 703–733. [Google Scholar] [CrossRef] [Green Version]
Thiemann, T. Quantum Spin Dynamics (QSD): III. Quantum Constraint Algebra and Physical Scalar Product in Quantum General Relativity. Class. Quantum Grav.1998, 15, 1207–1247. [Google Scholar] [CrossRef]
Thiemann, T. Quantum spin dynamics. VIII. The Master constraint. Class. Quant. Grav.2006, 23, 2249–2266. [Google Scholar] [CrossRef]
Giesel, K.; Thiemann, T. Scalar Material Reference Systems and Loop Quantum Gravity. Class. Quant. Grav.2015, 32, 135015. [Google Scholar] [CrossRef] [Green Version]
Varadarajan, M. Euclidean LQG Dynamics: An Electric Shift in Perspective. Class. Quant. Grav.2021, 38, 135020. [Google Scholar] [CrossRef]
Varadarajan, M. Anomaly free quantum dynamics for Euclidean LQG. arXiv2022, arXiv:2205.10779, 2022. [Google Scholar]
Laddha, A. Hamiltonian constraint in Euclidean LQG revisited: First hints of off-shell Closure. arXiv2014, arXiv:1401.0931. [Google Scholar]
Thiemann, T. Canonical Quantum Gravity, Constructive QFT and Renormalisation. Front. Phys.2020, 18, 548232. [Google Scholar] [CrossRef]
Smolin, L. The Classical limit and the form of the Hamiltonian constraint in nonperturbative quantum general relativity. arXiv1996, arXiv:gr-qc/9609034. [Google Scholar]
Thiemann, T. Quantum Spin Dynamics (QSD): II. The Kernel of the Wheeler-DeWitt Constraint Operator. Class. Quant. Grav.1998, 15, 875–905. [Google Scholar] [CrossRef]
Hajicek, P.; Kuchar, K. Constraint quantization of parametrized relativistic gauge systems in curved spacetimes. Phys. Rev. D1990, 41, 1091. [Google Scholar] [CrossRef] [PubMed]
Varadarajan, M. Propagation in Polymer Parameterised Field Theory. Class. Quant. Grav.2017, 34, 015012. [Google Scholar] [CrossRef] [Green Version]
Smolin, L. The G(Newton) → 0 limit of Euclidean quantum gravity. Class. Quant. Grav.1992, 9, 883–894. [Google Scholar] [CrossRef] [Green Version]
Glaser, L.; Steinhaus, S. Quantum Gravity on the Computer: Impressions of a Workshop. Universe2019, 5, 35. [Google Scholar] [CrossRef] [Green Version]
Han, M.; Liu, H. Effective Dynamics from Coherent State Path Integral of Full Loop Quantum Gravity. Phys. Rev. D2020, 101, 046003. [Google Scholar] [CrossRef] [Green Version]
Han, M.; Liu, H. Loop quantum gravity on dynamical lattice and improved cosmological effective dynamics with inflaton. Phys. Rev. D2021, 104, 024011. [Google Scholar] [CrossRef]
Liegener, K.; Rudnicki, L. Algorithmic approach to Cosmological Coherent State Expectation Values in LQG. Class. Quant. Grav.2021, 38, 205001. [Google Scholar] [CrossRef]
Comsa, I.; Firsching, M.; Fischbacher, T. SO(8) Supergravity and the Magic of Machine Learning. JHEP2019, 8, 057. [Google Scholar] [CrossRef] [Green Version]
Dittrich, B.; Mizera, S.; Steinhaus, S. Decorated tensor network renormalization for lattice gauge theories and spin foam models. New J. Phys.2016, 18, 053009. [Google Scholar] [CrossRef]
Li, K.; Li, Y.; Han, M.; Lu, S.; Zhou, J.; Ruan, D.; Long, G.; Wan, Y.; Lu, D.; Zeng, B.; et al. Quantum Spacetime on a Quantum Simulator. Commun. Phys.2019, 2, 1–6. [Google Scholar] [CrossRef] [Green Version]
Mielczarek, J. Prelude to Simulations of Loop Quantum Gravity on Adiabatic Quantum Computers. Front. Astron. Space Sci.2021, 8, 95. [Google Scholar] [CrossRef]
Czelusta, G.; Mielczarek, J. Quantum simulations of a qubit of space. Phys. Rev. D2021, 103, 046001. [Google Scholar] [CrossRef]
Brunnemann, J.; Thiemann, T. Simplification of the spectral analysis of the volume operator in loop quantum gravity. Class. Quant. Grav.2006, 23, 1289–1346. [Google Scholar] [CrossRef]
Varadarajan, M. Constraint algebra in Smolins’ G → 0 limit of 4d Euclidean gravity. Phys. Rev. D2018, 97, 106007. [Google Scholar] [CrossRef] [Green Version]
Tomlin, C.; Varadarajan, M. Towards an Anomaly-Free Quantum Dynamics for a Weak Coupling Limit of Euclidean Gravity. Phys. Rev.2013, 87, 044039. [Google Scholar] [CrossRef] [Green Version]
Varadarajan, M. Towards an Anomaly-Free Quantum Dynamics for a Weak Coupling Limit of Euclidean Gravity: Diffeomorphism Covariance. Phys. Rev.2013, 87, 044040. [Google Scholar] [CrossRef] [Green Version]
Sahlmann, H.; Thiemann, T. Towards the QFT on curved space-time limit of QGR. 1. A General scheme. Class. Quant. Grav.2006, 23, 867–908. [Google Scholar] [CrossRef]
Figure 1.
The parent graph. Green lines are in the y,z plane and red lines are in the x,y plane. Orange lines interchange between these planes. The u (d) lines have positive (negative) z coordinates, while the f (b) lines have positive (negative) x coordinates. The blue loops are tangent to edges at their endpoints as indicated.
Figure 1.
The parent graph. Green lines are in the y,z plane and red lines are in the x,y plane. Orange lines interchange between these planes. The u (d) lines have positive (negative) z coordinates, while the f (b) lines have positive (negative) x coordinates. The blue loops are tangent to edges at their endpoints as indicated.
Figure 2.
The figure shows the two contributing children graphs. Only the subdivided edges and arcs are highlighted; the rest of the graphs are identical to the parent graph.
Figure 2.
The figure shows the two contributing children graphs. Only the subdivided edges and arcs are highlighted; the rest of the graphs are identical to the parent graph.
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.