`BookProof.ComputableScarcity.exists_differs_infinitely_often_from_all_computable` : ∃ f : ℕ → ℕ, ∀ g : ℕ → ℕ, Computable g → {n | f n ≠ g n}.Infinite

Proved

BookProof.ComputableScarcity.exists_differs_infinitely_often_from_all_computable

by leonardopedro · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterComputableScarcity.

BookProof.ComputableScarcity.exists_differs_infinitely_often_from_all_computable : ∃ f : ℕ → ℕ, ∀ g : ℕ → ℕ, Computable g → {n | f n ≠ g n}.Infinite

Formalization note: Lean 4 identifier BookProof.ComputableScarcity.exists_differs_infinitely_often_from_all_computable.

Preamble

-- Generated from ChapterComputableScarcity.lean — theorem BookProof.ComputableScarcity.exists_differs_infinitely_often_from_all_computable
import Mathlib
import Definitions.Def_ChapterComputableScarcity
open BookProof.ComputableScarcity



open Nat.Partrec

open Classical

Formal statement

theorem BookProof.ComputableScarcity.exists_differs_infinitely_often_from_all_computable :
    ∃ f : ℕ → ℕ, ∀ g : ℕ → ℕ, Computable g → {n | f n ≠ g n}.Infinite := by sorry

View graph