Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary A.5 — SCI of dld_ldl​ is exactly lll

Open
AutoformalisationSCI.corollary_A_5

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

arithmetical-hierarchycomputabilitymathematical-logicsci-hierarchy

Corollary A.5 (p. 22). For each l≥2l\ge 2l≥2 and k≥9k\ge 9k≥9, let Ξdl:N→{0,1}\Xi_{d_l}:\mathbb N\to\{0,1\}Ξdl​​:N→{0,1} be the decision problem of the set dld_ldl​ (i.e. Ξdl(e)=1\Xi_{d_l}(e)=1Ξdl​​(e)=1 iff e∈dle\in d_le∈dl​). With the enumeration of Theorem A.4,

SCIA(Ξdl)=lfor every l≥2.\mathrm{SCI}_A(\Xi_{d_l})=l\qquad\text{for every }l\ge 2.SCIA​(Ξdl​​)=lfor every l≥2.

Equivalently, the decision problem for dld_ldl​ lies in Δl+1A∖ΔlA\Delta^A_{l+1}\setminus\Delta^A_lΔl+1A​∖ΔlA​.

This transfers the Σl0\Sigma^0_lΣl0​-completeness of dld_ldl​ (Theorem A.4) into an exact Solvability Complexity Index, using that the SCI hierarchy generalises the arithmetical hierarchy (Remark A.2). It is the key input to the main SCI = ∞ conclusion.

Preamble
import Mathlib
import Definitions.Def_AutoformalisationSCI_SCI
import Definitions.Def_AutoformalisationSCI_Poly

open AutoformalisationSCI
Formal statement
namespace AutoformalisationSCI

theorem corollary_A_5 (l k : ℕ) (hl : 2 ≤ l) (hk : 9 ≤ k) (E : ComputablePolyEnum (l - 1 + k)) :
    SCI_A (setProblem (dSetL l k hl E)) = (l : WithTop ℕ) := 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. Corollary A.5, p. 22; Remark A.2, p. 19.
Read-back

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

Universally quantified over l,k:Nl,k:\mathbb Nl,k:N with hl:2≤lhl:2\le lhl:2≤l, hk:9≤khk:9\le khk:9≤k, and a computable enumeration EEE in l−1+kl-1+kl−1+k variables. It asserts the equality SCI_A (setProblem (dSetL l k hl E)) = (l : WithTop ℕ): the Solvability Complexity Index of the decision problem of dld_ldl​ equals the natural number lll (viewed in WithTop ℕ, so it is finite and exactly lll, neither smaller nor ⊤\top⊤). The side conditions l≥2l\ge2l≥2, k≥9k\ge9k≥9 are hypotheses.

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