is_fractionally_pareto_optimal_zero_goods
When there are no goods, every complete allocation is fractionally Pareto optimal.
Statement
theorem is_fractionally_pareto_optimal_zero_goods (n : ℕ) (u : Fin n → Fin 0 → ℝ) (σ : Fin 0 → Fin n) :
is_fractionally_pareto_optimal u σ- Source
- folklore
- Verified
- 02 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- is_fractionally_pareto_optimalAn allocation of goods σ is fractionally Pareto optimal for additive valuations u if no fractional assignment x weakly improves every…
- goods_utilityThe utility vector of an allocation of goods under additive valuations: agent i's value for her own bundle.
- bundle_ofUnder an allocation that gives each item x to agent s(x), agent i's bundle is the set of items given to i.
- additive_valuationThe additive valuation with item values u: a bundle is worth the sum of its items' values.
- Used by 1
- scaled_common_ratio_bivalued_efx_fpo_envyfreeable_zero_goodsWhen m = 0, the empty allocation Fin.elim0 and zero subsidy vector 0 satisfy EFX, envy-freeness with subsidies, and fractional Pareto…
Read back from the Lean
For any natural number n, any utility function u : Fin n → Fin 0 → ℝ, and any discrete allocation σ : Fin 0 → Fin n, σ is fractionally Pareto optimal with respect to u. That is, there does not exist any fractional allocation x : Fin n → Fin 0 → ℝ such that:
1. For all agents i : Fin n and all goods g : Fin 0, x i g ≥ 0;
2. For all goods g : Fin 0, the sum of shares across agents ∑ i : Fin n, x i g = 1;
3. For all agents i : Fin n, agent i's valuation of the bundle assigned to them by σ (the sum of u i g over all goods g with σ g = i) is at most their utility from x (∑ g : Fin 0, u i g * x i g); and
4. There exists an agent i : Fin n whose utility from x is strictly greater than their utility from σ.
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
The theorem states that when there are no goods, every complete allocation is fractionally Pareto optimal. The proof argues by contradiction: if a fractional allocation strictly Pareto-dominates the discrete allocation, some agent must receive strictly greater utility under it. However, because there are zero goods, both the discrete bundle utility and the fractional allocation utility are empty sums equal to zero, reducing the strict preference inequality to 0 < 0.
Assume for contradiction that there exists a fractional allocation that strictly dominates σ for some agent.
By definition, fractional Pareto optimality asserts that no fractional allocation weakly dominates σ for all agents while strictly dominating it for at least one. We introduce the assumption for contradiction, decomposing the assumed dominating fractional allocation x and obtaining an agent i who strictly prefers x to σ (h_lt).
intro ⟨x, _, _, _, ⟨i, h_lt⟩⟩The strict improvement inequality simplifies to 0 < 0, a contradiction. automation
Because the number of goods is zero (Fin 0), the bundle assigned to agent i under σ is empty, so their current utility is an empty sum, which equals 0. Similarly, the fractional utility is a sum over Fin 0, which is also an empty sum equal to 0. Unfolding goods_utility, additive_valuation, and bundle_of, simp simplifies the strict inequality h_lt to 0 < 0 and derives False, closing the goal.
uses
goods_utility,additive_valuation,bundle_ofsimp [goods_utility, additive_valuation, bundle_of] at h_lt
goods_utility- The utility of an agent under a discrete allocation, defined as the additive valuation of their assigned bundle.
additive_valuation- The valuation of a set of goods, defined as the sum of the utilities of the goods in that set.
bundle_of- The set of goods assigned to an agent by an allocation function.
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.
/-- Vacuous fractional Pareto optimality when there are no goods. -/theorem is_fractionally_pareto_optimal_zero_goods (n : ℕ) (u : Fin n → Fin 0 → ℝ) (σ : Fin 0 → Fin n) : is_fractionally_pareto_optimal u σ := by intro ⟨x, _, _, _, ⟨i, h_lt⟩⟩ simp [goods_utility, additive_valuation, bundle_of] at h_lt