Confirming your payment

Skip to content

Competency-Based Questions (CBQ) · Question 77 of 80

A two-round quiz gives every contestant a real-valued round-one score; penalties make negative scores possible.

Question 774 marksHard

A two-round quiz gives every contestant a real-valued round-one score; penalties make negative scores possible. The organisers define a head-to-head test on the set R\mathbb{R} of possible scores: contestant with score aa survives against the contestant with score bb when aa is at most the square of bb. Formally,

R={(a,b)∈R×R: a≤b2}.R=\{(a,b)\in\mathbb{R}\times\mathbb{R}:\ a\le b^2\}.

Write s:R→Rs:\mathbb{R}\to\mathbb{R} for the squaring map s(b)=b2s(b)=b^2 used in the test.

Attempt any four of the following five sub-questions.

(a) Show that RR is not reflexive by naming one score. Then find all scores aa for which (a,a)∈R(a,a)\in R, and state exactly which scores make reflexivity fail.

(b) Show that RR is not symmetric, using the scores 11 and 22. Then find all real bb for which (2,b)(2,b) and (b,2)(b,2) both lie in RR.

(c) Show that RR is not transitive by verifying the three inequalities for the scores a=5a=5, b=3b=3, c=−2c=-2. Then find a second counterexample in which all three scores are positive, and verify it.

(d) Find the range of ss. Hence find the set of scores aa that survive against every contestant, and the set of scores bb against which every contestant survives, justifying both answers from the range of ss.

(e) Only five scores were actually recorded: D={−2, −1, 0, 12, 2}D=\{-2,\,-1,\,0,\,\tfrac12,\,2\}. Let RD=R∩(D×D)R_D=R\cap(D\times D). Compute ∣RD∣|R_D|, decide whether RDR_D is transitive with a counterexample if it is not, and find the least number of ordered pairs that must be added to RDR_D to make it reflexive on DD.