Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Show thata dense poset with at least two elements that are comparable is not well-founded.

Short Answer

Expert verified

Hence, any dense poset with at least two elements that are comparable is not well founded.

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Given data

Poset is dense.

02

Concept used of poset

A partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of aset.

03

Prove for dense poset

A poset\((R, \le )\) is said to be dense if for all \(x,y \in R\) with \(x < y\) there exists an element \(z \in R\) such that \(x < z < y\).Let \((S, \le )\) be a dense poset with at least two comparable elements. Let \(x,y \in S\) and assumethat \(x \le y\).

As \((S, \le )\) is dense, there exist \({z_0} \in S\) such that \(x \le {z_0} \le y\).

As \(x \le {z_0}\) and \(S\) is dense, there exist \({z_0} \in S\) such that \(x \le {z_0} \le y\).

As \(x \le {z_0}\) and \(S\) is dense, there exist \({z_1} \in S\) such that \(x \le {z_1} \le {z_0} \le y\).

Furthermore, there exist \({z_2},{z_3},{z_4},K,{z_i},K \in S\) such that \(x \le K \le {z_i} \le K \le {z_3} \le {z_2} \le {z_1} \le {z_0} \le y\) and this chain of decreasing elements \({z_i}\) of \(S\) produced to infinity.As \(S\) has infinite decreasing sequence of elements \({z_i}\) so by definition of well founded\(S\) is not well founded.Hence, any dense poset with at least two elements that are comparable is not well founded.

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

What do you obtain when you apply the selection operator \({s_C}\), where \(C\) is the condition (Project \( = 2\) ) \( \wedge \) (Quantity \( \ge 50\) ), to the database in Table 10 ?

Let \(S\) be a set with \(n\) elements and let \(a\) and \(b\) be distinct elements of \(S\). How many relations \(R\) are there on \(S\) such that

a) \((a,b) \in R\) ?

b) \((a,b) \notin R\) ?

c) no ordered pair in \(R\) has \(a\) as its first element?

d) at least one ordered pair in \(R\) has \(a\) as its first element?

e) no ordered pair in \(R\) has \(a\) as its first element or \(b\) as its second element?

f) at least one ordered pair in \(R\) either has \(a\) as its first element or has \(b\) as its second element?

To determine whether the relation R on the set of all real numbers is reflexive, symmetric, anti symmetric, transitive, where (x,y)โˆˆR if and only ifx=1 or y=1.

To determine for each of these relations on the set {1,2,3,4}decide whether it is reflexive, whether it is symmetric, whether it is anti symmetric, and whether it is transitive {(1,3),(1,4),(2,3),(2,4),(3,1),(3,4)}.

Exercises 34โ€“37 deal with these relations on the set of real numbers:

\({R_1} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a > b} \right\},\)the โ€œgreater thanโ€ relation,

\({R_2} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \ge b} \right\},\)the โ€œgreater than or equal toโ€ relation,

\({R_3} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a < b} \right\},\)the โ€œless thanโ€ relation,

\({R_4} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \le b} \right\},\)the โ€œless than or equal toโ€ relation,

\({R_5} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a = b} \right\},\)the โ€œequal toโ€ relation,

\({R_6} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \ne b} \right\},\)the โ€œunequal toโ€ relation.

36. Find

(a) \({R_1}^\circ {R_1}\).

(b) \({R_1}^\circ {R_2}\).

(c) \({R_1}^\circ {R_3}\).

(d) \({R_1}^\circ {R_4}\).

(e) \({R_1}^\circ {R_5}\).

(f) \({R_1}^\circ {R_6}\).

(g) \({R_2}^\circ {R_3}\).

(h) \({R_3}^\circ {R_3}\).

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free