Scribd Logo
Upload

Welcome to Scribd!

  • 26 views

    Notes 03

    Uploaded by

    Gekuh Konyak
    1. The document discusses maps between ordered sets, including order-preserving, order-embedding, and order-isomorphism maps. 2. It proves that the composition of order-preserving maps is also order-preserving. 3. It proves that ordered sets P and Q are order-isomorphic if there exist order-preserving maps between them whose compositions are identities.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Notes 03

    Uploaded by

    Gekuh Konyak
    26 views8 pages
    1. The document discusses maps between ordered sets, including order-preserving, order-embedding, and order-isomorphism maps. 2. It proves that the composition of order-preserving maps is also order-preserving. 3. It proves that ordered sets P and Q are order-isomorphic if there exist order-preserving maps between them whose compositions are identities.

    Original Description:

    Shsh

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document discusses maps between ordered sets, including order-preserving, order-embedding, and order-isomorphism maps. 2. It proves that the composition of order-preserving maps is also order-preserving. 3. It proves that ordered sets P and Q are order-isomorphic if there exist order-preserving maps between them whose compositions are identities.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    26 views8 pages

    Notes 03

    Uploaded by

    Gekuh Konyak
    1. The document discusses maps between ordered sets, including order-preserving, order-embedding, and order-isomorphism maps. 2. It proves that the composition of order-preserving maps is also order-preserving. 3. It proves that ordered sets P and Q are order-isomorphic if there exist order-preserving maps between them whose compositions are identities.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 8

    DSE2

    Boolean Algebra and Automata Theory


    Lecture III
    Maps between Ordered Sets
    Let P and Q be ordered sets and a map ϕ:P → Q is said to be
    1 Order-preserving (or alternatively monotone) if x ≤ y in P implies ϕ(x) ≤
    ϕ(y) in Q
    2 An order-embedding (and we write ϕ:P ,→ Q) if x ≤ y in P iff ϕ(x) ≤ ϕ(y)
    in Q
    3 An order-isomorphism if it is order-embedding which maps P onto Q

    Example

    1 ϕ1 is not order-preserving
    2 ϕ2 to ϕ5 are order-preserving
    but not order-embedding
    3 ϕ6 is order-embedding

    DSE2 Boolean Algebra and Automata Theory Lecture III 2/8


    Maps between Ordered Sets

    Theorem Theorem
    Let ϕ:P → Q and ψ:Q → R be Ordered sets P and Q are
    order-preserving maps then the order-preserving isomorphic iff there
    exist order-preserving maps ϕ:P → Q
    composite map ψ ◦ ϕ given by
    and ψ:Q → P such that ϕ ◦ ψ = idQ
    (ψ ◦ ϕ)(x) = ψ(ϕ(x )) for x ∈ P is also and ψ ◦ ϕ = idP [Where idS :S → S
    order preserving denotes the identity map on S given by
    idS (x) = x ∀ x ∈ S]
    Proof.
    Let x, y ∈ P and x ≤ y Proof.
    Since ϕ is order preserving we’ve Since P & Q is ordered sets and ϕ:P →
    ϕ(x) ≤ ϕ(y) in Q Q and ψ:Q → P are order-preserving
    maps.
    Again ψ is order preserving, we’ve Then ϕ is an inverse of ψ
    ψ(ϕ(x)) ≤ ψ(ϕ(y)) in R Clearly ϕ ◦ ψ & ψ ◦ ϕ are identity
    i.e. for x, y ∈ P and if x ≤ y in P, we get Conversely,
    ψ(ϕ(x)) ≤ ψ(ϕ(y)) in R if ϕ is order-preserving and ϕ ◦ ψ is
    ∴ ϕ ◦ ψ is order-preserving. identity then ϕ is surjective. Hence
    order-isomorphism

    DSE2 Boolean Algebra and Automata Theory Lecture III 3/8


    Exercise in Page 25

    Solution
    Given that (a) x < x is false and (b) x < y and y < z ⇒ x < z
    to prove ≤ is an order in P defined by
    x ≤ y ⇔ x < y or x = y
    1 We’ve x ≤ x ∀ x ∈ P
    ∴ the relation is reflexive
    2 x≤y&y≤x⇒x=y
    ∴ the relation is antisymmetric
    3 x≤y&y≤z⇒x≤z
    ∴ the relation is transitive
    Hence ≤ is an order in P
    DSE2 Boolean Algebra and Automata Theory Lecture III 4/8
    Exercise in Page 25
    1.2. There is a list of 16 diagrams of four-element ordered sets such that every
    four element ordered set can be represented by one of the diagram in the list.
    Find such list

    Solution

    DSE2 Boolean Algebra and Automata Theory Lecture III 5/8


    Exercise in Page 26
    1.3. Draw a diagram for each of the following subset with the order define by
    m 4 n iff m divides n
    (i) {1,2,3,5,30} (ii) {2,3,12,18}

    Solution

    DSE2 Boolean Algebra and Automata Theory Lecture III 6/8


    Exercise in Page 26

    Solution

    1.4. Let P={a,b,c,d,e,f,u,v}. Draw


    the diagram of the ordered set hP; ≤i:
    where
    v<a,v<b,v<c,v<d,v<e,v<f,v<u,
    a<c,a<d,a<e,a<f,a<u,
    b<c,b<d,b<e,b<f,b<u,
    c<d,c<e,c<f,c<u,
    d<e,d<f,d<u,
    e<u,f<u

    DSE2 Boolean Algebra and Automata Theory Lecture III 7/8


    Exercise in Page 27
    1.13. Draw and label a diagram for O (P) for each of the ordered sets P given in the figure

    Solution

    The down sets of P is given by


    O(P)={φ, {a}, {b}, {a,b}, {a,c},
    {b,d}, {a,b,c}, {a,b,d}, {a,b,c,d}}

    DSE2 Boolean Algebra and Automata Theory Lecture III 8/8

    You might also like