Discrete math: Suppose C is a collection of relations S on a set A, and let T be...

[yorkstudent]

Hi, I am a junior in college i am having a hard time visualizing the concept here. I have tried to go over what each term means; reflective, transitive, and so one but it gets confusing to me


Suppose C is a collection of relations S on a set A, and let T be the intersection of the relations S in C, that is, T = ^{S | S in C}. Answer the questions below.

If every S is symmetric, then T is ? If every S is transitive, then T is ? If every S is reflexive, then T is ? If every S is anti-symmetric, then T is ?

1. None of these 2. transitive 3. anti-symmetric 4. symmetric 5. reflexive