§3.3, proof of Theorem 3.1, p. 17 — d = D^µ on single additions and deletions
ProvedPrefSemimetric.TopDiff.agree_single_perturbationaxiomatic-characterizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1preference-relations
Let be a finite set and let be a semimetric on satisfying Axiom 3. Let be the measure on whose point masses are for every (assumed to be independent of , which Lemma 3.4 guarantees under Axiom 1). Then for every acyclic order and distinct :
- if are not -comparable and is acyclic, ;
- if , .
In words, and have the same value at every pair in which is a one-step perturbation of :
This is the base case of the "only if" direction of Theorem 3.1.
Formalization Note is given by point weights w with the hypothesis for all ; this is the page's definition , 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.