Start here
This guide tackles one precise learner problem: identifying diagonals from polygon structure rather than appearance. Begin with the controlling question: Does the segment join two non-adjacent vertices of the polygon? The aim is a portable decision method, not a slogan that works only on a familiar worksheet.
A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. This model will be tested through mechanisms, worked contrasts, misconception repairs, independent practice, delayed transfer and examination control.
Navigate through the complete Learner’s Guide volume directory and revisit the original PSLE Learning Guide. Use the Mathematics hub for related routes. For current paper-format information, consult the official SEAB PSLE formats examined in 2026.
Mechanism before method
Mechanism 1
Vertices are the corner points of a polygon. Two vertices are adjacent when a side directly joins them. A diagonal joins a pair of vertices that are not neighbours along the boundary.
Mechanism 2
A sloping side remains a side, not a diagonal, because it joins adjacent vertices. A horizontal or vertical segment can be a diagonal if it joins non-adjacent vertices in a rotated or specially shaped polygon.
Mechanism 3
The segment must begin and end at vertices. A line from a vertex to the midpoint of a side may be useful, but it is not a polygon diagonal under the definition.
Mechanism 4
In a quadrilateral, each vertex has one non-adjacent vertex, producing two diagonals altogether. In larger polygons, more non-adjacent pairs exist; count systematically rather than relying on the picture.
Mechanism 5
Rotation changes appearance but not adjacency. Trace the boundary order, mark neighbouring pairs, and classify a segment only after checking its endpoints against that order.
Apply four moves. Name the exact job, select the evidence that controls it, apply the relationship, and reject the nearest tempting alternative with a reason. The final contrast matters because it reveals whether you understood the mechanism or merely recognised the surface pattern.
Worked decision laboratory
Case 1: In quadrilateral ABCD, is segment AC a diagonal?
Answer: Yes. A and C are separated by vertex B in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 2: In quadrilateral PQRS, is side PQ a diagonal because it slopes in the drawing?
Answer: No. P and Q are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 3: A segment runs from vertex W to the midpoint of side YZ. Is it a polygon diagonal?
Answer: No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 4: Quadrilateral KLMN is rotated so segment LN looks vertical. Is LN still a diagonal?
Answer: Yes. L and N are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 5: In quadrilateral EFGH, is segment EG a diagonal?
Answer: Yes. E and G are separated by vertex F in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 6: In quadrilateral ABCD, is side AB a diagonal because it slopes in the drawing?
Answer: No. A and B are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 7: A segment runs from vertex P to the midpoint of side RS. Is it a polygon diagonal?
Answer: No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 8: Quadrilateral WXYZ is rotated so segment XZ looks vertical. Is XZ still a diagonal?
Answer: Yes. X and Z are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 9: In quadrilateral KLMN, is segment KM a diagonal?
Answer: Yes. K and M are separated by vertex L in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 10: In quadrilateral EFGH, is side EF a diagonal because it slopes in the drawing?
Answer: No. E and F are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 11: A segment runs from vertex A to the midpoint of side CD. Is it a polygon diagonal?
Answer: No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 12: Quadrilateral PQRS is rotated so segment QS looks vertical. Is QS still a diagonal?
Answer: Yes. Q and S are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 13: In quadrilateral WXYZ, is segment WY a diagonal?
Answer: Yes. W and Y are separated by vertex X in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 14: In quadrilateral KLMN, is side KL a diagonal because it slopes in the drawing?
Answer: No. K and L are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 15: A segment runs from vertex E to the midpoint of side GH. Is it a polygon diagonal?
Answer: No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 16: Quadrilateral ABCD is rotated so segment BD looks vertical. Is BD still a diagonal?
Answer: Yes. B and D are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 17: In quadrilateral PQRS, is segment PR a diagonal?
Answer: Yes. P and R are separated by vertex Q in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 18: In quadrilateral WXYZ, is side WX a diagonal because it slopes in the drawing?
Answer: No. W and X are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 19: A segment runs from vertex K to the midpoint of side MN. Is it a polygon diagonal?
Answer: No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 20: Quadrilateral EFGH is rotated so segment FH looks vertical. Is FH still a diagonal?
Answer: Yes. F and H are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 21: In quadrilateral ABCD, is segment AC a diagonal?
Answer: Yes. A and C are separated by vertex B in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 22: In quadrilateral PQRS, is side PQ a diagonal because it slopes in the drawing?
Answer: No. P and Q are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 23: A segment runs from vertex W to the midpoint of side YZ. Is it a polygon diagonal?
Answer: No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 24: Quadrilateral KLMN is rotated so segment LN looks vertical. Is LN still a diagonal?
Answer: Yes. L and N are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 25: In quadrilateral EFGH, is segment EG a diagonal?
Answer: Yes. E and G are separated by vertex F in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 26: In quadrilateral ABCD, is side AB a diagonal because it slopes in the drawing?
Answer: No. A and B are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 27: A segment runs from vertex P to the midpoint of side RS. Is it a polygon diagonal?
Answer: No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 28: Quadrilateral WXYZ is rotated so segment XZ looks vertical. Is XZ still a diagonal?
Answer: Yes. X and Z are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 29: In quadrilateral KLMN, is segment KM a diagonal?
Answer: Yes. K and M are separated by vertex L in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 30: In quadrilateral EFGH, is side EF a diagonal because it slopes in the drawing?
Answer: No. E and F are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 31: A segment runs from vertex A to the midpoint of side CD. Is it a polygon diagonal?
Answer: No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 32: Quadrilateral PQRS is rotated so segment QS looks vertical. Is QS still a diagonal?
Answer: Yes. Q and S are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 33: In quadrilateral WXYZ, is segment WY a diagonal?
Answer: Yes. W and Y are separated by vertex X in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 34: In quadrilateral KLMN, is side KL a diagonal because it slopes in the drawing?
Answer: No. K and L are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 35: A segment runs from vertex E to the midpoint of side GH. Is it a polygon diagonal?
Answer: No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 36: Quadrilateral ABCD is rotated so segment BD looks vertical. Is BD still a diagonal?
Answer: Yes. B and D are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 37: In quadrilateral PQRS, is segment PR a diagonal?
Answer: Yes. P and R are separated by vertex Q in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 38: In quadrilateral WXYZ, is side WX a diagonal because it slopes in the drawing?
Answer: No. W and X are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 39: A segment runs from vertex K to the midpoint of side MN. Is it a polygon diagonal?
Answer: No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Case 40: Quadrilateral EFGH is rotated so segment FH looks vertical. Is FH still a diagonal?
Answer: Yes. F and H are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. The controlling model is: A polygon diagonal is a line segment joining two non-adjacent vertices; slope, orientation and visual length do not define it. Now name one condition that would need to change for a different conclusion. That counterfactual check makes the reasoning transferable.
Common misconceptions and targeted repair
1. Every sloping segment is a diagonal.
Orientation is irrelevant; endpoint adjacency decides. Repair the habit by identifying the governing subject, endpoint relationship, denominator, syntax or local key before answering. Cite one concrete cue from the item.
2. A polygon side can become a diagonal after rotation.
Rotation preserves which vertices are neighbours. Repair the habit by identifying the governing subject, endpoint relationship, denominator, syntax or local key before answering. Cite one concrete cue from the item.
3. Any segment crossing the interior is a diagonal.
Both endpoints must be non-adjacent vertices. Repair the habit by identifying the governing subject, endpoint relationship, denominator, syntax or local key before answering. Cite one concrete cue from the item.
4. A vertex-to-midpoint segment is a diagonal.
The midpoint is not a polygon vertex. Repair the habit by identifying the governing subject, endpoint relationship, denominator, syntax or local key before answering. Cite one concrete cue from the item.
5. A diagonal must be longer than every side.
Length is not part of the definition. Repair the habit by identifying the governing subject, endpoint relationship, denominator, syntax or local key before answering. Cite one concrete cue from the item.
6. Only quadrilaterals have diagonals.
Polygons with more vertices also have non-adjacent vertex pairs. Repair the habit by identifying the governing subject, endpoint relationship, denominator, syntax or local key before answering. Cite one concrete cue from the item.
Graded independent practice with explained answers
1. In quadrilateral ABCD, is segment AC a diagonal?
Yes. A and C are separated by vertex B in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
2. In quadrilateral PQRS, is side PQ a diagonal because it slopes in the drawing?
No. P and Q are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
3. A segment runs from vertex W to the midpoint of side YZ. Is it a polygon diagonal?
No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
4. Quadrilateral KLMN is rotated so segment LN looks vertical. Is LN still a diagonal?
Yes. L and N are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
5. In quadrilateral EFGH, is segment EG a diagonal?
Yes. E and G are separated by vertex F in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
6. In quadrilateral ABCD, is side AB a diagonal because it slopes in the drawing?
No. A and B are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
7. A segment runs from vertex P to the midpoint of side RS. Is it a polygon diagonal?
No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
8. Quadrilateral WXYZ is rotated so segment XZ looks vertical. Is XZ still a diagonal?
Yes. X and Z are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
9. In quadrilateral KLMN, is segment KM a diagonal?
Yes. K and M are separated by vertex L in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
10. In quadrilateral EFGH, is side EF a diagonal because it slopes in the drawing?
No. E and F are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
11. A segment runs from vertex A to the midpoint of side CD. Is it a polygon diagonal?
No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
12. Quadrilateral PQRS is rotated so segment QS looks vertical. Is QS still a diagonal?
Yes. Q and S are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
13. In quadrilateral WXYZ, is segment WY a diagonal?
Yes. W and Y are separated by vertex X in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
14. In quadrilateral KLMN, is side KL a diagonal because it slopes in the drawing?
No. K and L are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
15. A segment runs from vertex E to the midpoint of side GH. Is it a polygon diagonal?
No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
16. Quadrilateral ABCD is rotated so segment BD looks vertical. Is BD still a diagonal?
Yes. B and D are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
17. In quadrilateral PQRS, is segment PR a diagonal?
Yes. P and R are separated by vertex Q in the boundary order, so they are non-adjacent vertices. Their joining segment satisfies the structural definition regardless of its slope. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
18. In quadrilateral WXYZ, is side WX a diagonal because it slopes in the drawing?
No. W and X are adjacent vertices joined by a boundary side. Sloping appearance does not convert a side into a diagonal. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
19. A segment runs from vertex K to the midpoint of side MN. Is it a polygon diagonal?
No. Only one endpoint is a vertex. A diagonal must join two non-adjacent vertices, so a midpoint endpoint fails the definition. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
20. Quadrilateral EFGH is rotated so segment FH looks vertical. Is FH still a diagonal?
Yes. F and H are non-adjacent vertices. Rotation changes orientation but preserves the boundary relationships that define the diagonal. Attempt the item before opening this explanation. If your result differs, classify the error as task reading, evidence selection, relationship choice, execution or final checking.
A three-round independence ladder
Round 1: visible model
Solve five items while the mechanism remains visible. Add a short evidence tag beside each answer. The tag should name the actual controller rather than repeat the answer.
Round 2: hidden model
Close the guide for at least twenty minutes, reconstruct the principle, and solve five different items. Write a reason before checking the explanation. Repair the earliest faulty step, not just the final answer.
Round 3: mixed transfer
Mix four new items with unrelated questions. Without the heading, first diagnose which model applies. Include one boundary case where an important condition changes and explain why the usual conclusion no longer follows.
Delayed transfer
The next day, retrieve the controlling question, the principle and two contrasting examples without rereading. Invent a new case with different surface details, solve it and explain why the closest alternative fails.
Three days later, ask someone to alter one condition. Predict what changes and what stays stable before solving. A genuine model explains the effect of the change; a memorised sentence usually cannot.
Keep a correction record with four columns: cue noticed, first decision, missed evidence and repaired rule. Short diagnostic entries are easier to retrieve than copied model answers.
Examination control
- Name the exact job before calculating or editing.
- Mark only controlling evidence.
- State the relationship in a few words.
- Execute the form, comparison or inference.
- Check grammar, units, endpoints, denominators, labels and keys.
When uncertain, compare the two most plausible interpretations against explicit evidence. Reject any reading that contradicts the clause structure, polygon boundary, starting count, table unit or local legend.
Make the final check targeted: a nearby plural noun pulling the verb, a sloping side mistaken for a diagonal, equal counts compared over unequal totals, or a question mark treated as punctuation inside an equation.
Guidance for parents and tutors
Ask “What evidence controlled your answer?” before correcting. The learner’s response distinguishes missing knowledge from a context-selection error or an execution slip.
Replace “be careful” with an observable action: remove the of-phrase, trace vertex adjacency, compare each result with its starting total, or read the symbol’s local key.
Frequently asked questions
Must I memorise all cases?
No. Learn the relationship and use cases to practise evidence recognition.
Why explain an obvious answer?
Explanation separates model-based reasoning from a guess.
What if the diagram looks convincing?
Use definitions, labels and stated conditions; appearance may mislead.
How fast should I work?
Build accurate decisions first, then shorten the routine through mixed retrieval.
Can one changed condition reverse the answer?
Yes. State which condition the conclusion depends on.
What demonstrates mastery?
You can retrieve the model later, solve a new case, reject a tempting error and identify a boundary.
Next routes
Continue through the complete volume directory, return to the original PSLE Learning Guide, and use the Mathematics hub. Keep the transferable habit: name the job, select controlling evidence, apply the mechanism and retrieve it after a delay.