MathDB
Probabilistic sum is strictly increasing

Source: Bulgarian Winter Tournament 2024 12.3

January 28, 2024
combinatoricsprobability

Problem Statement

Let nn be a positive integer and let A\mathcal{A} be a family of non-empty subsets of {1,2,,n}\{1, 2, \ldots, n \} such that if AAA \in \mathcal{A} and AA is subset of a set B{1,2,,n}B\subseteq \{1, 2, \ldots, n\}, then BB is also in A\mathcal{A}. Show that the function f(x):=AAxA(1x)nAf(x):=\sum_{A \in \mathcal{A}} x^{|A|}(1-x)^{n-|A|} is strictly increasing for x(0,1)x \in (0,1).