Exercise 1.1 · Q2: on
Show that the relation in the set of real numbers, defined as is neither reflexive nor symmetric nor transitive.
, as . So is not reflexive.
, as , but , as . So is not symmetric.
, as , and , as . But , as . So is not transitive.
Hence is neither reflexive nor symmetric nor transitive.
Want the reason behind every step, the basics and the checks?
Squaring does not always make a number bigger. For numbers between 0 and 1 it makes them smaller: . That single fact breaks reflexivity. The other two properties break because the rule treats and differently (only is squared), so swapping them, or chaining two links, can turn a true inequality into a false one. All three failures are shown with specific numbers.
- Given
- The set of real numbers and the rule: exactly when .
- To show
- is not reflexive, not symmetric and not transitive.
- Plan
- Each property is a "for all" statement, so each is disproved by one counterexample. For each property we (1) say what a counterexample must look like, (2) find numbers that fit, and (3) check every inequality with the arithmetic shown. We also explain how the numbers were found, so you can find your own.
Basics you need
means "the first number is at most the square of the second". So because , but because . Order matters. Basics: what a relation is
Reflexive: for every . Symmetric: . Transitive: and . Basics: reflexive, symmetric, transitive
To disprove "for all", give one case where it fails. For an "if … then" property, the case must make the "if" part true and the "then" part false. Both halves need checking. Basics: proving and disproving
If , then (multiplying the inequality by the positive number ). So squaring a number between 0 and 1 makes it smaller. For or it does not: . Basics: numbers
Solution
Picture the relation
Draw across and up. The pair is in exactly when the point lies on or below the curve .
Horizontal axis: , the second entry. Vertical axis: , the first entry. A pair is in when its point is in the shaded region, on or below . Green ✓ points are in , rose ✗ points are not. The six labelled pairs are the ones used in Steps 2 to 4. A picture shows at once why the properties fail. The curve is not symmetric about the line , so swapping and can move a point from inside to outside. And near between 0 and 1 the curve dips below the line , so points there lie outside the region. We use the picture only to find counterexamples; each one is then checked with exact arithmetic.Not reflexive: the pair
Reflexive would need for every real . Take :
So the condition reads , which is false, since . Hence , and is not reflexive.
Exactly which fail? means , that is . A product is when both factors have the same sign or one is 0, which happens for or . So for those , and exactly for .
Most numbers we first think of, like 2 or −3, do satisfy (, ). Testing only those would wrongly suggest is reflexive. The search has to go where squaring shrinks numbers: between 0 and 1 (Basic 4). One such number is all a disproof needs; the factorisation simply shows the whole set of failures, the open interval .A product exactly when and are both or both . Here , .Not symmetric: the pair
We need with . Take , :
So but .
So is not symmetric. (The pair works just as well: is true but is false. Any such pair works.)
For the reverse pair , the roles swap: now is compared with . We want the first inequality true and the second false, that is and . With both say the same thing in practice: , so any gives , and then as well. The simplest choice is .A symmetry counterexample makes "" true and "" false (Basic 3). Both halves are checked above.Not transitive: the pairs and
We need and but . Take , , :
Both links are in , but the shortcut is not. So is not transitive.
How were these numbers found? Written out, we need So must fit in the gap between and , and must sit above but not above . That gap only exists when , for example with gap from 2 to 4. Pick with in that gap: gives . Then pick between and : . On the figure, and are green, while is rose, sitting just above the curve.A transitivity counterexample needs two linked pairs (the second starts where the first ends, here at ) and a missing shortcut (Basic 2, Basic 3).Conclude
Each property has failed at a specific, checked example: ; but ; but . Hence is neither reflexive nor symmetric nor transitive.
The question says "show", so the answer is a proof, and three verified counterexamples are a complete proof of three "not" statements. No general argument is needed for a property that fails.
on is not reflexive (), not symmetric ( but ) and not transitive ( and , but ). In fact fails exactly for . (This is a "show that" question, so the textbook's answer key lists no separate answer; the result is exactly the statement the question asks us to show.)
Try another reflexive test: gives , so , as the interval predicts. And gives , so : the endpoint 1 is not a failure. The site's verification script checks all the counterexamples above in exact fractions, and also searches all triples from a grid of 25 numbers to confirm that failures of each property really exist.
- Testing reflexivity only on whole numbers. holds for every integer, so you never find the failure. The problem is set in , so fractions count.
- Mixing up which entry is squared. In it is the second entry that is squared. asks whether , not whether .
- Unlinked pairs for transitivity. The two pairs must share the middle element: then .
- Forgetting to check that the links are in . A transitivity counterexample is worthless unless both and really satisfy the rule.
- When a rule involves squares, look between 0 and 1, and at negative numbers: that is where intuition about "squaring makes it bigger" fails.
- A rule that treats its two entries differently is usually not symmetric. Swap them and look for a pair that changes from true to false.
- To build a transitivity counterexample, write the chain of inequalities you need () and choose numbers to fit it, one at a time.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Reflexive, symmetric, transitive | Steps 2–4 | Definition 3, Section 1.2 (Lesson: types of relations) |
| One counterexample disproves a "for all" statement | Steps 2–5 | Logic of quantifiers (Basics: proving and disproving) |
| Step 2 | Multiplying an inequality by a positive number | |
| exactly when or | Step 2 | Factorisation; sign of a product |
| Step 4 | Arithmetic, checked exactly in the verification script | |
| Every counterexample in Steps 2–4, the extra values and for integers | Steps 2–4, Check | Recomputed exactly (fractions) and by grid search in the site's verification script |
Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →