본문으로 건너뛰기

Multilinear Algebra and Determinants

9A. Bilinear Forms and Quadratic Forms

1) Bilinear Form

Bilinear Form

A bilinear form on VV is a function

β:V×VF\beta:V\times V\to\mathbb{F}

that is linear in each argument separately.

Meaning: A bilinear form takes two vectors and produces a scalar, behaving linearly in either vector when the other is fixed.

2) Space of Bilinear Forms

V(2)V^{(2)}

The set of all bilinear forms on VV is denoted by

V(2).V^{(2)}.

It is a vector space.

Meaning: Bilinear forms themselves can be added and multiplied by scalars.

3) Matrix of a Bilinear Form

Matrix of a Bilinear Form

Suppose

e1,,ene_1,\ldots,e_n

is a basis of VV.

The matrix of a bilinear form β\beta is defined by

M(β)j,k=β(ej,ek).\mathcal{M}(\beta)_{j,k} = \beta(e_j,e_k).

Meaning: A bilinear form is completely represented by its values on pairs of basis vectors.

Dimension

dimV(2)=(dimV)2.\dim V^{(2)} = (\dim V)^2.

Meaning: An nn-dimensional vector space requires n2n^2 scalar values to specify a bilinear form.

4) Change of Basis

Change-of-Basis Formula

If AA and BB represent the same bilinear form in two bases and CC is the corresponding change-of-basis matrix, then

A=CtBC.A=C^tBC.

Meaning: Bilinear-form matrices change by multiplication with the transpose of the basis-change matrix on one side.

5) Symmetric Bilinear Form

Symmetric Bilinear Form

A bilinear form ρ\rho is symmetric if

ρ(u,w)=ρ(w,u)\rho(u,w)=\rho(w,u)

for all u,wVu,w\in V.

Meaning: Swapping the two input vectors does not change the value.

Symmetric Matrix

A square matrix AA is symmetric if

A=At.A=A^t.

Meaning: A symmetric matrix is unchanged by transposition.

6) Symmetric Bilinear Forms and Matrices

Symmetry Criterion

A bilinear form ρ\rho is symmetric if and only if its matrix is symmetric with respect to any basis.

Meaning: Symmetry is a property of the bilinear form itself, not of a particular basis.

7) Diagonalization of a Symmetric Bilinear Form

Diagonalization

Every symmetric bilinear form has a diagonal matrix with respect to some basis.

Meaning: A suitable basis removes all cross terms from a symmetric bilinear form.

Real Inner Product Case

If VV is a real inner product space, the basis can be chosen to be orthonormal.

Meaning: Over a real inner product space, a symmetric bilinear form can be diagonalized without losing orthonormality.

8) Alternating Bilinear Form

Alternating Bilinear Form

A bilinear form α\alpha is alternating if

α(v,v)=0\alpha(v,v)=0

for every vVv\in V.

Meaning: An alternating bilinear form vanishes whenever its two inputs are equal.

Equivalent Condition

α(u,w)=α(w,u).\alpha(u,w) = -\alpha(w,u).

Meaning: Swapping the two vectors reverses the sign.

9) Decomposition of Bilinear Forms

Symmetric-Alternating Decomposition

Every bilinear form can be uniquely written as the sum of a symmetric and an alternating bilinear form.

V(2)=Vsym(2)Valt(2).V^{(2)} = V_{\mathrm{sym}}^{(2)} \oplus V_{\mathrm{alt}}^{(2)}.

For βV(2)\beta\in V^{(2)},

ρ(u,w)=β(u,w)+β(w,u)2,\rho(u,w) = \frac{\beta(u,w)+\beta(w,u)}{2},

and

α(u,w)=β(u,w)β(w,u)2.\alpha(u,w) = \frac{\beta(u,w)-\beta(w,u)}{2}.

Meaning: Every bilinear form splits uniquely into a symmetric part and an antisymmetric part.

10) Quadratic Form

Quadratic Form

