PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] example of antisymmetric (Example)

The axioms of a partial ordering demonstrate that every partial ordering is antisymmetric. That is: the relation $ \leq $ on a set $ S$ forces

$ a\leq b$ and $ b\leq a$ implies $ a=b$
for every $ a,b\in S$.

For a concrete example consider the natural numbers $ \mathbb{N}=\{0,1,2,\dots\}$ (as defined by the Peano postulates). Take the relation set to be:

$\displaystyle R=\{(a,a+n):a,n\in \mathbb{N}\}\subset \mathbb{N}\times \mathbb{N}.$
Then we denote $ a\leq b$ if $ (a,b)\in R$. That is, $ 5\leq 7$ because $ (5,7)=(5,5+2)$ and both $ 5,2\in\mathbb{N}$.

We can prove this relation is antisymmetric as follows: Suppose $ a\leq b$ and $ b\leq a$ for some $ a,b\in\mathbb{N}$. Then there exist $ n,m\in\mathbb{N}$ such that $ a+n=b$ and $ b+m=a$. Therefore

$\displaystyle b=a+n=b+m+n$
so by the cancellation property of the natural numbers, $ 0=m+n$. But by the first piano postulate, 0 has no predecessor, meaning $ 0\neq m+n$ unless $ m=n=0$.



"example of antisymmetric" is owned by Algeboy.
(view preamble)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: postulate, property, relation set, natural numbers, implies, forces, relation, antisymmetric, partial ordering, axioms
There is 1 reference to this entry.

This is version 5 of example of antisymmetric, born on 2006-06-15, modified 2006-06-15.
Object id is 8044, canonical name is ExampleOfAntisymmetric.
Accessed 1493 times total.

Classification:
AMS MSC03E20 (Mathematical logic and foundations :: Set theory :: Other classical set theory )

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)