Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Existential projection of a computable relation is c.e.

Proved
FriedbergMuchnik.recursive_projection_re

by tomasz · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

computability-theoryfriedberg-muchnikpriority-construction

Let R⊆N×NR\subseteq\mathbb N\times\mathbb NR⊆N×N be a computable relation: membership of (n,s)(n,s)(n,s) is decidable by a total computable procedure. Its projection onto the first coordinate is computably enumerable:

Computable⁡(R)⟹RE⁡({n∈N:∃s∈N, R(n,s)}).\operatorname{Computable}(R)\quad\Longrightarrow\quad\operatorname{RE}\bigl(\{n\in\mathbb N:\exists s\in\mathbb N,\ R(n,s)\}\bigr).Computable(R)⟹RE({n∈N:∃s∈N, R(n,s)}).

No bound on the witness sss is assumed. A row with no witness gives a nonmember of the projection. This general closure property converts effective stage membership into computable enumerability of a limit set.

Preamble
import Mathlib.Computability.RE
Formal statement
namespace FriedbergMuchnik

theorem recursive_projection_re (R : ℕ → ℕ → Prop)
    (hR : ComputablePred (fun p : ℕ × ℕ => R p.1 p.2)) :
    REPred (fun n => ∃ s, R n s) := by sorry

end FriedbergMuchnik
Source
General closure lemma underlying the passage from the recursive finite-stage sequence to its r.e. unions in Arnold W. Miller, Lecture notes in Recursion Theory, December 3, 2008, Section 26, Theorem 26.2, pp. 51–54, https://people.math.wisc.edu/~awmille1/old/m773-07/recthy.pdf#page=51, p. 53. Formal API: Partrec.rfind and Nat.rfind_dom in https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Computability/Partrec.lean; Partrec.dom_re and REPred in https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Computability/RE.lean.

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