Instituto Tecnolgico Autnomo de Mxico Maestra en Teora Econmica / Licenciatura en Economa Consumer and Producer Theory Problem set

1, Fall 2013 Ricard Torres

1. By considering all possible values (true, false) for each single statement ( , ), prove that the following statements are equivalent: (i) = (ii) ( ) (iii) () = ( ) (iv) ()
( )

2. By considering all possible values (true, false) for each single statement ( , , ), prove the following distributive laws for propositional logic: ( ) is equivalent to ( ) ( ) ( ) is equivalent to ( ) ( ) 3. Let all of the following sets be subsets of a given nonempty set . Recall that means , and that = is equivalent to ( ) ( ). Using this, prove each of the following statements: (i) (ii) is equivalent to = (iii) is equivalent to = (iv) = ( ) ( ) ( ) (v) For any nonempty index set , (vi) For any nonempty index set ,
( (

) )

= =

( (

(vii) For any nonempty index set , (viii) For any nonempty index set ,

( (

=
)

) )

4. Let and be nonempty sets, and : a function. Prove or disprove (via a counterexample) each of the following statements; in case the statement is not true, suggest an alternative one that implies subsituting just one symbol for it to become true. (i) , , implies ( ) ( ). (ii) , , ( ) = ( ) ( ). (iii) , , ( ) = ( ) ( ). (iv) , , ( ) = ( ) ( ). (v) , , implies 1 ( ) 1 ( ). (vi) , , 1 ( ) = 1 ( ) 1 ( ). (vii) , , 1 ( ) = 1 ( ) 1 ( ). (viii) , , 1 ( ) = 1 ( ) 1 ( ). 5. In the following cases, we give a set and describe a binary relation defined on it. For each case, find out which of the following properties the relation satisfies: reflexivity, irreflexivity, symmetry, asymmetry, transitivity, negative transitivity, completeness, connectivity. (i) = N = {1, 2, 3, . . .}, the set of natural numbers. is defined by: if + 2 , where is the usual weak order of the natural numbers. (ii) = N, the set of natural numbers. is defined by: if is divisible by (ie, equals times another integer). (iii) = N, the set of natural numbers. is defined by: if either = = 1, or if and share a common divisor strictly larger than 1. (iv) = 2N , the set of all subsets of the natural numbers. is defined by if . (v) = R2 , the set of all 2-dimensional vectors of real numbers. is defined by (1 , 2 )(1 , 2 ) if 1 + 2 < 1 + 2 , where < is the usual strict order of the real numbers. (vi) = R2 , the set of all 2-dimensional vectors of real numbers. is defined by (1 , 2 )(1 , 2 ) if 1 + 2 1 + 2 , where is the usual weak order of the real numbers. (vii) Let = {, , , , }, and let be the set of 5-dimensional vectors the elements of which are distinct elements of , ie, is the set of all permutations of the elements of . On define the binary relation by (1 , 2 , . . . , 5 )(1 , 2 , . . . , 5 ) if 1 = 1 . We can interpret the elements of as rankings of the alternatives in , and the relation as meaning that the top elements are the same. 6. Let be a nonempty set of alternatives, and let be a binary relation on that is reflexive and transitive. Define a new binary relation by iff and ( ). Prove that the new relation is asymmetric and transitive. Provide a counterexample to show that need not be negatively transitive.