# Partial orders and antichains

Task: Let $$(P, ⩽_{1} ), (P, ⩽_{2} )$$ be such partial orders on one set (nonempty) that the size of the maximum antichain in the first is $$k_{1}$$ , in the second is $$k_{2}$$ . Is it true that the size of the maximum antichain at the intersection of these orders does not exceed $$(k_{1} + 1)(k_{2} + 1)$$?

My thoughts: Well, we know that each partial order is defined on some one set, in which a certain number of elements. It turns out that these orders will consist of the same elements, but their partial order relations are different. Therefore, at the intersection of these orders, we will get a new order in which the number of elements is the same as that of the original orders, but in this order it turns out that two partial order relations are fulfilled at once? (is it possible?) Then it turns out that at the intersection of two orders, the antichain that was in the first order, it will remain an antichain at the intersection of these orders, the same is true for antichains inside the second order. I don't understand how to get $$(k_{1} + 1)* (k_{2} + 1)$$? Only intuition suggests that the size of the antichain obtained at the intersection can be no more than $$(k_{1} + k_{2})$$.

• Let $P = \{0,1,2,3,4 \}$, $\le_1$ the usual order on $P$, $\le_2$ the reverse order, i.e. $4 \le_2 3 \le_2 2 \le_2 1 \le_2 0$. Since both are linear orders, it is $k_1 = k_2 = 1$. The intersection $\le_3$ of $\le_1$ and $\le_2$ is the trivial order, i.e., $x \le_3 y$ only if $x = y$. Hence $P$ is an antichain with respect to $\le_3$ with $(k_1 +1) * (k_2+1) < 5$ elements.