Lecture 1
Lecture 1
0.1 Preferences
1. Let X denote a set of alternatives/objects/goods. A preference relation
of an economic agent is a binary relation, denoted by <, over X. The
relation describes what the agent wants. For any x; x0 2 X,
x < x0
(a) Completeness: For any two bundles x and x0 , it is that either x < x0 ,
or x0 < x, or both.
(b) Transitivity: For any three choices x; x0 , and x00 ,
5. If both x < x0 and x0 < x, then the agent is indi¤erent between x and
x0 . We use the notation to represent the indi¤erence relation. If x < x0
and x x0 , then the agent strictly prefers x to x0 . We use to represent
the strict preference relation.
6. The transitivity of < implies the transitivity of and the transitivity of
, and vice versa. So, we can equivalently state our axioms as
and
if x x0 and x0 x00 ; then x x00 :
1
7. It should be clear that if x x0 , then if x0 x (since neither x x0 nor
x0 x:)
8. Note that (6) implies that for any three choices x; x0 , and x00
10. Showing the equivalence or 4 and 6 are not hard. First, 4(a) and 6(a) are
equivalent. To show the transitivity of < implies the transitivity of , we
suppose, by way of contradiction, that there are x; x0 , and x00 such that
x x0 and x0 x00
imply
x < x0 < x00
and
x00 < x0 < x:
(a) The Condorcet Paradox of Majority Rule: Suppose each object x has
three characteristics: x1 ; x2 ; x3 . The rule states that x x0 i¤ there
exists i; j 2 f1; 2; 3g, i 6= j such that xi > x0i and xj > x0j . And
x x0 if x x0 and x0 x:
(b) x x0 if x x0 > 1; and x x0 if x x0 and x0 x:
2
0.2 Utility Function
1. A utility function de…ned over X assigns a real number to each member of
X. We say a utility function u : Rn ! R represents a preference relation
< if for any objects x and x0 ,
4. Proof: Suppose < can be represented by u. Since for any x and x0 , either
u (x) u (x0 ) ; or u (x0 ) u (x). Hence < must be complete. Since
the ordering on real number is transitive, the preference relation must be
transitive.
5. The converse of theorem is also true whenever X is countable. The idea
is obvious, but it does not hurt to write down a formal proof.
6. Proof: Since X is countable, we can order it in some way:
X = fx1 ; x2 ; :::g
Let u (x1 ) = 0. De…ne u (xi ), i > 1 recursively. For all i > 1, re-order
the objects such that xj denote the element with the j-th highest utility
among all xj , j < i. (By construction xj xj+1 .)
8
>
> (u (x1 ) + 1) =2 if xi x1
>
>
< u (x1 ) if xi x1
u (xi ) = u xj + u xj 1 =2 if xj 1 xi xj for some j :
>
>
>
> u (xi ) if xi xi 1
:
(u (xi ) 1) =2 if xi xi 1
The point is that there is always a rational number between any two
rational numbers. Note that by construction u 2 [ 1; 1].
3
9. Axiom 3: (Continuity) There are two (equivalent) ways to state this ax-
ioms.
10. 9a says that if y is strictly better than x, then anything su¢ ciently close
to y will also be strictly better than anything su¢ ciently close to x.
11. Assume 9a. If 9b is false and that lim xn lim y n . Then there would exist
a neighborhood of lim xn and a neighborhood of lim y n such that anything
in the former would be strictly better than anything in the latter. But
this would contradict the supposition that xn y n for all n.
12. Assume 9b. If 9a is false, then there must exist a sequence xn converging
to x and a sequence y n converging to y such that y n xn for all n. By
9b, y x, contradicting the supposition that y x.
13. Not all rational preferences are continuous: Example: Lexicographic pref-
erences. Suppose there are two goods: x1 and x2 . A consumer prefers x
to x0 if either
x1 > x01
or x1 = x01 and x2 > x02
4
18. Note that the continuity axiom is su¢ cient but not necessary for a pref-
erence relation to be representable by a utility function.
19. This theorem due to Debreu is classic result in economics. But it is mainly
a mathematical result and does not convey any economic insight.
20. We will consider two proofs. One follows Reny and Mas-Colell that makes
use of an additional axiom. The second, which follows Rubinstein, proves
existence but not continuity.
MGW
1. Axiom 4: Strict Monotonicity. For all x and x0 , if x x0 , then x x0 , and
if, in addition, xi < x0i for some i, then x x0 . The weakly-better-than-set
for x is
fx0 jx0 xg :
Axiom 4 means that the indi¤erence set will be a line which always have
a negative slope. We call these lines indi¤erence curves. Note that indif-
ference curves never crosses each other.
2. Step 1. Let e (1; 1; :::; 1) denote a unit consumption bundle (which
contains one unit of each good). For any consumption bundle x, de…ne
u (x) by the equation
u (x) e x:
(u (x) e (u (x) ; :::; u (x)), i.e., u (x) e is the consumption bundle that
consists of u (x) units of each good.)
Step 2. u (x) is uniquely de…ned for all x. Let xmax max fxi ; i = 1; :::; ng.
By strict monotonicity, it must be that
A ft 2 <+ : te < xg
and
B ft 2 <+ : x < teg
are both closed. By monotonicity,
A = ft 2 [t; 1)g
and
B = t 2 [0; t) :
By completeness, any t must belong to either A or B; thus A+ [A = <+ .
We therefore can conclude that t t; or that the intersection of A and B
is non-empty. Uniqueness follows from the monotonicity axiom.
5
Step 3. For any two consumption bundles x and x0 ,
x x0 , u (x) e u (x0 ) e (transitivity)
, u (x) u (x0 ) (strict monotonicity).
Hence, x < x0 if and only if u (x) u (x0 ).
Step 4. (Technical) A function u is continuous at x0 i¤ for all " > 0, there
exists some such that for all x0 2 fx : d (x; x0 ) g, ju (x) u (x0 )j ".
Intuitively, if u is continuous at x, a small movement from x will produce
only a small change in u. To prove continuity, we need to make use of the
following mathematical result: A function is continuous if for any open
set (a; b) <; the inverse mapping u 1 ((a; b)) is open in <n+ . (Recall
that a set in <n is open if and only for any point in the set, an open ball
including the point also belongs to the set. A set is closed if its complement
is open.) Explain brie‡y the “if” part: Roughly, if the inverse image of
an open set is open, then pick any x and an open ball B" (u (x)), an open
ball B (x) B" (u (x)). Now, in our case,
1
u ((a; b)) = fxja < u (x) < b)g
= fxjae u (x) e beg
= fxjae x beg :
Finally, the intersection of two open set is open.
3. This proof makes use of the natural utility function de…ned on the diagonal
and uses the continuity property to identify each x with a unique element
on the diagonal.
Rubinstein
1. The drawback of the …rst proof is that it requires a unnecessary axiom.
2. Recall we have constructed a utility function de…ned over all rational z
on ( 1; 1). Now, the set of rational numbers are dense in the set of <n .
That is, for any real number x, you can …nd a rational number that is as
close to z as you want. So we can just assign the utility of x to be equal
to the utility of a rational number very very close to it.
3. First, we show that if is continuous, then for any x y, there exists z
such that x z y.
4. Suppose not.
5. Set x1 = x and y1 = y.
6. Given (xt ; yt ). Consider the midpoint (xt + yt ) =2. By supposition, it is
either that (xt + yt ) =2 x or y (xt + yt ) =2. In the …rst case, set
xt+1 = (xt + yt ) =2;
yt+1 = yt :
6
In the second case, set
xt+1 = xt ;
yt+1 = (xt + yt ) =2:
xt x y yt ,
x z z0 x0 .