Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cash-or-nothing call and put: e−r(T−t)N(±d−)e^{-r(T-t)}N(\pm d_-)e−r(T−t)N(±d−​)

Proved
BlackScholesModel.cash_or_nothing_value

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

black-scholesmathematical-financeoption-pricing

Let K>0K>0K>0, σ>0\sigma>0σ>0, S>0S>0S>0, t<Tt<Tt<T, r∈Rr\in\mathbb Rr∈R, τ=T−t\tau=T-tτ=T−t, and let ST=Sexp⁡((r−σ22)τ+στZ)S_T=S\exp\big((r-\frac{\sigma^2}2)\tau+\sigma\sqrt\tau Z\big)ST​=Sexp((r−2σ2​)τ+στ​Z) with ZZZ standard normal be the risk-neutral terminal price. The risk-neutral value of a binary option paying one unit of cash if the spot ends above (respectively below) the strike is

e−rτ Q(ST>K)=e−rτN(d−),e−rτ Q(ST<K)=e−rτN(−d−).e^{-r\tau}\,\mathbb Q(S_T>K)=e^{-r\tau}N(d_-),\qquad e^{-r\tau}\,\mathbb Q(S_T<K)=e^{-r\tau}N(-d_-).e−rτQ(ST​>K)=e−rτN(d−​),e−rτQ(ST​<K)=e−rτN(−d−​).

In particular N(d−)N(d_-)N(d−​) is the risk-neutral probability that the call is exercised.

Formalization Note The source's binary-option formulas include a dividend yield qqq; this is the non-dividend case q=0q=0q=0 of the base model, with d2=d−d_2=d_-d2​=d−​.

Preamble
import Mathlib
import Definitions.Def_BlackScholesModel_Core

open Real MeasureTheory ProbabilityTheory Filter Topology
open scoped ContDiff
Formal statement
namespace BlackScholesModel

theorem cash_or_nothing_value (K r σ T S t : ℝ) (hK : 0 < K) (hσ : 0 < σ) (hS : 0 < S) (ht : t < T) :
    Real.exp (-r * (T - t)) * (gaussianReal 0 1).real {z | K < terminalPrice S r σ (T - t) z}
      = Real.exp (-r * (T - t)) * stdNormalCDF (dMinus S K r σ (T - t)) ∧
    Real.exp (-r * (T - t)) * (gaussianReal 0 1).real {z | terminalPrice S r σ (T - t) z < K}
      = Real.exp (-r * (T - t)) * stdNormalCDF (-dMinus S K r σ (T - t)) := by sorry

end BlackScholesModel
Source
Wikipedia, "Black–Scholes model" (snapshot supplied as Black–Scholes_model.pdf, 22 pp.), https://en.wikipedia.org/wiki/Black%E2%80%93Scholes_model; p. 11 (Binary options: cash-or-nothing call and put), p. 6 (N(d−) is the risk-neutral probability of exercise)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Non-blind read-back. This read-back was written by the same agent that drafted the Lean statement (at the explicit instruction of the proposal owner), not by an independent blind auditor. It is not independent testimony; reviewers should compare it against the Lean code themselves.

Here K,r,σ,T,S,tK,r,\sigma,T,S,tK,r,σ,T,S,t are arbitrary real numbers subject to the hypotheses K>0K>0K>0, σ>0\sigma>0σ>0, S>0S>0S>0 and t<Tt<Tt<T (so τ:=T−t>0\tau:=T-t>0τ:=T−t>0); rrr is unrestricted (it may be zero or negative). NNN, N′N'N′, d±d_\pmd±​, CCC, PPP are the functions of the companion definition file (normal distribution function given by its integral, normal density in closed form, d±=d±(S,K,r,σ,T−t)d_\pm=d_\pm(S,K,r,\sigma,T-t)d±​=d±​(S,K,r,σ,T−t), call price C(S,t)=N(d+)S−N(d−)Ke−r(T−t)C(S,t)=N(d_+)S-N(d_-)Ke^{-r(T-t)}C(S,t)=N(d+​)S−N(d−​)Ke−r(T−t), put price P(S,t)=N(−d−)Ke−r(T−t)−N(−d+)SP(S,t)=N(-d_-)Ke^{-r(T-t)}-N(-d_+)SP(S,t)=N(−d−​)Ke−r(T−t)−N(−d+​)S).

Let γ\gammaγ be the standard Gaussian probability measure on R\mathbb RR and ST(z)=Sexp⁡((r−σ2/2)(T−t)+σT−t z)S_T(z)=S\exp\big((r-\sigma^2/2)(T-t)+\sigma\sqrt{T-t}\,z\big)ST​(z)=Sexp((r−σ2/2)(T−t)+σT−t​z). The theorem asserts both

e−r(T−t) γ({z:K<ST(z)})=e−r(T−t) N(d−)ande−r(T−t) γ({z:ST(z)<K})=e−r(T−t) N(−d−),e^{-r(T-t)}\,\gamma\big(\{z: K<S_T(z)\}\big)=e^{-r(T-t)}\,N(d_-)\quad\text{and}\quad e^{-r(T-t)}\,\gamma\big(\{z: S_T(z)<K\}\big)=e^{-r(T-t)}\,N(-d_-),e−r(T−t)γ({z:K<ST​(z)})=e−r(T−t)N(d−​)ande−r(T−t)γ({z:ST​(z)<K})=e−r(T−t)N(−d−​),

with d−=d−(S,K,r,σ,T−t)d_-=d_-(S,K,r,\sigma,T-t)d−​=d−​(S,K,r,σ,T−t) and the measures of the sets taken as real numbers. Since e−r(T−t)>0e^{-r(T-t)}>0e−r(T−t)>0, each equation is equivalent to the corresponding equality of probabilities without the discount factor.

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