Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index; none of the 55 sources its claims cite is checked for support yet.

Taming Thiemann’s Hamiltonian constraint in canonical loop quantum gravity: Reversibility, eigenstates, and graph-change analysis

Open access
Guedes, T. L. M., Mena Marugán, G. A., Müller, M., Vidotto, F. · 2025 · Physical Review D

Published version of a preprint

Abstract

The Hamiltonian constraint remains an elusive object in loop quantum gravity because its action on spinnetworks leads to changes in their corresponding graphs. As a result, calculations in loop quantum gravity are often considered unpractical, and neither the eigenstates of the Hamiltonian constraint, which form the physical space of states, nor the concrete effect of its graph-changing character on observables are entirely known. Much worse, there is no reference value to judge whether the commonly adopted graph-preserving approximations lead to results anywhere close to the non-approximated dynamics. Our work sheds light on many of these issues, by devising a new numerical tool that allows us to implement the action of the Hamiltonian constraint without the need for approximations and to calculate expectation values for geometric observables. To achieve that, we fill the theoretical gap left in the derivations of the action of the Hamiltonian constraint on spinnetworks: we provide the first complete derivation of such action for the case of 4-valent spinnetworks, while updating the corresponding derivation for 3-valent spinnetworks. Our derivations also include the action of the volume operator. By proposing a new approach to encode spinnetworks into functions of lists and the derived formulas into functionals, we implement both the Hamiltonian constraint and the volume operator numerically. We are able to transform spinnetworks with graph-changing dynamics perturbatively and verify that volume expectation values have rather different behavior from the approximated, graph-preserving results. Furthermore, using our tool we find a family of potentially relevant solutions of the Hamiltonian constraint. Our work paves the way to a new generation of calculations in loop quantum gravity, in which graph-changing results and their phenomenology can finally be accounted for and understood.

Overview

CoChat Summary

TL;DR

The paper provides a complete recoupling-theory derivation of Thiemann’s Euclidean Hamiltonian constraint on 3- and 4-valent spin-network nodes and implements it numerically without graph-preserving approximations. It finds that graph-preserving dynamics can misestimate volume expectation values by nearly an order of magnitude and identifies new zero-eigenvalue solutions of the constraint.

Key findings

  • The authors give the first complete derivation of the Euclidean Hamiltonian constraint action on 4-valent spin networks using modern graphical calculus, update the 3-valent derivation, and include the volume operator.
  • Their Mathematica implementation applies the graph-changing constraint without approximations and evolves fiducial 4-valent node-like spin networks perturbatively in the lapse, up to third order when all links are allowed and up to fourth order when one link is excluded.
  • Graph-preserving dynamics “miss estimates the volume expectation value both in absolute value and in the location of its minima” by nearly one order of magnitude at moderate lapse; it also violates the equality of volume profiles seen for inner virtual spins \(i=0\) and \(i=1\) under graph-changing dynamics.
  • They find zero-eigenvalue eigenstates: for 3-valent spin networks, only \(j_1=j_2=j_3=0\) within the searched range; for 4-valent spin networks, the family \(j_1=j_2=j_3=j_4=i=0\). They also propose a more general family of solutions built from any desired spin network, Eq. (88).

Methods

  • Analytical derivation uses SU(2) recoupling theory, Wigner \(3j\), \(6j\), and \(9j\) symbols, intertwiners, and graphical calculus to compute the action of the Euclidean scalar constraint and volume operator on 3- and 4-valent node-like spin networks.
  • Numerical implementation is a Mathematica code encoding spin networks as ordered lists inside “ghost functions”; the Hamiltonian constraint is a linear functional acting on these arguments, with normalizer, collector, and volume functionals.
  • The unitary generated by the constraint, \(\hat U=\exp(-i\hat C_s[N])\), is expanded perturbatively in the lapse \(N\) and applied to fiducial spin networks with \(j_1=j_2=j_3=j_4=1/2\), \(\varepsilon=0\), and \(i=0\) or \(i=1\); computational times are reported, e.g. 168.8 s for \(\{1/2,1/2,1/2,1/2,0\}\) and 6543.8 s for \(\{1,1,1,1,0\}\).

