A group that's a collection of sets

  • Thread starter Thread starter halvizo1031
  • Start date Start date
  • Tags Tags
    Group Sets
halvizo1031
Messages
77
Reaction score
0

Homework Statement


Let S be a set of things and let P be the set of subsets of S. For A,B in P, define
A*B=[(S-A)intersection B] union [A intersection (S-B)]
I'm suppose to show that (p,*) is commutative, find the identity, and given that A is a subset of S, find the inverse of A. How do i even start this?



Homework Equations





The Attempt at a Solution


I need help starting it.
 
Physics news on Phys.org
Show that A*B=B*A.

Find I \in S such that A*I=I*A=A , \quad\forall A \in P.

Find B \in S such that A*B=I.
 
did you try what i suggested in your last post? (the exact same question)

https://www.physicsforums.com/showthread.php?t=347210

it was also suggested to use the fact unions & intersections are commutative operations
 
Donaldos said:
Show that A*B=B*A.

Find I \in S such that A*I=I*A=A , \quad\forall A \in P.

Find B \in S such that A*B=I.


I'm sorry but i couldn't understand what you wrote. And by that i mean that i can't read it. Could you rewrite it please?
 
then try the follwing multiplications: A with the empty set & A with its complement
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top