What was already known
Earlier high-dimensional spanner lower bounds restricted paths to two hops. It remained open whether near-linear edge counts were possible at some constant stretch without a hop restriction.
AI involvement
The paper credits a harness running Gemini 4 Carbon with discovering the proof with minimal human steering. Zuzic, Woodruff and Mirrokni prepared the formal verification. Waingarten, Jayaram, Zuzic and Woodruff prepared the exposition.
- AI disclosure in the manuscriptAI disclosure in the manuscript
Importance
The lower bound rules out near-linear-size graphs that preserve all distances up to a fixed constant in this model, even with auxiliary vertices.
Technical verification
The repository maps the geometric and non-metric Steiner bounds to its minimal Lean specification and proof. The paper reports a separate kernel replay and use of the three standard Lean axioms.
Formal checking
Checked the statements for geometric spanners and non-metric Steiner spanners, including the unrestricted-path lower bound.
- Checker
- Lean 4 kernel
- Scope
- For every fixed stretch and every finite , there are arbitrarily large n-point subsets of a logarithmic-dimensional binary cube in for which every undirected Steiner C-spanner needs edges for some . Auxiliary vertices, arbitrary nonnegative edge weights and unrestricted path lengths are allowed.
- Basis
- Reported by the linked checker
- Lean proof of the two main boundsLean proof of the two main bounds
Human understanding
The authors identify random constraint-satisfaction instances as the source of the hard point sets. The source credits humans with presenting the proof and leaves individual reconstruction of its central counting argument undocumented.
Other useful sources
Correction and publication history
Reviewed the primary result and its documented AI and checking scope.
Read this published revision