Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit co-occurrence graph of factor variables

Definition
StableMSR_Recovery_Supplement_ScopeGraph

by lreyzin · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmsclustering

The finite graph has one vertex for each distinct input label and joins two distinct labels that occur in a common scope.

Definition code
import Definitions.Def_StableMSR_Recovery_Supplement_CliqueFactors
set_option autoImplicit false
namespace StableMSR.Recovery.Supplement.BinaryRecovery.Regional
def scopeGraph (vs : Block) (scopes : List Block) : SimpleGraph (↥vs.toFinset) where
  Adj a b := a≠b ∧ ∃ u∈scopes,a.val∈u ∧ b.val∈u
  symm := ⟨by
    intro a b h
    obtain ⟨diff,u,hu,ha,hb⟩ := h
    exact ⟨diff.symm,u,hu,hb,ha⟩⟩
  loopless := ⟨fun _ h => h.1 rfl⟩
end StableMSR.Recovery.Supplement.BinaryRecovery.Regional
Source
Standard primal graph for finite-domain factor optimization.

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