AFTD Auto-Formalizing Theoretical Domains

swf_lower_restricted_dominance

def

A social welfare function W on infinite utility streams in [0, 1] satisfies lower restricted dominance if for all a < b in [0, 1], W(Stream'.const a) < W(Stream'.cons b (Stream'.const a)).

Statement

def swf_lower_restricted_dominance (W : Stream' (Set.Icc (0 : ℝ) 1) → ℝ) : Prop
Defined in
arXiv:2610.38824 after Proposition 1
Verified
02 Nov 2026
Axioms
none listed

Read back from the Lean

A welfare function $W$, which maps infinite streams of real numbers from the closed unit interval $[0, 1]$ to $\mathbb{R}$, satisfies swf_lower_restricted_dominance if and only if for all $a, b \in [0, 1]$ with $a < b$, the value of $W$ on the constant stream $(a, a, a, \dots)$ is strictly less than the value of $W$ on the stream $(b, a, a, a, \dots)$ (i.e., the stream whose first element is $b$ and all subsequent elements are $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

/-- A social welfare function satisfies lower restricted dominance if raising the first period utility above a constant tail strictly increases welfare. -/
def swf_lower_restricted_dominance (W : Stream' (Set.Icc (0 : ℝ) 1) → ℝ) : Prop :=
  ∀ a b : Set.Icc (0 : ℝ) 1, a < b →
    W (Stream'.const a) < W (Stream'.cons b (Stream'.const a))
See it in the graphDiscuss this resultChallenge it