About: Product order     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FProduct_order

In mathematics, given two preordered sets and the product order (also called the coordinatewise order or componentwise order) is a partial ordering on the Cartesian product Given two pairs and in declare that if and only if and The Cartesian product with the product order is the categorical product in the category of partially ordered sets with monotone functions. The product order generalizes to arbitrary (possibly infinitary) Cartesian products. Suppose is a set and for every is a preordered set. Then the product preorder on is defined by declaring for any and in that

AttributesValues
rdfs:label
  • 直積順序 (ja)
  • Product order (en)
rdfs:comment
  • 数学において、二つの順序集合 A と B が与えられたとき、そのデカルト積 A × B に対して、一つの半順序を以下のように導入することが出来る。 A × B 内の与えられた二つのペア (a1,b1) および (a2,b2) に対して、a1 ≤ a2 および b1 ≤ b2 が成り立つとき、そしてそのときに限り (a1,b1) ≤ (a2,b2) と定義する。 この順序は直積順序(ちょくせきじゅんじょ、英: product order)と呼ばれる。A × B 上の他の順序として、辞書式順序がある。 直積順序を伴うデカルト積は、単調函数を射とする半順序集合の圏における積である。 (ja)
  • In mathematics, given two preordered sets and the product order (also called the coordinatewise order or componentwise order) is a partial ordering on the Cartesian product Given two pairs and in declare that if and only if and The Cartesian product with the product order is the categorical product in the category of partially ordered sets with monotone functions. The product order generalizes to arbitrary (possibly infinitary) Cartesian products. Suppose is a set and for every is a preordered set. Then the product preorder on is defined by declaring for any and in that (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/N-Quadrat,_gedreht.svg
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
thumbnail
has abstract
  • In mathematics, given two preordered sets and the product order (also called the coordinatewise order or componentwise order) is a partial ordering on the Cartesian product Given two pairs and in declare that if and only if and Another possible ordering on is the lexicographical order, which is a total ordering. However the product order of two totally ordered sets is not in general total; for example, the pairs and are incomparable in the product order of the ordering with itself. The lexicographic order of totally ordered sets is a linear extension of their product order, and thus the product order is a subrelation of the lexicographic order. The Cartesian product with the product order is the categorical product in the category of partially ordered sets with monotone functions. The product order generalizes to arbitrary (possibly infinitary) Cartesian products. Suppose is a set and for every is a preordered set. Then the product preorder on is defined by declaring for any and in that if and only if for every If every is a partial order then so is the product preorder. Furthermore, given a set the product order over the Cartesian product can be identified with the inclusion ordering of subsets of The notion applies equally well to preorders. The product order is also the categorical product in a number of richer categories, including lattices and Boolean algebras. (en)
  • 数学において、二つの順序集合 A と B が与えられたとき、そのデカルト積 A × B に対して、一つの半順序を以下のように導入することが出来る。 A × B 内の与えられた二つのペア (a1,b1) および (a2,b2) に対して、a1 ≤ a2 および b1 ≤ b2 が成り立つとき、そしてそのときに限り (a1,b1) ≤ (a2,b2) と定義する。 この順序は直積順序(ちょくせきじゅんじょ、英: product order)と呼ばれる。A × B 上の他の順序として、辞書式順序がある。 直積順序を伴うデカルト積は、単調函数を射とする半順序集合の圏における積である。 (ja)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 49 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software