AFTD Auto-Formalizing Theoretical Domains

social_welfare_empty

theoremverified

The social welfare of the empty allocation is zero.

Statement

theorem social_welfare_empty {m n : ℕ} (v : Fin m → ℝ) :
    social_welfare (n := n) v (fun _ => ∅) = 0
Source
arXiv:2611.12740 Section 7
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • social_welfareThe utilitarian social welfare of an allocation X under a homogeneous additive valuation v is the sum of values v(X_i) over all agents i.
Used by 1
  • is_uniform_bivalued_chores_onesFor any number of chores m and any ratio r, the instance where both agents assign cost 1 to every chore is uniform bivalued with ratio r.

Read back from the Lean

For all natural numbers $m$ and $n$, and any item valuation function $v : \text{Fin } m \to \mathbb{R}$, the social welfare of the allocation assigning the empty set to each of the $n$ agents is equal to $0$.

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

By definition, social welfare is the sum over all agents of their additive valuations for their allocated sets of items. In the empty allocation, every agent receives the empty set, whose additive valuation is an empty sum and therefore equals zero. The total social welfare is thus a sum of zeros, which simplifies to zero.

  1. The social welfare of the empty allocation is 0. automation

    Unfolding the definitions of social_welfare and additive_valuation, the social welfare of the allocation assigning ∅ to each agent is ∑ i, (∑ j ∈ ∅, v j). Because the sum over an empty set is 0, each agent's valuation is 0, and the sum of 0 over all n agents evaluates to 0.

    line 4

    uses social_welfare, additive_valuation

      simp [social_welfare, additive_valuation]
social_welfare
The social welfare under valuation v and allocation X is defined as the sum of the agents' additive valuations, ∑ i, additive_valuation v (X i).
additive_valuation
The additive valuation of a set S under value function u is the sum of the values of its elements, ∑ j ∈ S, u j.

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

/-- The social welfare of the empty allocation is zero. -/theorem social_welfare_empty {m n : ℕ} (v : Fin m → ℝ) :    social_welfare (n := n) v (fun _ => ∅) = 0 := by  simp [social_welfare, additive_valuation]
See it in the graphDiscuss this resultChallenge it