We begin by reviewing basic mathematical facts and notation that we shall use repeatedly in the book. The basic results we need relate to binary relations and their extensions and representations, and to solutions to systems of inequalities.

BASIC DEFINITIONS AND NOTATIONAL CONVENTIONS

Relations

Let X be a set. An n-ary relation on X is a subset of Xn. A binary relation on X is a subset of X ×X. When R is a binary relation on X, we write (x, y) ∈ R as x R y. When R is an n-ary relation, we also write R(x1, …, xn) instead of (x1, …, xn) ∈ R.

Given a binary relation R, define its strict part, or asymmetric part, PR by (x, y) ∈ PR iff (x, y) ∈ R and (y, x) ∉ R. Define its symmetric part, or indifference relation, IR by (x, y) ∈ IR iff (x, y) ∈ R and (y, x) ∈ R. Two elements x, y ∈ X are unordered by R if (x, y) ∈ R and (y,x) ∈ R.

Two elements are ordered by R when they are not unordered by R. We say that a binary relation B is an extension of R if R ⊆ B and PR ⊆ PB. A binary relation B is a strict extension of R if it is an extension, and in addition there is a pair that is unordered by R but ordered by B. Finally, a binary relation is complete if it leaves no pair of elements unordered. That is, R is complete if for all x and y, x R y or y R x (or both).

The following are standard properties of binary relations. A binary relation R is:

1. • transitive if, for all x, y, and z, x R y and y R z imply that x R z;

2. • quasitransitive if, for all x, y, and z, xPR y and yPR z imply that xPR z;

3. • reflexive if x R x for all x;

4. • irreflexive if (x, x) ∉ R for all x;

5. • symmetric if, for all x and y, (x, y) ∈ R implies that (y, x) ∈ R;