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 of possible scores: contestant with score asurvives against the contestant with score b when a is at most the square of b. Formally,
R={(a,b)∈R×R:a≤b2}.
Write s:R→R for the squaring map s(b)=b2 used in the test.
Attempt any four of the following five sub-questions.
(a) Show that R is not reflexive by naming one score. Then find all scores a for which (a,a)∈R, and state exactly which scores make reflexivity fail.
(b) Show that R is not symmetric, using the scores 1 and 2. Then find all real b for which (2,b) and (b,2) both lie in R.
(c) Show that R is not transitive by verifying the three inequalities for the scores a=5, b=3, c=−2. Then find a second counterexample in which all three scores are positive, and verify it.
(d) Find the range of s. Hence find the set of scores a that survive against every contestant, and the set of scores b against which every contestant survives, justifying both answers from the range of s.
(e) Only five scores were actually recorded: D={−2,−1,0,21,2}. Let RD=R∩(D×D). Compute ∣RD∣, decide whether RD is transitive with a counterexample if it is not, and find the least number of ordered pairs that must be added to RD to make it reflexive on D.
(a)One score that fails. Take a=21. Then a2=41, and 21≤41 is false, so (21,21)∈/R. Hence R is not reflexive.
All scores with (a,a)∈R. The condition is a≤a2, i.e.
a2−a≥0⟺a(a−1)≥0.
A product of two factors is ≥0 when both are ≥0 or both are ≤0:
range of a
sign of a
sign of a−1
sign of a(a−1)
is (a,a)∈R?
a≤0
≤0
<0
≥0
yes
0<a<1
>0
<0
<0
no
a≥1
>0
≥0
≥0
yes
So
{a:(a,a)∈R}=(−∞,0]∪[1,∞),
and reflexivity fails exactly on the open interval 0<a<1. Check the endpoints: a=0 gives 0≤0, true; a=1 gives 1≤1, true — so both belong, and the failing set is open at each end.
(b)Not symmetric. With a=1,b=2: 1≤22=4 is true, so (1,2)∈R. Turning the pair round, (2,1) needs 2≤12=1, which is false. So (1,2)∈R but (2,1)∈/R, and R is not symmetric.
All b with both (2,b) and (b,2) in R. The two conditions are
(2,b)∈R:2≤b2,(b,2)∈R:b≤22=4.
The first says b2≥2, i.e. ∣b∣≥2, i.e. b≤−2 or b≥2. The second says b≤4. Combining:
b∈(−∞,−2]∪[2,4].
Note the asymmetry: on the negative side there is no lower cut-off, because b≤4 is automatic there; on the positive side the interval stops at 4. A spot check: b=−10 gives 2≤100 ✓ and −10≤4 ✓; b=5 gives 2≤25 ✓ but 5≤4 ✗, so 5 is correctly excluded.
(c) Take a=5, b=3, c=−2.
pair
condition
check
verdict
(a,b)=(5,3)
5≤32
5≤9
in R
(b,c)=(3,−2)
3≤(−2)2
3≤4
in R
(a,c)=(5,−2)
5≤(−2)2
5≤4
not in R
So (5,3)∈R and (3,−2)∈R but (5,−2)∈/R, and R is not transitive.
Why this example is easy to find: squaring destroys the sign, so a small negative c can still have a comfortably large square, c2=4 — big enough to accept b=3, yet not big enough to accept a=5.
A counterexample with all three scores positive. Take a=2, b=23, c=45.
pair
condition
check
verdict
(2,23)
2≤(23)2
2≤49=2.25
in R
(23,45)
23≤(45)2
1.5≤1625=1.5625
in R
(2,45)
2≤(45)2
2≤1.5625
not in R
So transitivity fails among positive scores too. The trick here is to keep b and c just above 1, where squaring barely increases a number, while a is large enough to clear b2 but not c2.
(d)Range of s. For every real b, b2≥0; and every r≥0 is attained, since s(r)=r. So
range(s)=[0,∞),with least value 0 (at b=0).
Scores that survive against everyone. We need
a≤b2for every b∈R.
That says a is a lower bound for the whole range [0,∞). The smallest element of the range is 0, so the condition is exactly a≤0:
{a:(a,b)∈R for all b}=(−∞,0].
Indeed if a≤0 then a≤0≤b2 for every b; and if a>0 then taking b=0 gives a≤0, false.
Scores everyone survives against. We need
a≤b2for every a∈R,
i.e. the single number b2 must be an upper bound for all of R. But R has no upper bound: whatever b is, the score a=b2+1 fails, since b2+1≤b2 is false. Hence
{b:(a,b)∈R for all a}=∅.
So there are "unbeatable-in-one-direction" scores — every non-positive score survives against everybody — but no score at all is a universal target.
(e)Computing RD. First tabulate b2 for the five recorded scores, then for each b list the a∈D with a≤b2.
b
b2
the a∈D with a≤b2
count
−2
4
−2,−1,0,21,2
5
−1
1
−2,−1,0,21
4
0
0
−2,−1,0
3
21
41
−2,−1,0
3
2
4
−2,−1,0,21,2
5
Adding the counts,
∣RD∣=5+4+3+3+5=20.
(Out of ∣D×D∣=25, so only five ordered pairs are missing.)
Transitivity.RD is not transitive. Take a=21, b=−2, c=0, all in D:
(21,−2): 21≤(−2)2=4 ✓, so it is in RD;
(−2,0): −2≤02=0 ✓, so it is in RD;
(21,0): 21≤0 ✗, so it is not in RD.
Transitivity therefore fails inside D as well, not just on all of R.
Making RD reflexive. Reflexivity on D needs all five pairs (a,a) for a∈D. Test each against a≤a2, or just read part (a): the condition fails exactly for 0<a<1.
a
a≤a2?
(a,a)∈RD?
−2
−2≤4 ✓
yes
−1
−1≤1 ✓
yes
0
0≤0 ✓
yes
21
21≤41 ✗
no
2
2≤4 ✓
yes
Only one score of D lies in the failing interval (0,1), namely 21. So exactly one ordered pair must be added,
(21,21),
and the least number of pairs required is 1. (Adding it makes RD reflexive, but not symmetric and not transitive: (−1,2)∈RD while (2,−1)∈/RD, since −1≤22=4 but 2≤(−1)2=1 is false; and the triple (21,−2,0) above still breaks transitivity. For the record, the five ordered pairs of D×D missing from RD are (21,0), (21,21), (2,−1), (2,0) and (2,21).)