翻訳と辞書 |
Order-embedding : ウィキペディア英語版 | Order-embedding In mathematical order theory, an order-embedding is a special kind of monotone function, which provides a way to include one partially ordered set into another. Like Galois connections, order-embeddings constitute a notion which is strictly weaker than the concept of an order isomorphism. Both of these weakenings may be understood in terms of category theory. == Formal definition == Formally, given two partially ordered sets (''S'', ≤) and (''T'', ≤), a function ''f'': ''S'' → ''T'' is an ''order-embedding'' if ''f'' is both order-preserving and order-reflecting, i.e. for all ''x'' and ''y'' in ''S'', one has : 〔.〕 Note that such a function is necessarily injective, since ''f''(''x'') = ''f''(''y'') implies ''x'' ≤ ''y'' and ''y'' ≤ ''x''.〔 If an order-embedding between two posets ''S'' and ''T'' exists, one says that ''S'' can be embedded into ''T''.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Order-embedding」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|