Relations

S = {0, 1, 2, 4, 6} Test the binary relations on S for reflexivity, symmetry ,antisymmetry, and transitivity. Also find the reflexive, symmetric and transitive closure of each relations. A) P = {(0,0), (1,1), (2,2), (4,4), (6,6), (0,1), (1,2), (2,4), (4,6) } B) P {(0,1), (1,0), (2,4), (4,2), (4,6), (6,4)} C) P ((0,0), (1,1), (2,2), 4,4), (6,6), (4,6), (6,4)} D) P = everything not equal to 0

Relations

Test the binary relations on S for reflexivity, symmetry ,antisymmetry, and transitivity A) S = Q X p Y <-> ABS(X) <= ABS(Y) B) S = Z X p Y <-> x -y is an integral multiple of 3 C) S = N X P Y <-> X is odd D) S = Set of all squares in the place S1 p S2 <-> length of side of S1 = length of side S2 E) S = set of finite-length strings of characters X p Y <-> number of characters in x = number of characters in y

Relations

For each case, think of a set S and a binary relation p on S for - A. p is reflexive and symmetric but not transitive b. p is reflexive and transitive but not symmetric c. p is reflexive but neither symmetric nor transitive

Functions

Let P be the power set of {A, B} and let S be the set of all binary strings of length 2. A function f: P -> S is defined as follows: For A in P, f(A) has a 1 in the high-order bit position (left end of string) if and only if a is in A. f(A) has a 1 in the low-order bit position (right end of string) if and only if b is in A. Is f one-to-one? Prove or disprove. Is f onto? Prove or disprove.

Functions

Let P be the power set of {a,b,c}. A function: f: P -> Z follows: For A in P, f(A) = the number of elements in A. Is f one-to-one? Prove or disprove. Is f onto? Prove or disprove.