最終更新日:2024/08/02
(mathematics) A partially ordered set that either has a join (a least upper bound) for any nonempty finite subset (a join-semilattice or upper semilattice) or has a meet (or greatest lower bound) for any nonempty finite subset (a meet-semilattice or lower semilattice). Equivalently, an underlying set which has a binary operation which is associative, commutative, and idempotent.
正解を見る
semilattice
編集履歴(0)
元となった辞書の項目
semilattice
noun
(mathematics)
A
partially
ordered
set
that
either
has
a
join
(a
least
upper
bound)
for
any
nonempty
finite
subset
(a
join-semilattice
or
upper
semilattice)
or
has
a
meet
(or
greatest
lower
bound)
for
any
nonempty
finite
subset
(a
meet-semilattice
or
lower
semilattice).
Equivalently,
an
underlying
set
which
has
a
binary
operation
which
is
associative,
commutative,
and
idempotent.
意味(1)
(mathematics)
A
partially
ordered
set
that
either
has
a
join
(a
least
upper
bound)
for
any
nonempty
finite
subset
(a
join-semilattice
or
upper
semilattice)
or
has
a
meet
(or
greatest
lower
bound)
for
any
nonempty
finite
subset
(a
meet-semilattice
or
lower
semilattice).
Equivalently,
an
underlying
set
which
has
a
binary
operation
which
is
associative,
commutative,
and
idempotent.