• 沒有找到結果。

# Discrete Mathematics

N/A
N/A
Protected

Share "Discrete Mathematics"

Copied!
26
0
0

(1)

### Discrete Mathematics

WEN-CHING LIEN Department of Mathematics National Cheng Kung University

2008

(2)

### 7.3: Partial orders: Hasse Diagrams

Example (7.35)

Define R on A= {1,2,3,4}by xRy if x|y−that is (exactly) divides y.

Then R = {(1,1), (2,2), (3,3), (4,4), (1,2), (1,3), (1,4), (2,4)}

is a partial order, and(A,R)is a poset.

(3)

### 7.3: Partial orders: Hasse Diagrams

Example (7.35)

Define R on A= {1,2,3,4}by xRy if x|y−that is (exactly) divides y.

Then R = {(1,1), (2,2), (3,3), (4,4), (1,2), (1,3), (1,4), (2,4)}

is a partial order, and(A,R)is a poset.

(4)

### 7.3: Partial orders: Hasse Diagrams

Example (7.37)

Consider the digraph for the partial order in Example 7.35.Fig.

7.17(a) is the graphical representation of R.In part (b) of the figure, we have a somewhat simpler diagram, which is called the Hasse diagram for R.

When we know that a relation R is a partial order on a set A, we can eliminate the loops at the vertices of its digraph .Since R is also transitive , having the edges(1,2)and(2,4)is enough to insure the existence of edge(1,4), so we need not include that edges.In this way we obtain the diagram in Fig. 7.17(b), where we have not lost the directions on the edges- the directions are assumed to go from the bottom to the top.

(5)

### 7.3: Partial orders: Hasse Diagrams

Example (7.37)

Consider the digraph for the partial order in Example 7.35.Fig.

7.17(a) is the graphical representation of R.In part (b) of the figure, we have a somewhat simpler diagram, which is called the Hasse diagram for R.

When we know that a relation R is a partial order on a set A, we can eliminate the loops at the vertices of its digraph .Since R is also transitive , having the edges(1,2)and(2,4)is enough to insure the existence of edge(1,4), so we need not include that edges.In this way we obtain the diagram in Fig. 7.17(b), where we have not lost the directions on the edges- the directions are assumed to go from the bottom to the top.

(6)

### 7.3: Partial orders: Hasse Diagrams

Example (7.37)

Consider the digraph for the partial order in Example 7.35.Fig.

7.17(a) is the graphical representation of R.In part (b) of the figure, we have a somewhat simpler diagram, which is called the Hasse diagram for R.

When we know that a relation R is a partial order on a set A, we can eliminate the loops at the vertices of its digraph .Since R is also transitive , having the edges(1,2)and(2,4)is enough to insure the existence of edge(1,4), so we need not include that edges.In this way we obtain the diagram in Fig. 7.17(b), where we have not lost the directions on the edges- the directions are assumed to go from the bottom to the top.

(7)

### 7.3: Partial orders: Hasse Diagrams

Example (7.37)

Consider the digraph for the partial order in Example 7.35.Fig.

7.17(a) is the graphical representation of R.In part (b) of the figure, we have a somewhat simpler diagram, which is called the Hasse diagram for R.

When we know that a relation R is a partial order on a set A, we can eliminate the loops at the vertices of its digraph .Since R is also transitive , having the edges(1,2)and(2,4)is enough to insure the existence of edge(1,4), so we need not include that edges.In this way we obtain the diagram in Fig. 7.17(b), where we have not lost the directions on the edges- the directions are assumed to go from the bottom to the top.

(8)

### 7.3: Partial orders: Hasse Diagrams

Example (7.37)

Consider the digraph for the partial order in Example 7.35.Fig.

7.17(a) is the graphical representation of R.In part (b) of the figure, we have a somewhat simpler diagram, which is called the Hasse diagram for R.

