Home Competitions KöMaL 2008 A451
Let U ⊂ P ( S ) \mathcal{U}\subset P(S) U ⊂ P ( S ) be an upset and let D ⊂ P ( S ) \mathcal{D}\subset P(S) D ⊂ P ( S ) be a downset on a set S S S of n n n elements, i.e. (a a a ) for every X ∈ U X\in\mathcal{U} X ∈ U we have Y ∈ U Y\in\mathcal{U} Y ∈ U for all X ⊂ Y ⊂ S X \subset Y \subset S X ⊂ Y ⊂ S ; (b b b ) for every X ∈ D X\in\mathcal{D} X ∈ D and Y ⊂ X Y \subset X Y ⊂ X , Y ∈ D Y\in\mathcal{D} Y ∈ D . Prove that ∣ U ∣ ⋅ ∣ D ∣ ≥ 2 n ⋅ ∣ U ∩ D ∣ |\mathcal{U}| \cdot |\mathcal{D}| \ge 2^n \cdot |\mathcal{U}\cap\mathcal{D}| ∣ U ∣ ⋅ ∣ D ∣ ≥ 2 n ⋅ ∣ U ∩ 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