Added to Favorites

Related Searches

Definitions

Nearby Words

In mathematics, two elements x and y of a set partially ordered by a relation ≤ are said to be comparable if and only if x ≤ y or y ≤ x, or in terms of the strict version of the partial order, if and only if x < y or y < x or y = x.
For example, two sets are comparable with respect to inclusion if and only if one is a subset of the other.

In a classification of mathematical objects such as topological spaces, two criteria are said to be comparable when the objects that obey one criterion constitute a subset (or subclass) of the objects that obey the other one (so the T_{1} and T_{2} axioms are comparable, while the T_{1} axiom and the sobriety axiom are not).

See also comparison.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Friday August 15, 2008 at 00:59:12 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Friday August 15, 2008 at 00:59:12 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2015 Dictionary.com, LLC. All rights reserved.