Basic Prerequisites: 02 · Optimal-Stopping Theory and BSM · The PDE.
1. Intuition & Practical Objective
The practical objective: write the American option as a well-posed boundary-value problem whose unknown is a function (the value) and a curve (the exercise boundary), and see why the two clean formulations - variational inequality and linear complementarity - are what a numerical solver actually implements.
The awkwardness is the free boundary . On the “continue” region the value solves the BSM PDE; on the “exercise” region it equals intrinsic. The two regions are separated by a curve we do not know. Three ways to tame it:
- Guess the boundary, solve, enforce tangency. Solve the PDE on with ; then impose smooth pasting to pin . This is exactly the perpetual case, where it is closed-form. (This is how we solve the perpetual put in 03 · Analytic Approximations.)
- Variational inequality (VI). State a single inequality that encodes “value ≥ payoff” and “waiting is not profitable” simultaneously - no explicit boundary.
- Linear complementarity (LCP). The pointwise algebraic form of the VI: at every , either the value is above the payoff (and the PDE holds), or the value equals the payoff (and the PDE inequality is slack). This is the form PSOR and penalty methods solve.
One sentence. “American pricing = solve the BSM operator subject to payoff and making the residual complementary to the constraint - the boundary is whatever curve that complementarity implies.”
2. Mathematical Ground Truth & Derivations
2.1 The free-boundary formulation (Shreve II §8.4; Björk Prop 21.27)
Let be the BSM operator, . On the continuation region intrinsic:
The boundary is the free boundary (a curve rising to at for the put). Two conditions hold across it:
and are continuous across ; jumps. Only regularity is required - smooth pasting is a choice (the “smooth fit” heuristic) that the correct solution satisfies, not an assumption.
2.2 The variational inequality (Björk Prop 21.25/21.26; Shreve II 8.3.18–8.3.20)
In the perpetual put the three conditions combine into a single statement with (the negative of the BSM operator):
The unique bounded function satisfying all three is the value of 03. In the continuation region ; in the exercise region , so . The probabilistic twin (Shreve II Thm 8.3.5, Cor 8.3.6): is a supermartingale, and is a martingale when stopped at the first hitting time .
2.3 The linear-complementarity problem (the solver’s form)
For a finite-maturity American put on a grid, conditions (i)–(iii) become, at every node :
or equivalently the complementarity system
Discretise (implicit Euler / Crank–Nicolson) and you get, at each time step, an algebraically messy linear system , , with complementarity - solved by PSOR (projected SOR) or by a penalty method (Duffy Ch 27–29). This is precisely the “1-factor American” row of the numerical-methods scheme table - the implementation detail lives in Numerical Methods · FDM; this page owns the formulation.
2.4 Why the boundary is where it is - the drift test (Björk Prop 21.28)
It is never optimal to stop where the payoff alone is a submartingale: if then . Intuitively you never exercise while the immediate reward is expected to grow faster than the discounting can erode it - the boundary is pushed out to the point where the two balance.
3. Computational Implementation - smooth pasting, complementarity and the perpetual limit
Three checks. (A) The boundary is the maximiser over constant boundaries of the value - smooth pasting as a first-order condition. (B) Long-dated CRR converges to the perpetual closed form. (C) The complementarity residual holds at every , computed by finite differences with the negative-BSM convention. Stdlib only.
Read the residual table: on the exercise side () the value equals payoff (first bracket ) and ; on the continuation side () the value is strictly above payoff and (to finite-difference accuracy). The minimum is zero everywhere - the complementarity system, verified. And the finite-maturity American put climbs monotonically toward the perpetual as , exactly the limit Björk Prop 21.30 predicts.
4. Failure Modes & First-Principles Breakdowns
- Sign confusion in the VI. Shreve writes , the negative of the usual BSM operator; it is (not ) and equals in the exercise region. Writing the wrong sign turns a correct solver into a subtly wrong one with no obvious symptom.
- Smooth pasting is a consequence, not an assumption. Imposing with an otherwise wrong ansatz produces a boundary that satisfies the tangency but not the PDE - a plausible-looking wrong answer. The VI formulation (no explicit boundary) is the safe statement.
- discontinuity breaks naive schemes. The gamma jump at is precisely what makes Crank–Nicolson ring near the strike; Rannacher startup / extrapolated implicit Euler suppress it (Numerical Methods · Failure Modes).
- Freezing the boundary or the “exercise-if-deep-ITM” heuristic. Both are sub-optimal policies; they return a value below the true one and, worse, an inconsistent delta. The boundary must be solved, not guessed.
- The free boundary is a full curve, not a point. For a finite-maturity put rises to at ; discretising only the current boundary (a perpetuity) misprices intermediate maturities.
5. References
- Shreve, Stochastic Calculus for Finance II
- Björk, Arbitrage Theory in Continuous Time
- Duffy, Finite Difference Methods in Financial Engineering
- Wilmott, Howison & Dewynne, The Mathematics of Financial Derivatives
6. Connected Graph Bridges
- Back: 03 · Analytic Approximations · Index Hub
- Forward: 05 · Failure Modes · 06 · Advanced Extensions
- Implementation (linked, not duplicated): FDM: penalty & PSOR · BSM · PDE