Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Acyclic forcing trees have unique true literals in each clause

Proved
KSATSingleFlip.Connect.forcing_tree_acyclic_true_unique

by wcysai · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

Let TTT be a forcing tree of a finite Boolean formula Φ\PhiΦ under assignment σ\sigmaσ. If the factor graph induced by the variables of TTT together with all clause vertices is acyclic, then each clause of Φ\PhiΦ has at most one literal that is true under σ\sigmaσ on the variables of TTT. This graph statement supplies the remaining acyclicity step in the bottom-up flip argument of Observation 3.2.

Preamble
import Definitions.Def_KSATSingleFlip_Connect_FactorGraph

open scoped Classical BigOperators
Formal statement
namespace KSATSingleFlip.Connect

/-- Acyclicity forces each clause to have at most one original true literal
among the variables of a forcing tree. -/
theorem forcing_tree_acyclic_true_unique {n : ℕ} (Φ : GFormula (Fin n)) (σ : Fin n → Bool)
    (T : ForcingTree Φ σ)
    (hacyclic : ((factorGraph Φ).induce {v | match v with
      | Sum.inl u => u ∈ T.vars
      | Sum.inr _ => True}).IsAcyclic) :
    ∀ c : Fin Φ.length, ∀ u ∈ T.vars, ∀ v ∈ T.vars,
      Φ.get c u = some (σ u) → Φ.get c v = some (σ v) → u = v := by
  sorry

end KSATSingleFlip.Connect
Source
Wang, Yin, Yu, Zhang, Single-Variable Connectivity in Random k-SAT, Observation 3.2, printed p. 14 (PDF p. 16) of STOC 2027 submission #737, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/737.pdf

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