A preference relation on lotteries is complete when every pair is comparable, allowing an indifference relation. Completeness does not require strict ranking of distinct lotteries. Together with a transitive relation, it gives the ordering assumption in the Von Neumann-Morgenstern utility theorem.
First pass from the preorder to a partial order. Define the indifference relation by and . Reflexivity and transitivity make this an equivalence relation. On the quotient set , put
Transitivity makes this independent of the representatives, and the quotient relation is antisymmetric, hence a partial order.
We need its order-extension property, including freedom to order incomparable classes. Here is the argument. Order all partial order extensions of by inclusion. The union of a chain of extensions is again a partial order: any finite list of comparisons needed to check an axiom occurs together in one member of the chain. Zorn's lemma therefore supplies a maximal extension. If two classes remain incomparable, adjoin and take the transitive closure of a relation. The only possible new comparisons have the form . A cycle would require a previously existing path , contradicting incomparability. The enlarged relation is still a partial order, contradicting maximality. Consequently the maximal extension is a total order. This also proves the Szpilrajn extension theorem used here.
Lift such a total order to the original bundles by comparing their equivalence classes. The lifted preference relation is complete and transitive, contains , and preserves its strict preference: if , their distinct classes satisfy , and antisymmetry of the extended order prevents the reverse comparison. In particular, the class is nonempty and .
For the reverse inclusion, take a pair with . If , then , so every member of strictly ranks above and excludes . If neither comparison holds, their classes are incomparable. First adjoin , which creates no cycle by the preceding argument, and then extend to a total order. Its lift belongs to and again excludes . Thus every pair outside is outside at least one member of , proving
The intersection proof is an order-theoretic fact about any preorder. The congruence axiom additionally ensures exact rationalization of the observed demand correspondence: every chosen bundle weakly outranks every affordable bundle, while an affordable unchosen bundle is strictly worse by part (b). Hence each completion's budget-maximizing set is exactly the observed chosen set.
No: uniform convergence of utilities on bounded sets does not imply closed convergence of preferences. It does imply the upper condition. Indeed, suppose , and . These bundles all lie in one bounded ball. Uniform convergence there, together with continuity of , gives
so .
For a strict limiting comparison , the fixed pair itself satisfies eventually. The obstruction is the lower condition at an indifference relation, where the strict approximating rankings need not disappear.
For a counterexample valid in every dimension , take
On , , exactly as required. Every induces if and only if , while makes every pair indifferent. In particular, holds in the limit. Any sequences , eventually have , so they cannot satisfy . The lower graph-limit condition fails.
Equivalently, an open neighborhood of sufficiently small to keep the first coordinate of its first bundle below that of its second bundle meets the limiting graph and none of the approximating graphs. The corresponding hit-open neighborhood in the Fell topology proves failure of convergence directly. Hence
The uniform utility convergence need not preserve closed preference convergence phenomenon reflects the loss of ranking information when the limiting utility has a flat indifference region.
. The distinction is small but strict: their normalized expected utilities are and , respectively.
By the Von Neumann-Morgenstern utility theorem, use a representing utility function and apply a positive affine function to set and . This is possible because the given strict preference implies . The two specified indifference relations then give
Taking the expected utility of each lottery yields
Their difference is , establishing the stated strict preference. These numbers measure utility, not monetary reward or an assumed ordering of the subscripts.
Here is the underlying argument directly in terms of the axioms. The independence axiom for lottery preferences permits substitution of indifferent lotteries inside a common mixture. Replacing by its given mixture of , and then replacing , followed by reduction of compound lotteries, gives
and consequently
The transitive relation axiom combines the successive substitutions. Finally, mixture monotonicity says that among mixtures of a strictly better and a strictly worse outcome, the greater probability of the better outcome is strictly preferred; this follows from the independence axiom for lottery preferences and transitivity. Since and , the comparison follows. Complete lottery preferences and continuity of lottery preferences are part of the representation theorem's hypotheses; the direct substitution calculation uses the already supplied indifferences and does not need to invoke continuity of lottery preferences again.[ref]
Under the expected utility hypothesis, use positive affine uniqueness of affine preference representations to normalize the extreme outcomes to and . The stated indifference relations then give
The two lotteries have expected utilities
Hence , with normalized expected utility difference . Equivalently, substitution reduces them to lotteries with probabilities and of the better extreme outcome. The inference uses the independence axiom for lottery preferences; the three displayed outcome comparisons alone would not determine preferences over all compound lotteries without the expected utility hypothesis.
Preference relation 2026-10-14
A weak preference relation records that one alternative is at least as desirable as another. Rational preferences are complete and transitive. Their strict preference and indifference relation are the asymmetric and symmetric parts. On a consumption space, continuity is expressed by a closed set of weakly ranked pairs.
Apply the independence axiom for lottery preferences in both weak directions of the indifference relation. At the two mixtures are identical. Repeating this substitution and using transitivity lets one replace any finite collection of indifferent component lotteries, after which reduction of compound lotteries combines their outcome probabilities.
Every partial order has a total order extension. Apply Zorn's lemma to extensions ordered by inclusion: the union of a chain is a partial order. If a maximal extension leaves two elements incomparable, adjoining one comparison and taking its transitive closure of a relation creates no cycle, contradicting maximality. Quotienting a preorder by its indifference relation and lifting a total order gives a complete weak-order extension preserving its strict part.