Tame Complexity of Effective Field Theories in the Quantum Gravity Landscape
Thomas W. Grimm, David Prieto, Mick van Vliet
TL;DR
The paper introduces tame geometry, particularly sharp o-minimality, as a quantitative framework to bound the apparently infinite data of EFTs in quantum gravity. It formulates the Finite Complexity Conjecture, asserting that EFTs up to a fixed cutoff $\Lambda$ admit uniform, finite tame complexity and that the space of such EFTs has a finite EFT covering, with EFT domains capturing local descriptions across moduli spaces. By connecting to string compactifications and dualities, the authors illustrate how differential constraints and dual representations reorganize infinite Wilsonian data into finite information, and they define notions of EFT domains, coverings, and volumes that yield well-defined, finite counting. The approach provides a unified language for finiteness phenomena across the swampland program and offers a route to quantitative bounds on the landscape, with concrete examples in higher-dimensional supergravity and Calabi–Yau moduli spaces. If developed further, this framework could yield explicit complexity bounds and volume-counting formulas, deepening our understanding of quantum-gravity constraints on low-energy physics.
Abstract
Effective field theories consistent with quantum gravity obey surprising finiteness constraints, appearing in several distinct but interconnected forms. In this work we develop a framework that unifies these observations by proposing that the defining data of such theories, as well as the landscape of effective field theories that are valid at least up to a fixed cutoff, admit descriptions with a uniform bound on complexity. To make this precise, we use tame geometry and work in sharply o-minimal structures, in which tame sets and functions come with two integer parameters that quantify their information content; we call this pair their tame complexity. Our Finite Complexity Conjectures are supported by controlled examples in which an infinite Wilsonian expansion nevertheless admits an equivalent finite-complexity description, typically through hidden rigidity conditions such as differential or recursion relations. We further assemble evidence from string compactifications, highlighting the constraining role of moduli space geometry and the importance of dualities. This perspective also yields mathematically well-defined notions of counting and volume measures on the space of effective theories, formulated in terms of effective field theory domains and coverings, whose finiteness is naturally enforced by the conjectures.
