Reduction technique for expanding the Feynman diagrams in AdS 2

arXiv:2609.29306 · hep-th · Submitted 2026-09-24 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: High Energy Physics: Theory. The day in high-energy theory: gravity, strings, fields and the questions left open.

Kai: We're looking at the paper: "Reduction technique for expanding the Feynman diagrams in AdS 2".

Mira: Here's the gist of the paper. Reduction technique for expanding the Feynman diagrams in AdS 2 form a method to systematically decompose n-point AdS Feynman diagrams into Wilson line networks by reducing them to problems involving (n-1)-point diagrams, thereby circumventing issues related to exponential growth in intermediate terms and complex integral relations This technique is crucial because it provides a constructive way to reconstruct bulk observables from boundary conformal blocks and vice versa Decomposition of AdS Diagrams The paper introduces the decomposition of AdS Feynman tree diagrams in two dimensions into the matrix elements of Wilson networks, referred to as AdS vertex functions, which are holographically reconstructed global conformal blocks This decomposition is important because it circumvents the difficulty of calculating Feynman diagrams in AdS spacetime when the propagator is given by a Gauss hypergeometric function.

Kai: The purpose of this decomposition is twofold: firstly, since the AdS Feynman propagator is not a simple rational function, this decomposition provides an alternative representation of AdS Feynman diagrams that avoids AdS integration.

Mira: Secondly, it is important for understanding the AdS/CFT correspondence by providing a constructive way to reconstruct bulk observables from boundary ones and vice versa.

Kai: The Reduction Technique The reduction technique is formulated to address two main problems encountered when applying the standard decomposition algorithm to higher-point diagrams.

Paper summary: Kai: To get into more detail, this paper focuses on decomposing AdS Feynman tree diagrams in two dimensions into matrix elements of Wilson line networks, which they call AdS vertex functions.

Mira: The main thesis is that this decomposition bypasses the difficulty where the AdS propagator isn't a simple rational function like it is in Minkowski space, which means you don't have to mess with those tricky AdS integrations.

Lev: So, it offers an alternative representation for these Feynman diagrams that avoids that specific integration problem entirely.

Kai: The decomposition also has this dual purpose: first, to avoid the messy integrals and second, to provide a constructive link between the bulk physics we calculate and the boundary physics we observe.

Mira: This connection is important because it shows you can reconstruct those bulk observables from things you know about the boundary.

Lev: It's not just theoretical; they show how this method works by applying it to all topologically distinct five-point AdS Feynman tree diagrams to prove the technique actually works for those cases.

Kai: And they found that the resulting expansions near the conformal boundary actually match what we already know about the decompositions of those five-point Witten diagrams into conformal blocks.

Mira: That's a strong result, showing that this reduction leads to known structures when you look at the boundary behavior.

Lev: The paper also sets up an algorithm for constructing these expansions directly from the diagram's graph, which is helpful for practical applications.

Conclusion: Kai: So, looking at the title, "Reduction technique for expanding the Feynman diagrams in AdS two", it sounds like a method designed to tame those notoriously difficult expansions we usually run into when dealing with higher order quantum field theory in curved space <ref:2609.29306#pg2>.

Mira: The authors are essentially proposing this reduction technique to handle the complexity of n-point diagrams without letting the calculation scale exponentially with n.

Lev: What this means for us is that if you want to calculate bulk dynamics, you don't have to face that massive intermediate term problem directly anymore; you can build up from smaller, known cases.

Kai: The implication for the world is that it gives us a concrete way to bridge the gap between the quantum field theory on the boundary and the gravitational physics in AdS space by providing a reliable mathematical tool for reconstruction.

Mira: They showed this works by using those five-point diagrams, which is a good test case because those specific results match what we already expect from Witten diagrams.

Lev: The method itself seems robust for these lower point calculations, and they even laid out an algorithm for building the expansions directly from the diagram's graph structure.

Kai: It suggests that this systematic decomposition approach might be a viable path forward for systematically understanding how bulk observables relate to their boundary counterparts in holographic setups.

I.E. Tamm Department of Theoretical Physics · Moscow Institute of Physics and Technology

hep-th

Submitted: 2026-09-24

Updated: 2026-11-16