For a bilinear form β\beta, define

qβ(v)=β(v,v).q_\beta(v) = \beta(v,v).

A function

q:VFq:V\to\mathbb{F}

is a quadratic form if

q=qβq=q_\beta

for some bilinear form β\beta.

Meaning: A quadratic form is obtained by applying a bilinear form to the same vector twice.

11) Symmetric Bilinear Form Associated with a Quadratic Form

Unique Symmetric Bilinear Form

Every quadratic form qq has a unique symmetric bilinear form ρ\rho such that

q(v)=ρ(v,v).q(v)=\rho(v,v).

It can be recovered from qq by

ρ(u,w)=q(u+w)q(u)q(w)2.\rho(u,w) = \frac{ q(u+w)-q(u)-q(w) }{2}.

Meaning: A quadratic form contains exactly the information of one symmetric bilinear form.

12) Homogeneity of a Quadratic Form

Quadratic Scaling

For every λF\lambda\in\mathbb{F},

q(λv)=λ2q(v).q(\lambda v) = \lambda^2q(v).

Meaning: Scaling a vector by λ\lambda scales its quadratic value by λ2\lambda^2.

13) Diagonalization of a Quadratic Form

Diagonal Form

For every quadratic form qq, there exist a basis

e1,,ene_1,\ldots,e_n

and scalars

λ1,,λn\lambda_1,\ldots,\lambda_n

such that

q(x1e1++xnen)=λ1x12++λnxn2.q(x_1e_1+\cdots+x_ne_n) = \lambda_1x_1^2+\cdots+\lambda_nx_n^2.

Meaning: Every quadratic form can be expressed without cross terms using a suitable basis.

Real Inner Product Case

If VV is a real inner product space, the basis can be chosen to be orthonormal.

Meaning: Real quadratic forms can be diagonalized using perpendicular unit directions.

9B. Alternating Multilinear Forms

1) Multilinear Form

mm-Linear Form

An mm-linear form is a function

β:VmF\beta:V^m\to\mathbb{F}

that is linear in each argument when all other arguments are fixed.

Meaning: A multilinear form generalizes a bilinear form from two inputs to any finite number of inputs.

V(m)V^{(m)}

The vector space of all mm-linear forms on VV is denoted by

V(m).V^{(m)}.

Meaning: V(m)V^{(m)} contains all scalar-valued functions that are linear in each of mm vector arguments.

2) Alternating Multilinear Form

Alternating mm-Linear Form

An mm-linear form α\alpha is alternating if

α(v1,,vm)=0\alpha(v_1,\ldots,v_m)=0

whenever two of the input vectors are equal.

Meaning: An alternating form vanishes when two input directions are repeated.

3) Alternating Forms and Linear Dependence

Linear Dependence Property

If

v1,,vmv_1,\ldots,v_m

is linearly dependent and α\alpha is alternating, then

α(v1,,vm)=0.\alpha(v_1,\ldots,v_m)=0.

Meaning: An alternating form can produce a nonzero value only from sufficiently independent input directions.

4) Too Many Inputs

Dimension Restriction

If

m>dimV,m>\dim V,

then the only alternating mm-linear form on VV is the zero form.

Meaning: More vectors than the dimension of the space must be linearly dependent.

5) Swapping Inputs

Sign Change

Swapping any two inputs of an alternating multilinear form changes its sign.

α(,vj,,vk,)=α(,vk,,vj,).\alpha(\ldots,v_j,\ldots,v_k,\ldots) = -\alpha(\ldots,v_k,\ldots,v_j,\ldots).

Meaning: Each swap contributes a factor of 1-1.

6) Permutation

Permutation

A permutation of

(1,,m)(1,\ldots,m)

is a rearrangement containing every number 1,,m1,\ldots,m exactly once.

Meaning: A permutation records a possible reordering of the input positions.

7) Sign of a Permutation

Sign

The sign of a permutation is

