e^(−rT)[πfᵤ+(1−π)fᴅ]
Changes with your probability judgmentStart with the question
Do you need the real-world probability of an up move to price the option?
Do not reach for a formula yet. Put your own up-move probability into the expectation and see what different analysts obtain.
The two states one period from now
Start with the payoff; Δ, B, and p* remain hidden for now.
—
Mechanism, not prediction
Find a portfolio that pays exactly the same in both states
Adjust Δ shares of stock and the initial risk-free position B. When both states match, the cost of building the portfolio today pins down the option price.
State-by-state check
| State | Stock price | Option payoff | Portfolio value at maturity | Residual |
|---|---|---|---|---|
| Up | — | — | — | — |
| Down | — | — | — | — |
Exact replication solution
Δ = (fᵤ − fᴅ) / (Sᵤ − Sᴅ)
B = e^(−rT) × (fᵤ − ΔSᵤ)
Discovery moment
Change π again: which quantities actually move?
The three cards represent different concepts. Move π from low to high and identify the only card that changes.
ΔS₀+B
Determined by state-by-state replicatione^(−rT)[p*fᵤ+(1−p*)fᴅ]
Equal to the replication costp* = [e^(rT) − d] / (u − d). It is a pricing weight that makes the discounted stock a fair game, not a forecast of the stock’s real-world up-move probability.
Bridge the two representations
First reproduce the one-period price, then extend the tree
The default CRR case is calibrated to the same one-period up and down factors. Its price must match exactly. Verify the bridge first, then load the three-period example.
f(node) = e^(−rΔt) × [p* f(up) + (1−p*) f(down)]
European only: At intermediate nodes, only continuation values are discounted; immediate exercise is not compared, so there is no early-exercise decision.
Backward-induction workspace
Matched settings are ready. Roll back one layer to verify the exact price match.
—
Black–Scholes–Merton continuous-time benchmark
The same S₀, K, r, σ, and T are used. BSM does not depend on the tree depth N, so it stays fixed while you refine the CRR tree.
Complete the CRR rollback to compare the discrete-tree price with the continuous-time benchmark.
Show the BSM formula used here
d₁ = [ln(S₀/K) + (r + σ²/2)T] / (σ√T)
d₂ = d₁ − σ√T
C = S₀Φ(d₁) − Ke^(−rT)Φ(d₂)
P = Ke^(−rT)Φ(−d₂) − S₀Φ(−d₁)
Assumptions for this benchmark: European exercise, no dividends, constant r and σ, and the standard lognormal BSM model. This panel is a comparison benchmark; the lesson’s main pricing mechanism remains replication and CRR backward induction.
② Replication cost and the risk-neutral price are two representations of the same price.
③ Backward induction repeats the one-period problem from right to left.
④ With S₀, K, r, σ, and T fixed, BSM stays fixed while finite-N CRR prices can change as the tree is refined.
Private learning trail
Your local learning record
Stored only in this browser; it contains no name, student ID, or email address and is never uploaded.
| Time | Mode | Action | Type | Price |
|---|---|---|---|---|
| No records yet | ||||