Week A

8.1 Functions of two variables

R: dependent variable
x and y are the independent variables.

The collection of all possible inputs, (x,y) is called the domain of f.

Increasing (decreasing) function of one of its variables if it increases (decreases) as that variable
increases while the other independent variables are held constant.

Many rows and columns are needed because the function has an output for every pair of values
of the independent variables.

Example

Give a formula for the function M=f(B,t) where M is the amount of money in a bank account t
years after an initial investment of B thousand dollars, if interest accrues at a rate of 5% per year
compounded
(a)Annually
M=f(B,t)=B(1.05)t
(b)Continuously
M=f(B,t)=Be0.05t
 Week B

16.1 introduction to systems of linear equations

Homogeneous linear equation in the variables x1, x2, ..., xn. b=0,

All variables occur only to the first power

Do not appear, trigonometric, logarithmic, or exponential functions.

Linear equations:

Not linear equations:

General linear system of m equations in the n unknowns x1,x2,...xn can be written as

A solution of a linear system in n unknowns x1,x2,...xn is a sequence of n numbers s1,s2,..,sn for

which the substitution:

Solutions can be written as

or

Ordered n-tuple,
n=2, ordered pair,
n=3, ordered triple.
 Linear systems in two and three unknowns.

Linear system is consistent, at least one solution, inconsistent, no solutions

Three unknowns:

Every system of linear equations has zero, one, or infinitely many solutions.
There are no other possibilities.

A linear system with infinitely many solutions

2 & 3 are multiples of 1.

Can first solving this equation for x in terms of y and z, and then assigning arbitrary values r and s
(parameters) to these two variables, and the expressing the solution by the three parametric
equations
Augmented Matrices and Elementary Row Operations

This is the augmented matrix for the system

Elementary row operations on a matrix

1.multiply a row through by a nonzero constant

2.Interchange two rows
3.Add a constant times one row to another.

A linear system whose equations are all homogeneous must be consistent

 16.2
Gaussian Elimination
Reduced Row echelon form
1. If a row does not consist entirely of zeros, then the first nonzero number in the row is a
(Leading 1)
2. If there are any rows that consist entirely of zeros, then they are grouped together at the
bottom of the matrix.
3. In any two successive rows that do not consist entirely of zeros, the leading 1 in the lower row
occurs farther to the right than the leading 1 in the higher row.
4. Each column that contains a leading 1 has zeros everywhere else in that column.

An example:

REF： zeros below each leading 1

RREF: zeros below and above each leading 1.

REF

Leading 1: leading variables,

 Remaining variables: free variables.

Solve the system

When t=0

General solution of the system: If linear system has infinitely many solutions, a set of parametric
equations (with parameters)

r,s,t
More than three unknowns, t1,t2,t3...

Elimination methods:
Gauss-Jordan elimination: RREF, forward phase (zeros below leading 1), backward phase (zeros
above leading 1’s)
Gaussian elimination: REF

Homogeneous linear systems

Every homogeneous system of linear equations is consistent because all such systems have x1=0,
x2=0,...xn=0 as a solution. This solution is called the trivial solution, if there are other solutions,
they are called nontrivial solutions.

Only two possible solutions

The system has only the trivial solution
The system has infinitely many solutions in addition to the trivial solution.

Free Variable theorem for homogeneous systems

If a homogeneous linear system has n unknowns, and if the reduced row echelon form of its
augmented matrix has r nonzero rows, then the system has n-r free variables.

A homogeneous linear system with more unknowns than equations has infinitely may solutions.

Solution a, inconsistent
Solution b, infinitely many solutions
Solution c, unique solution

Some facts about echelon forms

1.Every matrix has a unique RREF.
2.REF forms are not unique, different sequences can result in different row echelon forms.
3.Both RREF and REF of a matrix A have the same number of zero rows, and the leading 1’s
always occur in the same positions. These positions are called the pivot positions of A. And the
rows containing the leading 1’s are called the pivot rows of A. A nonzero entry in a pivot position
of A is called a pivot of A.
 Week C
16.3 Matrices and matrix operations

A matrix is a rectangular array of numbers. The numbers in the array are called the entries of
the matrix.

Size of matrix is described in terms of the number of rows and columns.

Matrix with one row, row vector (row matrix)

Matrix with one column, column vector (column matrix)

A matrix A with n rows and n columns is called a square matrix of order n, and the shaded
entries a11,a22,..., ann, in are said to be on the main diagonal of A.

Two matrices are defined to be equal if they have the same size and their corresponding entries
are equal.

Matrices of different sizes cannot be added or subtracted.

Row-column rule for matrix multiplication

A matrix can be subdivided or partitioned into smaller matrices by inserting horizontal and
vertical rules between selected rows and columns.

Partitioning, finding particular rows or columns of a matrix product AB without computing the
entire product.
Matrix multiplication by columns and by rows

Matrix products as linear combinations

 Column-Row Expansion
Matrix A (m*r), partitioned into its r column vectors, c1,c2, ...cr (each size m*1),
Matrix B (r*n), partitioned into its r row vectors r1,r2,...r3 (each of size 1*n).

Matrix form of a linear system

Transpose of a matrix

n*n
 Week D
17.6
Two-person zero-sum matrix game, zero-sum means that each play of the game, the positive
gain of one player is equal to the negative gain (loss) of the other player.

Payoff matrix of the game:

If an entry aij is negative, we mean that player C receives a payoff of |aij| from player R.
 Row vector p the strategy of player R, Column vector q the strategy of player C.

Expected payoff to player R.

Possible to have several saddle points, but the uniqueness of the value of a game
guarantees that the numerical values of all saddle points are the same.

2*2 Matrix Games

If there is a saddle point, optimal strategies for the two players can be found by using the
previous strategy.

If the game is not strictly determined:

Practice questions:
A game has a payoff matrix

If players R and C use strategies

1.3
Relative Change:

Week E
2.1-2.2

2.2
Derivative function
Improving numerical estimates for the derivative.
We used the point to the right to estimate for the derivative, however we can average these two
slopes 1/2*(slope to the left+slope to right)

We will usually estimate the derivative by going to the right.

Week F
2.3-2.5

2.3interpretations of the derivative

Using the derivative to estimate values of a function

Relative rate of change:

2.4 second derivative

 2.5 Marginal cost and revenue
R=pq

Week G
3.1

3.2 Exponential and logarithmic functions

3.4
Week H
3.3