sign(j1,,jm)=(1)N,\operatorname{sign}(j_1,\ldots,j_m) = (-1)^N,

where NN is the number of inversions.

Meaning: The sign is 11 for an even permutation and 1-1 for an odd permutation.

8) Permutations and Alternating Forms

Permutation Formula

For an alternating mm-linear form,

α(vj1,,vjm)=sign(j1,,jm)α(v1,,vm).\alpha(v_{j_1},\ldots,v_{j_m}) = \operatorname{sign}(j_1,\ldots,j_m) \alpha(v_1,\ldots,v_m).

Meaning: Reordering the vectors changes only the sign according to the permutation.

9) Top-Degree Alternating Forms

One-Dimensionality

If

n=dimV,n=\dim V,

then

dimValt(n)=1.\dim V_{\mathrm{alt}}^{(n)}=1.

Meaning: Up to multiplication by a scalar, there is only one alternating nn-linear form on an nn-dimensional space.

10) Alternating Forms and Bases

Linear Independence Criterion

Let

n=dimVn=\dim V

and let α\alpha be a nonzero alternating nn-linear form.

Then

α(e1,,en)0\alpha(e_1,\ldots,e_n)\neq0

if and only if

e1,,ene_1,\ldots,e_n

is linearly independent.

Meaning: A top-degree alternating form detects whether nn vectors form a basis.

9C. Determinants

1) Determinant of an Operator

Determinant

Let

n=dimVn=\dim V

and TL(V)T\in\mathcal{L}(V).

The determinant of TT is the unique scalar detT\det T such that

α(Tv1,,Tvn)=(detT)α(v1,,vn)\alpha(Tv_1,\ldots,Tv_n) = (\det T)\alpha(v_1,\ldots,v_n)

for every alternating nn-linear form α\alpha.

Meaning: The determinant measures how TT scales an alternating top-dimensional quantity.

2) Basic Determinants

Identity

detI=1.\det I=1.

Scalar Multiple of the Identity

det(λI)=λn.\det(\lambda I) = \lambda^n.

Scalar Multiple of an Operator

det(λT)=λndetT.\det(\lambda T) = \lambda^n\det T.

Meaning: Determinants scale according to the dimension of the vector space.

3) Determinant of a Matrix

Matrix Determinant

For a square matrix AA, define

detA\det A

to be the determinant of the corresponding operator on Fn\mathbb{F}^n.

Meaning: The usual matrix determinant is the coordinate representation of the determinant of an operator.

4) Determinant as an Alternating Multilinear Form

Column Interpretation

For an nn-by-nn matrix with columns

v1,,vn,v_1,\ldots,v_n,

the function

(v1,,vn)det(v1  vn)(v_1,\ldots,v_n) \mapsto \det(v_1\ \cdots\ v_n)

is an alternating nn-linear form.

Meaning: The determinant is linear in each column and changes sign when two columns are swapped.

5) Determinant Formula

Permutation Formula

For an nn-by-nn matrix AA,

detA=σsign(σ)k=1nAσ(k),k.\det A = \sum_{\sigma} \operatorname{sign}(\sigma) \prod_{k=1}^{n} A_{\sigma(k),k}.

Meaning: The determinant combines one entry from every row and column, with a sign determined by the permutation.

6) Upper-Triangular Matrix

Triangular Determinant

If AA is upper triangular with diagonal entries

λ1,,λn,\lambda_1,\ldots,\lambda_n,

then

detA=λ1λn.\det A = \lambda_1\cdots\lambda_n.

Meaning: The determinant of a triangular matrix is simply the product of its diagonal entries.

7) Multiplicativity

Multiplicative Property

For operators,

det(ST)=(detS)(detT).\det(ST) = (\det S)(\det T).

For square matrices,

det(AB)=(detA)(detB).\det(AB) = (\det A)(\det B).

Meaning: Volume-scaling factors multiply when transformations are composed.

8) Determinant and Invertibility

Invertibility Criterion

