Ordering

Let \(S\) denote the set containing all the natural numbers that are not divisible by \( 2 \).

And define the binary relation \ge on two natural number m,n m , n , mn m \ge n if m=kn m = k n , for integer k, meaning that n n divides m m .

How to show that (S{0},)(S\cup\{0\},\ge) is order-isomorphic to (S,)(S,\ge) ?

#Algebra

Note by A Former Brilliant Member
4 years, 8 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

It is just for mistake, thanks for the reminder.

A Former Brilliant Member - 4 years, 8 months ago

Log in to reply

I edited your post a bit using standard notation for a set and a poset. Can you check and tell me if this is what you wanted to mean? Thanks.

Prasun Biswas - 4 years, 8 months ago

Yes, absolutely.

A Former Brilliant Member - 4 years, 8 months ago

In that case, you can't prove it because they are not order-isomorphic.

Proof. Suppose that they are order-isomorphic. Then, there exists a bijection f ⁣:S{0}Sf\colon S\cup\{0\}\to S such that xy    f(x)f(y)  x,yS{0}x\geq y\iff f(x)\geq f(y)~\forall~x,y\in S\cup\{0\}.

Now, since 00 is divisible by every integer (since 0=0×a0=0\times a for all integers aa), we have 0a  aS{0}0\geq a~\forall~a\in S\cup\{0\}. So, we have f(0)f(a)  aS{0}f(0)\geq f(a)~\forall~a\in S\cup\{0\}, i.e., f(0)k  kIm(f)=Sf(0)\geq k~\forall~k\in\textrm{Im}(f)=S.

Since f(0)Sf(0)\in S, this means that there must exist some element in SS (which would be f(0)f(0)) which is divisible by every element in SS. Since 0Dom(f)0\in\textrm{Dom}(f), we know that f(0)f(0) exists, say f(0)=mf(0)=m.

Now, since f(0)=mSf(0)=m\in S, by definition of SS, we get that m+2Sm+2\in S but note that mm is not divisible by m+2m+2 (obvious), i.e., m=f(0)≱m+2m=f(0)\not\geq m+2 which is a contradiction.

Hence, our assumption is wrong and ff doesn't exist.

Hence, we conclude that (S{0},)(S\cup\{0\},\geq) is not order-isomorphic to (S,)(S,\geq)


An informal argument that one could use to show the same fact is that an order-isomorphism preserves maximum properties and since 0 is a maximum for (S{0},)(S\cup\{0\},\geq) whereas there is no maximum element in (S,)(S,\geq), they cannot be order-isomorphic.

In fact, there's a more general theorem which gives some sufficient conditions for two posets to not be order-isomorphic. You can check it out here.

Prasun Biswas - 4 years, 8 months ago
×

Problem Loading...

Note Loading...

Set Loading...