summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorThibaut Horel <thibaut.horel@gmail.com>2014-10-19 14:38:44 -0400
committerThibaut Horel <thibaut.horel@gmail.com>2014-10-19 14:38:44 -0400
commit6a316d49e546569de3730552e4d50d8b82f80459 (patch)
tree27de41e2d4d4d546213c4de824c771b88e56cb75
parent4a9ac7e8e5552992ec780f1c18c88e36d577a1a5 (diff)
downloadecon2099-6a316d49e546569de3730552e4d50d8b82f80459.tar.gz
[ps2] additional problem, typos
-rw-r--r--ps2/main.tex8
1 files changed, 5 insertions, 3 deletions
diff --git a/ps2/main.tex b/ps2/main.tex
index 6979b97..17f7693 100644
--- a/ps2/main.tex
+++ b/ps2/main.tex
@@ -136,12 +136,14 @@ by considering its restriction to an increasing sequence of bounded rectangles:
$K_n = \prod_{i=1}^n [-n, n]$. We can apply the previous result to each of the
truncated distributions and again take the limit as $n\rightarrow\infty$. The
validity of this last limit will depend on the exact technical assumptions we
-make on $\mathbf{F}$ (basically we need $F$ to be quickly decreasing outside of
-bounded intervals).
+make on $\mathbf{F}$ (basically we need $\mathbf{F}$ to be quickly decreasing
+outside of bounded intervals).
More generally, the previous approach will apply as long as we are considering
a distribution $\mathbf{F}$ in a space of distributions for which finite
support distributions are dense for the weak topology. There are various
-assumptions with various level of technicality which imply such a density.
+assumptions with various level of technicality which imply such a density. We
+can choose to apply one or the other based on the assumptions we have on
+$\mathbf{F}$.
\end{document}