Introductory university-level calculus, linear algebra, abstract algebra, probability, statistics, and stochastic processes.
Applications of integrals (1): Length of a curve
Get link
Facebook
X
Pinterest
Email
Other Apps
-
As an application of integrals, we consider the length of a curve. Specifically, we consider curves in the 2-dimensional space defined parametrically.
Let \(x(t)\) and \(y(t)\) be \(C^1\) functions defined on an interval containing the closed interval \([a,b]\). If \(t\) moves in \([a,b]\), the point \((x(t), y(t))\) on \(\mathbb{R}^2\) moves smoothly, drawing a curve. Let us denote this curve by \(C\). Let \(P = (x(a), y(a))\) and \(Q = (x(b), y(b))\) be the end points of the curve \(C\). We want to measure the ``length'' of the curve \(C\). But what is the length of a \emph{curve}, anyway? We do know how to calculate the length of a line segment (Pythagorean theorem). So, let us approximate the curve by line segments. Consider the partition of the closed interval \([a,b]\):
Then \(P_0 = (x(t_0), y(t_0)) = P\), \(P_1 = (x(t_1), y(t_1))\), \(P_2 = (x(t_2), y(t_2))\), \(\cdots\), \(P_{n-1} = (x(t_{n-1}), y(t_{n-1}))\), \(P_n = (x(t_n), y(t_n)) = Q\) are all on \(C\). We can approximate the curve \(C\) by connecting the line segments \(P_0P_1\), \(P_1P_2\), \(\cdots\), \(P_{n-1}P_{n}\). By adding the lengths of these segments, we can approximate the length \(l_{\Delta}\) of the curve \(C\). The length of \(P_{i}P_{i+1}\) is given by
Since \(y(t)\) is a \(C^1\) function, \(\frac{d}{dt}y(t)\) is continuous so the difference between \(\frac{d}{dt}y(s_i')\) and \(\frac{d}{dt}y(s_i)\) becomes smaller as \(\Delta\) is more refined. Thus, we have the approximation
As we refine \(\Delta\), both sides of {eq:mMlen} converge to the same value that is \(\int_{a}^{b}h(t)dt\). Thus, it is natural to define the length \(l(C)\) of the curve \(C\) by
Defining the birth process Consider a colony of bacteria that never dies. We study the following process known as the birth process , also known as the Yule process . The colony starts with \(n_0\) cells at time \(t = 0\). Assume that the probability that any individual cell divides in the time interval \((t, t + \delta t)\) is proportional to \(\delta t\) for small \(\delta t\). Further assume that each cell division is independent of others. Let \(\lambda\) be the birth rate. The probability of a cell division for a population of \(n\) cells during \(\delta t\) is \(\lambda n \delta t\). We assume that the probability that two or more births take place in the time interval \(\delta t\) is \(o(\delta t)\). That is, it can be ignored. Consequently, the probability that no cell divides during \(\delta t\) is \(1 - \lambda n \delta t - o(\delta t)\). Note that this process is an example of the Markov chain with states \({n_0}, {n_0 + 1}, {n_0 + 2}...
Sometimes, we may simplify integration by using the product rule of differentiation. This technique is called integration by parts. Theorem (Integration by parts) Let \(f(x)\) and \(g(x)\) be differentiable functions on an open interval \(I\). Then, \(\int f(x)g'(x)dx = f(x)g(x) - \int f'(x)g(x)dx\); For any \(a, b \in I\), \[\int_a^bf(x)g'(x)dx = \left[f(x)g(x)\right]_a^b - \int_a^bf'(x)g(x)dx.\] Proof . By the product rule, \[[f(x)g(x)]' = f'(x)g(x) + f(x)g'(x)\] so \[f(x)g'(x) = [f(x)g(x)]' - f'(x)g(x).\] By integrating both sides, we have the desired results. ■ Example . Let us find \(\int x\cosh x dx\). \[ \begin{eqnarray*} \int x\cosh x dx &=& \int x(\sinh x)'dx \\ &=& x \sinh x - \int 1 \cdot \sinh x dx\\ &=& x \sinh x - \cosh x + C. \end{eqnarray*} \] Example (eg:recur) . Let us study how we can compute \[I_n = \int \frac{dx}{(x^2 + 1)^n}\] for \(n\in \mathbb{N}\). Note \[I_{n} = \int \fr...
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-...
Comments
Post a Comment