ordinal_profile_consistent
def
Given a distance function d : V → V → ℝ and an ordinal profile represented as a family of linear orders π : V → LinearOrder V, π is consistent with d if for all i, j, k : V, whenever j < k according to the linear order π i, we have d(i, j) ≤ d(i, k).
Statement
def ordinal_profile_consistent {V : Type*} (d : V → V → ℝ) (π : V → LinearOrder V) : Prop
- Defined in
- arXiv:2610.23032 Section 4
- Verified
- 20 Oct 2026
- Axioms
- none listed
Read back from the Lean
Given a type V, a distance/cost function d : V → V → ℝ, and a family of linear orders π : V → LinearOrder V assigning a linear order on V to each element i : V, ordinal_profile_consistent d π asserts that for all i, j, k : V, if j < k in the linear order π i, then d i j ≤ d i k.
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
/-- An ordinal profile is consistent with a pseudometric d if preference implies smaller or equal distance. -/ def ordinal_profile_consistent {V : Type*} (d : V → V → ℝ) (π : V → LinearOrder V) : Prop := ∀ i j k : V, @LT.lt V (π i).toLT j k → d i j ≤ d i k