Bourbaki

Theorem 2 (Theorem of the monotone limit)

Tag 0BR7, permanent. Cite it as [Bourbaki, Tag 0BR7].

General Topology, chapter IV, § 5. Real-valued functions

Let XX be an ordered set and let AA be a directed subset of XX (*). Every monotonic real-valued function ff defined on AA has a limit with respect to AA (Chapter I, , no. 3); if ff is increasing (resp. decreasing), this limit is equal to the least upper bound (resp. greatest lower bound) of the set f(A)⊂R‾f(A) \subset \overline{\mathbf{R}}

Suppose for example that ff is increasing, and let a=sup⁡f(A)a = \sup f(A). If a=−∞a = -\infty, the theorem is trivial. If a>−∞a > -\infty, then for each b<ab < a there exists x∈Ax \in A such that b<f(x)≤ab < f(x) \leq a; hence, if SxS_x is the section of AA relative to xx (i.e. the set of all y≥xy \geq x, cf. Chapter I, § 6, no. 3), f(Sx)f(S_x) is contained in the neighbourhood ]b,+∞]]b, +\infty] of aa, and the theorem follows. The proof is analogous if ff is decreasing.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

Transcribed from the printed volume. Not translated.