Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2011 / Problems / Day 1, P4

IMC 2011 · Day 1 · P4

Let A1,A2,…,AnA_1, A_2, \dots, A_n be finite, nonempty sets. Define the function f(t)=∑k=1n∑1≤i1<i2<⋯<ik≤n(−1)k−1t∣Ai1∪Ai2∪⋯∪Aik∣.f(t) = \sum_{k=1}^{n} \sum_{1 \le i_1 < i_2 < \dots < i_k \le n} (-1)^{k-1} t^{|A_{i_1} \cup A_{i_2} \cup \dots \cup A_{i_k}|}. Prove that ff is nondecreasing on [0,1][0, 1].

(∣A∣|A| denotes the number of elements in AA.)

(Levon Nurbekyan and Vardan Voskanyan, Yerevan)

Solution (official)

Let Ω=⋃i=1nAi\Omega = \bigcup\limits_{i=1}^{n} A_i. Consider a random subset XX of Ω\Omega which chosen in the following way: for each x∈Ωx \in \Omega, choose the element xx for the set XX with probability tt, independently from the other elements.

Then for any set C⊂ΩC \subset \Omega, we have P(C⊂X)=t∣C∣.P(C \subset X) = t^{|C|}. By the inclusion-exclusion principle, P((A1⊂X) or (A2⊂X) or … or (An⊂X))==∑k=1n∑1≤i1<i2<⋯<ik≤n(−1)k−1P(Ai1∪Ai2∪⋯∪Aik⊂X)==∑k=1n∑1≤i1<i2<⋯<ik≤n(−1)k−1t∣Ai1∪Ai2∪⋯∪Aik∣.\begin{align*} P \bigl( (A_1 \subset X) \text{ or } (A_2 \subset X) \text{ or } \dots \text{ or } (A_n \subset X) \bigr) &= \\ = \sum_{k=1}^{n} \sum_{1 \le i_1 < i_2 < \dots < i_k \le n} (-1)^{k-1} P \bigl( A_{i_1} \cup A_{i_2} \cup \dots \cup A_{i_k} \subset X \bigr) &= \\ = \sum_{k=1}^{n} \sum_{1 \le i_1 < i_2 < \dots < i_k \le n} (-1)^{k-1} t^{|A_{i_1} \cup A_{i_2} \cup \dots \cup A_{i_k}|}. & \end{align*} The probability P((A1⊂X) or … or (An⊂X))P \bigl( (A_1 \subset X) \text{ or } \dots \text{ or } (A_n \subset X) \bigr) is a nondecreasing function of the probability tt.

Similar problems

IMC 2024 · Day 2 · P6easyavg 8.2/10 · solved 77% · near-0 11% · disc 0.35