Limitations

  • Stated: computational-time limitations prevented completing graph-changing calculations at fourth order; the study considers only two spin networks, so the numerical data are “the first evidence” rather than a proof, and only the volume operator is used as a figure of merit.
  • Stated: the work uses the Euclidean constraint, not the Lorentzian one; the physical inner product remains out of reach, the proposed solution series may not converge, and the solutions may not yet capture the full phenomenology of general relativity.
  • Stated/evident: the analysis is restricted to low spins and perturbative lapse values; graph-preserving comparisons depend on the chosen spin-network structure, and the authors note that calculations at lapse values close to unity may be questionable in a perturbative study.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1103/hjdk-kdhk

Cites

61 of 61 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

FIG. 1 Schematic representations of spin networks. (a) A 3-valent spin network node (bottom) is transformed under the action of the Hamiltonian to give a modified structure containing an inner loop (top), exemplifying the graph-changing character of the nonapproximated Hamiltonian constraint. (b) A minimal example of spin network: the dipole model. Two 4-valent nodes are connected through their links pairwise, so that the dual to such graph is formed by two tetrahedra with faces glued pairwise (what cannot be visualized in 3D). These tetrahedra represent the quanta of volume. (c) Under the action of a unitary generated by the Hamiltonian, with a perturbative evolution parameter N called lapse (which mathematically behaves similarly to the time in standard quantum mechanics), a transformed spin network node behaves differently when either graph-changing or graph-preserving dynamics is considered. The volume, with contributions up to second order in N displayed, decreases much slower with N when the approximation of nonchanging graphs is adopted (dotted curve, right dipole), while the correct dynamics produces a steeper volume reduction with N at leading perturbative order (solid curve, left dipole). The data for the volume dependence on N for these two cases consider a single spin network node with spins 1 = 2 on its four links and spin 0 (red) or 1 (black) in the central link (not displayed in the dipole model) and therefore do not entirely represent the dynamics of the dipole model, which was included for illustrative purposes.
FIG. 1 Schematic representations of spin networks. (a) A 3-valent spin network node (bottom) is transformed under the action of the Hamiltonian to give a modified structure containing an inner loop (top), exemplifying the graph-changing character of the nonapproximated Hamiltonian constraint. (b) A minimal example of spin network: the dipole model. Two 4-valent nodes are connected through their links pairwise, so that the dual to such graph is formed by two tetrahedra with faces glued pairwise (what cannot be visualized in 3D). These tetrahedra represent the quanta of volume. (c) Under the action of a unitary generated by the Hamiltonian, with a perturbative evolution parameter N called lapse (which mathematically behaves similarly to the time in standard quantum mechanics), a transformed spin network node behaves differently when either graph-changing or graph-preserving dynamics is considered. The volume, with contributions up to second order in N displayed, decreases much slower with N when the approximation of nonchanging graphs is adopted (dotted curve, right dipole), while the correct dynamics produces a steeper volume reduction with N at leading perturbative order (solid curve, left dipole). The data for the volume dependence on N for these two cases consider a single spin network node with spins 1 = 2 on its four links and spin 0 (red) or 1 (black) in the central link (not displayed in the dipole model) and therefore do not entirely represent the dynamics of the dipole model, which was included for illustrative purposes.From the PDF
Image 2
From the PDF
Image 3
From the PDF
Image 4
From the PDF
Image 5
From the PDF
Image 6
From the PDF
Image 7
From the PDF
Image 8
From the PDF
Image 9
From the PDF
Image 10
From the PDF
In Eq. (28), the three (magenta) dots represent the specific locations chosen for ' breaking ' the links and contracting
In Eq. (28), the three (magenta) dots represent the specific locations chosen for ' breaking ' the links and contractingFrom the PDF
Image 12
From the PDF
Image 13
From the PDF
Image 14
From the PDF
Image 15
From the PDF
Image 16
From the PDF
Image 17
From the PDF
Image 18
From the PDF
Image 19
From the PDF
Image 20
From the PDF
Image 21
From the PDF
Image 22
From the PDF
Image 23
From the PDF
Image 24
From the PDF
Image 25
From the PDF
Image 26
From the PDF
Image 27
From the PDF
Image 28
From the PDF
Image 29
From the PDF
Image 30
From the PDF
Image 31
From the PDF
Image 32
From the PDF
Image 33
From the PDF
Image 34
From the PDF
Image 35
From the PDF
Image 36
From the PDF
Image 37
From the PDF
Image 38
From the PDF
Image 39
From the PDF
Image 40
From the PDF
Image 41
From the PDF
Image 42
From the PDF
Image 43
From the PDF
Image 44
From the PDF
Image 45
From the PDF
Image 46
From the PDF
Image 47
From the PDF
Image 48
From the PDF
Image 49
From the PDF
Image 50
From the PDF
Image 51
From the PDF
Image 52
From the PDF
Image 53
From the PDF
Image 54
From the PDF
Image 55
From the PDF
Image 56
From the PDF
Image 57
From the PDF
Image 58
From the PDF
Image 59
From the PDF
Image 60
From the PDF
Image 61
From the PDF
Image 62
From the PDF
Image 63
From the PDF
Image 64
From the PDF
Image 65
From the PDF
Image 66
From the PDF
Image 67
From the PDF
Image 68
From the PDF
Image 69
From the PDF
Image 70
From the PDF
FIG. 2 (a) Schematic representation of the graphical changes introduced by the Hamiltonian constraint on 4-valent node-like spin networks. The central spin network contains its encoding function represented below. The rest of spin networks, differing from the central one by the addition of an inner loop at the location indicated within the arrows, are represented by the functions f ðf j 1 ; j 2 ; j 3 ; j 4 ; a; j 2 ; b; j 4 ; k; 1 ; 1 = 2 ; j 1 ; j 3 ; 0 ; … ; 0 gÞ , f ðf j 1 ; j 2 ; j 3 ; j 4 ; j 1 ; b; a; j 4 ; k; 2 ; 1 = 2 ; j 2 ; j 3 ; 0 ; … ; 0 gÞ , f ðf j 1 ; j 2 ; j 3 ; j 4 ; j 1 ; b; j 3 ; a; k; 3 ; 1 = 2 ; j 2 ; j 4 ; 0 ; … ; 0 gÞ , f ðf j 1 ; j 2 ; j 3 ; j 4 ; a; j 2 ; j 3 ; b; k; 4 ; 1 = 2 ; j 1 ; j 4 ; 0 ; … ; 0 gÞ , f ðf j 1 ; j 2 ; j 3 ; j 4 ; a; b; j 3 ; j 4 ; k; 5 ; 1 = 2 ; j 1 ; j 2 ; 0 ; … ; 0 gÞ , and f ðf j 1 ; j 2 ; j 3 ; j 4 ; j 1 ; j 2 ; a; b; k; 6 ; 1 = 2 ; j 3 ; j 4 ; 0 ; … ; 0 gÞ , respectively, for loop insertions at positions 1, 2, 3, 4, 5, and 6. (b) Pseudocode for the Hamiltonian implementation. The code checks whether an inner loop is present. If absent, it introduces inner loops in all six locations, with spin 1 = 2 on the newly created link. If present, for each possible location, a series of steps are followed. The case for location 1 is shown, while for other locations the dashed-line continuation of the diagram implies the presence of similar rules not shown. The corresponding innermost loop has its spins shifted by all allowed values without graph changes. If the connecting link reaches spin 0, it is removed, and the inner-loop data in the corresponding list are shifted to the left by four entries. Additionally, inner loops are added to all other positions, but if a loop was added at position 3 right before adding one at position 1 (these loops share no links), it is again possible to remove its extra link or simply change its spin. The diagram contains examples for the simplest spin networks for which the rules apply.
FIG. 2 (a) Schematic representation of the graphical changes introduced by the Hamiltonian constraint on 4-valent node-like spin networks. The central spin network contains its encoding function represented below. The rest of spin networks, differing from the central one by the addition of an inner loop at the location indicated within the arrows, are represented by the functions f ðf j 1 ; j 2 ; j 3 ; j 4 ; a; j 2 ; b; j 4 ; k; 1 ; 1 = 2 ; j 1 ; j 3 ; 0 ; … ; 0 gÞ , f ðf j 1 ; j 2 ; j 3 ; j 4 ; j 1 ; b; a; j 4 ; k; 2 ; 1 = 2 ; j 2 ; j 3 ; 0 ; … ; 0 gÞ , f ðf j 1 ; j 2 ; j 3 ; j 4 ; j 1 ; b; j 3 ; a; k; 3 ; 1 = 2 ; j 2 ; j 4 ; 0 ; … ; 0 gÞ , f ðf j 1 ; j 2 ; j 3 ; j 4 ; a; j 2 ; j 3 ; b; k; 4 ; 1 = 2 ; j 1 ; j 4 ; 0 ; … ; 0 gÞ , f ðf j 1 ; j 2 ; j 3 ; j 4 ; a; b; j 3 ; j 4 ; k; 5 ; 1 = 2 ; j 1 ; j 2 ; 0 ; … ; 0 gÞ , and f ðf j 1 ; j 2 ; j 3 ; j 4 ; j 1 ; j 2 ; a; b; k; 6 ; 1 = 2 ; j 3 ; j 4 ; 0 ; … ; 0 gÞ , respectively, for loop insertions at positions 1, 2, 3, 4, 5, and 6. (b) Pseudocode for the Hamiltonian implementation. The code checks whether an inner loop is present. If absent, it introduces inner loops in all six locations, with spin 1 = 2 on the newly created link. If present, for each possible location, a series of steps are followed. The case for location 1 is shown, while for other locations the dashed-line continuation of the diagram implies the presence of similar rules not shown. The corresponding innermost loop has its spins shifted by all allowed values without graph changes. If the connecting link reaches spin 0, it is removed, and the inner-loop data in the corresponding list are shifted to the left by four entries. Additionally, inner loops are added to all other positions, but if a loop was added at position 3 right before adding one at position 1 (these loops share no links), it is again possible to remove its extra link or simply change its spin. The diagram contains examples for the simplest spin networks for which the rules apply.From the PDF
FIG. 3 Variation of the dimensionless volume expectation value with respect to the lapse under different scenarios. The curves correspond to two fiducial spin networks with j 1 ¼ j 2 ¼ j 3 ¼ j 4 ¼ 1 = 2 , ε ¼ 0 , and i ¼ 0 (red) or i ¼ 1 (black). We compare graph-changing dynamics with (dot-dashed lines) and without (solid lines) allowing the Hamiltonian to act on the link along p 4 , as well as a graph-preserving transformation of the spin network shown in Fig. 4(c) (dashed lines). Unitary transformations are expanded up to third order in N for the full graphchanging case, and fourth order otherwise. Note that, as expected from our discussion in the main text, the third-order contributions to the volume vanish. It is possible to see that the graphpreserving dynamics miss estimates the volume expectation value both in absolute value and in the location of its minima. The graph-preserving dynamics also violates the equality between volume profiles observed for the two choices of inner virtual spins, i ¼ 0 and i ¼ 1 . The input spin networks employed in the calculations are normalized. The inset gives the corresponding curves for the variance, ðh ˆ V 2 i -h ˆ V i 2 Þ =V 2 0 . Recall that V 0 is the global constant factor introduced in our definition of the volume operator.
FIG. 3 Variation of the dimensionless volume expectation value with respect to the lapse under different scenarios. The curves correspond to two fiducial spin networks with j 1 ¼ j 2 ¼ j 3 ¼ j 4 ¼ 1 = 2 , ε ¼ 0 , and i ¼ 0 (red) or i ¼ 1 (black). We compare graph-changing dynamics with (dot-dashed lines) and without (solid lines) allowing the Hamiltonian to act on the link along p 4 , as well as a graph-preserving transformation of the spin network shown in Fig. 4(c) (dashed lines). Unitary transformations are expanded up to third order in N for the full graphchanging case, and fourth order otherwise. Note that, as expected from our discussion in the main text, the third-order contributions to the volume vanish. It is possible to see that the graphpreserving dynamics miss estimates the volume expectation value both in absolute value and in the location of its minima. The graph-preserving dynamics also violates the equality between volume profiles observed for the two choices of inner virtual spins, i ¼ 0 and i ¼ 1 . The input spin networks employed in the calculations are normalized. The inset gives the corresponding curves for the variance, ðh ˆ V 2 i -h ˆ V i 2 Þ =V 2 0 . Recall that V 0 is the global constant factor introduced in our definition of the volume operator.From the PDF
FIG. 4 (a) -(c) Three different choices of spin networks, selected for the study of graph-preserving dynamics. Structures (b) and (c) are modular, as implied by the dotted links above and below. The red dots mark locations where loops can be coupled (note the absence of loops coupled from the sides of the spin networks, even though this is technically possible). The loops extend along the entire perimeter of the regions marked by these red dots. The red link represents the sole intertwiner acted upon by the graph-preserving Hamiltonian, and its spin takes values i ¼ 0 or i ¼ 1 , each corresponding to red or black volume profiles in (d), respectively. (d) Variation of the dimensionless volume expectation value with respect to the lapse N for the three different choices of spin networks. The unitary transformation is expanded up to fourth order in N . Volumes of spin networks (a), (b), and (c) are represented by long-dashed, dotted, and dashed lines, respectively. Note the similarity of the results for spin networks (b) and (c), particularly when i ¼ 0 . The inset shows the corresponding curves for the variance, ðh ˆ V 2 i -h ˆ V i 2 Þ =V 2 0 , where V 0 is the global constant factor introduced in our definition of the volume operator.
FIG. 4 (a) -(c) Three different choices of spin networks, selected for the study of graph-preserving dynamics. Structures (b) and (c) are modular, as implied by the dotted links above and below. The red dots mark locations where loops can be coupled (note the absence of loops coupled from the sides of the spin networks, even though this is technically possible). The loops extend along the entire perimeter of the regions marked by these red dots. The red link represents the sole intertwiner acted upon by the graph-preserving Hamiltonian, and its spin takes values i ¼ 0 or i ¼ 1 , each corresponding to red or black volume profiles in (d), respectively. (d) Variation of the dimensionless volume expectation value with respect to the lapse N for the three different choices of spin networks. The unitary transformation is expanded up to fourth order in N . Volumes of spin networks (a), (b), and (c) are represented by long-dashed, dotted, and dashed lines, respectively. Note the similarity of the results for spin networks (b) and (c), particularly when i ¼ 0 . The inset shows the corresponding curves for the variance, ðh ˆ V 2 i -h ˆ V i 2 Þ =V 2 0 , where V 0 is the global constant factor introduced in our definition of the volume operator.From the PDF
Image 74
From the PDF
Image 75
From the PDF
Image 76
From the PDF
Image 77
From the PDF
Image 78
From the PDF
Image 79
From the PDF
Image 80
From the PDF
Image 81
From the PDF
Image 82
From the PDF
Image 83
From the PDF
Image 84
From the PDF
Image 85
From the PDF
Image 86
From the PDF
Image 87
From the PDF
Image 88
From the PDF
Image 89
From the PDF
Image 90
From the PDF
Image 91
From the PDF
Image 92
From the PDF
Image 93
From the PDF

