Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem A.3 — Σ20\Sigma^0_2Σ20​-completeness of ddd

Open
AutoformalisationSCI.theorem_A_3

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

arithmetical-hierarchycomputabilitydiophantinemathematical-logic

Theorem A.3 (p. 19). Fix an integer k≥9k\ge 9k≥9. For any computable enumeration (pe)e∈N(p_e)_{e\in\mathbb N}(pe​)e∈N​ of all integer-coefficient polynomials in k+1k+1k+1 variables, let Be(n)B_e(n)Be​(n) be the predicate that pe(n,x1,…,xk)≠0p_e(n,x_1,\dots,x_k)\ne0pe​(n,x1​,…,xk​)=0 for every (x1,…,xk)∈Nk(x_1,\dots,x_k)\in\mathbb N^k(x1​,…,xk​)∈Nk, and let

d={e∈N:(∃n∈N) Be(n)}.d=\{e\in\mathbb N:(\exists n\in\mathbb N)\,B_e(n)\}.d={e∈N:(∃n∈N)Be​(n)}.

Then ddd is Σ20\Sigma^0_2Σ20​-complete (under computable many-one reductions). In particular, ddd is not Turing-reducible to the halting problem ∅′\emptyset'∅′: no algorithm, even with an oracle for the halting problem, can always determine whether the least number nen_ene​ of Example 4.1 is well-defined.

This is the base case of the paper's hierarchy of presupposition-resolution problems and the precise form of the claim that resolving the ambiguity in Example 4.1 is harder than the halting problem.

Preamble
import Mathlib
import Definitions.Def_AutoformalisationSCI_Arith
import Definitions.Def_AutoformalisationSCI_Oracle
import Definitions.Def_AutoformalisationSCI_Poly

open AutoformalisationSCI
Formal statement
namespace AutoformalisationSCI

theorem theorem_A_3 (k : ℕ) (hk : 9 ≤ k) (E : ComputablePolyEnum (k + 1)) :
    SigmaComplete 2 (dSet k E) ∧ ¬ SetTuringReducible (dSet k E) (jumpIter 1) := 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. Theorem A.3, p. 19; Eq. (A.3), p. 19; Example 4.1, p. 13.
Read-back

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

The theorem is universally quantified over a natural number kkk, a proof hkhkhk that 9≤k9\le k9≤k, and a computable polynomial enumeration EEE in k+1k+1k+1 variables. It asserts the conjunction of two statements about the set d={e:∃n, Be(n)}d=\{e:\exists n,\,B_e(n)\}d={e:∃n,Be​(n)} built from EEE: (1) SigmaComplete 2 d, i.e. d∈Σ20d\in\Sigma^0_2d∈Σ20​ and every Σ20\Sigma^0_2Σ20​ set many-one reduces to ddd; and (2) ¬ SetTuringReducible d (jumpIter 1), i.e. the characteristic function of ddd is not computable relative to the oracle ∅(1)\emptyset^{(1)}∅(1) (the halting problem). The hypothesis k≥9k\ge9k≥9 is required; the enumeration is arbitrary (only the computability/surjectivity packaged in ComputablePolyEnum is assumed).

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