Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§3.3, proof of Theorem 3.1, p. 17 — d = D^µ on single additions and deletions

Proved
PrefSemimetric.TopDiff.agree_single_perturbation

by mikedeng1 · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

axiomatic-characterizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1preference-relations

Let XXX be a finite set and let ddd be a semimetric on A(X)\mathcal A(X)A(X) satisfying Axiom 3. Let μ\muμ be the measure on 2X2^X2X whose point masses are μ{b}=d(≿ab,≿ab+)\mu\{b\}=d(\succsim_{ab},\succsim^+_{ab})μ{b}=d(≿ab​,≿ab+​) for every a≠ba\ne ba=b (assumed to be independent of aaa, which Lemma 3.4 guarantees under Axiom 1). Then for every acyclic order ≿\succsim≿ and distinct a,b∈Xa,b\in Xa,b∈X:

  1. if a,ba,ba,b are not ≻\succ≻-comparable and ≿⊕(a,b)\succsim\oplus(a,b)≿⊕(a,b) is acyclic, d(≿,≿⊕(a,b))=Dμ(≿,≿⊕(a,b))d(\succsim,\succsim\oplus(a,b))=D^\mu(\succsim,\succsim\oplus(a,b))d(≿,≿⊕(a,b))=Dμ(≿,≿⊕(a,b));
  2. if a≻ba\succ ba≻b, d(≿,≿⊖(a,b))=Dμ(≿,≿⊖(a,b))d(\succsim,\succsim\ominus(a,b))=D^\mu(\succsim,\succsim\ominus(a,b))d(≿,≿⊖(a,b))=Dμ(≿,≿⊖(a,b)).

In words, ddd and DμD^\muDμ have the same value at every pair (≿,⊵)(\succsim,\trianglerighteq)(≿,⊵) in which ⊵\trianglerighteq⊵ is a one-step perturbation of ≿\succsim≿:

d(≿,⊵)=Dμ(≿,⊵).d(\succsim,\trianglerighteq)=D^\mu(\succsim,\trianglerighteq).d(≿,⊵)=Dμ(≿,⊵).

This is the base case of the "only if" direction of Theorem 3.1.

Formalization Note μ\muμ is given by point weights w with the hypothesis w(b)=d(≿ab,≿ab+)w(b)=d(\succsim_{ab},\succsim^+_{ab})w(b)=d(≿ab​,≿ab+​) for all a≠ba\ne ba=b; this is the page's definition μ{b}=mb\mu\{b\}=m_bμ{b}=mb​, with its well-definedness (Lemma 3.4) taken as part of the hypothesis.

Preamble
import Mathlib
import Definitions.Def_PrefSemimetric_TopDiff_Model
Formal statement
namespace PrefSemimetric.TopDiff

theorem agree_single_perturbation {X : Type*} [Fintype X] [DecidableEq X]
    (d : (X → X → Prop) → (X → X → Prop) → ℝ) (hd : IsSemimetric d) (h3 : Axiom3 d)
    (w : X → ℝ) (hw : ∀ a b, a ≠ b → w b = d (prefAB a b) (prefABplus a b))
    (R : X → X → Prop) (hR : IsAcyclicOrder R) (a b : X) (hab : a ≠ b) :
    (¬ asymmPart R a b → ¬ asymmPart R b a → IsAcyclicOrder (oplus R a b) →
        d R (oplus R a b) = Dmu w R (oplus R a b)) ∧
      (asymmPart R a b → d R (ominus R a b) = Dmu w R (ominus R a b)) := by sorry

end PrefSemimetric.TopDiff
Source
Nishimura & Ok, A Class of Dissimilarity Semimetrics for Preference Relations, arXiv:2203.04418v1, p. 17, §3.3, proof of Theorem 3.1 (definition of mb and µ; 'Conclusion: d and Dµ have the same value at (≿, ⊵) for every ≿, ⊵ ∈ A(X) where ⊵ is a one-step perturbation of ≿.')
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 20, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me