| dbo: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)
|
| dbo:thumbnail
| |
| dbo:wikiPageExternalLink
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 4480 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| 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)
|
| rdfs:label
|
- 直積順序 (ja)
- Product order (en)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:depiction
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:wikiPageRedirects
of | |
| is dbo:wikiPageWikiLink
of | |
| is foaf:primaryTopic
of | |
