swf_upper_restricted_dominance_not_constant
If a social welfare function W on infinite utility streams in [0, 1] satisfies upper restricted dominance, then there exist utility streams x and y such that W(x) < W(y).
Statement
theorem swf_upper_restricted_dominance_not_constant
(W : Stream' (Set.Icc (0 : ℝ) 1) → ℝ)
(h : swf_upper_restricted_dominance W) :
∃ x y : Stream' (Set.Icc (0 : ℝ) 1), W x < W y- Source
- arXiv:2610.38824, Definition 4
- Verified
- 02 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- swf_upper_restricted_dominanceA social welfare function W on infinite utility streams in [0, 1] satisfies upper restricted dominance if for all a < b in [0, 1],…
Read back from the Lean
For every function $W$ from infinite streams of elements in the closed unit interval $[0, 1]$ to $\mathbb{R}$, if $W$ satisfies upper restricted dominance (swf_upper_restricted_dominance), then there exist streams $x$ and $y$ of elements in $[0, 1]$ such that $W(x) < W(y)$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
Upper restricted dominance guarantees that for any two utility levels a < b in [0, 1], the welfare of the stream (a, b, b, ...) is strictly less than that of the constant stream (b, b, ...). Choosing a = 0 and b = 1 provides two such levels with 0 < 1. Evaluating the dominance condition on these endpoints yields two explicit streams whose welfare values differ strictly, demonstrating that W cannot be constant.
The endpoints a = 0 and b = 1 are well-defined elements of the unit interval [0, 1].
We introduce a as 0 and b as 1 in the subtype [0, 1], where membership (0 ∈ [0, 1] and 1 ∈ [0, 1]) is verified by simplification.
let a : Set.Icc (0 : ℝ) 1 := ⟨0, by simp⟩ let b : Set.Icc (0 : ℝ) 1 := ⟨1, by simp⟩
a < b
Unfolding the inequality between the subtype elements a and b reduces the goal to the strict inequality 0 < 1 between real numbers, which is verified by numerical computation.
have hab : a < b := by change (0 : ℝ) < 1 norm_num
There exist utility streams x and y such that W(x) < W(y).
Specializing the upper restricted dominance hypothesis to the pair a < b produces W(Stream'.cons a (Stream'.const b)) < W(Stream'.const b). Thus, the stream (0, 1, 1, 1, ...) and the constant stream (1, 1, 1, ...) serve as the required witnesses.
uses
Stream'.cons,Stream'.constexact ⟨Stream'.cons a (Stream'.const b), Stream'.const b, h a b hab⟩
Stream'.cons- Given a head element and a tail stream, constructs the stream starting with that element followed by the tail.
Stream'.const- Given an element, constructs the infinite stream consisting of that element repeated constantly.
- Formally, elements of the unit interval [0, 1] are represented as subtype terms bundling a real number with a proof that it lies in [0, 1], which Lean's simplifier verifies automatically.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Upper restricted dominance implies that the social welfare function is not constant. -/theorem swf_upper_restricted_dominance_not_constant (W : Stream' (Set.Icc (0 : ℝ) 1) → ℝ) (h : swf_upper_restricted_dominance W) : ∃ x y : Stream' (Set.Icc (0 : ℝ) 1), W x < W y := by let a : Set.Icc (0 : ℝ) 1 := ⟨0, by simp⟩ let b : Set.Icc (0 : ℝ) 1 := ⟨1, by simp⟩ have hab : a < b := by change (0 : ℝ) < 1 norm_num exact ⟨Stream'.cons a (Stream'.const b), Stream'.const b, h a b hab⟩