1 Definition and notation

The conjugate transpose of a matrix is obtained by first taking the complex conjugate of every entry and then transposing the result. It is a standard operation in linear algebra over complex vector spaces and is especially important when defining inner products and matrix adjoints. The operation extends the familiar transpose from real matrices to matrices with complex entries.

1.1 Matrix transpose

The transpose of a matrix swaps rows and columns. If a matrix has an entry in row i and column j, then after transposition that entry appears in row j and column i. For real matrices, the transpose is often enough to describe symmetry and orthogonality, but for complex matrices it does not fully capture the behavior needed in many geometric and algebraic settings.

1.2 Complex conjugation

Complex conjugation replaces each complex number a + bi with a − bi. Applied to a matrix, it is performed entry by entry. This step changes the sign of each imaginary part while leaving real parts unchanged. Conjugation is essential in complex inner product spaces because it ensures that lengths and angles behave correctly.

1.3 Conjugate transpose operation

The conjugate transpose combines these two operations. One first conjugates each entry of the matrix and then transposes the resulting array. The outcome is another matrix of compatible dimensions with rows and columns exchanged and complex phases reversed.

1.3.1 Entrywise formula

If A is a matrix with entries aij, its conjugate transpose is denoted by A* or A†, and its entries satisfy (A*)ij = overline{aji}. Thus the entry in position i, j of the conjugate transpose is the complex conjugate of the entry in position j, i of the original matrix.

1.3.2 Relationship to transpose and conjugation

The conjugate transpose can be written as the composition of conjugation and transposition. It is equal to the transpose of the conjugate matrix, and also to the conjugate of the transposed matrix. These equivalent descriptions reflect the fact that conjugation and transposition act independently on the values and the arrangement of entries.

1.4 Common symbols

The most common symbols for the conjugate transpose are A* and A†. In some contexts, especially physics and functional analysis, the notation A* is also used for the adjoint of an operator. The dagger symbol A† is often used to emphasize the Hermitian adjoint interpretation.

2 Basic properties

The conjugate transpose obeys several algebraic rules that make it compatible with matrix arithmetic. These properties are crucial in proofs involving inner products, unitary transformations, and matrix decompositions.

2.1 Involution property

Applying the conjugate transpose twice returns the original matrix. In other words, (A*)* = A. This is an involution, meaning the operation is its own inverse. The result follows because conjugating twice restores each entry and transposing twice restores the original arrangement.

2.2 Linearity and conjugate-linearity

The conjugate transpose is additive and interacts with scalar multiplication in a conjugate-linear way. It preserves sums, but scalars are conjugated when moved outside the operation. This behavior distinguishes it from ordinary linear maps and is one reason it is well suited to complex inner product theory.

2.3 Product rule

The conjugate transpose of a product reverses the order of multiplication. This rule is one of its most important algebraic features and is used repeatedly in matrix identities.

2.3.1 Reversed order in multiplication

For compatible matrices A and B, one has (AB)* = B* A*. The reversal occurs because transposition reverses multiplication order, and conjugation applies entrywise without changing the order itself. Together, these effects give the stated identity.

2.4 Scalar multiplication

For any complex scalar c and matrix A, (cA)* = overline{c} A*. If the scalar is real, then its conjugate is itself, so the rule reduces to the familiar behavior of the transpose. This relation is frequently used when simplifying expressions involving complex coefficients.

2.5 Compatibility with matrix addition

The conjugate transpose distributes over sums: (A + B)* = A* + B*. Because both conjugation and transposition respect addition, the combined operation does as well. This property allows term-by-term manipulation of matrix expressions.

3 Conjugate transpose of vectors

For vectors, the conjugate transpose converts between column and row form while also conjugating entries. This is especially important in complex vector spaces, where a vector and its conjugate transpose play distinct roles.

3.1 Row and column vectors

A column vector becomes a row vector under conjugate transposition, and each component is conjugated. Likewise, a row vector becomes a column vector. This operation is often used when forming scalar products from vectors written in matrix form.

3.2 Bra-ket notation

In bra-ket notation, common in physics, a ketv⟩ represents a column vector and the corresponding bra ⟨vrepresents its conjugate transpose. This notation makes it easy to express inner products and linear maps abstractly. The bra is not merely a transpose; it encodes the complex conjugation needed for correct calculations.

3.3 Inner products and norms

The conjugate transpose is central to the standard inner product on complex vector spaces. For vectors x and y, the quantity x* y gives the usual scalar product when x* is interpreted as the conjugate transpose of a row vector. Norms are then obtained from the inner product of a vector with itself, yielding a nonnegative real value.

4 Special matrices

Certain matrix classes are defined by simple relationships involving the conjugate transpose. These classes play major roles in linear algebra, numerical computation, and the study of complex systems.

4.1 Hermitian matrices

