The In-Out Formalism for In-In Correlators

Authors: Yaniv Donath, Enrico Pajer

38+10 pages, 4 figures
License: CC BY 4.0

Abstract: Cosmological correlators, the natural observables of the primordial universe, have been extensively studied in the past two decades using the in-in formalism pioneered by Schwinger and Keldysh for the study of dissipative open systems. Ironically, most applications in cosmology have focused on non-dissipative closed systems. We show that, for non-dissipative systems, correlators can be equivalently computed using the in-out formalism with the familiar Feynman rules. In particular, the myriad of in-in propagators is reduced to a single (Feynman) time-ordered propagator and no sum over the labelling of vertices is required. In de Sitter spacetime, this requires extending the expanding Poincar\'e patch with a contracting patch, which prepares the bra from the future. Our results are valid for fields of any mass and spin but assuming the absence of infrared divergences. We present three applications of the in-out formalism: a representation of correlators in terms of a sum over residues of Feynman propagators in the energy-momentum domain; an algebraic recursion relation that computes Minkowski correlators in terms of lower order ones; and the derivation of cutting rules from Veltman's largest time equation, which we explicitly develop and exemplify for two-vertex diagrams to all loop orders. The in-out formalism leads to a natural definition of a de Sitter scattering matrix, which we discuss in simple examples. Remarkably, we show that our scattering matrix satisfies the standard optical theorem and the positivity that follows from it in the forward limit.

Submitted to arXiv on 08 Feb. 2024

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.