When we know that a relation R is a partial order on a set A, we can eliminate the loops at the vertices of its digraph .Since R is also transitive , having the edges(1,2)and(2,4)is enough to insure the existence of edge(1,4), so we need not include that edges.In this way we obtain the diagram in Fig. 7.17(b), where we have not lost the directions on the edges- the directions are assumed to go from the bottom to the top.

(9)

Rule:

In general, if R is a partial order on a finite set A, we construct a Hasse diagram for R on A by drawing a line segment from x up to y,if x,yA with xRy and, most important, if there is no other element zA such that xRz and zRy.( So there is nothing ”in between” x and y.) If we adopt the convention of reading the diagram from bottom to top, then it is not necessary to direct any edges.

(10)

Rule:

In general, if R is a partial order on a finite set A, we construct a Hasse diagram for R on A by drawing a line segment from x up to y, if x,yA with xRy and, most important, if there is no other element zA such that xRz and zRy.( So there is nothing ”in between” x and y.) If we adopt the convention of reading the diagram from bottom to top, then it is not necessary to direct any edges.

(11)

Rule:

In general, if R is a partial order on a finite set A, we construct a Hasse diagram for R on A by drawing a line segment from x up to y, if x,yA with xRy and, most important, if there is no other element zA such that xRz and zRy.( So there is nothing ”in between” x and y.) If we adopt the convention of reading the diagram from bottom to top, then it is not necessary to direct any edges.

(12)

The pair(A,R)is called a partially ordered set, or poset, if relation R on A is a partial order, or a partial ordering relation.

Definition (7.16)

If(A,R)is a poset, we say that A is totally ordered (or, linearly ordered) if for all x,yA either xRy or yRx.

In this case R is called a total order (or, a linear order).

(13)

The pair(A,R)is called a partially ordered set, or poset, if relation R on A is a partial order, or a partial ordering relation.

Definition (7.16)

If(A,R)is a poset, we say that A is totally ordered (or, linearly ordered) if for all x,yA either xRy or yRx.

In this case R is called a total order (or, a linear order).

(14)

The pair(A,R)is called a partially ordered set, or poset, if relation R on A is a partial order, or a partial ordering relation.

Definition (7.16)

If(A,R)is a poset, we say that A is totally ordered (or, linearly ordered) if for all x,yA either xRy or yRx.

In this case R is called a total order (or, a linear order).

(15)

Definition (7.17)

If(A,R)is a poset, then an element xA is called a maximal element of A if for all aA,a6=xx/Ra.

An element yA is called a minimal element of A if whenever bA,b6=yb/Ry.

Definition (7.18)

If(A,R)is a poset, then an element xA is called a least element if xRa for all aA.

Element yA is called a greatest element if aRy for all aA.

(16)

Definition (7.17)

If(A,R)is a poset, then an element xA is called a maximal element of A if for all aA,a6=xx/Ra.

An element yA is called a minimal element of A if whenever bA,b6=yb/Ry.

Definition (7.18)

If(A,R)is a poset, then an element xA is called a least element if xRa for all aA.

Element yA is called a greatest element if aRy for all aA.

(17)

Definition (7.17)

If(A,R)is a poset, then an element xA is called a maximal element of A if for all aA,a6=xx/Ra.

An element yA is called a minimal element of A if whenever bA,b6=yb/Ry.

Definition (7.18)

If(A,R)is a poset, then an element xA is called a least element if xRa for all aA.

Element yA is called a greatest element if aRy for all aA.

(18)

Definition (7.17)

If(A,R)is a poset, then an element xA is called a maximal element of A if for all aA,a6=xx/Ra.

An element yA is called a minimal element of A if whenever bA,b6=yb/Ry.

Definition (7.18)

If(A,R)is a poset, then an element xA is called a least element if xRa for all aA.

Element yA is called a greatest element if aRy for all aA.

(19)

Theorem (7.4)

If the poset(A,R)has a greatest(least) element, then that element is unique.

