Suppose we have a town with a set of residents $V$, where $|V| = n$. The residents like forming clubs, and we have clubs $C_1,C_2,\ldots,C_m \subseteq V$. We are interested in the maximum number of clubs $m$ that can be formed. There are some rules regarding clubs:
- No two clubs are identical: all clubs are distinct.
- A club must have an even number of members. $\forall i, |C_i|$ is even.
- Any pair of two clubs shares an even number of members: $\forall i \neq j, |C_i \cap C_j|$ is even.
It follows from rule 1 that $m \leq 2^n$, as the set of all possible clubs is simply the power set of $V$.
Then it follows from rule 2 that $m \leq 2^{n-1}$, as the rule eliminates all odd subsets of $P(V)$. We note as a lemma that for a finite set $A$, exactly half the subsets of $P(A)$ are of odd cardinality. (Proof.)
Finally, the third rule further narrows down the bound: it implies that $m \geq 2^{\lfloor \frac{n}{2} \rfloor}$. However, I don't really understand the reasoning behind this. Can anyone explain the intuition or how to prove it?