Verification

Claims the paper makes

0 Valid · 3 Not valid · 27 Not checked · 178 Own results and interpretations

94 more claims

Create a free account to see all 208 claims and every source verdict.

See all claims — free account
  • It may state two separate claims as one. 65
  • Probably not a substantial claim. 63
  • The quote only partly states this claim. 1

Create a free account to see these claims.

Citations

Cites

Show all 61 references

Research works printed but not linked: 3

  1. P. A. M. Dirac, 2001, Lectures on Quantum Mechanics
  2. D. Brink, 1968, Angular Momentum
  3. A. Messiah, 1962, Quantum Mechanics Vol. II

Cited by

See all 5

Metadata

Authors
Guedes, T. L. M., Mena Marugán, G. A., Müller, M., & Vidotto, F.
Affiliations
  • Forschungszentrum Jülich (DE)
  • Instituto de Estructura de la Materia, IEM-CSIC
  • Western University (CA)
Venue
Physical Review D
Published
2025-07-22
Volume
112
Issue
2
ISSN
  • 2470-0010 (ISSN-L)
  • 2470-0029
OpenAlex
W4411630364
Cited by
5
References
61
Citations by year
2026: 4 · 2025: 1
FWCI
2.06
Type
journal article
Language
en
Open access
Locations
  • Physical review. D/Physical review. D. (publishedVersion, cc-by)
  • DIGITAL.CSIC (Spanish National Research Council (CSIC)) (submittedVersion, cc-by)
