Prove that ordered sets ⟨R×R,≤lex⟩ and ⟨R×Q,≤lex⟩ are not isomorphic (≤lex means lexicographical order).
I know that to prove that ordered sets are isomorphic, I would make a monotonic bijection, but how to prove they aren't isomorphic?
Prove that ordered sets ⟨R×R,≤lex⟩ and ⟨R×Q,≤lex⟩ are not isomorphic (≤lex means lexicographical order).
I know that to prove that ordered sets are isomorphic, I would make a monotonic bijection, but how to prove they aren't isomorphic?
How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
No comments:
Post a Comment