Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

Matemática para Mecânica Quântica

Como já estudei o básico das ferramentas matemáticas necessárias, por enquanto quero priorizar a compreensão física. Assim, aprofundarei a matemática até o nível necessário para compreender, aplicar e questionar criticamente a estrutura física em estudo. Demonstrações e desenvolvimentos puramente matemáticos podem ser deixados para quando se tornarem necessários ou quando eu decidir aprofundar os fundamentos.

Por exemplo, não é necessário, neste momento, aprofundar a demonstração do teorema espectral para matrizes Hermitianas, pois sua prova é predominantemente matemática e não acrescenta, por si só, uma nova interpretação física ao problema. Em contrapartida, vale aprofundar resultados matemáticos que estabelecem relações diretamente relevantes para a teoria física, como demonstrar que dois operadores que possuem uma mesma base completa de autovetores comutam, pois essa relação permite compreender matematicamente a compatibilidade entre observáveis.

Porém estarei compartilhando aqui uma revisão puramente matemática, uma reprodução quase na íntegra deste material: Delft University of Technology (2026).

Álgebra Linear

Aritmética Matricial Básica

Operação de Matrizes

Very often, an m×nm\times n-matrix AA with real entries represents a linear map from the space Rn\mathbb{R}^{n} of vectors of length nn to the space Rm\mathbb{R}^{m} of vectors of length mm. Similarly, a matrix with complex entries represents a linear map from Cn\mathbb{C}^{n} to Cm\mathbb{C}^{m}. This map is defined by the matrix-vector product.

Definition: Given a real (resp. complex) m×nm\times n-matrix AA, the linear map associated with AA is the map that sends each vector vRn\boldsymbol{v}\in\mathbb{R}^{n} to the vector AvRmA\boldsymbol{v}\in\mathbb{R}^{m} (resp. each vector vCn\boldsymbol{v}\in\mathbb{C}^{n} to the vector AvCmA\boldsymbol{v}\in\mathbb{C}^{m}). :::

Matrix multiplication is defined so that the product ABAB represents the linear map gotten by first applying BB and then AA. In other words, we have

(AB)v=A(Bv)(AB)\boldsymbol{v}=A(B\boldsymbol{v})

Note that on the left we have one matrix multiplication and one matrix-vector multiplication, while on the right we just have two matrix-vector multiplications. Commutators play an extremely important role in quantum physics.

Definition: Given two n×nn\times n-matrices AA and BB, the commutator of AA and BB is the n×nn\times n-matrix [A,B]=ABBA.[A,B]=AB-BA.

Definition: The transpose of an m×nm\times n-matrix AA is the n×mn\times m-matrix AA^{\top} defined by (A)i,j=Aj,i.(A^{\top})_{i,j}=A_{j,i}.

Definition: The adjoint (conjugate transpose or Hermitian transpose) of an m×nm\times n-matrix AA is the n×mn\times m-matrix AA^{\dagger} obtained by applying the complex conjugate and the transpose operation: (A)i,j=Aj,i.(A^{\dagger})_{i,j}=\overline{A_{j,i}}. The adjoint of AA is also known as the ** or ** of AA.

Definition: The trace of an n×nn\times n-matrix AA is the sum of the diagonal entries of AA: Tr(A)=i=1nAi,i.\text{Tr}\left(A\right)=\sum^{n}_{i=1}A_{i,i}.

The determinant of an n×nn\times n-matrix AA can be defined in various ways. We will make use of permutations. Using the Einstein summation convention[1] and the Levi-Civita symbol[2] commonly used in physics, we can also write this as

detA=ϵa1anA1,a1An,an\det A=\epsilon_{a_{1}\dots a_{n}}A_{1,a_{1}}\dots A_{n,a_{n}}

Properties of the determinant :

  1. A square matrix AA is invertible if and only if det(A)\det(A) is non-zero.

  2. Given two n×nn\times n-matrices AA and BB, we have det(AB)=(detA)(detB).\det(AB)=(\det A)(\det B).

  3. The determinant of a diagonal matrix (and more generally of an upper or lower triangular matrix) is the product of the diagonal entries.

  4. 4. If BB is obtained from AA by scaling a row by a scalar cc, then detB=cdetA\det B=c\det A.

  5. 5. If BB is obtained from AA by swapping two rows, then detB=detA\det B=-\det A.

  6. 6. If BB is obtained from AA by adding a multiple of a row to another row, then detB=detA\det B=\det A.

