Geometric Algorithms, Constructions and Theorems — AC9M9SP03

A geometric algorithm is a precise sequence of construction steps and decisions. Good algorithms are tested on varied cases, refined for ambiguity and justified using geometric properties or theorems.

By the end of this lesson, you should be able to:

• write precise step-by-step geometric algorithms
• use constructions and theorems as decision rules
• test algorithms on ordinary and boundary cases
• identify ambiguity and refine instructions

Recall basic constructions, angle and triangle facts, congruence and similarity language, and an algorithm as an ordered procedure.

Precision matters

Each step must name the object, operation and condition clearly enough that another person can reproduce it.

Decisions can branch

An algorithm may use if/then logic, for example testing whether two constructed lengths are equal before classifying a triangle.

Test more than one friendly case

Use different orientations, sizes and edge cases. A rule that works only on the original diagram is not robust.

Refinement is mathematical reasoning

When a test fails, identify whether the issue is an ambiguous step, missing condition or incorrect theorem, then rewrite and retest.

• A diagram that looks correct proves the algorithm: Test and justify using properties, not appearance.
• More steps always make an algorithm better: Steps should be necessary, unambiguous and efficient.
• Testing one case is enough: Include different orientations and boundary cases.
• Construction can rely on ‘approximately’: Defined operations and conditions are needed for reproducibility.

1. Write an algorithm for constructing a perpendicular bisector.
2. Test it on a horizontal and slanted segment.
3. Write a decision process to classify a triangle by side lengths.
4. Identify one ambiguous instruction and refine it.

Guided method: Name the mathematical structure first, show the calculation or representation, then verify with an estimate, inverse operation, second representation or digital check.

1. Write an algorithm to construct an angle bisector.
2. Design steps to test whether a quadrilateral is a rectangle from measured or constructed properties.
3. Give a boundary case for a triangle-classification algorithm.
4. Explain why orientation should not change algorithm output.
5. Find and repair ambiguity in a supplied construction procedure.
6. State the theorem or property justifying one decision step.

An algorithm correctly identifies squares when their sides are horizontal and vertical but fails after rotation. Diagnose the hidden assumption and redesign the test using invariant geometric properties.

Reasoning standard: Make a claim, show the relevant mathematical evidence, explain why it supports the conclusion and state any condition or limitation.

What makes an algorithm reproducible?

Clear ordered instructions and explicit decision conditions.

Why test boundary cases?

They reveal hidden assumptions or incomplete conditions.

What is refinement?

Changing the algorithm in response to test evidence, then retesting it.

1. [5 marks] Write and justify a geometric construction algorithm for a stated object.
2. [6 marks] Test a supplied algorithm on three cases, identify a failure and refine the procedure.
3. [7 marks] Design a decision-based algorithm to classify a family of shapes and justify each branch using geometric properties.

Review hint: A full-mark response shows the method, keeps units and restrictions visible, interprets the result in context and checks whether the answer is reasonable.

• I can write reproducible construction steps.
• I can use if/then decisions precisely.
• I can test varied and boundary cases.
• I can identify hidden assumptions.
• I can justify decisions with geometric properties.

Exit ticket: Solve one unfamiliar example and explain the key decision in words, not just symbols.

Australian Curriculum v9.0 — AC9M9SP03: design, test and refine algorithms involving a sequence of steps and decisions based on geometric constructions and theorems; discuss and evaluate refinements

Victoria: VC2M9SP03 — Level 9 Space. The mapping names direct Level 9 content where available and explicitly identifies supporting content where the Victorian structure separates an idea differently.

NSW: Stage 5 Path — Geometrical figures and proof, supported by Working mathematically. NSW organises Years 7–10 Mathematics through Stage 5 Core content groups and Paths rather than a one-code-per-Year-9 structure, so this lesson does not force a false one-to-one outcome.

Use these links to move through the Year 9 learning sequence rather than studying the code in isolation.

• AC9M9SP02 — Enlargement, Similarity, Ratio and Scale
• AC9M9A06 — Parameter Variation and Graph Transformations

• Australian Curriculum v9.0 — Mathematics
• Victorian Curriculum F–10 Version 2.0 — Mathematics
• NSW Mathematics K–10 Syllabus (2022)

Curriculum equivalents for Design, test and refine algorithms involving a sequence of steps...

Mapped skill: design, test and refine algorithms involving a sequence of steps and decisions based on geometric constructions and theorems; discuss and evaluate refinements

These references identify matching or closely related learning. Curriculum sequence, terminology and depth vary, so teachers should use the mapped skill and lesson difficulty to confirm suitability.

Australian Curriculum v9.0 is the canonical source for this SkillrHub lesson. Victoria and NSW entries name the closest published state codes or outcomes; international entries are planning references rather than claims of identical curricula.