• mathematical field of order theory, an order isomorphism is a special kind of monotone function that constitutes a suitable notion of isomorphism for partially...
    8 KB (1,061 words) - 17:31, 22 December 2024
  • Thumbnail for Isomorphism
    an isomorphism from a structure to itself. An isomorphism between two structures is a canonical isomorphism (a canonical map that is an isomorphism) if...
    19 KB (2,735 words) - 08:39, 14 May 2025
  • Thumbnail for Partially ordered set
    {P} (\mathbb {N} )} that is order-preserving, order-reflecting, and hence an order-embedding. It is not an order-isomorphism (since it, for instance, does...
    40 KB (5,418 words) - 19:44, 28 May 2025
  • the resulting isomorphism from Z n {\displaystyle \mathbb {Z} ^{n}} to the image of φ {\displaystyle \varphi } is an order isomorphism when the image...
    24 KB (3,368 words) - 20:24, 3 February 2025
  • An order isomorphism can be characterized as a surjective order embedding. As a consequence, any order embedding f restricts to an isomorphism between...
    6 KB (817 words) - 22:01, 18 February 2025
  • same up to renaming of elements. Order isomorphisms are functions that define such a renaming. An order-isomorphism is a monotone bijective function that...
    31 KB (4,510 words) - 13:16, 14 April 2025
  • the unique (up to an order isomorphism) "initial example" of a totally ordered set with a certain property, (here, a total order A is initial for a property...
    22 KB (3,150 words) - 15:51, 11 May 2025
  • an order isomorphism is a surjective order embedding. Order-preserving. See monotone. Order-reversing. See antitone. Partial order. A partial order is...
    29 KB (4,204 words) - 03:05, 12 April 2025
  • In order theory and model theory, branches of mathematics, Cantor's isomorphism theorem states that every two countable dense unbounded linear orders are...
    25 KB (3,035 words) - 08:06, 24 April 2025
  • Galois connection (category Order theory)
    rather weak compared to an order isomorphism between the involved posets, but every Galois connection gives rise to an isomorphism of certain sub-posets,...
    34 KB (4,176 words) - 07:20, 28 May 2025
  • where ω is the smallest limit ordinal. For example, there exists an order-isomorphism between the rational numbers and other densely ordered countable sets...
    5 KB (744 words) - 13:16, 1 November 2024
  • Look up isomorphism or isomorph in Wiktionary, the free dictionary. Isomorphism or isomorph may refer to: Isomorphism, in mathematics, logic, philosophy...
    1 KB (200 words) - 19:22, 13 July 2022
  • (y ∧ z) = (x ∨ y) ∧ (x ∨ z) holds Being a Boolean algebra Being an order isomorphism. Since partial orders are antisymmetric, the only ones that are self-dual...
    4 KB (457 words) - 00:47, 21 September 2023
  • Thumbnail for Ordinal number
    ordering. That is, f(a) ≤' f(b) if and only if a ≤ b. Provided there exists an order isomorphism between two well-ordered sets, the order isomorphism...
    48 KB (6,703 words) - 04:03, 30 May 2025
  • Monotonic Pointwise order of functions Galois connection Order embedding Order isomorphism Closure operator Functions that preserve suprema/infima Dedekind completion...
    5 KB (396 words) - 23:32, 16 April 2025
  • Thumbnail for Natural number
    well-ordered set, in a sense different from cardinality: if there is an order isomorphism (more than a bijection) between two well-ordered sets, they have the...
    53 KB (5,889 words) - 21:52, 30 May 2025
  • specifically, in differential geometry—the musical isomorphism (or canonical isomorphism) is an isomorphism between the tangent bundle T M {\displaystyle \mathrm...
    20 KB (4,149 words) - 16:33, 13 May 2025
  • with partial orders. Any bijective history preserving function is an order isomorphism. Furthermore, if for a given prefix ordered set P we construct the...
    5 KB (625 words) - 10:26, 6 January 2024
  • Thumbnail for Monotonic function
    ( x ) ≤ f ( y ) ) {\displaystyle f(x)\leq f(y))} and order isomorphisms (surjective order embeddings). In the context of search algorithms monotonicity...
    19 KB (2,471 words) - 01:32, 25 January 2025
  • standard definition of isomorphisms as invertible morphisms, a lattice isomorphism is just a bijective lattice homomorphism. Similarly, a lattice endomorphism...
    38 KB (5,438 words) - 17:09, 20 May 2025
  • set" for well-ordered sets: ordinal number (equal if there is an order-isomorphism) Resizing (fiction), a theme in fiction, in particular in fairy tales...
    1 KB (247 words) - 09:47, 10 May 2022
  • First-order logic, also called predicate logic, predicate calculus, or quantificational logic, is a collection of formal systems used in mathematics,...
    92 KB (12,931 words) - 19:08, 31 May 2025
  • Thumbnail for Noncrossing partition
    denoted NC ( S ) {\displaystyle {\text{NC}}(S)} . There is an obvious order isomorphism between NC ( S 1 ) {\displaystyle {\text{NC}}(S_{1})} and NC ( S 2...
    5 KB (758 words) - 17:01, 28 August 2023
  • Thumbnail for Graph isomorphism problem
    science Can the graph isomorphism problem be solved in polynomial time? More unsolved problems in computer science The graph isomorphism problem is the computational...
    41 KB (4,223 words) - 20:58, 31 May 2025
  • Thumbnail for Subset
    Subset (redirect from Subset order)
    partial order is—up to an order isomorphism—the Cartesian product of k = | S | {\displaystyle k=|S|} (the cardinality of S) copies of the partial order on...
    11 KB (1,734 words) - 18:05, 12 March 2025
  • Thumbnail for Size
    set" for well-ordered sets: ordinal number (equal if there is an order-isomorphism) In statistics (hypothesis testing), the "size" of the test refers...
    13 KB (1,715 words) - 21:09, 29 November 2024
  • bijective correspondence. Thus, the definition of an isomorphism is quite natural. An isomorphism of groups may equivalently be defined as an invertible...
    12 KB (2,043 words) - 06:23, 21 December 2024
  • In mathematics, a well-order (or well-ordering or well-order relation) on a set S is a total ordering on S with the property that every non-empty subset...
    12 KB (1,902 words) - 19:06, 15 May 2025
  • homomorphism is an isomorphism if and only if it is bijective as a function on the underlying sets. If there exists a ring isomorphism between two rings...
    12 KB (1,641 words) - 12:34, 6 May 2025
  • is called orderable or linearly orderable if there exists a total order on its elements such that the order topology induced by that order and the given...
    15 KB (2,175 words) - 00:47, 19 May 2025