A Hermitian matrix is one that equals its own conjugate transpose. Such matrices are the complex analogue of symmetric real matrices and have especially well-behaved spectral properties.

4.1.1 Definition

A matrix A is Hermitian if A* = A. This means the entry in row i, column j is the complex conjugate of the entry in row j, column i. The condition imposes a precise symmetry across the main diagonal.

4.1.2 Diagonal entries and eigenvalues

For Hermitian matrices, diagonal entries are real because each diagonal entry must equal its own complex conjugate. Their eigenvalues are also real, a fundamental fact that underlies many applications in mathematics and physics. This real spectrum makes Hermitian matrices particularly important in optimization and spectral theory.

4.2 Skew-Hermitian matrices

A skew-Hermitian matrix satisfies A* = −A. In this case, diagonal entries are purely imaginary or zero, since each diagonal entry must be the negative of its own conjugate. Skew-Hermitian matrices arise naturally as generators of certain continuous transformations.

4.3 Unitary matrices

Unitary matrices preserve complex inner products. They are the complex analogue of orthogonal matrices and are central in geometry, quantum theory, and numerical linear algebra.

4.3.1 Definition

A matrix U is unitary if U*U = I and equivalently UU* = I, where I is the identity matrix. This condition says that the conjugate transpose of U is also its inverse. Unitary matrices preserve lengths and angles in complex spaces.

4.3.2 Inverse via conjugate transpose

For a unitary matrix U, the inverse is U*. This fact simplifies many computations and explains why unitary matrices are numerically stable in practice. Because the inverse is obtained by a simple conjugate transpose, unitary transformations are often easier to analyze than arbitrary invertible matrices.

4.4 Normal matrices

A matrix is normal if it commutes with its conjugate transpose: A*A = AA*. This class includes Hermitian, skew-Hermitian, and unitary matrices. Normality is important because such matrices enjoy strong diagonalization properties over the complex numbers.

5 Algebraic applications

The conjugate transpose appears throughout the algebra of complex vector spaces and matrix theory. It provides a natural language for orthogonality, adjoints, and stable matrix factorizations.

5.1 Inner product spaces

In complex inner product spaces, the conjugate transpose helps define and manipulate the inner product. It ensures that the resulting scalar form satisfies the correct symmetry and positivity properties.

5.1.1 Sesquilinearity

A complex inner product is sesquilinear: it is linear in one argument and conjugate-linear in the other. The conjugate transpose reflects this asymmetry. When vectors are represented as matrices, one argument is typically transposed and conjugated before multiplication.

5.1.2 Orthogonality

Two vectors are orthogonal when their inner product is zero. The conjugate transpose provides the standard matrix expression for this condition. In geometric terms, it identifies when complex vectors are perpendicular in the inner product sense.

5.2 Adjoint operators

In linear algebra and functional analysis, the adjoint of a linear operator is the operator that corresponds to the conjugate transpose in finite-dimensional matrix form. It is defined by the requirement that inner products be preserved in a specific dual manner. This concept generalizes the matrix operation to more abstract spaces.

5.3 Matrix factorizations

Many matrix factorizations use the conjugate transpose directly or indirectly. It appears in formulas that separate a matrix into orthogonal, triangular, or diagonal components.

5.3.1 QR decomposition

In QR decomposition, a matrix is factored into a product Q R, where Q is unitary in the complex case and R is upper triangular. The conjugate transpose of Q is used to verify orthonormality and to recover factors in computations. This decomposition is widely used in solving linear systems and least squares problems.

5.3.2 Singular value decomposition

The singular value decomposition expresses a matrix as U Σ V*, where U and V are unitary and Σ is diagonal with nonnegative entries. The conjugate transpose appears in the final factor V*. This factorization is one of the most powerful tools in numerical linear algebra and data analysis.

The conjugate transpose is closely related to several basic operations and interpretations. These connections help place it within the broader framework of matrix theory.

6.1 Transpose

The transpose rearranges matrix entries by swapping rows and columns. It is the real-matrix counterpart of the conjugate transpose, which adds complex conjugation to handle nonreal entries appropriately.

6.2 Complex conjugate

Complex conjugation changes each complex number to its reflected value across the real axis. It is the value-level operation underlying the conjugate transpose and is responsible for the appearance of conjugated scalars in matrix identities.

6.3 Adjoint in functional analysis

In functional analysis, the adjoint extends the idea of conjugate transpose to operators on infinite-dimensional spaces. While the matrix case is finite-dimensional and concrete, the operator adjoint serves as its abstract analogue and is defined through inner products.

6.4 Real matrices as a special case

For matrices with only real entries, the conjugate transpose reduces to the ordinary transpose. Since real numbers equal their own complex conjugates, no change occurs in the entries during conjugation. This makes the conjugate transpose a direct generalization of the real transpose.