Of Notes

Super- and Sub-Replication

1 min read · revised 24 October 2026 · referred to by 2 notes · ·

From the upper and lower bound of a fair price in a trinomial model we call:

  • Upper Bound = Super Replication
  • Lower Bound = Sub Replication

This calls to use inequalities instead of exact equations. If we say:

Then a super replication will introduce a :

Each inequality is a half-plane in the plane, so the set of super-replicating portfolios is their intersection: an unbounded convex region. The fair upper bound is the cheapest point in it, where the cost line last touches the region, which is always at a vertex.

Super-replicating portfolios \((\alpha,\beta)\) form the shaded region above the three constraint lines. Sliding the dashed cost line down until it last touches the region gives the cheapest super-replication.
Fig. 1. Super-replicating portfolios form the shaded region above the three constraint lines. Sliding the dashed cost line down until it last touches the region gives the cheapest super-replication.
/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card