AFTD Auto-Formalizing Theoretical Domains

is_consistent_pseudometric

def

Given types V and C, a pseudometric space instance on V ⊕ C, and an election profile prof : V → LinearOrder C assigning a linear order on C to each voter v in V, is_consistent_pseudometric V C prof asserts that for all voters v in V and all candidates a and b in C, if dist (Sum.inl v) (Sum.inr a) < dist (Sum.inl v) (Sum.inr b), then (prof v).lt b a (meaning candidate b is strictly less than candidate a under the linear order prof v).

Statement

def is_consistent_pseudometric (V C : Type*) [PseudoMetricSpace (V ⊕ C)]
    (prof : V → LinearOrder C) : Prop
Defined in
arXiv:2610.26535 Section 2.1
Verified
24 Oct 2026
Axioms
none listed
Used by 4

Read back from the Lean

Given types V and C such that their sum V ⊕ C is equipped with a pseudometric space structure [PseudoMetricSpace (V ⊕ C)], and given a profile prof : V → LinearOrder C assigning a linear order on C to each v : V, is_consistent_pseudometric V C prof asserts that: For every v : V and every a, b : C, if the pseudometric distance between Sum.inl v and Sum.inr a is strictly less than the pseudometric distance between Sum.inl v and Sum.inr b, then b is strictly less than a with respect to the linear order prof v (that is, (prof v).lt b a).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Consistency between a pseudometric space on V ⊕ C and an election profile. -/
def is_consistent_pseudometric (V C : Type*) [PseudoMetricSpace (V ⊕ C)]
    (prof : V → LinearOrder C) : Prop :=
  ∀ (v : V) (a b : C),
    dist (Sum.inl v) (Sum.inr a) < dist (Sum.inl v) (Sum.inr b) →
      (prof v).lt b a
See it in the graphDiscuss this resultChallenge it