请输入您要查询的字词:

 

单词 BoundedComplete
释义

bounded complete


Let P be a poset. Recall that a subset S of P is called bounded from above if there is an element aP such that, for every sS, sa.

A poset P is said to be bounded complete if every subset which is bounded from above has a supremumMathworldPlanetmathPlanetmath.

Remark. Since it is not required that the subset be non-empty, we see that P has a bottom. This is because the empty setMathworldPlanetmath is vacuously bounded from above, and therefore has a supremum. However, this supremum is less than or equal to every member of P, and hence it is the least element of P.

Clearly, any complete latticeMathworldPlanetmath is bounded complete. An example of a non-complete bounded complete poset is any closed subset of of the form [a,), where a. In additionPlanetmathPlanetmath, arbitrary products of bounded complete posets is also bounded complete.

It can be shown that a poset is a bounded complete dcpo iff it is a complete semilattice.

Remark. A weaker concept is that of Dedekind completeness: A poset P is Dedekind complete if every non-empty subset bounded from above has a supremum. An obvious example is , which is Dedekind complete but not bounded complete (as it has no bottom). Dedekind completeness is more commonly known as the least upper bound property.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 6:54:13