Problem 4 - A First Course in General Relativity

Question

(a) Let \(A\) be an \(n \times n\) matrix whose entries are all very small, \(\left|A_{i j}\right| \ll 1 / n\), and let \(I\) be the unit matrix. Show that $$ (I+A)^{-1}=I-A+A^{2}-A^{3}+A^{4}-+\ldots $$ by proving that (i) the series on the right-hand side converges absolutely for each of the \(n^{2}\) entries, and (ii) \((I+A)\) times the right-hand side equals \(I .\) (b) Use (a) to establish Eq. (8.21) from Eq. (8.20).

Step-by-Step Solution

Answer

The series converges and verifies \((I+A)(I+A)^{-1} = I\). Use this for small perturbation expansions like \((I+\epsilon B)^{-1}\).

Step 1: Understanding the Series

We start with the series representation for the inverse matrix \((I+A)^{-1}\):\[(I+A)^{-1} = I - A + A^2 - A^3 + A^4 - \ldots\]This is similar to the geometric series \(1/(1-x) = 1 + x + x^2 + x^3 + \ldots\), where \(|x| < 1\). Here, we replace \(x\) with \(A\) and note that \(|A_{ij}| \ll 1/n\), implying small norm for \(A\) and hence ensuring the convergence of the series.

Step 2: Convergence of the Series

The matrix \(A\) satisfies \(|A_{ij}| \ll 1/n\), so its norm satisfies \(\|A\| < 1\). Thus, each term \(A^k\) in the series has entries that become successively smaller, similarly to \(x^k\) in a converging geometric series. Given this, the series converges absolutely for each entry in the matrix if \(\sum_{k=0}^{\infty} \|A^k\|\) converges. Since \(\|A^k\| \leq \|A\|^k\) and \(\|A\| < 1\), the series converges.

Step 3: Verifying \\((I+A)\\) Times Series

Multiply \((I+A)\) by the series:\[(I+A)(I-A+A^2-A^3+\ldots) = I - A + A^2 - A^3 + \ldots + A - A^2 + A^3 - \ldots = I\]Each term cancels with the subsequent term in the series. The final result reduces to the identity matrix \(I\), confirming \((I+A)(I+A)^{-1} = I\).

Step 4: Applying to Equation (8.21)

Given the expression for \((I+A)^{-1}\), if Equation (8.20) involves a small perturbation \(\epsilon B\), we have:\[(I+\epsilon B)^{-1} = I - \epsilon B + \epsilon^2 B^2 - \epsilon^3 B^3 + \ldots\]This is valid since \(|\epsilon B| \ll 1\), thus making \(|\epsilon B| < 1\) which fits our established series pattern.

Key Concepts

Convergence of Series

The convergence of a series is a crucial concept in mathematics, particularly when dealing with power series or infinite series. Consider a series of the form \(a_1 + a_2 + a_3 + \ldots\). To say that this series converges means that as you add more terms together, the sum gets closer and closer to a certain value. This value is called the limit of the series.

For the geometric series, which takes the form \(1 + x + x^2 + x^3 + \ldots\), the series converges when the absolute value of \(x\) is less than 1. This is similar to what happens with the matrix \(A\) from the exercise. Here, each entry of the matrix \(A\) is very small, ensuring its norm, \(\|A\|\), is less than 1.

• If the individual terms \(a_k\) become infinitely small as \(k\) increases, and their sum approaches a specific limit, the series is said to converge.
• In the context of matrices, if \(\|A^k\| < 1\), then the series \(I - A + A^2 - A^3 + \ldots\) converges for the matrix inverse.

Determining convergence is important, as non-convergent series do not approach a meaningful sum and can lead to incorrect results.

Matrix Norm

Matrix norm is a way of measuring the size of a matrix, similar to how absolute values measure the magnitude of numbers. There are several types of norms, but for simplicity, let's focus on the most common one—the operator norm or the spectral norm.

The norm of a matrix \(A\), often denoted as \(\|A\|\), is a non-negative value that gives an indication of its "large" effect. For an \(n \times n\) matrix, this can be thought of as the amount by which this matrix can "stretch" a vector when it is multiplied by it.

• The operator norm of matrix \(A\) is defined as the maximum value of \(\|Ax\|\) divided by \(\|x\|\) over all non-zero vectors \(x\).
• In simpler terms, \[ \|A\| = \max\{\|Ax\| : x \text{ is a vector with } \|x\| = 1\} \]

In the exercise, it's crucial that \(\|A\| < 1\) for the series expansion \(I - A + A^2 - A^3 + \ldots\) to converge. Since all entries are very small, this ensures that the matrix does not excessively stretch any vector, thereby ensuring the convergence of the series used to find the inverse.

Perturbation Theory

Perturbation theory is a mathematical technique used to find an approximate solution to a problem, which cannot be solved exactly, by introducing a small change to a simple problem that can be solved exactly. This technique is beneficial in both mathematics and physics.

In the context of matrices, perturbation theory helps in understanding how a small change in a matrix, such as \(A + \epsilon B\), affects the matrix's properties, like eigenvalues or the inverse.

• A perturbation \(\epsilon B\) is considered small if \(\epsilon\) is a small scalar and \(\|B\|\) is not too large.
• This allows us to expand \((I + \epsilon B)^{-1}\) using a series similar to the geometric series, provided \(|\epsilon B| < 1\).

The exercise uses perturbation theory to express \((I + \epsilon B)^{-1}\) as \(I - \epsilon B + \epsilon^2 B^2 - \epsilon^3 B^3 + \ldots\) when \(\epsilon\) is small enough. This approach provides a handy way to handle inverse matrices when dealing with slight modifications of identity matrices.