T is invertible    detT0.T\text{ is invertible} \iff \det T\neq0.

Similarly,

A is invertible    detA0.A\text{ is invertible} \iff \det A\neq0.

Meaning: A zero determinant means that some dimension has been collapsed.

Inverse

If TT is invertible, then

det(T1)=1detT.\det(T^{-1}) = \frac{1}{\det T}.

Meaning: The inverse reverses the determinant scaling.

9) Determinant and Eigenvalues

Eigenvalue Criterion

A scalar λ\lambda is an eigenvalue of TT if and only if

det(λIT)=0.\det(\lambda I-T)=0.

Meaning: Eigenvalues are precisely the values that make λIT\lambda I-T noninvertible.

10) Similarity Invariance

Similarity

If SS is invertible, then

det(S1TS)=detT.\det(S^{-1}TS) = \det T.

Meaning: Changing coordinates does not change the determinant of an operator.

11) Operator and Matrix Determinants

Basis Independence

For any basis of VV,

detT=detM(T).\det T = \det\mathcal{M}(T).

Meaning: The determinant is independent of which matrix representation of the operator is used.

12) Determinant and Eigenvalue Product

Product of Eigenvalues

If

F=C,\mathbb{F}=\mathbb{C},

then

detT\det T

equals the product of all eigenvalues of TT, counted according to their multiplicities.

detT=λ1λn.\det T = \lambda_1\cdots\lambda_n.

Meaning: The determinant is the total product of the eigenvalue scaling factors.

13) Transpose, Dual, and Adjoint

Transpose

detAt=detA.\det A^t = \det A.

Meaning: Transposing a matrix does not change its determinant.

Dual

detT=detT.\det T' = \det T.

Meaning: An operator and its dual have the same determinant.

Adjoint

For an operator on an inner product space,

det(T)=detT.\det(T^*) = \overline{\det T}.

Meaning: Taking the adjoint conjugates the determinant.

14) Row and Column Operations

Equal Rows or Columns

If two rows or two columns are equal, then

detA=0.\det A=0.

Meaning: Repeated rows or columns indicate linear dependence.

Swap

Swapping two rows or two columns multiplies the determinant by

1.-1.

Meaning: Exchanging two directions reverses orientation.

Scaling

Multiplying one row or column by λ\lambda multiplies the determinant by λ\lambda.

Meaning: Scaling one direction scales the determinant by the same amount.

Row or Column Addition

Adding a scalar multiple of one row to another row does not change the determinant.

The same holds for columns.

Meaning: Shearing does not change the determinant.

15) Determinant of a Unitary Operator

Unitary Determinant

If SS is unitary, then

detS=1.|\det S|=1.

Meaning: A unitary transformation preserves volume.

16) Determinant of a Positive Operator

Positive Determinant

If TT is positive, then

detT0.\det T\ge0.

Meaning: A positive operator has only nonnegative eigenvalue scaling factors.

17) Determinant and Singular Values

Singular Value Product

If

s1,,sns_1,\ldots,s_n

are the singular values of TT, then

detT=s1sn.|\det T| = s_1\cdots s_n.

Equivalently,

detT=det(TT).|\det T| = \sqrt{\det(T^*T)}.

Meaning: The absolute determinant is the product of all orthogonal stretching factors.

18) Geometric Meaning of the Determinant

Volume Scaling

For TL(Rn)T\in\mathcal{L}(\mathbb{R}^n),

volume(T(Ω))=detTvolume(Ω).\operatorname{volume}(T(\Omega)) = |\det T| \operatorname{volume}(\Omega).

Meaning: The absolute determinant tells how much a linear transformation scales nn-dimensional volume.

19) Characteristic Polynomial

Characteristic Polynomial

For any finite-dimensional real or complex vector space,

pT(z)=det(zIT).p_T(z) = \det(zI-T).

Meaning: The characteristic polynomial records the values for which zITzI-T becomes noninvertible.

Degree

degpT=dimV.\deg p_T = \dim V.