Properties 4-6 also hold for columns instead of rows.

Finally, we define the characteristic polynomial of a square matrix; this will be used in diagonalisation.

Definition: The characteristic polynomial of an n×nn\times n-matrix AA is the polynomial of degree nn in a variable tt defined by χA(t)=det(xIA).\chi_{A}(t)=\det(x\mathbb{I}-A).[3]

Basis transformations

Until now, we have been working with one specific coordinate system in which vectors are identified with their coordinate vectors with respect to the standard basis vectors:

e1=(1000),e2=(0100),,en=(0001)\boldsymbol{e}_{1}=\begin{pmatrix}1\\ 0\\ 0\\ \vdots\\ 0 \end{pmatrix},\quad\boldsymbol{e}_{2}=\begin{pmatrix}0\\ 1\\ 0\\ \vdots\\ 0 \end{pmatrix},\quad\ldots,\quad\boldsymbol{e}_{n}=\begin{pmatrix}0\\ 0\\ 0\\ \vdots\\ 1 \end{pmatrix}

In other words, a vector v=(v1v2vn)\boldsymbol{v}=\begin{pmatrix}v_{1}\\ v_{2}\\ \vdots\\ v_{n} \end{pmatrix} means the same as the corresponding linear combination of the standard basis vectors:

v=v1e1++vnen\boldsymbol{v}=v_{1}\boldsymbol{e}_{1}+\cdots+v_{n}\boldsymbol{e}_{n}

In many situations, it is useful to express vectors in a different coordinate system. For this we need the general concept of a basis.

Definition: A basis of Rn\mathbb{R}^{n} consists of nn vectors (b1,,bn)(\boldsymbol{b}_{1},\ldots,\boldsymbol{b}_{n}) (or {bi}i=1n\left\{ \boldsymbol{b}_{i}\right\} ^{n}_{i=1}) such that every vector vRn\boldsymbol{v}\in\mathbb{R}^{n} can be written in exactly one way as a linear combination:v=c1b1++cnbn\boldsymbol{v}=c_{1}\boldsymbol{b}_{1}+\cdots+c_{n}\boldsymbol{b}_{n}, with scalars c1,,cnc_{1},\ldots,c_{n}. These scalars are called the coordinates of v\boldsymbol{v} relative to {bi}i=1n\left\{ \boldsymbol{b}_{i}\right\} ^{n}_{i=1}. The vector (c1cn)T\left(\begin{array}{ccc} c_{1} & \dots & c_{n}\end{array}\right)^{T} is called the coordinate vector of v\boldsymbol{v} relative to {bi}i=1n\left\{ \boldsymbol{b}_{i}\right\} ^{n}_{i=1}.

Alternatively, a basis consists of nn vectors {bi}i=1n\left\{ \boldsymbol{b}_{i}\right\} ^{n}_{i=1} with the following two properties:

A priori, we could have defined a basis as a collection of some number (say mm) of vectors that span the space and are linearly independent. However, it can be shown that in fact any two bases contain the same number of vectors. Since the standard basis of Rn\mathbb{R}^{n} consists of nn vectors, the same therefore holds for any basis.

Suppose we have two bases of Rn\mathbb{R}^{n}, say

B=(b1,,bn)andC=(c1,,cn).B=(\boldsymbol{b}_{1},\ldots,\boldsymbol{b}_{n})\quad\text{and}\quad C=(\boldsymbol{c}_{1},\ldots,\boldsymbol{c}_{n}).

Definition: The basis transformation matrix (or change-of-basis matrix) from BB to CC is the matrix P=PBCP=P_{B\to C} such that the jj-th column of PP contains the coordinates of bj\boldsymbol{b}_{j} relative to the basis (c1,,cn)(\boldsymbol{c}_{1},\ldots,\boldsymbol{c}_{n}).

The definition of PP means:

bj=i=1nPi,jci.\boldsymbol{b}_{j}=\sum^{n}_{i=1}P_{i,j}\boldsymbol{c}_{i}.

