AFTD Auto-Formalizing Theoretical Domains

is_single_peaked

def

A strict preference relation P over a linearly ordered set of alternatives A is single-peaked with peak p if moving toward p strictly increases preference: for x < y ≤ p or p ≤ y < x, y is strictly preferred to x.

Statement

def is_single_peaked {A : Type*} [LinearOrder A] (P : A → A → Prop) (p : A) : Prop
Defined in
Black (1948), The Decisions of a Committee Using a Special Majority; Arrow (1951)
Verified
08 Oct 2026
Axioms
propext
Used by 3

Read back from the Lean

For a linearly ordered type $A$, a binary relation $P$ on $A$, and an element $p \in A$, is_single_peaked P p is defined to hold if and only if: 1. For all $x, y \in A$, if $x < y$ and $y \le p$, then $P(y, x)$; and 2. For all $x, y \in A$, if $p \le y$ and $y < x$, then $P(y, x)$.

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

/-- Single-peakedness of a pairwise strict preference relation along a linear order of alternatives. -/
def is_single_peaked {A : Type*} [LinearOrder A] (P : A → A → Prop) (p : A) : Prop := ∀ x y : A, ((x < y ∧ y ≤ p) ∨ (p ≤ y ∧ y < x)) → P y x
See it in the graphDiscuss this resultChallenge it