# 11 Introduction to Multiple Regression

In the chapters in Part 3 of this book, we will introduce and develop multiple ordinary least squares regression – that is, linear regression models using two or more independent (or explanatory) variables to predict a dependent variable. Most users simply refer to it as “multiple regression”.^{20} This chapter will provide the background in matrix algebra that is necessary to understand both the logic of, and notation commonly used for, multiple regression. As we go, we will apply the matrix form of regression in examples using R to provide a basic understanding of how multiple regression works. Chapter 12 will focus on the key assumptions about the concepts and data that are necessary for OLS regression to provide unbiased and efficient estimates of the relationships of interest, and it will address the key virtue of multiple regressions – the application of “statistical controls” in modeling relationships through the estimation of partial regression coefficients. Chapter 13 will turn to the process and set of choices involved in specifying and estimating multiple regression models, and to some of the automated approaches to model building you’d best avoid (and why). Chapter 13 turns to some more complex uses of multiple regression, such as the use and interpretation of “dummy” (dichotomous) independent variables, and modeling interactions in the effects of the independent variables. Chapter 14 concludes this part of the book with the application of diagnostic evaluations to regression model residuals, which will allow you to assess whether key modeling assumptions have been met and – if not – what the implications are for your model results. By the time you have mastered the chapters in this section, you will be well primed for understanding and using multiple regression analysis.

## 11.1 Matrix Algebra and Multiple Regression

Matrix algebra is widely used for the derivation of multiple regression because it permits a compact, intuitive depiction of regression analysis. For example, an estimated multiple regression model in scalar notion is expressed as: \(Y = A + BX_1 + BX_2 + BX_3 + E\). Using matrix notation, the same equation can be expressed in a more compact and (believe it or not!) intuitive form: \(y = Xb + e\).

In addition, matrix notation is flexible in that it can handle any number of independent variables. Operations performed on the model matrix \(X\), are performed on all independent variables simultaneously. Lastly, you will see that matrix expression is widely used in statistical presentations of the results of OLS analysis. For all these reasons, then, we begin with the development of multiple regression in matrix form.

## 11.2 The Basics of Matrix Algebra

A matrix is a rectangular array of numbers with rows and columns. As noted, operations performed on matrices are performed on all elements of a matrix simultaneously. In this section we provide the basic understanding of matrix algebra that is necessary to make sense of the expression of multiple regression in matrix form.

### 11.2.1 Matrix Basics

The individual numbers in a matrix are referred to as “elements”. The elements of a matrix can be identified by their location in a row and column, denoted as \(A_{r,c}\). In the following example, \(m\) will refer to the matrix row and \(n\) will refer to the column.

