# Well Ordered Set : Proof of Refelxive and Transitive under Relation

Not what you're looking for?

Trying to prove the following: A set "A" is called a well ordered set if there is a relation R on A such that R is reflexive, transitive, and for all a,b are elements of A, either aRb or bRa.

Prove that the set of the integers is a well-ordered set under the relation less than or equal to.

Would I just need to prove the less than or equal to is reflexive and transitive?

How would I do this?

##### Purchase this Solution

##### Solution Summary

A well ordered set, refelxiveness, transitiveness are investigated under a relation. The solution is detailed and well presented.

##### Solution Preview

Please see the attached file for the complete solution.

Thanks for using BrainMass.

A set "A" is called a well ordered set if there is a relation R on A such that R is reflexive, transitive, and for all a, b are elements of A, either aRb or bRa. Prove that the set of the integers is a well-ordered set under the relation less than or equal to. Would I ...

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Probability Quiz

Some questions on probability

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.