# The transversality condition

The transversality condition appears as a necessary condition to determine the optimal path in dynamic models. It complements the Euler equation and allows to pinpoint the exact optimal path (see example below).

We use the transversality condition to avoid explosive consumption or saving paths that would end up in:

- Excessive consumption, driving the capital stock of the economy to zero and impeding future consumption,
- Excessive savings, up to the point that a large amount of the output is devoted to replace capital that depreciates.

Indeed, using only the Euler equation alongside with initial conditions allows for infinitely many optimal paths to be found. The Ramsey problem does not state any final value for capital $k_{t=T}$ (in fact, it does not even state a final period $T$ because $T \rightarrow \infty).$ Therefore, working only with the Euler equation and the initial stock of capital $k_{t=0} = k_{0}$ allows for infinitely optimal paths. In the following example, we try to solve the simple cake-eating problem without imposing the transversality condition, and obtain infinitely many solutions.

## Example: Cake-eating problem

We try to maximise utility from eating a finite cake over an infinite amount of time. The size of the cake ($k$) is given: $k_{t=0} = k_0 \ > 0.$ The problem reads:

$$\begin{eqnarray}
\max & \sum_{t=0}^{\infty} \beta^{t} \ln ( c_{t} ) \\\

& k_{t+1} = k_{t} - c_{t} \\\

& k_{t=0} = k_{0}
\end{eqnarray}$$

We solve it noting that we can decide on $c_{t}$ and $k_{t}.$
The Lagrangian is:
$$\mathcal{L} = \sum_{t=0}^{\infty} \beta^{t} \ln (c_{t}) + \sum_{t=0}^{\infty} \lambda_{t} (k_{t+1} - k_{t} + c_{t}).$$
Taking derivatives with respect to $c_{t}$ and $k_{t}$, and noticing that $k_{t}$ appears together with the $\lambda_{t-1}$ term gives us the Euler equation:
$$c_{t+1} = \beta c_{t}.$$
Hence, iterating, $c_{t} = \beta^{t}c_{0}$

Plugging it in the constraint gives us: $k_{t+1} = k_{t} - \beta^{t}c_{0}.$

Solving for $k_{t}$ gives us $k_{t} = D - \frac{c_{0}(1-\beta^{t})}{1-\beta}.$
At this point, we can no longer proceed (we have the unknown $D$) unless we have the extra restriction given by the transversality condition.
If we use it, which reads, $\lim_{t \rightarrow \infty} \beta^{t} u^{\prime} (c_{t})k_{t+1}=0$ we can substitute $c_{t} = \beta^{t} c_{0}$.
Therefore: $\lim_{t \rightarrow \infty} \beta^{t} \frac{1}{c_{t} k_{t+1}} = \lim_{t \rightarrow \infty} \beta^{t} \frac{1}{\beta^{t} c_{0}} k_{t+1} = \lim_{t \rightarrow \infty} k_{t+1} = 0.$
So, at the limit, the size of the cake becomes zero, and we eat it completely.

**Note:** This makes sense, because utility is increasing in consumption and leaving something behind would be a waste of resources.

Now, with this additional information ($\lim_{t \rightarrow \infty} k_{t+1} = 0$) we can close the problem using: $k_{t+1} = D - \frac{c_{0}(1-\beta^{t-1})}{1-\beta}$. Hence $\lim_{t \rightarrow \infty} k_{t+1} = \lim_{t \rightarrow \infty} D - \frac{c_{0}(1-\beta^{t-1})}{1-\beta} = D - \frac{c_{0}}{1-\beta} = 0.$ Therefore, $D = \frac{c_{0}}{1-\beta}$ which implies that $k_{t} = \frac{c_{0}\beta^{t}}{1-\beta}$. Since $k_{t=0} = k_{0}$ we can easily obtain $c_{0}$ from: $k_{0} = \frac{c_{0}}{1-\beta} \implies c_{0} = (1-\beta)k_{0}.$

Finally, we have that $c_{t} = \beta^{t} c_{0} = \beta^{t}(1-\beta)k_{0}.$

