Mathematics Homework Solutions
Problem
#2604

Working with partial order relations in discrete math.

Let S = {0,1} and consider the partial order relation R defined on S X  S X  S as follows: for all ordered triples (a, b, c) and (d, e, f) in S X S  X S.  
( a, b, c ) R ( d, e, f ) <->  a ≤ d, b ≤ e, c ≤ f,
where ≤ denotes the usual "less than or equal to" relation for real numbers. Do the maximal, greatest, minimal and least elements exist?  If so, which are they?  


Solution Summary

This shows how to determine if the maximal, greatest, minimal and least elements exist for a given situation.

Solution
What is this?
By OTA - Overall OTA Rating
Yupei Xiong, PhD - 4.8/5
Purchase Cost Now
$2.19 CAD (was ~$3.99)
Included in Download
  • Plain text response
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Maximal, greatest, minimal, least elements - Given S = {0, 1}, let R be the partial order relation on S X S X S such that for all ordered triples (a, b, c) and (d, e, f) in SXSXS (a, b, c) is related to (d, e, f)  a =
  • Discrete Math: Hasse diagram of a partial order relation - S = {0,1} and consider the partial order relation R defined on S X S X S as follows: for all ordered triples (a, b, c) and (d, e, f) in S X S X S. ( a, b, c ) R ( d, e, f ) <-> a ≤ d ...
  • Proving a partial order and total order. - In each of the following say whether or not R is a partial order on A. If so, is it a total order? a) A= {a,b,c,d}, R= {(a,a),(b,a),(b,b),(b,c),(c,c)} b) A is the set of positive divisors of 24, ...
  • Pythagorean Triples - 1) The numbers 3, 4, and 5 are called Pythagorean triples since 3 2+ 4 2= 5 2. The numbers 5, 12, and 13 are also Pythagorean triples since 5 2 + 12 2= 13 2. Can you find any other Pythagorean triples ...
  • Is this relation a partial order? - I need help with question 1.c. Is this relation a partial order? Explain. If this relation a partial order, draw its Hasse diagram.
Browse