Consistency:
OpenAutoformalisationSCI.dSetL_two_eq_dSetcomputabilitymathematical-logic
Consistency remark (p. 22). With the same and the same polynomial enumeration, the case of the predicate is exactly , so that . This recovers Theorem A.3 as the instance of Theorem A.4.
This is a sanity check that the general level- construction specialises correctly to the base case.
Preamble
import Mathlib import Definitions.Def_AutoformalisationSCI_Poly open AutoformalisationSCI
Formal statement
namespace AutoformalisationSCI
theorem dSetL_two_eq_dSet (k : ℕ) (E : ComputablePolyEnum (k + 1)) :
dSetL 2 k (by omega)
(cast (congrArg ComputablePolyEnum (by omega : k + 1 = 2 - 1 + k)) E) =
dSet k E := by sorry
end AutoformalisationSCISource
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 ('the case l = 2 gives B_e^(2)(n) = B_e(n) ... so that d_2 = d').
Read-back
What the Lean code literally says, in plain math · claude-opus-4-8
Universally quantified over and a computable enumeration in variables. It asserts the set equality dSetL 2 k (by omega) E = dSet k E, where the side condition 2 ≤ 2 is discharged by omega. No further hypotheses. This identifies the level-2 set with the base set .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.