Skip to content
#small language model Open access

A Geometric and Metric-Measure Framework for the Yang–Mills Mass Gap

Oct 2026 · Zenodo (CERN European Organization for Nuclear Research)
Quantum Chromodynamics and Particle Interactions

Abstract

This paper studies the Gribov–Zwanziger formulation of Yang–Mills theory as a metric-measure problem and separates what is proved from what is assumed. It does not solve the Yang–Mills existence and mass gap problem. The mass-gap result is conditional only: it holds if (i) regularized ground-state measures on the Gribov region satisfy a uniform Bakry–Émery curvature bound CD(K,∞), and (ii) the corresponding Hamiltonians converge in the strong resolvent sense after an isometric identification of their Hilbert spaces. Under those two unproved hypotheses, the continuum Hamiltonian has a gap of at least g²K/2. Neither hypothesis is established here; no mass gap is claimed. Proved unconditionally: on every finite-dimensional Galerkin truncation of the Gribov region, in flat Landau-slice coordinates, the Faddeev–Popov log-determinant and the horizon function are convex, with an analogous statement for lattice SU(2) in one gauge chart. The strong-convexity modulus of the horizon function tends to zero as the truncation cutoff is removed, so this convexity gives no uniform curvature bound and does not establish hypothesis (i). Several smaller facts (linearity of the gap criterion in K, exact L^(1/2) scaling of the distance to the Gribov horizon, infinite Federer reach of the closure of the convex Gribov region, a tree-level estimate) are proved with stated scope. Known Bakry–Émery bounds for strongly coupled lattice Yang–Mills theory are discussed; they do not supply hypothesis (i). Formal verification. Selected elementary statements of this paper are formalized in Lean 4 with Mathlib (no `sorry`, no added axiom; `#print axioms` reports only the standard axioms) in the folder `formal_proofs_mathlib` of the author's repository, modules `LeanReal/YangMills`, `YangMills_Y4`, `YangMills_Y4a` and `YangMills_Y5`, each as a declared reduction stated in that folder's README: YangMills — the convexity of the Gribov region and that 0 lies in it, for an abstract affine pencil in any real vector space, with M₀ > 0 as a hypothesis (Prop. 4.2(a)); the unique nearest point in its closure, in a complete real inner-product space (Prop. 4.2(d); Federer's reach itself is not formalized); the tree-level bound k² + λ⁴/k² ≥ 2λ² with its equality case, algebraically (the Gribov–Zwanziger quadratic form is not derived); YangMills_Y4 — the convexity and strict convexity of −log det on the positive-definite cone and on Galerkin pencils, strict iff the pencil map is injective (Lemma 4.6(b); part (a) and the boundary limit are not in this module); YangMills_Y4a — the symmetry and affinity of M_N and that the truncated region is open, convex and contains 0 (Lemma 4.6(a)), in an abstract integration-by-parts model where two torus facts are hypotheses and the model is proved only for the circle T¹ (the Faddeev–Popov operator is not formalized); YangMills_Y5 — the range of the tight-binding band E(θ) = −2t cos θ and the finite circulant ring (Prop. on tight binding; the spectrum on ℓ²(ℤ) is not proved). Negative controls (`mutant_gribov_nonaffine`, `mutant_tree_level`) are proved false in the same modules. The paper's own Verification-status paragraph now names all four modules by name, including Lemma 4.6(a) (`YangMills_Y4a`). The mass gap, the conditional theorem, its hypotheses, items (b)–(c) of Prop. 4.2 and reach(Ω) = 0 are not formalized. The older Lean 4 files in `formal_proofs_yang_mills` are a placeholder skeleton without Mathlib and verify none of the mathematics. Repository: https://github.com/reinaldomsilvafilho-netizen/quantum-gravity-lean4 Use of AI and status. Large language model assistants (Anthropic Claude; Google Gemini) were used extensively, as disclosed in the paper's Declarations, in line with the Leiden Declaration on Artificial Intelligence and Mathematics (arXiv:2609.35334): the mathematics was checked by AI sessions that had not written it (blind review, independent correction, targeted re-check). These checks are not peer review. This is a preprint: Zenodo is a repository, not a peer-reviewed venue, and no result has yet been checked by an independent human expert. Funding: CAPES, Finance Code 001.

View source

Similar papers

#small language model Dataset Open access Oct 2026

Socratic guiding questions in synthetic arithmetic data: matched LoRA runs (revision v2)

Supporting data, adapters, predictions and code for the article *Low-Cost LoRA Fine-Tuning of Small Language Models for Multi-Step Arithmetic Reasoning* by Jake O'Grady, Asena Isik Gürhan, Chee Fong Ting and Effirul Ramlan (University of Galway). We generated 20,000 GSM8K-derived arithmetic problems with step-by-step s...

O'Grady, Jake, Gürhan, Asena Isik, Chee, Fong Ting et al. · 465 citations
#computer vision Open access Jun 2016

Software Development in Startup Companies: The Greenfield Startup Model

The results are packaged in the Greenfield Startup Model (GSM), which explains the priority of startups to release the product as quickly as possible, and the need to shorten time-to-market, by speeding up the development through low-precision engineering activities.

Carmine Giardino, Nicolò Paternoster, M. Unterkalmsteiner et al. · 178 citations · ⚡14
#computer vision Open access Oct 2016

Software Startups - A Research Agenda

Software startup companies develop innovative, software-intensive products within limited timeframes and with few resources, searching for sustainable and scalable business models.

M. Unterkalmsteiner, P. Abrahamsson, Xiaofeng Wang et al. · 157 citations · ⚡17
#machine learning Review Open access Oct 2016

“Failures” to be celebrated: an analysis of major pivots of software startups

This study conducts a case survey study based on the secondary data of the major pivots happened in 49 software startups, and demonstrates that customer need pivot is the most common among all pivot types.

Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguyen-Duc et al. · 127 citations · ⚡15
#computer vision Review Open access May 2015

A survey study on major technical barriers affecting the decision to adopt cloud services

The comparison of adopter and non-adopter sample reveals three potential adoption inhibitor, security, data privacy, and portability, which underlines the importance of the technical and security perspectives for research investigating the adoption of technology.

Nattakarn Phaphoom, Xiaofeng Wang, S. Samuel et al. · 111 citations · ⚡8
#computer vision Open access Feb 2018

Lean Internal Startups for Software Product Innovation in Large Companies: Enablers and Inhibitors

This study investigates how Lean internal startup facilitates software product innovation in large companies and identifies its enablers and inhibitors, and shows the potential of the method-in-action framework to investigate the Lean startup approach in non-startup context.

Henry Edison, Nina M. Smørsgård, Xiaofeng Wang et al. · 78 citations · ⚡6

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.