Certain elements have special importance in posets. The maximal element(s) is the greatest element(s). The minimal element (s) is the element (s) with.

Slides:



Advertisements
Similar presentations
Partial Orderings Section 8.6.
Advertisements

CSE 211- Discrete Structures1 Relations Ch 2 schaums, Ch 7 Rosen.
CSCI 115 Chapter 6 Order Relations and Structures.
Relations Relations on a Set. Properties of Relations.
Equivalence, Order, and Inductive Proof
8.6 Partial Orderings. Definition Partial ordering– a relation R on a set S that is Reflexive, Antisymmetric, and Transitive Examples? R={(a,b)| a is.
1.7 Diagonal, Triangular, and Symmetric Matrices.
Multiplication Rule. A tree structure is a useful tool for keeping systematic track of all possibilities in situations in which events happen in order.
Chapter 7 Relations : the second time around
Branch and Bound Similar to backtracking in generating a search tree and looking for one or more solutions Different in that the “objective” is constrained.
1 Relations: The Second Time Around Chapter 7 Equivalence Classes.
Relations binary relations xRy on sets x  X y  Y R  X  Y Example: “less than” relation from A={0,1,2} to B={1,2,3} use traditional notation 0 < 1,
Partial Orderings: Selected Exercises
1.7 Diagonal, Triangular, and Symmetric Matrices 1.
Section 7.6: Partial Orderings Def: A relation R on a set S is called a partial ordering (or partial order) if it is reflexive, antisymmetric, and transitive.
1 Partial Orderings Based on Slides by Chuck Allison from Rosen, Chapter 8.6 Modified by.
Partially Ordered Sets (POSets)
Lecture 9 Illustrations Lattices. Fixpoints Abstract Interpretation.
Relations (3) Rosen 6th ed., ch fall.
Chapter 6. Order Relations and Structure
Copyright © 2010 Pearson Education, Inc. All rights reserved. 6.1 – Slide 1.
Lecture 4.5: POSets and Hasse Diagrams CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
Zvi Kohavi and Niraj K. Jha 1 Capabilities, Minimization, and Transformation of Sequential Machines.
Solving fixpoint equations
1 Partial Orderings Aaron Bloomfield CS 202 Rosen, section 7.6.
Discrete Structures – CNS2300
The Integers. The Division Algorithms A high-school question: Compute 58/17. We can write 58 as 58 = 3 (17) + 7 This forms illustrates the answer: “3.
2.6 Equivalence Relation §1.Equivalence relation §Definition 2.18: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric,
8.3 Representing Relations Directed Graphs –Vertex –Arc (directed edge) –Initial vertex –Terminal vertex.
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Chapter 8 Relations 歐亞書局.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Relations and their Properties
Sets, Relations, and Lattices
Section 2.2 Subsets and Set Operations Math in Our World.
Sets and Subsets Set A set is a collection of well-defined objects (elements/members). The elements of the set are said to belong to (or be contained in)
Problem Statement How do we represent relationship between two related elements ?
Unit II Discrete Structures Relations and Functions SE (Comp.Engg.)
1 Section 4.3 Order Relations A binary relation is an partial order if it transitive and antisymmetric. If R is a partial order over the set S, we also.
Chapter 8: Relations. 8.1 Relations and Their Properties Binary relations: Let A and B be any two sets. A binary relation R from A to B, written R : A.
1 Partial Orderings Based on Slides by Chuck Allison from Rosen, Chapter 8.6 Modified by.
Making a Box & Whiskers Plot Give Me Five!. 5 Numbers are Needed 1) Lowest: Least number of the data set 2) Lower Quartile : The median of the lower half.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Infinite sets We say that a set A is infinite if a proper subset B exists of A such that there is a bijection It is easy to see that no set with a finite.
1 Partial Orderings Epp, section Introduction An equivalence relation is a relation that is reflexive, symmetric, and transitive A partial ordering.
Capabilities, Minimization, and Transformation of Sequential Machines
Chapter 5 Relations and Operations
Partial Orderings: Selected Exercises
Chapter 6 Order Relations and Structures
CSE 2813 Discrete Structures
Unit-III Algebraic Structures
Partial Orders.
Partial Orderings CSE 2813 Discrete Structures.
Partial Orders (POSETs)
Equivalence Relations
Partial Orderings.
Relations and Digraphs
LATTICES AND BOOLEAN ALGEBRA
14 Factoring and Applications.
Introductory Material
Discrete Math (2) Haiming Chen Associate Professor, PhD
Partial Orders Section 9.6 of Rosen Spring 2018
Field.
Box Plots.
Background material.
Relations.
교환 학생 프로그램 내년 1월 중순부터 6월 초 현재 학부 2,3 학년?
Background material.
Relations: The Second Time Around
Foundations of Discrete Mathematics
Introductory Material
Presentation transcript:

Certain elements have special importance in posets. The maximal element(s) is the greatest element(s). The minimal element (s) is the element (s) with the least value. You may have 1 or many maximal or minimal elements. a 1,a 2,a 3 are maximal elements b 1,b 2,b 3 are minimal elements since there is no line between b 2 and b 3 we cannot conclude that one is less than the other or equal to each other. a1a1 b1b1 a2a2 b2b2 a3a3 b3b3

Topological sorting decba ab d e c

To find a topological sorting of poset (A,≤)(linear order) A = {a,b,c,d,e} 1. Choose a minimal element of A. You could choose d or e. We will choose d. 2. Make d the next entry of sort and replace A – {d}. A = {a,b,c,e} Repeat steps 1 and 2 until A = {}

First we note d and e are minimal elements. We choose either d or e and place it in the sort. We select d in this example. Mark off d. Next we see e is the minimal element, so e is the next in our sort. Mark off e. Next we see c is the minimal element. Place c in the sort and mark it off. Next we can choose either a or b as our minimal element. In this example we choose b. b goes in the sort. We are left with a. a is the last entry the sort. a c de b decba

An element is considered a greatest element if it is greater than all the other elements. There can only be one greatest element or none. An element is considered the least element if it is less than all other elements. There can only be one least element or none. S = {a,b,c} A = P(s) (Power set of s) A = {{},{a},{b}, {c},{a,b},{a,c},{b,c},{a,b,c}} The least element in set A is {}. The greatest element in set A is {a,b,c}

d is the greatest element A is the least element There is no greatest element There is no least element d b c a ba e dc

Posets have an upper bound and a lower bound. A = {a,b,c,d,e,f,g,h} Subset B 1 = {a,b} Subset B 2 = {c,d,e} B 1 has no lower bounds. a and b are as low as you can go. Upper bounds = c,d,e,f,g,h B 2 Upperbounds are f,g,h lower bounds are c,a,b. f d a b c e g h

Subset B 2 = {c,d,e} Draw a line at the highest pair (d,e) Anything above the line is considered upper bounds. Anything below the line is considered lower bounds. f d a b c e g h

Least upper bound: LUB Greatest lower bound GLB Subset B = {c,d,e} 1. draw a line at the greatest pair of subset B (d,e). 2. least upper bound of subset B is f. 3. greatest lower bound of subset B is c. g d ba c e f h

If you have no lower bound then, you have no greatest lower bound. a and b are not comparable. This poset has no greatest lower bound. c is the least upper bound. c ba