In the mathematical field of analysis, a well-known theorem describes the set of discontinuities of a monotone real-valued function of a real variable; all discontinuities of such a (monotone) function are necessarily jump discontinuities and there are at most countably many of them.
Usually, this theorem appears in literature without a name. It is called Froda's theorem in some recent works; in his 1929 dissertation, Alexandru Froda stated that the result was previously well-known and had provided his own elementary proof for the sake of convenience.[1] Prior work on discontinuities had already been discussed in the 1875 memoir of the French mathematician Jean Gaston Darboux.[2]
Denote the limit from the left byand denote the limit from the right by
If
f\left(x+\right)
f\left(x-\right)
f\left(x+\right)-f\left(x-\right)
f
x.
Consider a real-valued function
f
x
x.
f
x
x
x
f
x,
x
f\left(x+\right)=f\left(x-\right) ≠ f(x).
Let
f
I.
One can prove that all points of discontinuity of a monotone real-valued function defined on an interval are jump discontinuities and hence, by our definition, of the first kind. With this remark the theorem takes the stronger form:
Let
f
I.
This proof starts by proving the special case where the function's domain is a closed and bounded interval
[a,b].
Two proofs of this special case are given.
Let
I:=[a,b]
f:I\to\R
a<x<b,
\alpha>0
x1<x2< … <xn
n
I
f
\alpha
For any
i=1,2,\ldots,n,
+\right) | |
f\left(x | |
i |
\leq
-\right) | |
f\left(x | |
i+1 |
-\right) | |
f\left(x | |
i+1 |
-
+\right) | |
f\left(x | |
i |
\geq0.
n\leq
f(b)-f(a) | |
\alpha |
.
Since
f(b)-f(a)<infty
\alpha
Define the following sets:
Each set
Sn
S=
infty | |
cup | |
n=1 |
Sn
Si, i=1,2,\ldots
S
If
f
\blacksquare
So let
f:[a,b]\to\R
D
d\in[a,b]
f
f
Because
f
d\inD,
f\left(d-\right) ≠ f\left(d+\right)
yd\in\Q
f\left(d-\right)andf\left(d+\right)
f\nearrow
yd\in\Q
f\left(d-\right)<yd<f\left(d+\right)
f\searrow
yd\in\Q
f\left(d-\right)>yd>f\left(d+\right)
It will now be shown that if
d,e\inD
d<e,
yd ≠ ye.
f\nearrow
d<e
f\left(d+\right)\leqf\left(e-\right)
yd<f\left(d+\right)\leqf\left(e-\right)<ye.
f\searrow
d<e
f\left(d+\right)\geqf\left(e-\right)
yd>f\left(d+\right)\geqf\left(e-\right)>ye.
yd ≠ ye.
Thus every
d\inD
D\to\Q
d\mapstoyd
\Q
D.
\blacksquare
Suppose that the domain of
f
cupn\left[an,bn\right]
n,
f\vert | |
\left[an,bn\right] |
:\left[an,bn\right]\to\R
f
\left[an,bn\right]
Dn.
f
x0\incupn\left[an,bn\right]
x0
x0\in\left\{a1,b1,a2,b2,\ldots\right\}
n
an<x0<bn,
x0
f\vert | |
\left[an,bn\right] |
x0\inDn
D
f
\left\{a1,b1,a2,b2,\ldots\right\}\cupcupnDn,
D
In particular, because every interval (including open intervals and half open/closed intervals) of real numbers can be written as a countable union of closed and bounded intervals, it follows that any monotone real-valued function defined on an interval has at most countable many discontinuities.
To make this argument more concrete, suppose that the domain of
f
I
In
I=
infty | |
\cup | |
n=1 |
In.
I=(a,b]witha\geq-infty
I1=\left[\alpha1,b\right], I2=\left[\alpha2,\alpha1\right],\ldots,In=\left[\alphan,\alphan-1\right],\ldots
\left(\alphan\right)
infty | |
n=1 |
\alphan → a.
I=[a,b),withb\leq+infty
I=(a,b)with-infty\leqa<b\leqinfty.
In,
\blacksquare
Examples. Let 1 < 2 < 3 < ⋅⋅⋅ be a countable subset of the compact interval [{{mvar|''a''}},{{mvar|''b''}}] and let μ1, μ2, μ3, ... be a positive sequence with finite sum. Set
f(x)=
infty | |
\sum | |
n=1 |
\mun
\chi | |
[xn,b] |
(x)
where χA denotes the characteristic function of a compact interval . Then is a non-decreasing function on [{{mvar|''a''}},{{mvar|''b''}}], which is continuous except for jump discontinuities at for ≥ 1. In the case of finitely many jump discontinuities, is a step function. The examples above are generalised step functions; they are very special cases of what are called jump functions or saltus-functions.
More generally, the analysis of monotone functions has been studied by many mathematicians, starting from Abel, Jordan and Darboux. Following, replacing a function by its negative if necessary, only the case of non-negative non-decreasing functions has to be considered. The domain [{{mvar|''a''}},{{mvar|''b''}}] can be finite or have ∞ or −∞ as endpoints.
The main task is to construct monotone functions — generalising step functions — with discontinuities at a given denumerable set of points and with prescribed left and right discontinuities at each of these points.Let (≥ 1) lie in and take λ1, λ2, λ3, ... and μ1, μ2, μ3, ... non-negative with finite sum and with λ + μ > 0 for each . Define
fn(x)=0
x<xn,fn(xn)=λn,fn(x)=λn+\mun
x>xn.
Then the jump function, or saltus-function, defined by
infty | |
f(x)=\sum | |
n=1 |
fn(x)=
\sum | |
xn\lex |
λn+
\sum | |
xn<x |
\mun,
is non-decreasing on [{{mvar|''a''}}, {{mvar|''b''}}] and is continuous except for jump discontinuities at for ≥ 1.
To prove this, note that sup || = λ + μ, so that Σ converges uniformly to . Passing to the limit, it follows that
f(xn)-f(xn-0)=λn,f(xn+0)-f(xn)=\mun,
f(x\pm0)=f(x)
if is not one of the 's.
Conversely, by a differentiation theorem of Lebesgue, the jump function is uniquely determined by the properties:[3] (1) being non-decreasing and non-positive; (2) having given jump data at its points of discontinuity ; (3) satisfying the boundary condition = 0; and (4) having zero derivative almost everywhere.
Property (4) can be checked following, and . Without loss of generality, it can be assumed that is a non-negative jump function defined on the compact [{{mvar|''a''}},{{mvar|''b''}}], with discontinuities only in .
Note that an open set of is canonically the disjoint union of at most countably many open intervals ; that allows the total length to be computed ℓ= Σ ℓ(). Recall that a null set is a subset such that, for any arbitrarily small ε' > 0, there is an open containing with ℓ < ε'. A crucial property of length is that, if and are open in, then ℓ + ℓ = ℓ(∪) + ℓ(∩). It implies immediately that the union of two null sets is null; and that a finite or countable set is null.
Proposition 1. For > 0 and a normalised non-negative jump function, let be the set of points such that
{f(t)-f(s)\overt-s}>c
for some, with < < . Then is open and has total length ℓ() ≤ 4 −1 (–).
Note that consists the points where the slope of is greater that near . By definition is an open subset of, so can be written as a disjoint union of at most countably many open intervals = (, ). Let be an interval with closure in and ℓ() = ℓ()/2. By compactness, there are finitely many open intervals of the form covering the closure of . On the other hand, it is elementary that, if three fixed bounded open intervals have a common point of intersection, then their union contains one of the three intervals: indeed just take the supremum and infimum points to identify the endpoints. As a result, the finite cover can be taken as adjacent open intervals (,), (,), ... only intersecting at consecutive intervals.[4] Hence
\ell(Jk)\le\summ(tk,m-sk,m)\le\summc-1(f(tk,m)-f(sk,m))\le2c-1(f(bk)-f(ak)).
Proposition 2. If is a jump function, then ' = 0 almost everywhere.
To prove this, define
Df(x)=\limsups,t → {f(t)-f(s)\overt-s},
a variant of the Dini derivative of . It will suffice to prove that for any fixed > 0, the Dini derivative satisfies ≤ almost everywhere, i.e. on a null set.
Choose ε > 0, arbitrarily small. Starting from the definition of the jump function = Σ , write = + with = Σ≤ and = Σ> where ≥ 1. Thus is a step function having only finitely many discontinuities at for ≤ and is a non-negative jump function. It follows that = ' + = except at the points of discontinuity of . Choosing sufficiently large so that Σ> λ + μ < ε, it follows that is a jump function such that − < ε and ≤ off an open set with length less than 4ε/.
By construction ≤ off an open set with length less than 4ε/. Now set ε' = 4ε/ — then ε' and are arbitrarily small and ≤ off an open set of length less than ε'. Thus ≤ almost everywhere. Since could be taken arbitrarily small, and hence also ' must vanish almost everywhere.As explained in, every non-decreasing non-negative function can be decomposed uniquely as a sum of a jump function and a continuous monotone function : the jump function is constructed by using the jump data of the original monotone function and it is easy to check that = − is continuous and monotone.