Question

Prove that transitivity implies each of the following claims: . If a ~ b andb ~~ c, then a c. bc, then da (Harder) If a - bandb~c, then a c. In each case, first convert the strict/indifferent statement to an equivalent statement using only weak preference. Then prove the equivalent statement using our definition of transitivity, which involves only weak preference.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Solution:

First, converting strict preference into weak preference: We know if A is strictly preferred to B (A (curly)> B), this means A is at least as good as B, but B is not at least as good as A (A (curly)>= B, but B is not (curly)>= A). Similarly if a person is indifferent between A and B (A~B), in terms of weak preference we can say that A is at least as good as B and B is at least as good as A (A (curly)>= B and B (curly)>= A). Using these facts, we can write the equivalent statements for the given statements as follows:

(The proofs are also in the image)

Smila, u ( 2) If a>-6 and b~c,then a neu →aal y conradicon Per c a, Suttose not above Tris aveady pr ved unvy already have Novo, Luingransiti nty, it must be: b%a whch 、sa Contadicin, oi ore already give b a ca and a^c . Hence, poved

Add a comment
Know the answer?
Add Answer to:
Prove that transitivity implies each of the following claims: . If a ~ b andb ~~...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT