Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The autarky production possibility frontier

Proved
ComparativeAdvantage.autarky_frontier

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

comparative-advantageeconomicsinternational-trade

In autarky a country faces the production constraint aLCQC+aLWQW≤La_{LC}Q_C+a_{LW}Q_W\le LaLC​QC​+aLW​QW​≤L with QC,QW≥0Q_C,Q_W\ge0QC​,QW​≥0. Then

  1. every feasible bundle satisfies
QC≤LaLC−aLWaLCQW;Q_C\le\frac{L}{a_{LC}}-\frac{a_{LW}}{a_{LC}}Q_W;QC​≤aLC​L​−aLC​aLW​​QW​;
  1. for every QWQ_WQW​ with 0≤QW≤L/aLW0\le Q_W\le L/a_{LW}0≤QW​≤L/aLW​, the bundle (L/aLC−(aLW/aLC)QW,  QW)\bigl(L/a_{LC}-(a_{LW}/a_{LC})Q_W,\;Q_W\bigr)(L/aLC​−(aLW​/aLC​)QW​,QW​) is feasible.

So cloth consumption at the production possibility frontier is QC=L/aLC−(aLW/aLC)QWQ_C=L/a_{LC}-(a_{LW}/a_{LC})Q_WQC​=L/aLC​−(aLW​/aLC​)QW​.

Preamble
import Mathlib
import Definitions.Def_ComparativeAdvantage_Model
Formal statement
namespace ComparativeAdvantage

theorem autarky_frontier (c : Country) :
    (∀ q ∈ autarkySet c, q.1 ≤ c.L / c.aLC - (c.aLW / c.aLC) * q.2) ∧
    ∀ QW : ℝ, 0 ≤ QW → QW ≤ c.L / c.aLW →
      (c.L / c.aLC - (c.aLW / c.aLC) * QW, QW) ∈ autarkySet c := by sorry

end ComparativeAdvantage
Source
Wikipedia, "Comparative advantage" (PDF export supplied with the request); https://en.wikipedia.org/wiki/Comparative_advantage, section "Ricardian model"
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.

Here a country ccc is a triple of real numbers (L,aLC,aLW)(L, a_{LC}, a_{LW})(L,aLC​,aLW​), all strictly positive (the structure itself carries the positivity proofs). For every country c=(L,aLC,aLW)c=(L,a_{LC},a_{LW})c=(L,aLC​,aLW​) the statement asserts both:

  1. for every pair (x,y)(x,y)(x,y) with x≥0x\ge0x≥0, y≥0y\ge0y≥0 and aLCx+aLWy≤La_{LC}x+a_{LW}y\le LaLC​x+aLW​y≤L: x≤L/aLC−(aLW/aLC) yx\le L/a_{LC}-(a_{LW}/a_{LC})\,yx≤L/aLC​−(aLW​/aLC​)y;
  2. for every real yyy with 0≤y≤L/aLW0\le y\le L/a_{LW}0≤y≤L/aLW​, the pair (L/aLC−(aLW/aLC)y,  y)\bigl(L/a_{LC}-(a_{LW}/a_{LC})y,\;y\bigr)(L/aLC​−(aLW​/aLC​)y,y) has both coordinates ≥0\ge0≥0 and satisfies aLCx+aLWy≤La_{LC}x+a_{LW}y\le LaLC​x+aLW​y≤L for that xxx.

No prices appear.

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