**Note:** This problem is more easily solved assuming since the beginning that the entire cake will be consumed.
This is, $\sum_{t=0}^{\infty} c_{t} = k_{0}$.
In that case, the Lagrangian is: $\mathcal{L} = \sum_{t=0}^{\infty} \beta^{t} \ln (c_{t}) + \lambda (\sum_{t=0}^{\infty} c_{t} - k_{0}).$
Notice that in this case we have only one $\lambda$.
It is simple to show that $c_{t} = \beta c_{t-1}.$
Substituting this information in the constraint gives us $k_{0} = \sum_{t=0}^{\infty} \beta^{t} c_{0} = \frac{c_{0}}{1-\beta}.$
Therefore, $c_{t} = \beta^t (1-\beta)k_{0}.$
There is one important remark regarding this alternative method.
It *indirectly* uses the transversality condition.
Remember that we obtained that $\lim_{t \rightarrow \infty} k_{t+1} = 0$ which implies that the entire cake is consumed.
In the alternative method we assumed it, which makes sense just by looking at the utility formulation.

## A **wrong** proof of the transversality condition

In some cases the transversality constraint is justified as the limit when time goes to infinity of an equivalent problem with a finite horizon. This is, one can write an optimal program that ends at some specific period. For instance, our Ramsey problem with a terminal state can be written as: $$\max_{c_{t}, k_{t+1}} \sum_{t=0}^{T} \beta^{t} u(c_{t}).$$

We impose that capital must be positive all periods: $k_{t+1} \geq 0.$ Write the Lagrangian that corresponds to the Kuhn-Tucker problem:

$$\mathcal{L} = \sum_{t=0}^{T} \beta^{t} u(c_{t}) + \sum_{t=0}^{T} \lambda_{t}(w_{t} + r_{t} k_{t} + (1-\delta)k_{t} - c_{t} - k_{t+1}) + \sum_{t=0}^{T} \mu_{t}k_{t+1}.$$

Taking the appropriate derivatives with respect to $k_{t+1}, c_{t}$ and remembering the complementary slackness condition leaves us with the following system of equations, which we evaluate at $t=T.$
$$\begin{eqnarray}
\beta^{T} u^{\prime}(c_{T}) & = \lambda_{T} \\\

\lambda_{T} & = \mu_{T} \\\

\mu_{T} k_{T+1} & = 0.
\end{eqnarray}$$

Rearranging we can get: $$\begin{equation} \beta^{T} u^{\prime} (c_{T}) k_{T+1} = 0. \end{equation}$$

The equation above indicates that one of either two possibilities must be true:

- $\beta^{T} u^{\prime} (c_{T}) >0$ which requires $k_{T+1} = 0,$
- $\beta^{T} u^{\prime} (c_{T}) = 0$ and $k_{T+1} \geq 0.$

The first case indicates that we leave the world at time $T$ with zero capital.
This makes sense because the optimisation does not go beyond $T$, and leaving resources unconsumed is not efficient: after all, we *eat* capital.
So we eat everything before dying.
The second case never arises: the marginal utility is zero only when consumption is infinite.

Letting time go to infinity, the equation above becomes the transversality condition: $$\lim_{t \rightarrow \infty} \beta^{t}u^{\prime}(c_{t})k_{t+1} = 0.$$

## The transversality condition is a necessary condition: proof

Proof by Kamihigashi (2002): A Simple Proof of the Necessity of the Transversality Condition

Kamihigashi (2002) shows that the transversality condition is a necessary condition in an optimal control problem. This proof neglects consumption and focuses on current and future values of $x_{t}.$ Consider the following maximisation problem:

$$
\max_{ \{x_{t} \}_{t=0}^{\infty} } \sum_{t=0}^{\infty} v_{t}(x_{t}, x_{t+1}) \\\

x_{0} = \bar{x_{0}}, \forall t \in \mathbb{Z}_{+}, (x_{t}, x_{t+1}) \in X_{t}.
$$

We assume the following:

- $x_{t} \in X \subset \mathbb{R}_{+}^{m}$, basically, $x_{t} \geq 0,$
- $X_{t}$ is convex, $(0,0) \in X_{t},$
- $U: Gr(\Gamma) \rightarrow \mathbb{R}$ is $\mathcal{C}^{1}$ and concave,
- $\forall (x,y) \in Gr(\Gamma), U_{y}(x,y) \leq 0,$
- For any feasible path ${x_{t}}, \sum_{t=0}^{\infty} v_{t}(x_{t}, x_{t+1}) \equiv \lim_{T \rightarrow \infty} \sum_{t=0}^{T} v_{t}(x_{t}, x_{t+1})$ exists in $(-\infty, \infty).$

