Projective blowups: a formal and multicentered proof
A. Mayeux
math.AG
Aug 13, 2026 · v2
cs.LO
TL;DR
Formalizes in Lean 4 and Mathlib the universal property of multicentered blowups of schemes, built by gluing multicentered dilatation charts via multigraded Proj.
Abstract
We give a machine-checked proof, in Lean 4, of the universal property of multi- centered blowups: given a finite family Z of closed subschemes of a scheme X, presented on each chart by ideals, there is a scheme BlZ X over X, terminal among X-schemes on which every member of the family becomes an effective Cartier divisor. To the best of our knowledge this is the first formalisation of blowups, single- or multicentered, in any theorem prover. The proof is organised around the universal property of the multicentered dilatation of a ring. The comparison isomorphisms on overlaps, the cocycle identity, and the independence of the chosen presentation are obtained from the uniqueness part of this universal property. We give the exact theorem statement as formalized, the proof architecture, and the main new mathematical ingredients, together with the corresponding Lean code.
Problem
Blowups are a foundational construction in algebraic geometry, but no theorem prover had formalized them, single- or multicentered. The goal is a machine-checked proof of the universal property of multicentered blowups along a finite family of closed subschemes.
Approach
Centres are encoded as presented closed subschemes, given by ideals on an affine open cover and taken up to equivalence. The proof rests on the universal property of multicentered dilatations of rings and uses the multigraded Proj of Brenner and Schröer to obtain the affine blowup. Local blowups are then glued over charts. Overlap isomorphisms, the cocycle identity and independence of the presentation all follow from the uniqueness part of the dilatation universal property.
Results
The paper gives a complete Lean 4 proof that Bl_Z X is terminal among X-schemes on which every centre becomes an effective Cartier divisor. The proof needs no noetherian, properness or finite type hypotheses. A table maps each paper statement to its Lean declaration.