Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Main result — SCI = ∞ for presupposition resolution

Open
AutoformalisationSCI.presupposition_resolution_sci_infinite

by LG · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

autoformalisationcomputabilitymathematical-logicsci-hierarchy

Main result (Appendix A.2.1, pp. 22–23). Fix k≥9k\ge 9k≥9 and any family of computable enumerations of integer-coefficient polynomials, one for each level. Consider the combined presupposition-resolution problem: given e∈Ne\in\mathbb Ne∈N and a level l≥2l\ge 2l≥2, decide whether {n:Be(l)(n)}\{n:B_e^{(l)}(n)\}{n:Be(l)​(n)} is nonempty. Then

SCIA(combined problem)=∞.\mathrm{SCI}_A(\text{combined problem})=\infty.SCIA​(combined problem)=∞.

This is the precise form of the paper's headline claim that providing semantically faithful AI autoformalisation is harder than any computational problem: a trustworthy autoformaliser that always outputs either a semantically faithful translation or "this statement cannot be translated" must resolve the above question for every eee and l≥2l\ge 2l≥2, a problem harder than every problem of finite SCI. It follows from Corollary A.5, since a finite tower for the combined problem would restrict to a tower of the same height for each fixed level lll, contradicting SCIA(Ξdl)=l\mathrm{SCI}_A(\Xi_{d_l})=lSCIA​(Ξdl​​)=l for lll larger than that height.

Preamble
import Mathlib
import Definitions.Def_AutoformalisationSCI_SCI
import Definitions.Def_AutoformalisationSCI_Poly

open AutoformalisationSCI
Formal statement
namespace AutoformalisationSCI

theorem presupposition_resolution_sci_infinite (k : ℕ) (hk : 9 ≤ k)
    (E : ∀ l : ℕ, ComputablePolyEnum (l - 1 + k)) :
    SCI_A (combinedProblem k E) = ⊤ := by sorry

end AutoformalisationSCI
Source
A. Bastounis, F. Circelli, A. C. Hansen, Navier–Stokes lost in translation, arXiv:2610.08144 (2026), https://arxiv.org/abs/2610.08144. Appendix A.2.1, pp. 22–23; abstract; §4.1 and §5.
Read-back

What the Lean code literally says, in plain math · claude-opus-4-8

Universally quantified over k:Nk:\mathbb Nk:N with hk:9≤khk:9\le khk:9≤k, and a family EEE assigning to every natural number lll a computable polynomial enumeration in l−1+kl-1+kl−1+k variables. It asserts SCI_A (combinedProblem k E) = ⊤, i.e. the Solvability Complexity Index of the combined decision problem (over all levels l≥2l\ge2l≥2, encoded by pairing l−2l-2l−2 with eee) is ⊤\top⊤ (= +∞+\infty+∞) in WithTop ℕ: no finite arithmetic tower computes it. The hypothesis k≥9k\ge9k≥9 is required; the family of enumerations is arbitrary subject to ComputablePolyEnum at each level.

Human review
  • Endorsed by Shuze Chen · Nov 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me