Definition (7.19)

Let(A,R)be a poset with BA.An element xA is called a lower bound of B if xRb for all bB.Likewise, an element yA is called an upper bound of B if bRy for all bB.

An element xA is called a greatest lower bound (glb) of B if it is a lower bound of B and if for all other lower bounds x′′of B we have x′′Rx.Similarly, yA is a least upper bound (lub) of B if it is an upper bound of B and if yRy′′for all other upper bounds y′′of B.

(20)

Theorem (7.4)

If the poset(A,R)has a greatest(least) element, then that element is unique.

Definition (7.19)

Let(A,R)be a poset with BA.An element xA is called a lower bound of B if xRb for all bB.Likewise, an element yA is called an upper bound of B if bRy for all bB.

An element xA is called a greatest lower bound (glb) of B if it is a lower bound of B and if for all other lower bounds x′′of B we have x′′Rx.Similarly, yA is a least upper bound (lub) of B if it is an upper bound of B and if yRy′′for all other upper bounds y′′of B.

(21)

Theorem (7.4)

If the poset(A,R)has a greatest(least) element, then that element is unique.

Definition (7.19)

Let(A,R)be a poset with BA.An element xA is called a lower bound of B if xRb for all bB.Likewise, an element yA is called an upper bound of B if bRy for all bB.

An element xA is called a greatest lower bound (glb) of B if it is a lower bound of B and if for all other lower bounds x′′of B we have x′′Rx.Similarly, yA is a least upper bound (lub) of B if it is an upper bound of B and if yRy′′for all other upper bounds y′′of B.

(22)

Theorem (7.4)

If the poset(A,R)has a greatest(least) element, then that element is unique.

Definition (7.19)

Let(A,R)be a poset with BA.An element xA is called a lower bound of B if xRb for all bB.Likewise, an element yA is called an upper bound of B if bRy for all bB.

An element xA is called a greatest lower bound (glb) of B if it is a lower bound of B and if for all other lower bounds x′′of B we have x′′Rx.Similarly, yA is a least upper bound (lub) of B if it is an upper bound of B and if yRy′′for all other upper bounds y′′of B.

(23)

Theorem (7.4)

If the poset(A,R)has a greatest(least) element, then that element is unique.

Definition (7.19)

Let(A,R)be a poset with BA.An element xA is called a lower bound of B if xRb for all bB.Likewise, an element yA is called an upper bound of B if bRy for all bB.

An element xA is called a greatest lower bound (glb) of B if it is a lower bound of B and if for all other lower bounds x′′of B we have x′′Rx.Similarly, yA is a least upper bound (lub) of B if it is an upper bound of B and if yRy′′for all other upper bounds y′′of B.

(24)

Theorem (7.4)

If the poset(A,R)has a greatest(least) element, then that element is unique.

Definition (7.19)

Let(A,R)be a poset with BA.An element xA is called a lower bound of B if xRb for all bB.Likewise, an element yA is called an upper bound of B if bRy for all bB.

An element xA is called a greatest lower bound (glb) of B if it is a lower bound of B and if for all other lower bounds x′′of B we have x′′Rx.Similarly, yA is a least upper bound (lub) of B if it is an upper bound of B and if yRy′′for all other upper bounds y′′of B.

(25)

Theorem (7.5)

If(A,R)is a poset and BA,then B has at most one lub(glb).

(26)

### Thank you.

It’s easy to check that m is a maximal ideal, called the valuation ideal. We can show that R is a

(a) The magnitude of the gravitational force exerted by the planet on an object of mass m at its surface is given by F = GmM / R 2 , where M is the mass of the planet and R is

1) Ensure that you have received a password from the Indicators Section. 2) Ensure that the system clock of the ESDA server is properly set up. 3) Ensure that the ESDA server

“Since our classification problem is essentially a multi-label task, during the prediction procedure, we assume that the number of labels for the unlabeled nodes is already known