Adjoint eigenvector identity for a normal matrix Created 2026-10-06 Updated 2026-10-07
If a normal matrix satisfies , then . Indeed, is normal and . Since , also . This identity proves orthogonality of distinct eigenspaces and gives spectral restrictions for Hermitian matrices, skew-Hermitian matrices and unitary matrices.
For a complex antisymmetric tensor , the SU(4) action is . The unitary skew-diagonalization of an antisymmetric matrix gives in suitable coordinates, where . If , preserving forces a stabilizing unitary matrix to preserve the two coordinate planes. The identity then forces both two-by-two blocks to have determinant one, using also when one of vanishes. The exact stabilizer is . If , the stabilizer is the larger compact symplectic group . If , it is all of . The real structure of the SU4 exterior square imposes in this form, so a nonzero real six-dimensional field has the larger symplectic stabilizer, whereas unequal paired singular values are generic for a complex six-dimensional field.
Anyon F-matrix 2026-10-25
The unitary matrix relating the anyon fusion trees and . Fix the convention . An inverse change of parentheses uses the adjoint matrix, so its entries are complex conjugates with exchanged indices.
Autonne-Takagi factorization Created 2026-10-07 Updated 2026-10-25
Every complex symmetric matrix admits a unitary congruence decomposition with a unitary matrix and nonnegative diagonal entries equal to its singular values. This differs from unitary similarity diagonalization. It reduces a multimode squeezed vacuum to independent oscillator squeezing factors.
For a linear, fixed-frequency beam splitter, choose power-normalized complex amplitudes at its input optical ports and at its output optical ports: and are powers. The scalar description treats one specified electromagnetic polarization and matching transverse profiles; other fields require additional components. With the geometrical ordering in the diagram,
Here are transmission complex amplitudes per unit input and are reflection complex amplitudes per unit input. In this power normalization, a single input gives and . Raw electric field amplitudes in different media generally need additional power-normalization factors.
If these two output optical ports account for all outgoing power and the device has no loss or gain, is a unitary matrix:
The dagger is the Hermitian transpose and a star is complex conjugation. To prove the condition, substitute into conservation of total power for every input vector: . Inputs and fix the diagonal entries; and fix the real and imaginary parts of the off-diagonal entry. A lossy two-output description instead has for a passive device.[ref]
One consistent ideal symmetric 50:50 choice is
Each reflection carries relative wave phase in this convention. The columns have unit vector norm and zero inner product, directly verifying that is a unitary matrix. Choosing a different phase convention for complex amplitudes at the optical ports replaces by , where the are diagonal matrices whose entries have modulus one; the input complex amplitudes must be transformed consistently. Observable powers are unchanged. The displayed is a convention for this ideal model, not a universal reflection rule for every coating or incidence geometry.
Cabibbo-Kobayashi-Maskawa matrix Created 2026-09-24 Updated 2026-10-18
The Cabibbo-Kobayashi-Maskawa matrix compares the left-handed unitary matrices that diagonalize the up-type and down-type Yukawa matrices. Its rows label up quarks, charm quarks and top quarks; its columns label down quarks, strange quarks and bottom quarks. In the weak charged current, the coefficient of is . A single CKM matrix therefore connects quark masses, flavour-changing decay amplitudes, and CP violation.
Write and . An exactly unitary matrix with three mixing angles and one CP-violating phase is
This convention agrees with Makoto Kobayashi's account of three-generation quark mixing.[ref]
The Christenson-Cronin-Fitch-Turlay kaon CP violation experiment established the phenomenon that required an explanation. Makoto Kobayashi and Toshihide Maskawa showed that two-generation quark mixing cannot supply it, whereas adding a third quark generation permits an irreducible weak phase. Their 1973 paper also considered additional fields as alternative mechanisms; the three-generation conclusion concerns CP violation from the minimal unitary quark mixing mechanism.[ref]
A common weak phase makes CP violation across mesons testable through the BABAR time-dependent CP violation experiment. It does not explain the cosmic baryon asymmetry.[ref]
Cayley transform of a Hermitian matrix Created 2026-09-28 Updated 2026-10-20
For a Hermitian matrix , both and are invertible because every eigenvalue of is real. The displayed rational function is a unitary matrix: taking its conjugate transpose and commuting the rational factors gives . It maps each eigenvector of with eigenvalue to the same vector with eigenvalue , a complex number of modulus one different from one. The inverse Cayley transform of a unitary matrix without eigenvalue one recovers .
Another common convention is , which sends to and avoids eigenvalue minus one. The two conventions are related by ; the inverse formula must match the chosen convention.
Let a Hermitian matrix have distinct real eigenvalues with multiplicities . A unitary matrix commuting with it must preserve each eigenspace: if , then . Conversely, any unitary transformation acting independently on these mutually orthogonal eigenspaces commutes with . The centralizer in is therefore . Imposing total determinant one gives the displayed subgroup inside the special unitary group .
For multiplicities in SU(3), it is , embedded by . Three distinct eigenvalues leave the diagonal maximal torus . This determines the unbroken group for a diagonal adjoint scalar field vacuum, including its global determinant constraint.
CKM parameter counting Created 2026-10-06 Updated 2026-10-18
An unitary matrix has real parameters. Its real rotation subgroup has mixing angles, leaving phases. The up-type and down-type quark fields allow quantum field rephasings, but their common phase acts trivially on the CKM matrix. Removing phases therefore leaves
For two quark generations, there is one mixing angle and no physical CP-violating phase. For three quark generations, there are three mixing angles and one physical CP-violating phase. The count describes generic, nondegenerate quark masses and generic mixing; a vanishing mixing angle can make the remaining phase unobservable, and mass degeneracies enlarge the allowed basis changes. Three quark generations permit CP violation but do not force it.
For and any two-by-two unitary matrix, expand the two columns of . The equal-index coefficients cancel, and the coefficient of is the determinant. Its modulus is one, so a common change of qubit basis preserves the spin singlet state up to a global phase. The density projector is exactly invariant.
Column orthogonality 2026-10-31
For a finite group, the sum of products of irreducible character values is zero when are not conjugate, and equals when are conjugate. To prove this from row orthogonality relations for a character table, choose representatives of its conjugacy classes and form . Row orthogonality says . There are equally many irreducible characters and conjugacy classes, so this is a square unitary matrix and as well. Its column equations give the result, using .
Complex matrix 2026-10-20
A matrix whose entries are complex numbers. For an endomorphism of , Hermitian matrices and unitary matrices are distinguished by their behavior under the conjugate transpose.
Complex orthogonal matrix 2026-10-25
An invertible matrix over the complex numbers preserving the symmetric bilinear form : . The transpose here does not include complex conjugation, unlike the defining condition for a unitary matrix. For example, is complex orthogonal for real , but is not unitary when .
For the Dirac representation of the gamma matrices, the unitary matrix
sends to while commuting with every spatial gamma matrix. This is the standard Weyl representation of the gamma matrices with spatial blocks . The similarity transformation preserves the Clifford algebra relations. Changing block-order or chirality conventions can change the displayed transformation, so its direction must be specified.
Discrete Fourier transform Created 2026-09-24 Updated 2026-10-18
The discrete Fourier transform turns a finite list of samples into the weights of its discrete Fourier modes. The goal is to reveal a simple oscillatory recipe hidden in complicated-looking data, while retaining enough information to reconstruct every sample exactly. In signal processing, those weights identify sampled frequencies and wave phases; in numerical analysis, they simplify circular convolution and the discrete sine transform Poisson solver.
Start with eight real samples, indexed by :
Writing , the actual list is
The discrete Fourier transform recovers the recipe as
The constant contributes ; the cosine contributes ; the half-sized sine contributes and . All other coefficients vanish exactly. The imaginary coefficients carry the sine's wave phase, which a plot of absolute values alone would hide.
Figure 1.
Eight samples become a constant, a cosine pair, and a sine pair in the discrete Fourier transform
. Details.
Precisely, for a positive integer and a vector , the forward discrete Fourier transform and inverse discrete Fourier transform used here are
Thus the forward exponent has a minus sign and no scale factor; the inverse exponent has a plus sign and the factor . The coefficients in the reconstruction are , rather than . In the example, , the pair reconstructs the cosine, and the pair reconstructs the half-sized sine. These conventions agree with the scaled Fourier coefficients in MIT's authored notes.[ref]
The proof idea is orthogonality of roots of unity: for integers ,
Distinct discrete Fourier modes cancel in this finite geometric series. Substituting the forward formula into the inverse discrete Fourier transform leaves only the desired sample. The same orthogonality makes the normalized discrete Fourier modes an orthonormal basis and gives the discrete Parseval identity, in the present convention,
For the eight-sample example, direct squaring gives , while , so . This identity preserves the squared L2 norm after accounting for normalization. The existing discrete Parseval identity instead scales the forward discrete Fourier transform by , producing a unitary matrix and equal squared L2 norms without the factor .
For real input, discrete Fourier conjugate symmetry pairs positive and negative frequencies. The label is a residue modulo : when represents the same discrete Fourier mode as , since . It therefore represents negative frequency cycles per sample. If samples are seconds apart, the corresponding signed frequency is cycles per second. Similarly, index represents , while index is its own negative modulo .
The discrete Fourier transform is an invertible map between two finite vectors. The continuous Fourier transform instead describes a function on the real line by an integral over a continuous frequency variable. A finite list of samples does not determine the full continuous frequency spectrum: aliasing of discrete Fourier modes already supplies distinct waveforms with identical observations. Applying the inverse formula at arbitrary integer indices gives the periodic extension of a finite sequence, repeating the recorded block every samples. This is a property of that representation, rather than evidence that the physical signal repeats beyond the recording. Laurent Demanet's MIT notes place the discrete Fourier transform alongside the continuous Fourier transform and Fourier series to explain the role of sampling and repetition.[ref]
The beauty is that a change of basis exposes cancellation and structure without losing data. Direct evaluation needs sums of terms; a Fast Fourier transform computes the same discrete Fourier transform with far less work. Computational speed and the mathematical meaning of the coefficients are separate questions.
With normalization , the discrete Fourier transform is a unitary matrix. Orthogonality of the roots-of-unity vectors gives the displayed identity. Multiplying both sides by the grid spacing gives the corresponding discrete L2 norm. Modal contraction therefore proves grid-norm contraction without a mesh-dependent change-of-basis constant.
If is Skew-Hermitian, then is a Hermitian matrix. The finite-dimensional spectral theorem gives , with real and a unitary matrix . Since the matrix exponential respects similarity, . Each diagonal entry has modulus one, so is a unitary matrix. Thus a skew-Hermitian matrix generates norm-preserving linear evolution.
Finite-dimensional spectral theorem Created 2026-09-24 Updated 2026-10-14
Every self-adjoint operator on a finite-dimensional real or complex inner product space has an orthonormal eigenbasis, and all its eigenvalues are real. In orthonormal coordinates, a real symmetric matrix has the form , with an orthogonal matrix and a real diagonal matrix. A complex Hermitian matrix instead has , with a unitary matrix and its conjugate transpose. These are the self-adjoint cases of the spectral theorem; Axler gives the real and complex finite-dimensional statements in Section 7B.[ref]
An orthonormal eigenbasis turns a seemingly coupled linear map into independent scalar multiplications while preserving lengths and angles. If and , then
The last identity removes every cross term from the quadratic form. The eigenvalues tell us whether it is positive, negative, or mixed in sign, and the eigenvectors identify the corresponding directions. This connects positive-definite matrices, quadratic forms, and the Hermitian Rayleigh quotient range.
For a fully computed example, take
Direct multiplication gives and . Their dot product is zero and each has norm one. Thus
Writing changes into . Its level set is therefore an ellipse with semiaxis lengths and , along and . The coordinates change, but the ellipse does not: orthogonal diagonalization reveals its existing geometry.
Figure 1.
An orthonormal eigenbasis removes the cross term from a quadratic form and reveals the axes of its ellipse
. Details.
For distinct eigenvalues, orthogonality follows at once from self-adjointness: . Within a repeated eigenspace, choose an orthonormal basis; arbitrarily chosen eigenvectors of the same eigenvalue need not be orthogonal. One outline of the full argument finds an eigenvector, observes that its orthogonal complement is invariant, and repeats in that smaller space. Merely having real eigenvalues is weaker: has two real eigenvalues, but its eigenvectors and are not orthogonal.
Flavour mixing 2026-10-25
The interaction-labelled fields of several particle species can be linear combinations of the propagation or mass eigenfields. A unitary matrix relates orthonormal bases with canonical kinetic normalization. Quark mixing is described by the CKM matrix; the lepton mixing matrix describes the corresponding mismatch for leptons. A mixing angle parametrizes part of this matrix once ordering and phase conventions are fixed.
Hermitian matrix model 2026-10-06
A Hermitian matrix model replaces a spacetime field by a finite-dimensional Hermitian matrix. Its normalized integral supplies correlation functions and a zero-dimensional perturbative quantum field theory expansion. For an action built from traces of matrix powers, unitary matrix conjugation is a symmetry and the eigenvalues describe the invariant degrees of freedom. A quartic real integral needs a nonnegative highest-order coupling for convergence; a formal power series can be studied independently of this convergence issue.