Funders
  • John Templeton Foundation (62312)
  • European Research Council (804247)
  • HORIZON EUROPE European Research Council (101114305, 101046968)
  • Deutsche Forschungsgemeinschaft
  • Canada Excellence Research Chairs, Government of Canada
  • Natural Sciences and Engineering Research Council of Canada
  • Institut Périmètre de physique théorique
  • Government of Canada
  • Industry Canada
  • Ontario Ministry of Economic Development and Innovation
  • Ministerio de Ciencia e Innovación
  • Agencia Estatal de Investigación
  • Federación Española de Enfermedades Raras (PID2020-118159GB-C41)
  • Ministerio de Ciencia, Innovación y Universidades (PID2023-149018NB-C41)
  • European Social Fund Plus
  • Cluster of Excellence Matter and Light for Quantum Computing (EXC 2004/1, 390534769)
  • Hightech Agenda Bayern Plus
Topics
  • Physical Sciences › Physics and Astronomy › Nuclear and High Energy Physics › Noncommutative and Quantum Gravity Theories
  • Physical Sciences › Physics and Astronomy › Astronomy and Astrophysics › Relativity and Gravitational Theory
  • Physical Sciences › Physics and Astronomy › Nuclear and High Energy Physics › Black Holes and Theoretical Physics
Keywords
loop quantum gravity, Hamiltonian constraint, spin networks, physical Hilbert space, eigenstates, volume operator, expectation values, reversibility, physical subspace

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

A language model drew the claims from the paper on 2026-10-29, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-29 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Taming Thiemann’s Hamiltonian constraint in canonical loop quantum gravity: Reversibility, eigenstates, and graph-change analysis. https://app.cochat.ai/papers/10.1103/hjdk-kdhk
The paper
Guedes, T. L. M., Mena Marugán, G. A., Müller, M., & Vidotto, F. (2025). Taming Thiemann’s Hamiltonian constraint in canonical loop quantum gravity: Reversibility, eigenstates, and graph-change analysis. Physical Review D. https://doi.org/10.1103/hjdk-kdhk

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.