Meaning: The characteristic polynomial of an nn-dimensional operator has degree nn.

Eigenvalues

pT(λ)=0p_T(\lambda)=0

if and only if λ\lambda is an eigenvalue in F\mathbb{F}.

Meaning: Eigenvalues are the roots of the characteristic polynomial.

20) Cayley–Hamilton Theorem

Cayley–Hamilton Theorem

Every operator satisfies its own characteristic polynomial.

pT(T)=0.p_T(T)=0.

Meaning: Substituting the operator itself into its characteristic polynomial gives the zero operator.

21) Minimal and Characteristic Polynomials

Divisibility

The minimal polynomial divides the characteristic polynomial.

pminpT.p_{\min}\mid p_T.

Meaning: The characteristic polynomial always contains enough factors to annihilate the operator.

22) Trace and Determinant in the Characteristic Polynomial

Characteristic Polynomial Coefficients

If

n=dimV,n=\dim V,

then

pT(z)=zn(trT)zn1++(1)ndetT.p_T(z) = z^n - (\operatorname{tr}T)z^{n-1} +\cdots+ (-1)^n\det T.

Meaning: Trace and determinant appear directly as important coefficients of the characteristic polynomial.

23) Hadamard's Inequality

Hadamard's Inequality

If

v1,,vnv_1,\ldots,v_n

are the columns of AA, then

detAk=1nvk.|\det A| \le \prod_{k=1}^{n}\|v_k\|.

Meaning: For fixed column lengths, the largest possible volume occurs when the columns are orthogonal.

9D. Tensor Products

1) Bilinear Functional

Bilinear Functional

A bilinear functional on V×WV\times W is a function

β:V×WF\beta:V\times W\to\mathbb{F}

that is linear in each argument separately.

Meaning: A bilinear functional combines vectors from two possibly different vector spaces into a scalar.

B(V,W)\mathcal{B}(V,W)

The space of all bilinear functionals on V×WV\times W is denoted by

B(V,W).\mathcal{B}(V,W).

Its dimension is

dimB(V,W)=(dimV)(dimW).\dim\mathcal{B}(V,W) = (\dim V)(\dim W).

Meaning: A bilinear functional requires one coefficient for every pair of basis directions.

2) Tensor Product of Vector Spaces

Tensor Product

The tensor product of VV and WW is defined by

VW=B(V,W).V\otimes W = \mathcal{B}(V',W').

Meaning: VWV\otimes W is a new vector space designed to represent bilinear combinations of vectors from VV and WW.

3) Tensor Product of Vectors

Simple Tensor

For

vV,wW,v\in V, \qquad w\in W,

the tensor

vwv\otimes w

is defined by

(vw)(φ,τ)=φ(v)τ(w)(v\otimes w)(\varphi,\tau) = \varphi(v)\tau(w)

for φV\varphi\in V' and τW\tau\in W'.

Meaning: vwv\otimes w combines one vector from each space into an element of the tensor-product space.

4) Dimension of a Tensor Product

Tensor Product Dimension

dim(VW)=(dimV)(dimW).\dim(V\otimes W) = (\dim V)(\dim W).

Meaning: Tensor-product dimensions multiply rather than add.

5) Bilinearity of the Tensor Product

Addition in the First Factor

(v1+v2)w=v1w+v2w.(v_1+v_2)\otimes w = v_1\otimes w+v_2\otimes w.

Addition in the Second Factor

v(w1+w2)=vw1+vw2.v\otimes(w_1+w_2) = v\otimes w_1+v\otimes w_2.

Scalar Multiplication

λ(vw)=(λv)w=v(λw).\lambda(v\otimes w) = (\lambda v)\otimes w = v\otimes(\lambda w).

Meaning: Tensor multiplication is linear in each vector separately.

6) Basis of a Tensor Product

Tensor Product Basis

If

e1,,eme_1,\ldots,e_m

is a basis of VV and

f1,,fnf_1,\ldots,f_n

