Froda's theorem

From HandWiki

In mathematics, Darboux–Froda's theorem, named after Alexandru Froda, a Romanian mathematician, describes the set of discontinuities of a monotone real-valued function of a real variable. Usually, this theorem appears in literature without a name. It was written in Froda' thesis in 1929.[1][2][dubious ]. As it is acknowledged in the thesis, the theorem is in fact due to Jean Gaston Darboux.[3]

Definitions

  1. Consider a function f of real variable x with real values defined in a neighborhood of a point x0 and the function f is discontinuous at the point on the real axis x=x0. We will call a removable discontinuity or a jump discontinuity a discontinuity of the first kind.[4]
  2. Denote f(x+0):=limh↘0f(x+h) and f(x−0):=limh↘0f(x−h). Then if f(x0+0) and f(x0−0) are finite we will call the difference f(x0+0)−f(x0−0) the jump[5] of f at x0.

If the function is continuous at x0 then the jump at x0 is zero. Moreover, if f is not continuous at x0, the jump can be zero at x0 if f(x0+0)=f(x0−0)≠f(x0).

Precise statement

Let f be a real-valued monotone function defined on an interval I. Then the set of discontinuities of the first kind is at most countable.

One can prove[6][7] 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 Froda's theorem takes the stronger form:

Let f be a monotone function defined on an interval I. Then the set of discontinuities is at most countable.

Proof

Let I:=[a,b] be an interval and f, defined on I, an increasing function. We have

f(a)≤f(a+0)≤f(x−0)≤f(x+0)≤f(b−0)≤f(b)

for any a<x<b. Let α>0 and let x1<x2<⋯<xn be n points inside I at which the jump of f is greater or equal to α:

f(xi+0)−f(xi−0)≥α, i=1,2,…,n

We have f(xi+0)≤f(xi+1−0) or f(xi+1−0)−f(xi+0)≥0, i=1,2,…,n. Then

f(b)−f(a)≥f(xn+0)−f(x1−0)=∑i=1n[f(xi+0)−f(xi−0)]+
+∑i=1n−1[f(xi+1−0)−f(xi+0)]≥∑i=1n[f(xi+0)−f(xi−0)]≥nα

and hence: n≤f(b)−f(a)α.

Since f(b)−f(a)<∞ we have that the number of points at which the jump is greater than α is finite or zero.

We define the following sets:

S1:={x:x∈I,f(x+0)−f(x−0)≥1},
Sn:={x:x∈I,1n≤f(x+0)−f(x−0)<1n−1}, n≥2.

We have that each set Sn is finite or the empty set. The union S=⋃n=1∞Sn contains all points at which the jump is positive and hence contains all points of discontinuity. Since every Si, i=1,2,… is at most countable, we have that S is at most countable.

If f is decreasing the proof is similar.

If the interval I is not closed and bounded (and hence by Heine–Borel theorem not compact) then the interval can be written as a countable union of closed and bounded intervals In with the property that any two consecutive intervals have an endpoint in common: I=∪n=1∞In.

If I=(a,b], a≥−∞ then I1=[α1,b], I2=[α2,α1],…, In=[αn,αn−1],… where {αn}n is a strictly decreasing sequence such that αn→a. In a similar way if I=[a,b), b≤+∞ or if I=(a,b) −∞≤a<b≤∞.

In any interval In we have at most countable many points of discontinuity, and since a countable union of at most countable sets is at most countable, it follows that the set of all discontinuities is at most countable.

See also

Notes

  1. ↑ Alexandre Froda, Sur la Distribution des Propriétés de Voisinage des Fonctions de Variables Réelles, Thèse, Éditions Hermann, Paris, 3 December 1929
  2. ↑ Alexandru Froda – Collected Papers (Opera Matematica), Vol.1, Editor Academiei Române, 2000
  3. ↑ Jean Gaston Darboux, Mémoire sur les fonctions discontinues, Annales Scientifiques de l'École Normale Supérieure, 2-ème série, t. IV, 1875, Chap VI.
  4. ↑ Walter Rudin, Principles of Mathematical Analysis, McGraw-Hill 1964, (Def. 4.26, pp. 81–82)
  5. ↑ Miron Nicolescu, Nicolae Dinculeanu, Solomon Marcus, Mathematical Analysis (Bucharest 1971), Vol. 1, p. 213, [in Romanian]
  6. ↑ Walter Rudin, Principles of Mathematical Analysis, McGraw–Hill 1964 (Corollary, p. 83)
  7. ↑ Miron Nicolescu, Nicolae Dinculeanu, Solomon Marcus, Mathematical Analysis (Bucharest 1971), Vol.1, p. 213, [in Romanian]

References

  • Bernard R. Gelbaum, John M. H. Olmsted, Counterexamples in Analysis, Holden–Day, Inc., 1964. (18. Page 28)
  • John M. H. Olmsted, Real Variables, Appleton–Century–Crofts, Inc., New York (1956), (Page 59, Ex. 29).