## Problem of the week

### 2022-12 A partition of the power set of a set

Consider the power set $$P([n])$$ consisting of $$2^n$$ subsets of $$[n]=\{1,\dots,n\}$$.
Find the smallest $$k$$ such that the following holds: there exists a partition $$Q_1,\dots, Q_k$$ of $$P([n])$$ so that there do not exist two distinct sets $$A,B\in P([n])$$ and $$i\in [k]$$ with $$A,B,A\cup B, A\cap B \in Q_i$$.