Dilworth's Theorem for Totally Ordered Sets

55 Views Asked by At

Dilworth's Theorem, states that in a poset the size of the largest antichain is the same size as the smallest chain decomposition. If I am understanding this correctly then, In a totally ordered set, there are no antichains. So the biggest antichain would be of size $0$ and therefore, the smallest chain decomposition would be of size $0$. This seems like a contradictory conclusion to me, so is there some sort of exceptions for posets with no antichains?