Singapore School Mathematics Operating Manual · Chapter 26
Some problems look large because the same mathematical situation appears several times in different clothing.
A shape may be reflected. A probability branch may be the reverse order of another. Two algebraic cases may differ only by sign. A counting problem may list arrangements that are equivalent under rotation. A graph may be symmetric about an axis. A sequence may repeat under a cycle. A geometry diagram may contain equal substructures.
When these cases are genuinely equivalent, solving each independently is wasteful and can create duplicate counting.
This chapter develops a practical discipline for symmetry, redundancy and case reduction: identify what transformation preserves the relevant structure, choose one representative case, solve it carefully, then transport the conclusion only where the symmetry really applies.
1. Symmetry means some transformation leaves the relevant structure unchanged
A square rotated by 90° occupies a different orientation but retains its side lengths, angles and overall shape.
A parabola y = x² reflected across the y-axis is unchanged because f(−x) = f(x).
A fair coin model treats heads and tails symmetrically if the physical model assigns equal probability.
The important phrase is “relevant structure”. A transformation may preserve one property while changing another.
2. Equivalent cases can share one proof
Suppose an argument for x > 0 has an identical reflected form for x < 0 because the expression depends only on |x|.
If the symmetry is established, one branch can be solved and the other obtained by reflection.
The proof becomes shorter without becoming weaker.
3. Symmetry must be proved or given, not guessed from appearance
A graph may look symmetric in a rough sketch while the exact function is not.
A diagram may appear isosceles while no equality is stated.
A probability device may look balanced while the question says it is biased.
Visual resemblance is not sufficient evidence for case reduction.
4. Even functions reduce left-right work
If f(−x) = f(x), then f is even.
Knowing behaviour on x ≥ 0 can determine corresponding values on x ≤ 0.
For y = x², the point (3,9) has mirror point (−3,9).
This does not mean the function is increasing on both sides; symmetry preserves output values under sign change, not monotonic direction.
5. Odd functions carry sign-reversing symmetry
If f(−x) = −f(x), then f is odd.
For f(x) = x³, f(2) = 8 implies f(−2) = −8.
The symmetry is rotational about the origin rather than reflective about the y-axis.
6. Geometry often contains interchangeable substructures
In an isosceles triangle with AB = AC, the base angles at B and C are equal.
Once this structure is established, calculations for one base angle automatically determine the other.
Equal substructures reduce independent unknowns.
7. Congruence can certify redundant geometric cases
If two triangles are congruent, corresponding lengths and angles agree.
There is no need to separately calculate every corresponding property once congruence has been proved.
A congruence proof acts as a transport certificate.
8. Similarity transports ratios, not absolute lengths
Similar triangles are equivalent in shape but not generally in size.
A solved angle transfers directly. A side length does not; it must be scaled.
This is an important warning: the preserved structure determines what may be copied.
9. Probability order symmetry can reduce work—but only when the branches really match
For two draws without replacement from a bag containing red and blue counters, the branch red-then-blue and blue-then-red may have equal probability in some configurations.
For 3 red and 2 blue, P(RB) = (3/5)(2/4) and P(BR) = (2/5)(3/4), both 3/10.
The equality comes from multiplication structure, not from a general rule that reversed branches always match.
10. Independent trials can create exact branch symmetry
For two fair coin tosses, HT and TH each have probability 1/4.
If the coin is biased but tosses are independent with P(H)=p and P(T)=1−p, both still have probability p(1−p).
The reversed order remains symmetric because multiplication commutes and the trial probabilities do not change.
11. Without replacement, branch probabilities can still be equal for one-of-each events
As above, RB and BR can match because the numerator products reverse while the denominator products are the same.
But this should be derived, not assumed.
12. Counting arrangements requires a definition of when two outcomes are distinct
If necklaces are considered the same under rotation, arrangements that look different in a fixed drawing may represent one equivalence class.
If seating positions are labelled, rotation may matter.
Case reduction depends on the identity rule of the problem.
13. Duplicate counting is the danger opposite to missing cases
Completeness asks whether every case appears.
Redundancy control asks whether any case appears more than once.
A correct counting argument needs both.
This links to Exhaustive Solutions and Completeness.
14. Inclusion-exclusion corrects overlapping categories
Count integers from 1 to 30 divisible by 2 or 3.
There are 15 multiples of 2 and 10 multiples of 3.
Multiples of 6 belong to both groups; there are 5.
Total = 15 + 10 − 5 = 20.
The subtraction removes redundant double counting.
15. Algebraic symmetry can expose substitution opportunities
The expression x² + 1/x² is unchanged if x is replaced by 1/x.
This reciprocal symmetry suggests using u = x + 1/x in suitable problems because u² = x² + 2 + 1/x².
Recognising invariance can reveal a more compact representation.
16. Symmetric expressions can reduce variable order
x + y and xy are unchanged if x and y are swapped.
Many equations involving only these symmetric combinations do not care which variable is called x or y.
The pair (2,5) and (5,2) may represent the same unordered solution depending on the question.
17. Ordered and unordered answers must not be confused
If x and y represent different roles, (2,5) and (5,2) are different ordered pairs.
If the problem asks only for two numbers without labels, the pair may be considered the same set.
Redundancy depends on role structure.
18. Sign symmetry can reduce equation solving
If an equation contains only x², then replacing x by −x leaves it unchanged.
Therefore non-zero real solutions often occur in ± pairs.
For x⁴ − 5x² + 4 = 0, solve u = x² first, then restore both sign branches where u > 0.
19. Symmetry can generate cases after one representative is solved
If one solution angle θ is known for sin θ = a, another may be generated by trigonometric symmetry, subject to the stated interval.
The representative angle does not finish the task; the symmetry rule must generate every valid partner.
20. Case reduction should never hide boundary cases
Splitting real x into positive and negative values omits zero.
A symmetry between positive and negative branches may not tell us what happens at the fixed point x = 0.
Fixed points of the symmetry often deserve separate treatment.
21. Symmetry transformations can have fixed points
Reflection x ↦ −x fixes x = 0.
Reciprocal transformation x ↦ 1/x fixes x = 1 and x = −1 over non-zero reals.
At fixed points, the “paired case” collapses into one case and must not be counted twice.
22. Rotational symmetry can reduce geometry calculations
A regular polygon repeats angle and side structure.
Rather than analyse every vertex independently, solve one vertex and multiply where appropriate.
The regularity assumption is the certificate that each vertex is equivalent.
23. Translation symmetry appears in arithmetic progressions
An arithmetic sequence has a constant difference.
Local changes between adjacent terms repeat under index translation.
This repeated structure permits compact nth-term formulas instead of separate term-by-term calculation.
24. Periodicity is symmetry under repeated shift
sin(θ + 360°) = sin θ.
The function repeats after a fixed shift.
One period can represent all periods, while the domain determines how many translated copies must be listed.
25. Modular arithmetic formalises cycle redundancy
Integers with the same remainder modulo m behave equivalently for many remainder questions.
Instead of checking every integer, check one representative from each residue class.
For divisibility by 3, every integer is equivalent to remainder 0, 1 or 2 modulo 3.
26. State compression is a general mathematical strategy
If many raw cases share the same mathematically relevant state, replace them by the state.
Example: for parity questions, exact integer value may be irrelevant; only even or odd matters.
For remainder questions, only residue class may matter.
For sign questions, only negative, zero or positive may matter.
This is case reduction by forgetting irrelevant detail while preserving the property needed for the target.
27. Redundant equations do not narrow a solution set
x + y = 10 and 2x + 2y = 20 contain the same information.
The second is an algebraic multiple of the first.
Treating them as two independent constraints would falsely suggest more information than exists.
28. Independent information must not be confused with repeated information
Two measurements may look different numerically while encoding the same underlying relation.
Data sufficiency depends on independence of constraints, not count of sentences.
29. Symmetry can support error checks
If a supposedly symmetric expression gives different outputs after swapping equivalent variables, recheck the calculation.
If a regular polygon calculation assigns different interior angles to different vertices, something is wrong unless symmetry has been intentionally broken.
30. Symmetry can be broken by conditions
The equation x² = 9 is symmetric under x ↦ −x.
The added condition x > 0 breaks the symmetry by selecting only one branch.
Constraints can convert equivalent mathematical cases into inequivalent admissible cases.
31. Efficient proof often means quotienting by symmetry
In plain language: solve one representative from each genuinely different class rather than every superficial copy.
This idea appears throughout higher Mathematics, but the school-level version is already visible in parity, congruence, periodicity, regular figures and symmetric equations.
32. A practical symmetry audit
Ask:
Which transformation appears to connect cases? What quantities does it preserve? Is the symmetry exact or merely visual? Are there fixed points or boundary cases? Are the cases genuinely distinct under the problem’s definition? Can one solved representative generate the others? Am I accidentally counting the same state twice?
33. Independent practice
1. Explain why y = x² is even.
2. If f is odd and f(4)=7, find f(−4).
3. Why may (2,5) and (5,2) be the same answer in one problem but different in another?
4. Count integers from 1 to 24 divisible by 2 or 3.
5. Solve x⁴ − 5x² + 4 = 0 using u = x².
6. Why must x = 0 be checked separately in a positive/negative symmetry argument?
7. A regular hexagon has one interior angle calculated. Why can the same angle be assigned to all six vertices?
8. Explain why x + y = 10 and 2x + 2y = 20 are redundant.
9. Give one example of periodic symmetry.
10. Why can a rough diagram not prove symmetry?
11. Give one example of state compression.
12. What is the main counting risk when equivalent cases are not recognised?
34. Worked answers
1. f(−x) = (−x)² = x² = f(x).
2. f(−4) = −7.
3. If roles are labelled, order matters; if the problem asks for an unordered pair of numbers, swapping may not create a new outcome.
4. 12 multiples of 2 + 8 multiples of 3 − 4 multiples of 6 = 16.
5. u² − 5u + 4 = 0 gives u = 1 or 4. Hence x = ±1 or ±2.
6. Zero is fixed by x ↦ −x and belongs to neither strict-sign branch.
7. Regularity makes all vertices equivalent under rotation, so interior angles are equal.
8. The second equation is exactly twice the first and adds no new restriction.
9. sin(θ + 360°) = sin θ.
10. Drawings can be approximate; symmetry must come from stated conditions or derivation.
11. Replace every integer by its parity class when only even/odd behaviour matters.
12. Duplicate counting or repeated unnecessary work.
35. Continue through Batch 07
Use Inverse Problems and Reconstruction to identify hidden quantities, Thresholds and Regime Changes when one symmetry class or rule stops applying, and Conditioning and Ill-Posedness when apparently equivalent data produce very different reconstructions.
Return to the BTT Mathematics Hub for Batch 07.