\(A_{m,n} = \begin{bmatrix} a_{1,1} & a_{1,2} & \cdots & a_{1,n} \\ a_{2,1} & a_{2,2} & \cdots & a_{2,n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{m,1} & a_{m,2} & \cdots & a_{m,n} \end{bmatrix}\)

Therefore, in the following matrix;

\(A = \begin{bmatrix} 10 & 5 & 8 \\ -12 & 1 & 0 \end{bmatrix}\)

element \(a_{2,3} = 0\) and \(a_{1,2} = 5\).

### 11.2.2 Vectors

A vector is a matrix with single column or row. Here are some examples:

\(A = \begin{bmatrix} 6 \\ -1 \\ 8 \\ 11 \end{bmatrix}\)

or

\(A = \begin{bmatrix} 1 & 2 & 8 & 7 \\ \end{bmatrix}\)

### 11.2.3 Matrix Operations

There are several “operations” that can be performed with and on matrices. Most of the these can be computed with `R`

, so we will use `R`

examples as we go along. As always, you will understand the operations better if you work the problems in `R`

as we go. There is no need to load a data set this time – we will enter all the data we need in the examples.

### 11.2.4 Transpose

Transposing, or taking the “prime” of a matrix, switches the rows and columns.^{21} The matrix

\(A = \begin{bmatrix} 10 & 5 & 8 \\ -12 & 1 & 0 \end{bmatrix}\)

Once transposed is:

\(A' = \begin{bmatrix} 10 & -12 \\ 5 & 1 \\ 8 & 0 \end{bmatrix}\)

Note that the operation “hinges” on the element in the upper right-hand corner of \(A\), \(A_{1,1}\), so the first column of \(A\) becomes the first row on \(A'\). To transpose a matrix in `R`

, create a matrix object then simply use the `t`

command.

```
A <- matrix(c(10,-12,5,1,8,0),2,3)
A
```

```
## [,1] [,2] [,3]
## [1,] 10 5 8
## [2,] -12 1 0
```

`t(A)`

```
## [,1] [,2]
## [1,] 10 -12
## [2,] 5 1
## [3,] 8 0
```

### 11.2.5 Adding Matrices

To add matrices together, they must have the same *dimensions*, meaning that the matrices must have the same number of rows and columns. Then, you simply add each element to its counterpart by row and column. For example:

\(A = \begin{bmatrix} 4 & -3 \\ 2 & 0 \end{bmatrix} + B = \begin{bmatrix} 8 & 1 \\ 4 & -5 \end{bmatrix} = A+B = \begin{bmatrix} 4+8 & -3+1 \\ 2+4 & 0+(-5) \end{bmatrix} = \begin{bmatrix} 12 & -2 \\ 6 & -5 \end{bmatrix}\)

To add matrices together in `R`

, simply create two matrix objects and add them together.

```
A <- matrix(c(4,2,-3,0),2,2)
A
```

```
## [,1] [,2]
## [1,] 4 -3
## [2,] 2 0
```

```
B <- matrix(c(8,4,1,-5),2,2)
B
```

```
## [,1] [,2]
## [1,] 8 1
## [2,] 4 -5
```

`A + B`

```
## [,1] [,2]
## [1,] 12 -2
## [2,] 6 -5
```

See – how easy is that? No need to be afraid of a little matrix algebra!

### 11.2.6 Multiplication of Matrices

To multiply matrices they must be **conformable**, which means the number of *columns* in the first matrix must match the number of *rows* in the second matrix.

Then, multiply column elements by the row elements, as shown here:

\(A = \begin{bmatrix} 2 & 5 \\ 1 & 0 \\ 6 & -2 \end{bmatrix} * B = \begin{bmatrix} 4 & 2 & 1 \\ 5 & 7 & 2 \end{bmatrix} = A X B = \\ \begin{bmatrix} (2 X 4)+(5 X 5) & (2 X 2)+(5 X 7) & (2 X 1)+(5 X 2) \\ (1 X 4)+(0 X 5) & (1 X 2)+(0 X 7) & (1 X 1)+(0 X 2) \\ (6 X 4)+(-2 X 5) & (6 X 2)+(-2 X 7) & (6 X 1)+(-2 X 2) \end{bmatrix} = \begin{bmatrix} 33 & 39 & 12 \\ 4 & 2 & 1 \\ 14 & -2 & 2 \end{bmatrix}\)

To multiply matrices in `R`

, create two matrix objects and multiply them using the `\%*\%`

command.

```
A <- matrix(c(2,1,6,5,0,-2),3,2)
A
```

```
## [,1] [,2]
## [1,] 2 5
## [2,] 1 0
## [3,] 6 -2
```

```
B <- matrix(c(4,5,2,7,1,2),2,3)
B
```

```
## [,1] [,2] [,3]
## [1,] 4 2 1
## [2,] 5 7 2
```

`A %*% B`

```
## [,1] [,2] [,3]
## [1,] 33 39 12
## [2,] 4 2 1
## [3,] 14 -2 2
```

### 11.2.7 Identity Matrices

The identity matrix is a square matrix with 1’s on the diagonal and 0’s elsewhere. For a 4 x 4 matrix, it looks like this:

\(I = \begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix}\)

It acts like a 1 in algebra; a matrix (\(A\)) times the identity matrix (\(I\)) is \(A\). This can be demonstrated in `R`

.

```
A <- matrix(c(5,3,2,4),2,2)
A
```

```
## [,1] [,2]
## [1,] 5 2
## [2,] 3 4
```

```
I <- matrix(c(1,0,0,1),2,2)
I
```

```
## [,1] [,2]
## [1,] 1 0
## [2,] 0 1
```

`A %*% I`

```
## [,1] [,2]
## [1,] 5 2
## [2,] 3 4
```

Note that, if you want to square a column matrix (that is, multiply it by itself), you can simply take the transpose of the column (thereby making it a row matrix) and multiply them. The square of column matrix \(A\) is \(A'A\).

### 11.2.8 Matrix Inversion

The matrix inversion operation is a bit like dividing any number by itself in algebra. An inverse of the \(A\) matrix is denoted \(A^{-1}\). Any matrix multiplied by its inverse is equal to the identity matrix:

\[\begin{equation*} AA^{-1} = A^{-1}A = I \end{equation*}\]For example,

\(A = \begin{bmatrix} 1 & -1 \\ -1 & -1 \end{bmatrix} \text{and } A^{-1} = \begin{bmatrix} 0.5 & -0.5 \\ -0.5 & 0.5 \end{bmatrix} \text{therefore } A*A^{-1} = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}\)

However, matrix inversion is only applicable to a square (i.e., number of rows equals number of columns) matrix; only a square matrix can have an inverse.

#### Finding the Inverse of a Matrix

To find the inverse of a matrix, the values that will produce the identity matrix, create a second matrix of variables and solve for \(I\).

\(A = \begin{bmatrix} 3 & 1 \\ 2 & 4 \end{bmatrix} X \begin{bmatrix} a & b \\ c & d \end{bmatrix} = \begin{bmatrix} 3a+b & 3c+d \\ 2a+4b & 2c+4d \end{bmatrix} = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}\)

Set \(3a+b=1\) and \(2a+4b=0\) and solve for \(a\) and \(b\). In this case \(a = \frac{2}{5}\) and \(b = -\frac{1}{5}\). Likewise, set \(3c+d=0\) and \(2c+4d=1\); solving for \(c\) and \(d\) produces \(c=-\frac{1}{10}\) and \(d=\frac{3}{10}\). Therefore,

\(A^{-1} = \begin{bmatrix} \frac{2}{5} & -\frac{1}{10} \\ -\frac{1}{5} & \frac{3}{10} \end{bmatrix}\)

Finding the inverse matrix can also be done in `R`

using the `solve`

command.

```
A <- matrix(c(3,2,1,4),2,2)
A
```

```
## [,1] [,2]
## [1,] 3 1
## [2,] 2 4
```

```
A.inverse <- solve(A)
A.inverse
```

```
## [,1] [,2]
## [1,] 0.4 -0.1
## [2,] -0.2 0.3
```

`A %*% A.inverse`

```
## [,1] [,2]
## [1,] 1 0
## [2,] 0 1
```

OK – now we have all the pieces we need to apply matrix algebra to multiple regression.

## 11.3 OLS Regression in Matrix Form

As was the case with simple regression, we want to minimize the sum of the squared errors, \(e\). In matrix notation, the OLS model is \(y=Xb+e\), where \(e = y-Xb\). The sum of the squared \(e\) is:

\[\begin{equation} \sum e^{2}_i = \begin{bmatrix} e_1 & e_2 & \cdots & e_n \\ \end{bmatrix} \begin{bmatrix} e_1 \\ e_2 \\ \vdots \\ e_n \\ \end{bmatrix} = e'e \tag{11.1} \end{equation}\]Therefore, we want to find the \(b\) that minimizes this function:

\[\begin{align*} e'e &= (y-Xb)'(y-Xb) \\ &=y'y-b'X'y-y'Xb+b'X'Xb \\ &=y'y-2b'X'y+b'X'Xb \\ \end{align*}\]To do this we take the derivative of \(e'e\) w.r.t \(b\) and set it equal to \(0\).

\[\begin{equation*} \frac{\partial e'e}{\partial b}=-2X'y+2X'Xb=0 \end{equation*}\] To solve this we subtract \(2X'Xb\) from both sides: \[\begin{equation*} -2X'Xb=-2X'y \end{equation*}\]Then to remove the \(-2\)’s, we multiply each side by \(-1/2\). This leaves us with:

\[\begin{equation*} (X'X)b=X'y \end{equation*}\]To solve for \(b\) we multiply both sides by the inverse of \(X'X, (X'X)^{-1}\). Note that for matrices this is equivalent to dividing each side by \(X'X\). Therefore:

\[\begin{equation} b = (X'X)^{-1}X'y \tag{11.2} \end{equation}\]The \(X'X\) matrix is square, and therefore invertible (i.e., the inverse exists). However, the \(X'X\) matrix can be non-invertible (i.e., singular) if \(n < k\)—the number of \(k\) independent variables exceeds the \(n\)-size—or if one or more of the independent variables is perfectly correlated with another independent variable. This is termed perfect **multicollinearity** and will be discussed in more detail in Chapter 14. Also note that the \(X'X\) matrix contains the basis for all the necessary means, variances, and covariances among the \(X\)’s.

#### Regression in Matrix Form

Assume a model using \(n\) observations, \(k\) parameters, and \(k-1\), \(X_{i}\) (independent) variables.\[\begin{align*} y &= Xb+e \\ \hat{y} &= Xb \\ b &= (X'X)^{-1}X'y \end{align*}\]

- \(y=n*1\) column vector of observations of the DV, \(Y\)
- \(\hat{y}=n*1\) column vector of predicted \(Y\) values
- \(X=n*k\) matrix of observations of the IVs; first column \(1\)s
- \(b=k*1\) column vector of regression coefficients; first row is \(A\)
- \(e=n*1\) column vector of \(n\) residual values

Using the following steps, we will use `R`

to calculate \(b\), a vector of regression coefficients; \(\hat y\), a vector of predicted \(y\) values; and \(e\), a vector of residuals.

We want to fit the model \(y = Xb+e\) to the following matrices:

\[ y = \begin{bmatrix} 6 \\ 11 \\ 4 \\ 3 \\ 5 \\ 9 \\ 10 \end{bmatrix}\quad X = \begin{bmatrix} 1 & 4 & 5 & 4 \\ 1 & 7 & 2 & 3 \\ 1 & 2 & 6 & 4 \\ 1 & 1 & 9 & 6 \\ 1 & 3 & 4 & 5 \\ 1 & 7 & 3 & 4 \\ 1 & 8 & 2 & 5 \end{bmatrix} \]

Create two objects, the \(y\) matrix and the \(X\) matrix.

```
y <- matrix(c(6,11,4,3,5,9,10),7,1)
y
```

```
## [,1]
## [1,] 6
## [2,] 11
## [3,] 4
## [4,] 3
## [5,] 5
## [6,] 9
## [7,] 10
```

```
X <- matrix(c(1,1,1,1,1,1,1,4,7,2,1,3,7,8,5,2,6,9,4,3,2,4,3,4,6,5,4,5),7,4)
X
```

```
## [,1] [,2] [,3] [,4]
## [1,] 1 4 5 4
## [2,] 1 7 2 3
## [3,] 1 2 6 4
## [4,] 1 1 9 6
## [5,] 1 3 4 5
## [6,] 1 7 3 4
## [7,] 1 8 2 5
```

Calculate \(b\): \(b = (X'X)^{-1}X'y\).

We can calculate this in `R`

in just a few steps. First, we transpose \(X\) to get \(X'\).

```
X.prime <- t(X)
X.prime
```

```
## [,1] [,2] [,3] [,4] [,5] [,6] [,7]
## [1,] 1 1 1 1 1 1 1
## [2,] 4 7 2 1 3 7 8
## [3,] 5 2 6 9 4 3 2
## [4,] 4 3 4 6 5 4 5
```

Then we multiply \(X\) by \(X'\); (\(X'X\)).

```
X.prime.X <- X.prime %*% X
X.prime.X
```

```
## [,1] [,2] [,3] [,4]
## [1,] 7 32 31 31
## [2,] 32 192 104 134
## [3,] 31 104 175 146
## [4,] 31 134 146 143
```

Next, we find the inverse of \(X'X\); \(X'X^{-1}\)

```
X.prime.X.inv<-solve(X.prime.X)
X.prime.X.inv
```

```
## [,1] [,2] [,3] [,4]
## [1,] 12.2420551 -1.04528602 -1.01536017 -0.63771186
## [2,] -1.0452860 0.12936970 0.13744703 -0.03495763
## [3,] -1.0153602 0.13744703 0.18697034 -0.09957627
## [4,] -0.6377119 -0.03495763 -0.09957627 0.27966102
```

Then, we multiply \(X'X^{-1}\) by \(X'\).

```
X.prime.X.inv.X.prime<-X.prime.X.inv %*% X.prime
X.prime.X.inv.X.prime
```

```
## [,1] [,2] [,3] [,4] [,5] [,6]
## [1,] 0.43326271 0.98119703 1.50847458 -1.7677436 1.8561970 -0.6718750
## [2,] 0.01959746 0.03032309 -0.10169492 0.1113612 -0.2821769 0.1328125
## [3,] 0.07097458 0.02198093 -0.01694915 0.2073623 -0.3530191 0.1093750
## [4,] -0.15677966 -0.24258475 -0.18644068 0.1091102 0.2574153 -0.0625000
## [,7]
## [1,] -1.33951271
## [2,] 0.08977754
## [3,] -0.03972458
## [4,] 0.28177966
```

Finally, to obtain the \(b\) vector we multiply \(X'X^{-1}X'\) by \(y\).

```
b<-X.prime.X.inv.X.prime %*% y
b
```

```
## [,1]
## [1,] 3.96239407
## [2,] 1.06064619
## [3,] 0.04396186
## [4,] -0.48516949
```

We can use the `lm`

function in `R`

to check and see whether our “by hand” matrix approach gets the same result as does the “canned” multiple regression routine:

`lm(y~0+X)`

```
##
## Call:
## lm(formula = y ~ 0 + X)
##
## Coefficients:
## X1 X2 X3 X4
## 3.96239 1.06065 0.04396 -0.48517
```

Calculate \(\hat y\): \(\hat y=Xb\).

To calculate the \(\hat y\) vector in `R`

, simply multiply `X`

and `b`

.

```
y.hat <- X %*% b
y.hat
```

```
## [,1]
## [1,] 6.484110
## [2,] 10.019333
## [3,] 4.406780
## [4,] 2.507680
## [5,] 4.894333
## [6,] 9.578125
## [7,] 10.109640
```

Calculate \(e\).

To calculate \(e\), the vector of residuals, simply subtract the vector \(y\) from the vector \(\hat y\).

```
e <- y-y.hat
e
```

```
## [,1]
## [1,] -0.4841102
## [2,] 0.9806674
## [3,] -0.4067797
## [4,] 0.4923199
## [5,] 0.1056674
## [6,] -0.5781250
## [7,] -0.1096398
```

## 11.4 Summary

Whew! Now, using matrix algebra **and** calculus, you have derived the squared-error minimizing formula for multiple regression. Not only that, you can use the matrix form, in `R`

, to calculate the estimated slope and intercept coefficients, predict \(Y\), and even calculate the regression residuals. We’re on our way to true Geekdome!

Next stop: the key assumptions necessary for OLS to provide the best, unbiased, linear estimates (BLUE) and the basis for statistical controls using multiple independent variables in regression models.

It is useful to keep in mind the difference between “multiple regression” and “multivariate regression”. The latter predicts 2 or more dependent variables using an independent variable.↩

The use of “prime” in matrix algebra should not be confused with the use of ``prime" in the expression of a derivative, as in \(X'\).↩