Math Problem Statement

Given any partially-ordered set (S,⪯) , it is known that a standard Hasse diagram can be constructed representing the relation ⪯ on the vertex set with vertices labelled by the elements of S . Gabriel wants to compare the Hasse diagram for a partially-ordered set with the standard arrow diagram for the relation ⪯ on S , which we might refer to as the unsimplified diagram for (S,⪯) . (a) Consider the set S={1,2,4,5,6,8,10,12,18} . How many edges are in the standard Hasse diagram for the partially-ordered set (S,∣) and How many edges are in the unsimplified diagram for (S,∣) ? Include the Hasse diagram in your answer.

Solution

Ask a new question for Free

By Image

Drop file here or Click Here to upload

Math Problem Analysis

Mathematical Concepts

Partially-ordered sets
Hasse diagrams
Divisibility relation

Formulas

-

Theorems

-

Suitable Grade Level

Advanced Mathematics