Mathematics for Applied Sciences (Osnabrück 2023-2024)/Part I/Lecture 10/latex
\setcounter{section}{10}
\zwischenueberschrift{Continuous functions}
We denote the distance between two real numbers
\mathkor {} {x} {and} {x'} {}
by
\mavergleichskette
{\vergleichskette
{ d { \left( x, x' \right) }
}
{ \defeq }{ \betrag { x-x' }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
For a given function
\mathdisp {f \colon \R \longrightarrow \R} { , }
one may ask whether it is possible to control the distance in the image
\zusatzklammer {the target} {} {}
by controlling the distance in the domain. Let
\mavergleichskette
{\vergleichskette
{x
}
{ \in }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and let
\mavergleichskette
{\vergleichskette
{y
}
{ = }{f(x)
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be its image. One would like that for points $x'$ which are close to $x$, also their image points \mathl{f(x')}{} are close to \mathl{f(x)}{.} Already linear functions with different slopes show that the measure for being close in the image and in the domain can not be the same. A reasonable question is whether for any desired exactness in the image there exists at all an exactness in the domain which ensures that the values of the function are lying inside the desired exactness. To make this intuitive idea more precise, let
\mavergleichskette
{\vergleichskette
{\epsilon
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be given. This $\epsilon$ represents an accuracy for the target. The question is whether one can find a
\mavergleichskette
{\vergleichskette
{ \delta
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
\zusatzklammer {representing an accuracy for the domain} {} {}
such that for all $x'$ fulfilling
\mavergleichskette
{\vergleichskette
{ d { \left( x, x' \right) }
}
{ \leq }{ \delta
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
also the relation
\mavergleichskette
{\vergleichskette
{ d { \left( f(x), f(x') \right) }
}
{ \leq }{ \epsilon
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds. This idea leads to the concept of a continuous function.
\inputdefinition
{ }
{
Let
\mavergleichskette
{\vergleichskette
{D
}
{ \subseteq }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be a subset,
\mathdisp {f \colon D \longrightarrow \R} { }
a
function,
and
\mavergleichskette
{\vergleichskette
{x
}
{ \in }{D
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
a point. We say that $f$ is
\definitionswort {continuous}{}
in the point $x$, if for every
\mavergleichskette
{\vergleichskette
{\epsilon
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
there exists a
\mavergleichskette
{\vergleichskette
{\delta
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
such that for all
\mavergleichskette
{\vergleichskette
{x'
}
{ \in }{D
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
fulfilling
\mavergleichskette
{\vergleichskette
{ \betrag { x-x' }
}
{ \leq }{ \delta
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
the estimate
\mavergleichskette
{\vergleichskette
{ \betrag { f(x)- f(x') }
}
{ \leq }{ \epsilon
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds. We say that $f$
\definitionswort {continuous}{,}
if it is continuous in every point
\mavergleichskette
{\vergleichskette
{ x
}
{ \in }{ D
}
{ }{
}
{ }{
}
{ }{
}
}
}
$D$ stands for the set of definition of the function. Typically, $D$ is just $\R$, or an interval, or $\R$ with finitely many points removed. Instead of working with the real numbers \mathkor {} {\epsilon} {and} {\delta} {,} one might also work just with the unit fractions \mathkor {} {{ \frac{ 1 }{ n } }} {and} {{ \frac{ 1 }{ m } }} {.}
\inputbeispiel{}
{
A constant function
\mathdisp {\R \longrightarrow \R
, x \longmapsto c} { , }
is
continuous.
For every given $\epsilon$, one can choose an arbitrary $\delta$, since
\mavergleichskettedisp
{\vergleichskette
{ d(f(x),f(x'))
}
{ =} { d(c,c)
}
{ =} { 0
}
{ \leq} {\epsilon
}
{ } {
}
}
{}{}{}
holds anyway.
The identity
\mathdisp {\R \longrightarrow \R
, x \longmapsto x} { , }
is also
continuous.
For every given $\epsilon$, one can take
\mavergleichskette
{\vergleichskette
{\delta
}
{ = }{ \epsilon
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
yielding the tautology: If
\mavergleichskettedisp
{\vergleichskette
{ d(x,x')
}
{ \leq} { \delta
}
{ =} { \epsilon
}
{ } {
}
{ } {
}
}
{}{}{,}
then
\mavergleichskettedisp
{\vergleichskette
{ d(f(x),f(x'))
}
{ =} { d(x,x')
}
{ \leq} {\epsilon
}
{ } {
}
{ } {}
}
{}{}{}
holds.
}
\inputbeispiel{}
{
We consider the function
\mathdisp {f \colon \R \longrightarrow \R} { , }
given by
\mavergleichskettedisp
{\vergleichskette
{ f(x)
}
{ =} { \begin{cases} 0, \text{ if } x < 0 \, , \\ 1, \text{ if } x \geq 0 \, . \end{cases}
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
This function is not continuous in $0$. For
\mavergleichskette
{\vergleichskette
{ \epsilon
}
{ = }{ { \frac{ 1 }{ 2 } }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and every positive $\delta$, there exists a negative number $x'$ such that
\mavergleichskette
{\vergleichskette
{ d(0,x')
}
{ = }{ \betrag { x' }
}
{ \leq }{ \delta
}
{ }{
}
{ }{
}
}
{}{}{.}
But for such a number we have
\mavergleichskette
{\vergleichskette
{ d(f(0),f(x'))
}
{ = }{ d(1,0)
}
{ = }{ 1
}
{ \not\leq }{ { \frac{ 1 }{ 2 } }
}
{ }{
}
}
{}{}{.}
}
The following statement relates continuity to convergent sequences.
\inputfaktbeweis
{Real function/Continuity in a point/Characterization/Fact}
{Lemma}
{}
{
\faktsituation {Let
\mavergleichskette
{\vergleichskette
{D
}
{ \subseteq }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be a subset,
\mathdisp {f \colon D \longrightarrow \R} { }
a
function
and
\mavergleichskette
{\vergleichskette
{x
}
{ \in }{D
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
a point.}
\faktuebergang {Then the following statements are equivalent.}
\faktfolgerung {\aufzaehlungzwei {$f$ is
continuous
in the point $x$.
} {For every
convergent sequence
\mathl{{ \left( x_n \right) }_{n \in \N }}{} in $D$ with
\mavergleichskette
{\vergleichskette
{ \lim_{ n \rightarrow \infty} x_{ n }
}
{ = }{ x
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
also the
image sequence
\mathl{{ \left( f(x_n) \right) }_{ n \in \N }}{} is convergent with limit \mathl{f(x)}{.}
}}
\faktzusatz {}
}
{
Suppose that (1) is fulfilled and let \mathl{{ \left( x_n \right) }_{n \in \N }}{} be a sequence in $D$ converging to $x$. We have to show that
\mavergleichskettedisp
{\vergleichskette
{ \lim_{n \rightarrow \infty} f(x_n)
}
{ =} { f(x)
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
holds. To show this, let
\mavergleichskette
{\vergleichskette
{ \epsilon
}
{ > }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be given. Due to (1), there exists a
\mavergleichskette
{\vergleichskette
{ \delta
}
{ > }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
fulfilling the estimation property (from the definition of continuity) and because of the convergence of \mathl{{ \left( x_n \right) }_{n \in \N }}{} to $x$ there exists a natural number $n_0$ such that for all
\mavergleichskette
{\vergleichskette
{n
}
{ \geq }{ n_0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
the estimate
\mavergleichskettedisp
{\vergleichskette
{ d(x_n,x)
}
{ \leq} { \delta
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
holds. By the choice of $\delta$ we have
\mathdisp {d(f(x_n), f(x)) \leq \epsilon \text{ for all } n \geq n_0} { , }
so that the image sequence converges to \mathl{f(x)}{.}
Suppose now that (2) is fulfilled. We assume that $f$ is not continuous. Then there exists an
\mavergleichskette
{\vergleichskette
{ \epsilon
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
such that for all
\mavergleichskette
{\vergleichskette
{ \delta
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
there exist elements
\mavergleichskette
{\vergleichskette
{z
}
{ \in }{ D
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
such that their distance to $x$ is at most $\delta$, but such that the distance of their value \mathl{f(z)}{}to \mathl{f(x)}{} is larger than $\epsilon$. This holds in particular
for every
\mathbed {\delta=1/n} {}
{n \in \N_+} {}
{} {} {} {.}
This means that for every natural number
\mavergleichskette
{\vergleichskette
{n
}
{ \in }{ \N_+
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
there exists a
\mavergleichskette
{\vergleichskette
{x_n
}
{ \in }{ D
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
with
\mathdisp {d(x_n ,x) \leq \frac{1}{n} \text{ and with } d(f(x_n), f(x)) > \epsilon} { . }
This sequence \mathl{{ \left( x_n \right) }_{n \in \N }}{} converges to $x$, but the image sequence does not converge to \mathl{f(x)}{,} since the distance of its members to \mathl{f(x)}{} is always at least $\epsilon$. This contradicts condition (2).
\zwischenueberschrift{Rules for continuous functions}
\inputfaktbeweis
{Real function/Continuous/Composition/Fact}
{Lemma}
{}
{
\faktsituation {Let
\mavergleichskette
{\vergleichskette
{D
}
{ \subseteq }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mavergleichskette
{\vergleichskette
{E
}
{ \subseteq }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be subsets and let
\mathdisp {f \colon D \longrightarrow \R} { }
and
\mathdisp {g \colon E \longrightarrow \R} { }
denote functions with
\mavergleichskette
{\vergleichskette
{f(D)
}
{ \subseteq }{E
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}}
\faktuebergang {Then the following statements hold.}
\faktfolgerung {\aufzaehlungzwei {If $f$ is
continuous
in
\mavergleichskette
{\vergleichskette
{x
}
{ \in }{D
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and $g$ is continuous in \mathl{f(x)}{,} then also the
composition
\mathl{g \circ f}{} is continuous in $x$.
} {If
\mathkor {} {f} {and} {g} {}
are continuous, so is \mathl{g \circ f}{.}
}}
\faktzusatz {}
}
{
The first statement follows from Lemma 10.4 . This implies also the second statement.
\inputfaktbeweis
{Real function/Continuous/Addition, multiplication, inverting/Fact}
{Lemma}
{}
{
\faktsituation {Let
\mavergleichskette
{\vergleichskette
{D
}
{ \subseteq }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be a subset and let
\mathdisp {f,g \colon D \longrightarrow \R} { }
be
continuous functions.}
\faktfolgerung {Then also the functions
\mathdisp {f+g \colon D \longrightarrow \R
, x \longmapsto f(x)+g(x)} { , }
\mathdisp {f-g \colon D \longrightarrow \R
, x \longmapsto f(x)-g(x)} { , }
\mathdisp {f \cdot g \colon D \longrightarrow \R
, x \longmapsto f(x) \cdot g(x)} { , }
are continuous. For a subset
\mavergleichskette
{\vergleichskette
{U
}
{ \subseteq }{D
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
such that $g$ has no zero in $U$, also
\mathdisp {f/g \colon U \longrightarrow \R
, x \longmapsto f(x)/g(x)} { , }
is continuous.}
\faktzusatz {}
}
{
This follows from Lemma 10.4 and Lemma 8.1 .
\inputfaktbeweis
{Polynomial function/R/Continuous/Fact}
{Corollary}
{}
{
\faktsituation {Polynomial functions
\mathdisp {P \colon \R \longrightarrow \R
, x \longmapsto P(x)} { , }
}
\faktfolgerung {are
continuous.}
\faktzusatz {}
}
{
Due to
Example 10.
and
Lemma 10.6
,
the powers
\mathdisp {\R \longrightarrow \R
, x \longmapsto x^n} { , }
are continuous for every
\mavergleichskette
{\vergleichskette
{ n
}
{ \in }{ \N
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
Hence, also the functions
\mathdisp {\R \longrightarrow \R
, x \longmapsto ax^n} { , }
are continuous for every
\mavergleichskette
{\vergleichskette
{ a
}
{ \in }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and therefore, again due to
Lemma 10.6
,
the functions
\mathdisp {\R \longrightarrow \R
, x \longmapsto a_nx^n +a_{n-1} x^{n-1} + \cdots + a_1x +a_0} { , }
are continuous.
\inputfaktbeweis
{Rational function/R/Continuous/Fact}
{Corollary}
{}
{
\faktsituation {Let
\mavergleichskette
{\vergleichskette
{P,Q
}
{ \in }{ \R [X]
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be
polynomials
and let
\mavergleichskette
{\vergleichskette
{U
}
{ \defeq }{ { \left\{ x \in \R \mid Q(x) \neq 0 \right\} }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}}
\faktfolgerung {Then the
rational function
\mathdisp {U \longrightarrow \R
, x \longmapsto { \frac{ P(x) }{ Q(x) } }} { , }
is
continuous.}
\faktzusatz {}
}
{
This follows from Corollary 10.7 and Lemma 10.6 .
\zwischenueberschrift{Limit of a function}
Quite often, functions are not defined in certain points, e.g. if the used functional term is not defined there. However, it makes a huge difference whether only the functional term is not defined in a point, but has a useful (continuous) extension, or whether the function does not have a useful extension in this point, e.g. because it has a pole or an even more chaotic behavior. The following concept is in particular relevant for the definition of differentiability (if the difference quotient has a useful limit, then it is called differential quotient).
\inputdefinition
{ }
{
Let
\mavergleichskette
{\vergleichskette
{ T }
{ \subseteq }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
denote a subset and
\mavergleichskette
{\vergleichskette
{ a
}
{ \in }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
a point. Let
\mathdisp {f \colon T \longrightarrow \R} { }
be a
function.
Then
\mavergleichskette
{\vergleichskette
{ b
}
{ \in }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
is called \definitionswort {limit}{} of $f$ in $a$, if for every
\mavergleichskette
{\vergleichskette
{ \epsilon
}
{ > }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
there exists some
\mavergleichskette
{\vergleichskette
{ \delta
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
such that for all
\mavergleichskette
{\vergleichskette
{x
}
{ \in }{T
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
fulfilling
\mavergleichskettedisp
{\vergleichskette
{ \betrag { x-a }
}
{ \leq} { \delta
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{,}
the estimate
\mavergleichskettedisp
{\vergleichskette
{ \betrag { f(x)-b }
}
{ \leq} { \epsilon
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
holds. In this case, we write
\mavergleichskettedisp
{\vergleichskette
{ \operatorname{lim}_{ x \rightarrow a } \, f(x)
}
{ =} { b
}
{ } {
}
{ } {
}
{ } {
}
}
}
This concept is basically only useful if there exists at least some sequence within $T$ converging to $a$. A typical situation is the following: Let $I$ denote a real interval,
\mavergleichskette
{\vergleichskette
{a
}
{ \in }{I
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
a point and let
\mavergleichskette
{\vergleichskette
{ T
}
{ = }{ I \setminus \{a\}
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
The function is defined on $T$ but not in $a$, and we are dealing with the question whether $f$ can be extended to a function $\tilde{f}$ defined on the whole $I$. Here, \mathl{\tilde{f}(a)}{} should be determined by $f$.
\inputfaktbeweis
{Function/R/Limit/Epsilon/Characterizations/Fact}
{Lemma}
{}
{
\faktsituation {Let
\mavergleichskette
{\vergleichskette
{ T }
{ \subseteq }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
denote a subset and
\mavergleichskette
{\vergleichskette
{ a
}
{ \in }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
a point.}
\faktvoraussetzung {Let
\mathdisp {f \colon T \longrightarrow \R} { }
be a
function
and
\mavergleichskette
{\vergleichskette
{ b
}
{ \in }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
a point.}
\faktuebergang {Then the following statements are equivalent.}
\faktfolgerung {\aufzaehlungzwei {We have
\mavergleichskettedisp
{\vergleichskette
{ \operatorname{lim}_{ x \rightarrow a } \, f(x)
}
{ =} { b
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{.}
} {For every sequence \mathl{{ \left( x_n \right) }_{n \in \N }}{} in $T$ which
converges
to $a$, also the image sequence \mathl{{ \left( f(x_n) \right) }_{ n \in \N }}{} converges to $b$.
}}
\faktzusatz {}
{See Exercise 10.24 . }
This implies for a continuous function
$f \colon T \rightarrow \R$
that it can be extended to a continuous function
$\tilde{f} \colon T \cup \{a\} \rightarrow \R$
(by
\mavergleichskette
{\vergleichskette
{ \tilde{f}(a)
}
{ = }{ b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}) if and only if the limit of $f$ in $a$ equals $b$.
\inputfaktbeweis
{Function/R/Limit/Epsilon/Rules/Fact}
{Lemma}
{}
{
\faktsituation {Let
\mavergleichskette
{\vergleichskette
{ T }
{ \subseteq }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
denote a subset and
\mavergleichskette
{\vergleichskette
{ a
}
{ \in }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
a point.}
\faktvoraussetzung {Let
$f \colon T \rightarrow \R$
and
$g \colon T \rightarrow \R$
denote
functions,
such that the
limits
\mathkor {} {\operatorname{lim}_{ x \rightarrow a } \, f(x)} {and} {\operatorname{lim}_{ x \rightarrow a } \, g(x)} {}
exist.}
\faktuebergang {Then the following statements hold.}
\faktfolgerung {\aufzaehlungdrei {The sum \mathl{f+g}{} has in $a$ the limit
\mavergleichskettedisp
{\vergleichskette
{ \operatorname{lim}_{ x \rightarrow a } \, (f(x)+g(x))
}
{ =} { \operatorname{lim}_{ x \rightarrow a } \, f(x) + \operatorname{lim}_{ x \rightarrow a } \, g(x)
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{.}
} {The product \mathl{f \cdot g}{} has in $a$ the limit
\mavergleichskettedisp
{\vergleichskette
{ \operatorname{lim}_{ x \rightarrow a } \, (f(x) \cdot g(x))
}
{ =} { \operatorname{lim}_{ x \rightarrow a } \, f(x) \cdot \operatorname{lim}_{ x \rightarrow a } \, g(x)
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{.}
} {Suppose that
\mavergleichskette
{\vergleichskette
{g(x)
}
{ \neq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
for all
\mavergleichskette
{\vergleichskette
{x
}
{ \in }{T
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mavergleichskette
{\vergleichskette
{ \operatorname{lim}_{ x \rightarrow a } \, g(x)
}
{ \neq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
Then the quotient \mathl{f/g}{} has in $a$ the limit
\mavergleichskettedisp
{\vergleichskette
{ \operatorname{lim}_{ x \rightarrow a } \, \frac{f(x)}{ g(x)}
}
{ =} { \frac{ \operatorname{lim}_{ x \rightarrow a } \, f(x) }{ \operatorname{lim}_{ x \rightarrow a } \, g(x) }
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{.}
}}
\faktzusatz {}
}
{
This follows from Lemma 10.10 and from Lemma 8.1 .
\inputbeispiel{}
{
We consider the limit
\mathdisp {\operatorname{lim}_{ x \rightarrow 0 } \, \frac{\sqrt{x+4} - 2}{x}} { , }
where \mathl{x \in \R \setminus \{0\} , \, x \geq -4}{.} For
\mavergleichskette
{\vergleichskette
{x
}
{ = }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
this term is not defined, and from this term one can not read of directly whether the limit exists. It is however possible to multiply the numerator and the denominator by \mathl{\sqrt{x+4} +2}{,} then we get
\mavergleichskettealign
{\vergleichskettealign
{ \frac{\sqrt{x+4}-2}{x}
}
{ =} { \frac{ { \left( \sqrt{x+4} - 2 \right) } { \left( \sqrt{x+4} + 2 \right) } }{x { \left( \sqrt{x+4} +2 \right) } }
}
{ =} { \frac{ x+4 -4 }{x { \left( \sqrt{x+4} +2 \right) } }
}
{ =} { \frac{ x }{ x { \left( \sqrt{x+4} +2 \right) } }
}
{ =} { \frac{ 1 }{ \sqrt{x+4} +2 }
}
}
{}
{}{.}
Due to
the rules for limits,
we can determine the limit in the numerator and in the denominator separately, where for the denominator we use the continuity of the square root according to
Exercise 10.4
.
Hence, the limit is \mathl{1/4}{.}
}