Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Ordinal utility
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Necessary conditions for existence of ordinal utility function == Some conditions on <math>\preceq</math> are necessary to guarantee the existence of a representing function: * [[Transitive relation|Transitivity]]: if <math>A \preceq B</math> and <math>B \preceq C</math> then <math>A \preceq C</math>. * Completeness: for all bundles <math>A,B\in X</math>: either <math>A\preceq B</math> or <math>B\preceq A</math> or both. ** Completeness also implies reflexivity: for every <math>A\in X</math>: <math>A \preceq A</math>. When these conditions are met and the set <math>X</math> is finite, it is easy to create a function <math>u</math> which represents <math>\prec</math> by just assigning an appropriate number to each element of <math>X</math>, as exemplified in the opening paragraph. The same is true when X is [[countably infinite]]. Moreover, it is possible to inductively construct a representing utility function whose values are in the range <math>(-1,1)</math>.<ref name=Rubinstein>Ariel Rubinstein, Lecture Notes in Microeconomic Theory, [http://press.princeton.edu/rubinstein/lecture2.pdf Lecture 2 β Utility]</ref> When <math>X</math> is infinite, these conditions are insufficient. For example, [[lexicographic preferences]] are transitive and complete, but they cannot be represented by any utility function.<ref name=Rubinstein/> The additional condition required is [[#Continuity|continuity]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)