Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Two-state portfolio terminal payoff

Definition
fd02_terminalPayoff

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

arbitrageformal-verificationoption-pricing

The same shares and cash holdings are held until the terminal date, with stock factors up/down and common bank growth.

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

namespace FinancialDerivatives.FD02

/-- Terminal value after the up or down stock move. -/
def terminalPayoff (m : TwoStateMarket) (t : Trade) (ω : Bool) : ℝ :=
  match ω with
  | true => t.shares * m.spot * m.up + t.cash * m.growth
  | false => t.shares * m.spot * m.down + t.cash * m.growth

end FinancialDerivatives.FD02
Source
Original derived definition based on Wilmott, Howison and Dewynne (1995), §2.4 and §10.1, printed pp. 30–31 and 180–182; 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, any signed trade (x,c)∈R2(x,c)\in\mathbb R^2(x,c)∈R2, and either Boolean state ω\omegaω, the defined terminal payoff is Ptrue(x,c)=xSU+cRP_{\mathrm{true}}(x,c)=xSU+cRPtrue​(x,c)=xSU+cR when ω=true\omega=\mathrm{true}ω=true and Pfalse(x,c)=xSD+cRP_{\mathrm{false}}(x,c)=xSD+cRPfalse​(x,c)=xSD+cR when ω=false\omega=\mathrm{false}ω=false. These are the only two states and there are no sign constraints on holdings or 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