最終更新日：2024/07/31
(set theory) A diagram which represents a finite poset, in which nodes are elements of the poset and arrows represent the order relation between elements. Transitivity of the order relation is tacit, in other words, if x<y and y<z then no arrow is drawn from x to z, but if there is no distinct z between x and y (such that x<z<y) then an arrow is draw from x to y.
正解を見る
Hasse diagram
編集履歴（0）
元となった辞書の項目
Hasse diagram
noun
(set
theory)
A
diagram
which
represents
a
finite
poset,
in
which
nodes
are
elements
of
the
poset
and
arrows
represent
the
order
relation
between
elements.
Transitivity
of
the
order
relation
is
tacit,
in
other
words,
if
x<y
and
y<z
then
no
arrow
is
drawn
from
x
to
z,
but
if
there
is
no
distinct
z
between
x
and
y
(such
that
x<z<y)
then
an
arrow
is
draw
from
x
to
y.
意味（1）
(set
theory)
A
diagram
which
represents
a
finite
poset,
in
which
nodes
are
elements
of
the
poset
and
arrows
represent
the
order
relation
between
elements.
Transitivity
of
the
order
relation
is
tacit,
in
other
words,
if
x<y
and
y<z
then
no
arrow
is
drawn
from
x
to
z,
but
if
there
is
no
distinct
z
between
x
and
y
(such
that
x<z<y)
then
an
arrow
is
draw
from
x
to
y.
