Answering Questions That Require Multiple Applications of a Transition Matrix (VCE SSCE General Mathematics): Revision Notes
Answering Questions That Require Multiple Applications of a Transition Matrix
Introduction to matrix recurrence relations
When working with transition matrices, we often need to predict what happens over multiple time periods. For example, if we're tracking whether people go to the movies or stay home each week, we might want to know:
- How many people will be at the movies after week?
- How many after weeks?
- What about after weeks or more?
This is similar to financial problems where we track how an investment grows over time. Just as we use recurrence relations to model the growth of investments, we can use recurrence relations with matrices to model changes in populations or states over time.
Understanding how to apply transition matrices multiple times is essential for making long-term predictions in real-world scenarios, from population movements to market behavior.
The initial state matrix
Before we can track changes, we need a starting point. This is called the initial state matrix, denoted . It tells us the situation at the beginning, before any transitions have occurred.
For example, if people initially go to the movies and stay at home, the initial state matrix would be:
The initial state matrix is always your starting point. Every subsequent calculation builds from this foundation, so it's crucial to identify it correctly from the problem statement.
Matrix recurrence relations
A matrix recurrence relation is a formula that allows us to generate a sequence of state matrices, showing how the situation changes at each time step.
The General Form of a Matrix Recurrence Relation:
where:
- is the transition matrix
- is the state matrix after applications of the transition matrix (or time intervals)
- is the state matrix after applications
This formula is the foundation for tracking changes over time.
How it works
To find what happens after each time period, we multiply the transition matrix by the current state matrix:
- After time period:
- After time periods:
- After time periods:
This pattern continues for as many time periods as we need to calculate. Each new state depends only on the previous state and the transition matrix.
Worked example: using recursion to generate successive state matrices
Worked Example: Children at a Fair
Children at a fair can either go on the Ferris wheel or the Merry-go-round. At the start, children went on the Ferris wheel and children went on the Merry-go-round.
The initial state matrix is:
The transition matrix is:
Part 1: Finding the state after one turn
To predict the number of children on each ride after one turn, we calculate :
After one turn, we predict that 136 children will go on the Ferris wheel and 84 will go on the Merry-go-round.
Part 2: Finding the state after three turns
To find the state after three turns, we need to work through each step:
After two turns, :
After three turns, :
After three turns, we predict 133 children on the Ferris wheel and 87 on the Merry-go-round.
The explicit rule for large values of n
While the recurrence relation works well for a few time steps, it becomes inefficient when we need to find the state after many transitions (for example, after or years). There is a more efficient method using an explicit rule.
Understanding the pattern
Notice the following relationship between successive states:
Key Pattern Recognition:
Each time we apply the transition matrix, we're effectively multiplying by one more time. This pattern reveals that .
The explicit rule
If the recurrence relation is:
then an explicit rule for finding is:
The Explicit Rule:
where:
- is the transition matrix
- is the initial state matrix
- is the number of time intervals or applications of the transition matrix
This rule allows us to jump directly to any time period without calculating all the intermediate steps.
Worked example: modelling population growth and decay
Worked Example: Population Changes Between Cities
A study was conducted to investigate the change in the populations of Geelong () and Ballarat () due to movement of people between the two cities.
At the start of the study, the populations were:
- Geelong: people
- Ballarat: people
The initial state matrix is:
The transition matrix describing population movements from year to year is:
Part a: Predicting the population after one year
Using the recursion rule :
The predicted population of Geelong after one year is 241,500.
Part b: Predicting populations after two, three and four years
Using the recursion rule repeatedly:
- After two years:
- After three years:
- After four years:
Part c: Predicting populations after 20, 30 and 40 years
Using the explicit rule (calculations done with a calculator):
- After twenty years:
- After thirty years:
- After forty years:
Part d: Long-term behaviour
Over time, the predicted population in Geelong is declining. Initially, the population falls rapidly from to in just one year. However, the rate of decline then slows, and the population appears to stabilise at around people.
Understanding steady state and equilibrium
When we calculate population changes over many time periods, we often observe that the populations eventually become stable. This doesn't mean that nobody is moving between locations; rather, it means that the number moving in each direction is equal.
Calculating the steady state
In the Geelong and Ballarat example, when :
- Geelong's population:
- Ballarat's population:
At , we can check if the populations are in equilibrium:
Number of people moving from Geelong to Ballarat:
Number of people moving from Ballarat to Geelong:
Understanding Equilibrium:
Since these two numbers are equal, the populations are at steady state or equilibrium state. The same number of people are moving in both directions, so the overall populations remain constant.
This is a key characteristic of steady state: movement continues, but the net effect is zero change in each population.
Exam tips
Strategies for Success:
-
Always start with the initial state matrix - this is your foundation.
-
For a few time steps (like , , or periods), use the recurrence relation and work step-by-step.
-
For many time steps (like or periods), use the explicit rule with your calculator.
-
Check your dimensions: When multiplying matrices, make sure the dimensions are compatible. A transition matrix times a state matrix gives a state matrix.
-
Interpret your results: Remember what each number in your state matrix represents. The question will usually ask about a specific state or population.
-
Look for patterns: If asked about long-term behaviour, calculate several values and observe whether populations are increasing, decreasing, or stabilising.
Key Points to Remember:
-
The recurrence relation allows you to generate state matrices step-by-step, where is the initial state matrix.
-
The explicit rule provides a shortcut for finding the state matrix after transitions without calculating all intermediate steps.
-
Steady state or equilibrium state occurs when the number of items (people, objects, etc.) moving between states is equal in both directions, resulting in stable populations over time.
-
To solve these problems effectively, identify whether you need to use the recurrence relation (for a few steps) or the explicit rule (for many steps).
-
Always check that your final answer makes sense in the context of the problem - do the numbers represent realistic populations or proportions?