Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remarks after Theorem A.4 — complement and Turing degree of dld_ldl​

Open
AutoformalisationSCI.theorem_A_4_degree_remarks

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

arithmetical-hierarchycomputabilitymathematical-logicturing-degrees

Remarks following Theorem A.4 (p. 22). For every l≥2l\ge 2l≥2 and k≥9k\ge 9k≥9:

  1. the complement of dld_ldl​ is Πl0\Pi^0_lΠl0​-complete; and
  2. dld_ldl​ has the Turing degree of ∅(l)\emptyset^{(l)}∅(l) (since ∅(l)\emptyset^{(l)}∅(l) is Σl0\Sigma^0_lΣl0​-complete by Post's theorem).

These record the exact position of dld_ldl​ in both the many-one and the Turing degrees, complementing the Σl0\Sigma^0_lΣl0​-completeness of Theorem A.4.

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_4_degree_remarks (l k : ℕ) (hl : 2 ≤ l) (hk : 9 ≤ k)
    (E : ComputablePolyEnum (l - 1 + k)) :
    PiComplete l (dSetL l k hl E)ᶜ ∧
      SetTuringEquivalent (dSetL l k hl E) (jumpIter l) := 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. Paragraph following the proof of Theorem A.4, p. 22.
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 conjunction: (1) PiComplete l (dSetL l k hl E)ᶜ, i.e. the set-complement of dld_ldl​ is Πl0\Pi^0_lΠl0​-complete under many-one reductions; and (2) SetTuringEquivalent (dSetL l k hl E) (jumpIter l), i.e. dl≤T∅(l)d_l\le_T\emptyset^{(l)}dl​≤T​∅(l) and ∅(l)≤Tdl\emptyset^{(l)}\le_T d_l∅(l)≤T​dl​. Both side conditions 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