The purpose of this preliminary chapter is to clarify terminology and notation and to recall elementary properties of countability and of real numbers. The heart of the matter begins in Chapter 2, p. 11.
1.1. Sets, mappings, orders
Set theory notations. We utilize the usual notations of set theory1, namely = for “is equal to”, ∈ for “is an element of”, ∀ for “for all”, ∃ for “there exists”, ⇒ for “implies”, ⇐ for “results from”, ⇔ for “is equivalent to”. A barred symbol designates the negation of the property, for example ≠ means “is not equal to”.
We denote {a, b, …, z} the set consisting of a, b, … and z, {a : P(a)} or {a}P(a) the set of the a having the property P(a), and ∅ the empty set. We denote ⊂ set inclusion, ∩ their union and ∩ their intersection. We denote ⊃ for “is a superset of” and U \ V = {u ∈ U : u ∉ V}.
We denote (a, b, …, z) the ordered set composed of a, b, … and z. Therefore, (a, b) ≠ (b, a) if a≠ b. On the contrary, {a, b} = {b, a} always holds.
We denote U1× U2× ·· × Ud = { (u1, u2, …, ud) : ui ∈ Ui for all i} the product2 of the sets U1,… , Ud and denote Ud = { (u1, u2, …, ud) : ui ∈ U for every i}. In particular, U2 = U × U.
Given a set I and for each i ∈ I, a set Ui, we denote ⋃i ∈I Ui the union of all the Ui, ⋂i ∈ I Ui their intersection and ∏i ∈ I Ui = {(ui)i ∈ I:ui ∈ Ui, ∀ i ∈ I} their product. These quantities are related by De Morgan’s laws3:
The axiomatic construction of the set theory is, for instance, achieved in [SCHWARTZ, 100, chap. I] or [BOURBAKI, 16].
Mappings. A mapping T from a set X into a set Y is the data, for each u ∈ X, of an element T(u) ∈ Y. It is said that T is defined on X and that T(u) is the image by T of the point u. The image4 by T of a subset U of X is the se...