Introductory university-level calculus, linear algebra, abstract algebra, probability, statistics, and stochastic processes.
Limit of a univariate function
Get link
Facebook
X
Pinterest
Email
Other Apps
-
Let \(f(x)\) be a function. Suppose we move \(x\in\mathbb{R}\) towards \(a\) while keeping \(x \neq a\). If in this case \(f(x)\) approaches a constant value \(\alpha\) irrespective of the way how \(x\) approaches \(a\), we say that \(f(x)\) converges to \(\alpha\) as \(x \to a\) and write \[\lim_{x\to a}f(x) = \alpha\] or \[f(x) \to \alpha \text{ as \(x \to a\)}.\]
Remark. \(a\) needs not belong to \(\text{dom}(f)\) (the domain of \(f\)) as long as \(x\) can approach \(a\) arbitrarily closely. □
But what does this mean exactly? Here's a rigorous definition in terms of what is called the \(\varepsilon-\delta\) argument.
Definition (Limit of a function)
We say that the function \(f(x)\) converges to \(\alpha\) as \(x \to a\) and write
\[\lim_{x\to a}f(x) = \alpha\]
if the following condition is satisfied.
For any \(\varepsilon > 0\), there exists \(\delta > 0\) such that, for all \(x\in \text{dom}(f)\), if \(0 < |x - a| < \delta\) then \(|f(x) - \alpha| < \varepsilon\).
Remark. We are implicitly assuming \(\varepsilon, \delta \in\mathbb{R}\). □
Here's how this definition works. Suppose \(f(x) \to \alpha\) as \(x \to a\). Let us pick any positive real number \(\varepsilon\). However small this \(\varepsilon\) may be, if \(x\) is sufficiently close to \(a\), we can always have \(|f(x) - \alpha| < \varepsilon\). Here ``sufficiently close'' means that we can pick some sufficiently small positive real number \(\delta\) such that \(|x - a| < \delta\) implies \(|f(x) - \alpha| < \varepsilon\). In other words, we move \(x\) closer and closer to \(a\) until \(|f(x) - \alpha| < \varepsilon\) holds. Conversely, if this operation is possible for any \(\varepsilon\), it makes sense to say that \(f(x)\) converges to \(\alpha\) as \(x \to a\).
Example. Consider \(f(x) = x^2 + 1\). We have
\[\lim_{x \to 1}f(x) = 2.\]
Let \(\varepsilon = 0.1\). Let us find \(\delta > 0\) such that \(0 < |x - 1| < \delta\) implies \(|f(x) - 2| < \varepsilon\). Suppose
Since \(\sqrt{0.9} - 1 = -0.0513\cdots\) and \(\sqrt{1.1} - 1 = 0.0488\cdots\), if
\[|x - 1| < \sqrt{1.1} - 1,\]
then we have
\[|f(x) - 2| < 0.1 = \varepsilon.\]
So \(\delta\) can be any positive number less than \(\sqrt{1.1} - 1\). For example, let \(\delta = 0.04\). Then \(|x - 1| < 0.04\) implies \(0.96 < x < 1.04\), which implies \(-0.0784 < x^2 - 1 < 0.0816\) so
Let \(\mathbf{X} = (X_1, X_2, \cdots, X_n)^\top\) be a vector of random variables. We say it follows the multivariate normal (Gaussian) distribution if its density is given by \[f(\mathbf{x}) = \frac{1}{\sqrt{(2\pi)^n|\Sigma|}}\exp\left(-\frac{1}{2}(\mathbf{x} - \boldsymbol{\mu})^\top\Sigma^{-1}(\mathbf{x} - \boldsymbol{\mu})\right)\tag{Eq:density}\] where \(\boldsymbol{\mu} = (\mu_1, \mu_2, \cdots, \mu_n)^\top \in \mathbb{R}^n\) is a vector, \(\Sigma\) is a symmetric positive definite \(n\times n\) matrix, and \(\Sigma^{-1}\) and \(|\Sigma|\) are the inverse and determinant of \(\Sigma\), respectively. It turns out that \(\boldsymbol{\mu}\) and \(\Sigma\) are the mean vector and covariance matrix of \(\mathbf{X}\), respectively. But we will not prove that here. In this post, we will show this density (Eq:density) is normalized (of course). That is, we prove that \[\int_{\mathbb{R}^n}f(\mathbf{x})d\mathbf{x} = 1.\] We assume that you already know how to prove the univariate nor...
Let \(\mathbf{X} = (X_1, X_2, \cdots, X_n)^\top \in \mathbb{R}^n\) be a vector of random variables. The covariance matrix \(\Sigma\) of \(\mathbf{X}\) is a square (\(n\times n\)) matrix whose elements are covariances between the components of \(\mathbf{X}\). That is, \[\Sigma_{ij} = \mathrm{Cov}(X_i,X_j)\] where \(\mathrm{Cov}(X_i,X_j)\) is the covariance between \(X_i\) and \(X_j\) , \(i,j = 1, 2, \cdots, n\): \[\mathrm{Cov}(X_i, X_j) = \mathbb{E}[(X_i - \mathbb{E}[X_i])(X_j - \mathbb{E}[X_j])].\] Here, \(\mathbb{E}[\cdot]\) indicates the expectation value of a random variable . Any covariance matrix has the following properties: Symmetric. That is, \[\Sigma = \Sigma^\top.\] Positive semi-definite. That is,\[\forall \mathbf{v} \in \mathbb{R}^n, \mathbf{v}^\top\Sigma\mathbf{v} \geq 0.\] See also : Positive definite matrix (Wolfram MathWorld) The symmetry is obvious from the definition of the covariance matrix. Now, let us prove that the covariance matrix is positive semi-...
We show some basic properties of differentiation, such as linearity, the product rule, the quotient rule, the chain rule, etc. We also introduce higher-order derivatives and differentiability classes. Theorem (Properties of differentiation) Let \(f(x)\) and \(g(x)\) be differentiable functions on an open interval \(I\). (Linearity) \[\frac{d}{dx}[kf(x) + lg(x)] = kf'(x) + lg'(x)\] where \(k, l\) are constants. (Product rule) \[\frac{d}{dx}[f(x)g(x)] = f'(x)g(x) + f(x)g'(x).\] (Quotient rule) \(\frac{f(x)}{g(x)}\) is differentiable on \(\{x \mid g(x) \neq 0, x\in I\}\) and \[\frac{d}{dx}\left[\frac{f(x)}{g(x)}\right] = \frac{f'(x)g(x) - f(x)g'(x)}{[g(x)]^2}.\] Proof . Exercise. Since \(f(x)\) is differentiable at \(x=a\), it is continuous at \(x=a\) so \(f(x) \to f(a)\) as \(x \to a\). For any \(a\in I\), \[\begin{eqnarray*} \frac{f(x)g(x) - f(a)g(a)}{x - a} &=& \frac{f(x)g(x) - f(x)g(a) + f(x)g(a) - f(a)g(a)}{x - a}\\ &=& f(x)\cdot\frac{g(x) ...
Comments
Post a Comment