Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Capping ANRAM advice queries by the time bound

Proved
CNFEncComplexity.ANRAM.anramEvaluates_cap

by bersubs · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theorysatisfiability

With nonempty advice, capping the number of prefetched advice pairs at the time bound preserves the function evaluated by the ANRAM.

Preamble
import Definitions.Def_CNFEncComplexity_AnramEvaluates

open CNFEncComplexity
Formal statement
theorem CNFEncComplexity.ANRAM.anramEvaluates_cap {n : ℕ} (prog : List Instr) (A : List Bool) (b t : ℕ)
    (f : (Fin n → Bool) → Bool) (hA : 0 < A.length) :
    AnramEvaluates prog A b t f ↔ AnramEvaluates prog A (min b t) t f := by sorry
Source
Krapivin, Przybocki, Subercaseaux, The CNF Encoding Complexity of Boolean Functions, arXiv:2611.05614, Theorem 2, Section 3.2.

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