Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Mill: no excess of all other commodities together with an excess of money

Proved
SaysLaw.mill_no_glut_with_excess_money

by Lucas · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

economicsgeneral-equilibriummacroeconomicssays-law

Throughout, ι\iotaι is a finite set of agents and GGG a finite set of goods; p=(pg)g∈Gp=(p_g)_{g\in G}p=(pg​)g∈G​ is a real price vector; si=(si,g)gs_i=(s_{i,g})_gsi​=(si,g​)g​ and di=(di,g)gd_i=(d_{i,g})_gdi​=(di,g​)g​ are real vectors giving the quantities agent iii brings to market (supplies) and plans to buy (demands); ⟨p,x⟩=∑g∈Gpgxg\langle p,x\rangle=\sum_{g\in G}p_g x_g⟨p,x⟩=∑g∈G​pg​xg​ is the market value of a bundle xxx; and zg=∑i∈ι(di,g−si,g)z_g=\sum_{i\in\iota}(d_{i,g}-s_{i,g})zg​=∑i∈ι​(di,g​−si,g​) is the aggregate excess demand for good ggg. Each agent holds money mim_imi​ initially and plans to hold mi′m'_imi′​.

Assume there is at least one good, all prices are strictly positive, and every agent satisfies the monetary budget constraint ⟨p,di⟩+mi′=⟨p,si⟩+mi\langle p,d_i\rangle+m'_i=\langle p,s_i\rangle+m_i⟨p,di​⟩+mi′​=⟨p,si​⟩+mi​. Then it is impossible that simultaneously

  1. every good is in excess supply (zg<0z_g<0zg​<0 for all g∈Gg\in Gg∈G), and
  2. money is not in excess demand (∑i(mi′−mi)≤0\sum_i(m'_i-m_i)\le 0∑i​(mi′​−mi​)≤0).

This is Mill's rescue of the no-general-glut principle by counting money as one of the commodities.

Preamble
import Mathlib
import Definitions.Def_SaysLaw_Model
Formal statement
namespace SaysLaw

theorem mill_no_glut_with_excess_money {ι G : Type*} [Fintype ι] [Fintype G] [Nonempty G]
    (p : G → ℝ) (hp : ∀ g, 0 < p g) (supply demand : ι → G → ℝ) (m m' : ι → ℝ)
    (hbudget : MonetaryBudget p supply demand m m') :
    ¬ (GeneralGlut (excessDemand supply demand) ∧ excessMoneyDemand m m' ≤ 0) := by sorry

end SaysLaw
Source
Wikipedia, "Say's law" (PDF export supplied with the request); https://en.wikipedia.org/wiki/Say%27s_law
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent as the drafter; non-blind

Disclosure — NON-BLIND read-back. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement it describes, with full knowledge of the source article and of the intended meaning. It is not independent, blind testimony and must not be mistaken for one. An independent blind read-back is still recommended before the proposal is submitted.

Let ι\iotaι be an arbitrary finite type, GGG a finite type assumed nonempty, p:G→Rp:G\to\mathbb Rp:G→R with pg>0p_g>0pg​>0 for every ggg, and s,d:ι→G→Rs,d:\iota\to G\to\mathbb Rs,d:ι→G→R, m,m′:ι→Rm,m':\iota\to\mathbb Rm,m′:ι→R arbitrary. Assume for every iii: ∑gpgdi,g+mi′=∑gpgsi,g+mi\sum_g p_g d_{i,g}+m'_i=\sum_g p_g s_{i,g}+m_i∑g​pg​di,g​+mi′​=∑g​pg​si,g​+mi​. Then it is not the case that both (a) zg<0z_g<0zg​<0 for every g∈Gg\in Gg∈G, where zg=∑i(di,g−si,g)z_g=\sum_i(d_{i,g}-s_{i,g})zg​=∑i​(di,g​−si,g​), and (b) ∑i(mi′−mi)≤0\sum_i(m'_i-m_i)\le 0∑i​(mi′​−mi​)≤0. Equivalently: if every zg<0z_g<0zg​<0 then ∑i(mi′−mi)>0\sum_i(m'_i-m_i)>0∑i​(mi′​−mi​)>0. If ι\iotaι is empty, (a) fails because z≡0z\equiv 0z≡0.

Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me