pareto_optimal_implies_weakly_pareto_optimal
theoremverified
In a pure exchange economy E with finite, nonempty agent type Agent, if an allocation x : Agent → Good → ℝ is Pareto optimal in E, then x is weakly Pareto optimal in E.
Statement
theorem pareto_optimal_implies_weakly_pareto_optimal {Agent Good : Type*} [Fintype Agent] [Nonempty Agent] (E : ExchangeEconomy Agent Good) (x : Agent → Good → ℝ) (h : is_pareto_optimal E x) : is_weakly_pareto_optimal E x
- Source
- Mas-Colell, Whinston & Green, Microeconomic Theory, ch. 16.C
- Verified
- 01 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- is_pareto_optimalIn a pure exchange economy E with finite agents Agent, an allocation x : Agent → Good → ℝ is Pareto optimal if x is feasible in E and…
- is_weakly_pareto_optimalIn a pure exchange economy E with finite agents Agent, an allocation x : Agent → Good → ℝ is weakly Pareto optimal if x is feasible in E…
- ExchangeEconomyA pure exchange economy with agent type Agent and commodity type Good consists of a non-negative initial endowment of each good for each…
Read back from the Lean
For any types Agent and Good, where Agent is finite and nonempty, given an exchange economy E and an allocation x : Agent → Good → ℝ, if x is Pareto optimal in E, then x is weakly Pareto optimal in E.
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
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.
/-- In a pure exchange economy with at least one agent, any Pareto optimal allocation is weakly Pareto optimal. -/theorem pareto_optimal_implies_weakly_pareto_optimal {Agent Good : Type*} [Fintype Agent] [Nonempty Agent] (E : ExchangeEconomy Agent Good) (x : Agent → Good → ℝ) (h : is_pareto_optimal E x) : is_weakly_pareto_optimal E x := by rcases h with ⟨hfeas, hnot⟩ refine ⟨hfeas, ?_⟩ rintro ⟨y, hyfeas, hy⟩ apply hnot obtain ⟨i₀⟩ := ‹Nonempty Agent› exact ⟨y, hyfeas, fun i => (hy i).le, ⟨i₀, hy i₀⟩⟩