Comum · Saberes
Order type
Two ordered sets X,Y are said to have the same order type just when they are order isomorphic, that is, when there exists a bijection f: X → Y such that both f and its inverse are strictly increasing
In mathematics, especially in set theory and order theory, two ordered sets X and Y are said to have the same order type if they are order isomorphic, that is, if there exists a bijection (each element pairs with exactly one in the other set) f : X → Y {\displaystyle f\colon X\to Y} such that both f and its inverse are monotonic (preserving orders of elements). In the special case when X is totally ordered, monotonicity of f already implies monotonicity of its inverse.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
In mathematics, especially in set theory and order theory, two ordered sets X and Y are said to have the same order type if they are order isomorphic, that is, if there exists a bijection (each element pairs with exactly one in the other set) f : X → Y {\displaystyle f\colon X\to Y} such that both f and its inverse are monotonic (preserving orders of elements). In the special case when X is totally ordered, monotonicity of f already implies monotonicity of its inverse. One and the same set may be equipped with different orders. Since order-equivalence is an equivalence relation, it partitions the class of all ordered sets into equivalence classes.
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
C★★
Conjunto bem-ordenado
-
c★
conjunto totalmente ordenado
Conjunto equipado com uma ordem total
-
★
Cotas superior e inferior
Todo elemento de um conjunto parcialmente ordenado A que é maior (menor, respectivamente) do que cada elemento de um subconjunto B incluído em A
-
★★★
Relação binária
Noção na matemática
-
★★
Teoria dos tipos
-
T★★
Teoria axiomática
Set of formula that can be deduced from axioms in some given logic