First, define an optimal path $\{x_{t}^{\star}\}$ as a feasible path such that: $$\sum_{t=0}^{\infty} v_{t}(x_{t}, x_{t+1}) \leq \sum_{t=0}^{\infty} v_{t}(x_{t}^{\star}, x_{t+1}^{\star}).$$

The proof only involves using an argument derived from concavity. $$\forall \gamma \in [0,1), \forall \lambda \in [\gamma, 1), \frac{f(1)-f(\lambda)}{1-\lambda} \leq \frac{f(1)-f(\gamma)}{1-\gamma}.$$

Suppose we deviate $\lambda \in [0,1)$ from the optimal path ${x_{t}^{\star}}$ and follow a path that is feasible:

**Lemma 1**
$${x_{0}^{\star}, x_{1}^{\star}, \ldots, x_{T}^{\star}, \lambda x_{T+1}^{\star}, \lambda x_{T+2}^{\star}, \ldots }.$$

Again, we are assuming that by taking $\lambda \in [0,1)$ this alternative path is feasible. By optimality we have: $$v_{T}(x_{T}^{\star}, \lambda x_{T+1}^{\star}) - v_{T}(x_{T}^{\star}, x_{T+1}^{\star}) + \sum_{t=T+1}^{\infty}[v_{t}(\lambda x_{t}^{\star}, \lambda x_{t+1}^{\star}) - v_{t}(x_{t}^{\star}, x_{t+1}^{\star})] \leq 0.$$ This condition essentially says that deviating from the optimal path reports less utility than following it.

Divide through by $(1-\lambda)$ and obtain:

$$\frac{v_{T}(x_{T}^{\star}, \lambda x_{T+1}^{\star}) - v_{T}(x_{T}^{\star}, x_{T+1}^{\star})}{1-\lambda} \leq \sum_{t=T+1}^{\infty} \frac{v_{t}(x_{t}^{\star}, x_{t+1}^{\star}) - v_{t}(\lambda x_{t}^{\star}, \lambda x_{t+1}^{\star})}{1-\lambda} \leq \sum_{t=T+1}^{\infty} [v_{t}(x_{t}^{\star}, x_{t+1}^{\star}) - v_{t}(0,0)].$$

The last inequality follows because of Lemma 1 and because $v$ is concave, setting $\gamma = 0$. Now take the $\lim_{\lambda \rightarrow 1}$ on the right-hand side to obtain:

$$0 \leq -v_{T,2}(x_{T}^{\star}, x_{T+1}^{\star}x_{T+1)}^{\star} \leq \sum_{t=T+1}^{\infty} [v_{t}(x_{t}^{\star}, x_{t+1}^{\star}) - v_{t}(0,0)].$$

The first inequality follows from Assumption 4 and a rewrite of derivative definition: $f^{\prime}(x) = \lim_{\eta \rightarrow 0} \frac{f(\eta x) - f(x)}{x - \eta x}.$

Finally, take $\lim_{T \rightarrow \infty}$, which yields:

$$0 \leq \lim_{T \rightarrow \infty}[-v_{T,2}(x_{T}^{\star}, x_{T+1}^{\star}] \leq \lim_{T \rightarrow \infty} \sum_{t=T+1}^{\infty}[v_{t}(x_{t}^{\star}, x_{t+1}^{\star}) - v_{t}(0,0)] = 0,$$

where the equality holds by Assumption 5. We have obtained the transversality condition.

https://link.springer.com/referenceworkentry/10.1007%2F978-1-4471-5102-9_200-1 https://www.encyclopediaofmath.org/index.php/Pontryagin_maximum_principle http://web.sgh.waw.pl/~mbrzez/Adv_Macro/2_Ramsey_model.pdf http://cyber.sci-hub.tw/MTAuMTAwNy9zMDAxOTkwMTAwMTk4/10.1007%40s001990100198.pdf https://economics.mit.edu/files/8336 http://www.econ2.jhu.edu/people/ccarroll/Public/LectureNotes/Growth/HamiltonianVSDiscrete.pdf https://eml.berkeley.edu/~webfac/obstfeld/e202a_f13/lecture2.pdf http://www.princeton.edu/~moll/ECO503Web/Lecture2_ECO503.pdf https://dl1.cuni.cz/pluginfile.php/97847/mod_resource/content/0/Lecture_3.pdf