# Is the partial order relation a total order relation [closed]

Let $T$ be the partial order relation defined on $\mathbb{N}\times \mathbb{N}$ by $(a,b)\, T\, (c,d)$ if and only if $a$ is smaller than or equal to $c$ and $b$ is smaller than or equal to $d$. Is it a total order relation?

I'm thinking it's yes but I don't know how to justify?

## closed as off-topic by Namaste, Arnaldo, Shailesh, Daniel W. Farlow, XamApr 26 '17 at 3:27

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Namaste, Arnaldo, Shailesh, Daniel W. Farlow, Xam
If this question can be reworded to fit the rules in the help center, please edit the question.

• Well, what are the factors that lead you to think yes? – Namaste Apr 25 '17 at 22:39
• There must be some reason you're thinking yes, no? If you don't have any thoughts that lead you to think yes, then it seems you simply guess. So, how about you start with adding, to your post, how T satisfies a partial order relation, as well as the criteria/definition of a total order. – Namaste Apr 25 '17 at 22:44

It is not a total order relation because you cannot compare $(1,2)$ and $(2,1)$.
This means that you cannot say $(1,2)\, T\, (2,1)$ or $(2,1)\, T \,(1,2)$.
Take out a piece of paper, and draw the first few points of $\Bbb N\times \Bbb N$ in a square, say up to $5\times 5$ or $6\times 6$. Now colour every point $(a,b)$ such that either $(a,b)T(3,3)$, or $(3,3)T(a,b)$. Can you see that some points are uncoloured, i.e. incomparable to $(3,3)$? What is the conclusion?
• So can you, for instance, compare $(4,2)$ to $(3,3)$ using $T$? – Arthur Apr 25 '17 at 22:46