Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Strong zero-cost no-arbitrage in the base market

Definition
fd02_NoArbitrage

by WillR · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

arbitrageformal-verificationoption-pricing

Strong absence of arbitrage excludes a zero-cost trading strategy that is nonnegative in both states and strictly positive in either state.

Definition code
import Mathlib.Data.Real.Basic
import Definitions.Def_fd02_TwoStateMarket
import Definitions.Def_fd02_Trade
import Definitions.Def_fd02_initialCost
import Definitions.Def_fd02_terminalPayoff

namespace FinancialDerivatives.FD02

/-- Zero initial cost and nonnegative payoffs force zero in both states. -/
def NoArbitrage (m : TwoStateMarket) : Prop :=
  ∀ t : Trade,
    initialCost m t = 0 →
    0 ≤ terminalPayoff m t true →
    0 ≤ terminalPayoff m t false →
    terminalPayoff m t true = 0 ∧ terminalPayoff m t false = 0

end FinancialDerivatives.FD02
Source
Original derived definition based on Wilmott, Howison and Dewynne (1995), §3.2, printed pp. 33–34; https://doi.org/10.1017/CBO9780511812545. The same object is fixed for all FD-02 theorem statements.
Read-back

What the Lean code literally says, in plain math · GPT-6

For any market with real spot S>0S>0S>0, bank growth R>0R>0R>0, and stock factors 0≤D<U0\le D<U0≤D<U, the predicate “no arbitrage” holds exactly if, for every pair of real signed holdings (x,c)(x,c)(x,c), the three conditions xS+c=0xS+c=0xS+c=0, xSU+cR≥0xSU+cR\ge0xSU+cR≥0, and xSD+cR≥0xSD+cR\ge0xSD+cR≥0 imply simultaneously xSU+cR=0xSU+cR=0xSU+cR=0 and xSD+cR=0xSD+cR=0xSD+cR=0. In particular, the condition concerns zero-initial-cost trades and includes both states, including zero payoffs.

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

    Confirmed by the moderator at approval.

  • Endorsed by WillR · Oct 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me