Comments: 34 pages, 5 figures. V3: Added more clarifying comments in the Introduction and Conclusion, extended the description of the reduction technique, added a new integral relation in Section 3, typos corrected. Journal version

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 77/100

The gist: Reduction technique for expanding the Feynman diagrams in AdS 2 form a method to systematically decompose n-point AdS Feynman diagrams into Wilson line networks by reducing them to problems involving…

Key concepts

AdS Feynman Diagrams
These are mathematical representations of physical processes in Anti-de Sitter (AdS) spacetime, often used in string theory. They are complex integrals that describe how fields interact within this curved spacetime.
Wilson Line Networks
These networks represent the structure of the AdS Feynman diagrams after decomposition. They provide a systematic way to organize and reconstruct the full diagram from simpler components, essentially mapping bulk interactions to boundary structures.
AdS Vertex Functions
These are holographically reconstructed global conformal blocks that arise from decomposing AdS Feynman tree diagrams. They serve as an alternative representation of the original diagrams, bypassing difficult AdS integration by linking bulk and boundary physics.
Reduction Technique
This is a three-part method used to handle high-point diagrams. It reduces the problem by first summing (n-1)-point diagrams, then substituting Wilson network expansions, and finally using integral relations to convert these back into n-point vertex functions.

Terminology

Summary

Reduction technique for expanding the Feynman diagrams in AdS 2 form a method to systematically decompose n-point AdS Feynman diagrams into Wilson line networks by reducing them to problems involving (n-1)-point diagrams, thereby circumventing issues related to exponential growth in intermediate terms and complex integral relations This technique is crucial because it provides a constructive way to reconstruct bulk observables from boundary conformal blocks and vice versa

Decomposition of AdS Diagrams

The paper introduces the decomposition of AdS Feynman tree diagrams in two dimensions into the matrix elements of Wilson networks, referred to as AdS vertex functions, which are holographically reconstructed global conformal blocks This decomposition is important because it circumvents the difficulty of calculating Feynman diagrams in AdS spacetime when the propagator is given by a Gauss hypergeometric function. The purpose of this decomposition is twofold: firstly, since the AdS Feynman propagator is not a simple rational function, this decomposition provides an alternative representation of AdS Feynman diagrams that avoids AdS integration. p. 2 Secondly, it is important for understanding the AdS/CFT correspondence by providing a constructive way to reconstruct bulk observables from boundary ones and vice versa. p. 2

The Reduction Technique

The reduction technique is formulated to address two main problems encountered when applying the standard decomposition algorithm to higher-point diagrams. These problems are:

  1. The large number of intermediate terms produced by step (i) of the algorithm, which grows exponentially with n. p. 2

  2. The structure of the algorithm itself, where part (2) requires converting modified diagrams into AdS vertex functions using integral representations, which is hindered if the diagram has many internal bulk-to-bulk propagators. p. 2

The reduction technique consists of three parts:

  1. Applying step (i) of the previous method to two external legs sharing a common vertex, resulting in a sum of integrals of (n-1)-point AdS Feynman diagrams. p. 2

  2. Substituting the Wilson network expansions of these (n-1)-point diagrams, yielding a sum of integrals of (n-1)-point AdS vertex functions. p. 2

  3. Applying integral relations between (n-1)-point and n-point AdS vertex functions to convert the former into the latter. p. 2

Integral Relations for Vertex Functions

The core of the reduction technique relies on using integral relations between (n-1)-point and n-point AdS vertex functions, similar to those used in equation (3.12). These relations are essential for the final step of the decomposition. p. 9 For instance, the relation (4. p. 17) converts integrals into five-point AdS vertex functions by relating a geodesic integral of an (n-1)-point AdS vertex function to the n-point AdS vertex function. p. 9 The proof of this relation involves using auxiliary identities like those in (A. p. 913) and the four-point AdS vertex function identity. p. 8

Decompositions of Five-Point Diagrams

The reduction technique is demonstrated by applying it to all topologically distinct five-point AdS Feynman tree diagrams. For the five-point contact diagram, the final result (4. p. 111) shows a standard structure where external weights are single-trace, and remaining terms have at least one multi-trace weight. p. 5 The boundary asymptotics of these resulting expansions reproduce the known conformal block decompositions of the corresponding five-point Witten diagrams. p. 0 Similar results are obtained for single-exchange and double-exchange diagrams, which coincide with those from [18]. p. 5

