Every PDE of the form ∂tu+Lu−cu=−f has a solution that can be written
as a conditional expectation. What is the precise connection, and how does it make numerical pricing
by Monte Carlo and PDE methods equivalent?
The Feynman–Kac formula is one of the deepest results connecting probability and analysis. It says: the solution to a certain class of backward parabolic PDEs is a conditional expectation of a functional of a diffusion. This has two directions of impact:
Analytical: hard expectations become tractable PDEs.
Probabilistic: hard PDEs become tractable Monte Carlo simulations.
In finance, it is the rigorous foundation behind "price = expectation."
If u solves the PDE, the dt coefficient vanishes, leaving dYt=(pure stochastic integral). A stochastic integral is a local martingale. Under integrability, Yt is a true martingale.
At time t:E[YT∣Ft]=Yt (martingale). Rewriting gives u(t,Xt)=E[…∣Xt].
Feynman–Kac: u(0,x) = E[g(x + W_T)] solves the heat PDE
PDE solution at x=00.39894
Monte Carlo E[g(W_T)]1.49777
Feynman–Kac says the PDE solution equals a conditional expectation. The blue curve is the exact PDE solution u(0,x); the grey dashed curve is the terminal payoff g(x). The red dot is the Monte Carlo estimate at x=0 — it matches the PDE solution by design. In finance, u = option price.
In the simplest case c=0, f=0, the Feynman–Kac formula reduces to:
u(t,x)=E[g(XT)∣Xt=x],
which solves:
∂tu+b(t,x)∂xu+21σ(t,x)2∂xxu=0,u(T,x)=g(x).
For pure Brownian motion (b=0, σ=1), this is the heat equation ∂tu=−21∂xxu (note the sign: running backward from T to 0). The solution is convolution with the Gaussian kernel:
u(0,x)=2πT1∫−∞∞g(y)e−(x−y)2/(2T)dy.
This is exactly the smoothing property of the heat equation — the Brownian motion "averages" the terminal payoff over Gaussian fluctuations.
For GBM under Q (b=rx, σ=σx): this is precisely the Black–Scholes PDE. The Feynman–Kac formula proves that the Black–Scholes price equals the risk-neutral discounted expectation.
Feynman–Kac as a dictionary
The Feynman–Kac correspondence is a dictionary:
Probability side
PDE side
Conditional expectation E[g(XT)∣Xt=x]
Solution u(t,x) of the backward PDE
SDE coefficients b, σ
PDE operator b∂x+21σ2∂xx
Terminal condition g
Boundary data u(T,x)=g(x)
Discount rate c
Killing term −cu in PDE
Running cost f
Source term in PDE
Every pricing problem can be attacked from either side: solve the PDE analytically, or simulate the SDE by Monte Carlo.
This is not directly a Feynman–Kac problem (the running maximum is not Markovian on its own). But (Wt,Mt) jointly is Markovian, and Feynman–Kac applies in two dimensions.
10.6 The Kolmogorov backward equation as a special case
For c=0, f=0, and g=1(−∞,y] (cumulative distribution), Feynman–Kac gives:
u(t,x)=P(XT≤y∣Xt=x).
This solves the Kolmogorov backward equation ∂tu+Lxu=0. Setting t=0 gives the transition probability P(XT≤y∣X0=x) — the fundamental solution of the backward equation.
Simulate N paths of X from x to time T using Euler–Maruyama.
Compute g(XT(k)) for each path k.
Estimate u(0,x)≈N1∑kg(XT(k)).
Error: O(1/N) — statistical, independent of dimension.
PDE solver (analytical side):
Discretize the PDE on a grid (ti,xj).
Apply finite differences or finite elements.
March backward from T to 0.
Error: O(Δt+Δx2) — deterministic, but grid size explodes in high dimensions (curse of dimensionality).
Feynman–Kac guarantees both methods converge to the same answer.
When to use Monte Carlo vs PDE
Use PDE when: 1D or 2D problem (e.g., European option on one stock), high accuracy needed,
Greeks required analytically (differentiate PDE solution), early exercise (American options via
free boundary PDE).
Use Monte Carlo when: High-dimensional problem (basket, path-dependent), flexible payoff
structure, convergence guarantee regardless of dimension, embarrassingly parallelizable.
Dimension d≥4: Monte Carlo dominates. Dimension d≤3: PDE methods are often faster and
more precise.