Thread: A cloak covered with patches

1. A cloak covered with patches

Hi. Could you help me solve this problem. I've tried using inclusion–exclusion principle but it didn't work.

There is a cloak which area equals 1. It is completely covered with 5 patches, whose area is at least 0,5. Show that the area of the intersection of certain two patces is at least 0,2. ( Hint: It's not as easy as you think)

2. Re: A cloak covered with patches

Hey wilhelm.

Can you relate the intersection of the two patches with Kolmgorovs axiom (i.e P(A OR B) = P(A) + P(B) - P(A and B)) where if A is patched part and B is the cloak the A is a subset of B which implies that P(A and B) = P(A)?

3. Re: A cloak covered with patches

I've tried using the probability axioms, but it seems hopeless. There are five patches A, B, C, D, E. We have $1=P(A _{1} \cup A _{2} \cup A_3 \cup A_4 \cup A_5) =$ $\sum_{I=1}^{5} P(A_i) - \sum_{1 \le i $\sum_{1 \le i Could you please give me a hint on how to estimate these values? I know the sum must equal one because the patches cover the whole cloak

4. Re: A cloak covered with patches

One suggestion I have is if two things involve subset relations (i.e A is a subset of B) then P(A) <= P(B).

This gives you inequalities to use for the three, four, and five intersection terms amongst others and can put bounds on all subsets.

Recall that the intersection of two events in a subset of the union of those two events.