Algorithm for Constructing Expansions

An algorithm is formulated to construct the expansion of a diagram directly from its graph by analyzing expansions of three-, four-, and five-point diagrams. This algorithm involves several steps:

  1. Consider the n-point AdS Feynman diagram with n ≤ 5, applying transformations if it contains a non-cubic vertex. p. 9

  2. Apply steps 2 and 3 (h˜1) to obtain the arrangement of weights in the resulting AdS vertex function. p. 9

  3. Apply steps 4, 5, and 6 to obtain the term in the expansion. p. 9

Conclusion

The reduction technique successfully circumvents the two main obstructions of the previous decomposition algorithm: a large number of intermediate terms that grows rapidly with n and the necessity of complex integral relations between modified AdS Feynman diagrams and AdS vertex functions. The technique has been applied to all three topologically distinct five-point AdS Feynman tree diagrams, yielding Wilson network expansions in terms of AdS vertex functions with single-trace and multi-trace weights. p. 3 The resulting expansions reproduce the known conformal block decompositions of the corresponding five-point Witten diagrams at the conformal boundary. p. 0 Furthermore, an algorithm for constructing individual terms of the expansion directly from the graph is formulated. p. 5 The application to cubic vertex diagrams can be carried out straightforwardly, and it is expected that integral relations for arbitrary topologies can be found in future work. p. 2

B List of Coefficients of the Expansions

The paper provides extensive lists of coefficients for the resulting expansions, categorized by the number of double-trace weights in the AdS vertex function, including single-trace and two double-trace weights. These coefficients are derived from analyzing the graph structure and weight arrangements determined by the algorithm. p. 1

B.1 Coefficients for (4. p. 1 p. 114)

The coefficients in the expansion (4.14) are given by specific expressions involving Pochhammer symbols and Gamma functions. p. 8 These coefficients are consistent with the algorithm formulated at the end of Section 4. p. 54.

B.2 Coefficients and Weight Arrangements for (4. p. 116)

The coefficients and weight arrangements for (4.16) are also detailed, categorized by the number of double-trace weights, including single-trace and two double-trace weights. p. 5

B.3 Coefficients of the AdS Vertex Functions

The coefficients of the AdS vertex functions with three double-trace weights are also provided, categorized by various permutations of index exchanges. These coefficients are derived from analyzing graph structures and weight arrangements. p. 1

B.4 Algorithm for Constructing Expansions

The algorithm for constructing the expansion involves several steps, including a transformation to a simplified diagram consisting only of cubic vertices, followed by steps 2 and 3 (h˜1) to determine the arrangement of weights. Steps 4, 5, and 6 then produce the resulting term in the expansion. p. 3

B.5 Coefficients for Five-Point Diagrams

The coefficients for the five-point diagrams are categorized based on whether they involve single-trace or two double-trace weights. These coefficients are derived from analyzing the structure of the resulting terms. p. 3

B.7 References

The paper lists several references, including works on holographic reconstructions and Wilson line networks in AdS space. These references provide the theoretical foundation for the decomposition methods used in the study. p. 3

**B.1 Coefficients for (4.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. The AI system can perform recursive decomposition of n-point AdS Feynman diagrams by reducing them to (n-1)-point problems, as described in Section 3, which avoids an exponential increase in intermediate terms.

  2. The system can construct individual terms of the expansion directly from the graph of a diagram by applying steps 4 through 7 of the algorithm, thereby automating the complex coefficient and weight arrangement process.

  3. The AI can verify consistency between bulk AdS Feynman diagrams and boundary Witten diagram decompositions by comparing their respective boundary asymptotics, such as those in equations (4.21) and (4.23).

  4. The system can calculate specific coefficients of the Wilson network expansions for five-point diagrams using the provided lists in Appendix B, including single-trace and multi-trace weights.

  5. The system can apply transformation rules to simplify arbitrary n-point Feynman diagrams by repeatedly applying step 1 of the algorithm until only cubic vertices remain, as detailed in Section 4.4.

Sources

Related papers