Additive functions, unions, and intersections.

  • Thread starter Thread starter reb659
  • Start date Start date
  • Tags Tags
    Functions
reb659
Messages
64
Reaction score
0

Homework Statement



A function G:P--->R where R is the set of real numbers is additive provided
G(X1 U X2)=G(X1)+G(X2) if X1, X2 are disjoint.

Let S be a set, Let P be the power set of S. Suppose G is an additive function mapping P to R. Prove that if X1 and X2 are ARBITRARY(not necessarily disjoint subsets of W), then
G(X1 U X2)=G(X1)+G(X2)-G(X1 I X2)

Homework Equations


The Attempt at a Solution


The only way I know how to do this is using an element chasing proof. But if I let an element c be in the right hand side I can't go anywhere because the sets are not necessarily disjoint.
 
Last edited:
Physics news on Phys.org
Try using
X1\cup X2=X1\setminus X2+X2\setminus X1+X1\cap X2
X1=X1\setminus X2+X1\cap X2
and similar for X2. Draw it, play with the equations using additivity of f. I used "+" for disjoint unions.
 
I am such an idiot. I tried it before representing the left hand side as a union of disjoint sets but for some reason I didn't bother manipulating the right hand side in the same way.

Thanks a ton!
 
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