Mathematics · Notes

Rational preferences

5 October 2026

This note collects the definitions used in Tool 04. It builds on note 02, where relations and their properties are defined, and on note 03.

Preference relations

A consumer chooses among the elements of a set XX of bundles. A preference relation is a relation ≿\succsim on XX, and x≿yx \succsim y reads “xx is at least as good as yy”. The preference relation is called rational when it is

From ≿\succsim we define two further relations:

RelationDefinitionReads
strict preference x≻yx \succ yx≿yx \succsim y and not y≿xy \succsim xxx is better than yy
indifference x∼yx \sim yx≿yx \succsim y and y≿xy \succsim xxx and yy are equally good

Two bundles are incomparable when neither x≿yx \succsim y nor y≿xy \succsim x holds. Incomparability is not indifference: indifference means that both comparisons hold, and incomparability means that neither does.

If ∼\sim is an equivalence relation, its equivalence classes are called indifference classes.

Pictures of a preference relation

A preference relation on a finite set can be given in either of the forms used in Tool 03.

Choice sets

A menu is a nonempty subset B⊆XB \subseteq X of bundles that are available. The choice set of BB consists of the bundles in BB that are at least as good as everything in BB:

C(B)={x∈B:x≿y for every y∈B}.C(B) = \{x \in B : x \succsim y \text{ for every } y \in B\}.

The choice set may contain several bundles, or none at all.

Utility representations

A function u:X→Ru : X \to \mathbb{R} represents ≿\succsim when, for all x,y∈Xx, y \in X,

x≿yif and only ifu(x)≥u(y).x \succsim y \quad\text{if and only if}\quad u(x) \ge u(y).

A utility function carries only order information. If uu represents ≿\succsim and f:R→Rf : \mathbb{R} \to \mathbb{R} is strictly increasing, then f∘uf \circ u represents ≿\succsim as well, since f(u(x))≥f(u(y))f(u(x)) \ge f(u(y)) exactly when u(x)≥u(y)u(x) \ge u(y). So the values u=4,1,3u = 4, 1, 3 and u=100,0,7u = 100, 0, 7 represent the same preferences on three bundles.

Lexicographic preferences. On bundles x=(x1,x2)x = (x_1, x_2) and y=(y1,y2)y = (y_1, y_2), the lexicographic preference compares the first coordinates and uses the second only to break a tie:

x≿ywhenx1>y1,   or   x1=y1 and x2≥y2.x \succsim y \quad\text{when}\quad x_1 > y_1, \;\text{ or }\; x_1 = y_1 \text{ and } x_2 \ge y_2 .

The name comes from the way a dictionary orders words: by the first letter, then by the second.

Test these definitions in Tool 04. Some of its exercises ask for a utility function that does not exist; showing why is part of the exercise.