is a basis of WW, then

{ejfk}\{e_j\otimes f_k\}

is a basis of

VW.V\otimes W.

Meaning: Every pair of basis directions produces one independent tensor-product direction.

7) Simple Tensors and General Tensors

General Tensor

Every element of VWV\otimes W can be written as a finite sum

kvkwk.\sum_k v_k\otimes w_k.

However, not every tensor must itself have the form

vw.v\otimes w.

Meaning: A single tensor product vwv\otimes w is only a special type of element in the full tensor-product space.

8) Bilinear Map

Bilinear Map

A bilinear map is a function

Γ:V×WU\Gamma:V\times W\to U

that is linear in each argument separately.

Meaning: Unlike a bilinear functional, a bilinear map may output vectors instead of only scalars.

9) Universal Property of Tensor Products

Bilinear Maps Become Linear Maps

For every bilinear map

Γ:V×WU,\Gamma:V\times W\to U,

there exists a unique linear map

Γ^:VWU\widehat{\Gamma}:V\otimes W\to U

such that

Γ^(vw)=Γ(v,w).\widehat{\Gamma}(v\otimes w) = \Gamma(v,w).

Meaning: Tensor products convert bilinear problems into ordinary linear problems.

10) Tensor Product of Inner Product Spaces

Tensor Product Inner Product

If VV and WW are inner product spaces, there is a unique inner product on VWV\otimes W satisfying

vw,ux=v,uw,x.\langle v\otimes w, u\otimes x \rangle = \langle v,u\rangle \langle w,x\rangle.

Meaning: Inner products of simple tensors are products of the corresponding inner products.

Orthonormal Tensor Basis

If

e1,,eme_1,\ldots,e_m

and

f1,,fnf_1,\ldots,f_n

are orthonormal bases, then

{ejfk}\{e_j\otimes f_k\}

is an orthonormal basis of VWV\otimes W.

Meaning: Tensoring orthonormal bases produces an orthonormal basis of the tensor-product space.

11) Tensor Products of Multiple Vector Spaces

Multiple Tensor Product

For vector spaces

V1,,Vm,V_1,\ldots,V_m,

the tensor product is denoted by

V1Vm.V_1\otimes\cdots\otimes V_m.

Meaning: Tensor products extend naturally from two vector spaces to any finite number of vector spaces.

12) Tensor Product of Multiple Vectors

Multiple Simple Tensor

For

vkVk,v_k\in V_k,

write

v1vm.v_1\otimes\cdots\otimes v_m.

It satisfies multilinearity in all mm arguments.

Meaning: The tensor product is linear independently in every factor.

13) Dimension of a Multiple Tensor Product

Dimension

dim(V1Vm)=k=1mdimVk.\dim(V_1\otimes\cdots\otimes V_m) = \prod_{k=1}^{m}\dim V_k.

Meaning: The dimensions of all tensor factors multiply.

14) Basis of a Multiple Tensor Product

Tensor Basis

If

e1k,,enkke_1^k,\ldots,e_{n_k}^k

is a basis of VkV_k for every kk, then all tensors

ej11ejmme_{j_1}^1 \otimes\cdots\otimes e_{j_m}^m

form a basis of

V1Vm.V_1\otimes\cdots\otimes V_m.

Meaning: Choosing one basis vector from each factor produces every basis direction of the tensor product.

15) Universal Property for Multiple Tensor Products

Multilinear Maps Become Linear Maps

Every mm-linear map

Γ:V1××VmU\Gamma: V_1\times\cdots\times V_m \to U

corresponds to a unique linear map

Γ^:V1VmU\widehat{\Gamma}: V_1\otimes\cdots\otimes V_m \to U

such that

Γ^(v1vm)=Γ(v1,,vm).\widehat{\Gamma} (v_1\otimes\cdots\otimes v_m) = \Gamma(v_1,\ldots,v_m).

Meaning: Tensor products convert multilinear maps into ordinary linear maps.