olymmath

KöMaL 2008 A451

    Let U⊂P(S)\mathcal{U}\subset P(S) be an upset and let D⊂P(S)\mathcal{D}\subset P(S) be a downset on a set SS of nn elements, i.e. (aa) for every X∈UX\in\mathcal{U} we have Y∈UY\in\mathcal{U} for all X⊂Y⊂SX \subset Y \subset S; (bb) for every X∈DX\in\mathcal{D} and Y⊂XY \subset X, Y∈DY\in\mathcal{D} . Prove that ∣U∣⋅∣D∣≥2n⋅∣U∩D∣|\mathcal{U}| \cdot |\mathcal{D}| \ge 2^n \cdot |\mathcal{U}\cap\mathcal{D}|.

    Official text KöMaL. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator hu-komal/2008/a451 · Tag WJR7SMC8XV · Edit this page on GitHub · Keys: j next, k previous