Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weighted satisfiability for unambiguous DNFs is in P

Open
WeightedUDNF.binary_weights_satisfiability_in_polytime

by hao jia · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

boolean-functionscomplexity-theorydnf

For every valid unambiguous DNF input with positive binary-encoded variable weights and positive binary-encoded threshold, one fixed deterministic Turing machine decides whether there is a satisfying assignment of weight at least the threshold, in time polynomial in the explicit binary input-code length. This is the weighted-satisfiability baseline recorded in the cited open-problem entry; it is not the falsifiability goal.

Preamble
import Definitions.Def_WeightedUDNF
import Mathlib.Computability.TuringMachine.Computable
Formal statement
namespace WeightedUDNF
theorem binary_weights_satisfiability_in_polytime :
    ∃ f : Input → Bool,
      ∃ machine : Turing.TM2ComputableInPolyTime encodeInput
        Computability.encodingBoolBool.encode f,
        ∀ input, validInput input → f input = satisfyingDecision input := by sorry
end WeightedUDNF
Source
Albertine Amarilli, “Weighted falsifiability for unambiguous DNFs,” List of open questions in theoretical computer science, section “Weighted falsifiability for unambiguous DNFs,” https://a3nm.net/work/research/questions/#weighted-falsifiability-for-unambiguous-dnfs. The entry's weighted-satisfiability paragraph.
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by hao jia · Oct 5, 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