Namespaces
Variants
Actions

Similar sets

From Encyclopedia of Mathematics
Revision as of 18:37, 6 October 2016 by Richard Pinch (talk | contribs) (Tex done)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

A generalization of the elementary geometrical concept of a similarity. Two sets $A$ and $B$ that are totally ordered by relations $R$ and $S$ respectively are said to be similar if there exists a bijection $f : A \rightarrow B$ such that for any $x,y \in A$ it follows from $x\, R\, y$ that $f(x)\, S\, f(y)$.


Comments

An equivalence class of totally ordered sets under the relation of similarity is often called an order type.

How to Cite This Entry:
Similar sets. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Similar_sets&oldid=39364
This article was adapted from an original article by M.I. Voitsekhovskii (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article