Given a vector x\boldsymbol{x}, we write x(B)=(x1(B),,xn(B))\boldsymbol{x}^{(B)}=(x^{(B)}_{1},\ldots,x^{(B)}_{n}) for the coordinate vector of x\boldsymbol{x} with respect to the basis {bi}i=1n\left\{ \boldsymbol{b}_{i}\right\} ^{n}_{i=1}, and we define x(C)\boldsymbol{x}^{(C)} similarly. Then we calculate

x=j=1nxj(B)bj=j=1nxj(B)i=1nPi,jci=i=1n(j=1nPi,jxj(B))ci=i=1n(Px(B))ici,\begin{aligned}\boldsymbol{x} & =\sum^{n}_{j=1}x^{(B)}_{j}\boldsymbol{b}_{j}\\ & =\sum^{n}_{j=1}x^{(B)}_{j}\sum^{n}_{i=1}P_{i,j}\boldsymbol{c}_{i}\\ & =\sum^{n}_{i=1}\left(\sum^{n}_{j=1}P_{i,j}x^{(B)}_{j}\right)\boldsymbol{c}_{i}\\ & =\sum^{n}_{i=1}\bigl(P\boldsymbol{x}^{(B)}\bigr)_{i}\boldsymbol{c}_{i}, \end{aligned}

which shows that

x(C)=PBCx(B).\boldsymbol{x}^{(C)}=P_{B\to C}\boldsymbol{x}^{(B)}.

Similarly, given a linear map AA, we write A(B)A^{(B)} for the matrix of AA with respect to the basis {bi}i=1n\left\{ \boldsymbol{b}_{i}\right\} ^{n}_{i=1}, and likewise for A(C)A^{(C)}. Then A(B)A^{(B)} and A(C)A^{(C)} are related by

A(C)=PA(B)P1A^{(C)}=PA^{(B)}P^{-1}

Namely, consider what happens when we multiply this matrix to a coordinate vector of the form x(C)\boldsymbol{x}^{\left(C\right)}. First, applying P1P^{-1}[4] to x(C)\boldsymbol{x}^{\left(C\right)} gives x(B)\boldsymbol{x}^{\left(B\right)}. Next, applying A(B)A^{(B)} gives (Ax)(B)(A\boldsymbol{x})^{(B)}. Finally, applying PP gives (Ax)(C)(A\boldsymbol{x})^{(C)}, which is what we wanted to show.

The trace and the determinant are invariant under basis transformation: if AA and PP are square matrices of the same size with PP invertible, then we have

Tr(PAP1)=Tr(A)anddet(PAP1)=detA.\text{Tr}(PAP^{-1})=\text{Tr}\left(A\right)\quad\text{and}\quad\det(PAP^{-1})=\det A.

Because the characteristic polynomial is also defined as a determinant, it too is invariant under basis transformation.

Diagonalisation

Hilbert Spaces

Operators on Hilbert spaces

Tensor products

Footnotes
  1. Einstein notation is a notational convention that implies summation over a set of indexed terms in a formula, thus achieving brevity. There are essentially three rules of Einstein summation notation, namely: 1) Repeated indices are implicitly summed over. 2) Each index can appear at most twice in any term. 3) Each term must contain identical non-repeated indices (Wolfram MathWorld).

  2. More generally, in nn dimensions, the Levi-Civita symbol is defined by: +1 if (a1,,an)\left(a_{1},\dots,a_{n}\right)is an even permutation from (1,2,,n)\left(1,2,\dots,n\right), -1 if is an odd permutation and 0 otherwhise.

  3. An alternative definition of the characteristic polynomial, which agrees with the one above up to a factor (1)n(-1)^{n}, is χA(t)=det(AxI).\chi_{A}(t)=\det(A-x\mathbb{I}).

  4. Note que se x(C)=Px(B)\boldsymbol{x}^{(C)}=P\boldsymbol{x}^{(B)}e sendo P1P=IP^{-1}P=\mathbb{I}, então P1x(C)=x(B)P^{-1}\boldsymbol{x}^{(C)}=\boldsymbol{x}^{(B)}, o seja P1=PCBP^{-1}=P_{C\rightarrow B}

References
  1. Delft University of Technology. (n.d.). Mathematics for Quantum Physics. Retrieved August 31, 2026, from https://interactivetextbooks.tudelft.nl/mqp-v2/