SU(2) matrix Created 2026-10-05 Updated 2026-10-20
An SU(2) matrix is a two-by-two complex unitary matrix with determinant one. It has the form with . Its action on the Riemann sphere is a rotational Möbius transformation; opposite matrices induce the same sphere rotation.
On , take and . The special unitary group preserves the Kähler form by unitarity and preserves by its unit determinant. Fixing therefore embeds it in the compact G2 stabilizer of . The complexified seven-dimensional representation restricts as .
SU(4) group Created 2026-10-07 Updated 2026-10-14
Sylvester matrix Created 2026-10-14 Updated 2026-10-18
For polynomials of polynomial degrees , the Sylvester matrix has shifted coefficient rows of followed by shifted rows of , using descending-power order. It is a square matrix of size . Its transpose represents the linear map with , ; its determinant is the resultant.
For an original parameter example, choose and . Then
The two lists of coefficients become three rows because is multiplied by both and . Thus the common-root parameter values are and . At , the resultant is , so the two polynomials have no common root.
Figure 1.
A Sylvester matrix tests when a moving root of a polynomial coincides with a fixed one
. Original example , . Left: the vertical dashed line marks the root of a polynomial of ; it does not make zero. Right: the same test for all parameters is the function graph of the resultant . A crossing between two arbitrary function curves would not suffice: both values must be zero. Details.
One can verify the certificate without any determinant expansion:
For , division by gives a Bézout's identity for polynomials. At , the identity instead becomes a nontrivial cancellation between multiples of two polynomials sharing the polynomial factor .
The general proof needs only a short linear algebra outline. A common polynomial factor gives a nonzero cancelling pair within the degree bounds, making the Sylvester matrix singular. Conversely, if are coprime polynomials and , then divides ; the bound forces and then . Thus the linear map has zero kernel of a linear map exactly in the coprime case. Over an algebraic closure, a nonconstant common polynomial factor is equivalent to a common root.
In 1840, James Joseph Sylvester described forming the shifted coefficient rows and taking a signed sum of products selected by permutations. In modern notation, this is the Sylvester matrix and its determinant. The construction turns the nonlinear common-root of a polynomial question into linear algebra. His paper's word derivatives concerns elimination, rather than the formal derivative used below.[ref]
Sylvester's criterion Created 2026-09-24 Updated 2026-10-18
A Hermitian matrix is a positive-definite matrix exactly when its leading principal minors
are all positive. The leading principal minor uses the first rows and the first columns in the same ordering. For the two-by-two Cholesky decomposition example, and , so the criterion proves positive definiteness without calculating eigenvalues.
The successive pivot elements before taking square roots are , with . Here they are and . In general, a leading triangular matrix factor has determinant equal to the product of its diagonal entries, so
Conversely, positive leading principal minors make each successive Schur complement pivot element positive, allowing the Cholesky decomposition to be constructed. The identity then proves positive definiteness; for complex matrices, replace the transposes by conjugate transposes. This gives a short inductive proof of the criterion.
For , the first minor is positive but . The second Cholesky radicand would be , and directly gives . Thus positive diagonal entries are insufficient. Replacing “positive” by “nonnegative” in just the leading-minor test is also insufficient for positive semidefiniteness: has leading minors , but its quadratic form is negative on .
Two identical concave mirrors of curvature radius R separated by L have half-round-trip ray matrix . Its determinant is one and its trace is . The eigenvalues are a conjugate unit-modulus pair for the displayed interval. At the confocal point , , so it is bounded despite the full-round-trip trace reaching minus two. Matching a Gaussian beam's mirror wavefront gives and . The endpoints are degenerate limiting geometries, not finite confined Gaussian modes.
A real symmetric tensor of the special orthogonal group transforms as . If its vacuum expectation value has distinct eigenvalues with multiplicities , its stabilizer subgroup is : each transformation preserves each eigenspace and the product of the block determinants is one. Its identity component is . Thus a scalar multiple of the identity preserves the whole group, whereas a tensor with simple spectrum preserves only diagonal signs with total sign one. A tracelessness condition constrains the eigenvalues but does not change this stabilizer formula.
The tangent cone to a theta divisor at a degree- line bundle is cut out in by the determinant of . Under Serre duality its matrix entries are for bases of and . For , its tangent hyperplane is annihilated by the nonzero holomorphic differential form .
Take a central chemical atom at the origin and four substituents at the vertices of an ideal regular tetrahedron:
These dimensionless coordinates describe shape, not measured bond lengths. For distinct labels A, B, C and D, define a signed determinant
It is six times the oriented volume of the labelled tetrahedron. A translation cancels from the differences. A rotation has and preserves , whereas the mirror matrix has and changes it to . Consequently no rotation can place every distinct label on its mirror partner. This argument uses three-dimensional coordinates, not clockwise order on a page.
Now let C and D both be the same substituent H. Swapping these identical groups is allowed. For this model the half-turn
about the axis maps the reflected A and B to their original positions and exchanges the two H positions. The models superpose. With distinct C and D, the same half-turn fails precisely at those two labels; the determinant argument rules out every other rotation as well. This is the local reason two identical hydrogen chemical atoms prevent glycine's amino acid alpha carbon from being a tetrahedral stereocenter.
Figure 1.
The same spatial half-turn succeeds only when the exchanged groups are identical
. Original model, mirror model and rotated mirror model. Top: the distinct C and D remain mismatched, so the A/B/C/D model is chiral. Bottom: the identical H groups may exchange, so the A/B/H/H model is achiral. The operation is an actual three-dimensional rotation about , with determinant . Details.
For a flexible molecule, also distinguish conformational isomerism from a persistent enantiomer pair. A particular frozen shape may be chiral while ordinary internal motions interconvert mirror shapes. Turning the entire model is always allowed in a spatial comparison; an internal motion must be considered with its actual accessibility and timescale.
For cube vertices , the four vertices of coordinate product and the four of product form the two inscribed regular tetrahedra. A cube rotation is a signed permutation matrix of determinant one and maps each product class to one class. A quarter-turn about a coordinate axis exchanges the classes. The orbit of either tetrahedron therefore has size two, while the cube rotation group has order 24. The orbit-stabilizer theorem gives its setwise stabilizer subgroup order 12; this is the tetrahedron's proper rotation group.
For a number-conserving Gaussian pairing state, six permutations give this expression. Each transposition has sign , positive for bosons and negative for fermions; the two three-cycles have positive sign for either statistics. Equivalently it is the permanent or determinant of the three-by-three one-body density matrix. For bosonic number states, repeated-mode factorial corrections must be included instead of assuming that Wick theorem.
Evaluation determinants for and have a quotient which is a rational section of , not intrinsically a scalar. If , its th power becomes a rational function after choosing that trivialization. In Cartier divisor notation, write and . With raw meromorphic evaluations the scalar expression is . The extra product accounts for the line-bundle frames; it is suppressed when evaluation already uses compatible torsion trivializations.
The directed vertex-edge incidence matrix has one and one per nonloop column and a zero column for a loop. Every square subdeterminant belongs to . Induct on its size: a column with no nonzero entries makes the determinant zero; a column with one nonzero entry permits a cofactor expansion to a smaller determinant; and if every column has two nonzero entries, their opposite signs make the column sums zero, giving linearly dependent rows. Negating rows preserves absolute subdeterminants. Consequently the unsigned vertex-edge incidence matrix of a bipartite graph is totally unimodular: negate all rows in one part. The assignment problem is an instance, with row vertices and column vertices forming the two parts.
Trace and local volume change Created 2026-10-14 Updated 2026-10-20
For any fixed real -by- matrix , as the real parameter tends to zero,
The big O notation means the remainder is bounded in absolute value by for some constant near zero. The determinant stays positive for sufficiently small , so its oriented volume factor is also its ordinary volume factor. Thus the trace is the first-order fractional volume change, measured from the identity matrix.
A proof follows directly from multilinearity of the determinant. Each column of is . The constant term chooses all the standard basis columns and equals one. A term containing exactly one factor replaces just column by ; expanding that vector in the standard basis leaves only its component, , because every other choice repeats a column. Summing gives . Terms with two or more replacements have order or higher. This also proves the derivative of the determinant at the identity matrix.
This coefficient has a direct visual meaning. At the point , the linear map has component along direction . In a small step , these are the first-order changes of the square's or box's sides in their own directions. Summing them gives its fractional area or volume change; the off-diagonal entries initially change shape rather than contributing to this first-order total.
For the constant-coefficient linear system of differential equations , the exact linear flow is , using the matrix exponential. Its volume factor is
This is the matrix exponential determinant identity. One can derive it without diagonalization: set , whose matrix inverse is , and use in Jacobi's formula to get . The scalar differential equation with initial value one gives the displayed exponential function. Thus positive trace causes volume expansion, negative trace causes contraction, and zero trace preserves volume, even when individual directions behave differently.
In two dimensions, compare four generators at :
The first and third diagonal matrices expand or contract both directions. The second expands horizontally and contracts vertically by reciprocal factors, making a rectangle of unchanged area. For the last nilpotent matrix, , so its matrix exponential is exactly ; it sends to , a shear mapping. Zero trace allows substantial shape change and does not mean the flow map is stationary.
Figure 1.
Four examples of a linear system of differential equations: trace controls area change while a saddle and a shear mapping preserve area
. Details.
The first-order statement and the exact flow map should be distinguished. For , , whereas for all real . Zero trace eliminates the first-order change in the approximate step, and it preserves volume exactly in the matrix exponential flow. The examples use an abstract parameter and coordinate vectors; no physical units are assumed.
For , the off-diagonal equations in are . Thus either or the trace is one. The condition alone is not sufficient: has trace one but is not an idempotent matrix. For a two-by-two matrix of trace one, idempotence is equivalent to zero determinant, by the Cayley-Hamilton theorem.
Trace of an idempotent equals its rank Created 2026-10-20 Updated 2026-10-25
For a finite-dimensional real or complex linear projection , every vector splits as in the image of a linear map and the kernel of a linear map, respectively. Their intersection is zero, so a basis adapted to this direct sum represents as . Its trace and rank both equal . In particular, a projection's determinant is zero unless it is the identity. Hermiticity is unnecessary for this algebraic identity; a Hermitian matrix projection is additionally orthogonal.
For a real-frequency lossless reciprocal periodic line, a cell transfer matrix has determinant one. If half its trace lies outside , the Bloch multipliers are real reciprocal numbers rather than unit-modulus propagation factors. The physical interior field decays and carries no net power to infinity. A real reference line is then totally reflected by a semi-infinite structure; a finite structure can still tunnel.
Trefoil knot Created 2026-09-28 Updated 2026-10-14
The trefoil is the torus knot . It is the simplest nontrivial knot by crossing number of a knot: . A standard three-crossing alternating knot diagram is reduced, so the Tait crossing-number theorem establishes minimality. The four-crossing knot diagram shown below also represents the trefoil knot, illustrating that a particular projection need not achieve that minimum. Its Seifert genus is one.
Here is a small algebraic certificate that a trefoil knot cannot be deformed into an unknot. One Seifert matrix for a trefoil knot is
Taking the determinant gives the Alexander polynomial of a knot
where allows multiplication by a Laurent unit in the Laurent polynomial ring. No such multiplication turns this three-term Alexander polynomial of a knot into the unknot's value . Since the Alexander polynomial of a knot is a knot invariant, this computation rules out every possible ambient isotopy between the two knots; it does not merely rule out the deformations we happened to try.
The knot group supplies another certificate. The presentation maps onto the symmetric group by and , since both sides of the relation map to the identity. These images generate a non-abelian group, so the knot group cannot be the unknot's infinite cyclic group. However, a trefoil knot and its mirror of a link have isomorphic knot groups: the abstract knot group alone does not distinguish all knots.
Add diffusivities to the basally forced quadratic activator-inhibitor model. A Fourier mode with has matrix and determinant . When , its trace is negative for every . A positive-growth mode therefore occurs precisely when for some positive . The parabola has a positive minimizer only if , and its minimum is negative exactly when . Thus the ordinary Turing instability requires , and . At onset, and the critical wavelength is . A bounded spatial domain further requires an allowed mode inside the unstable band.
In cylindrical orthonormal bases the deformation gradient is and has unit determinant. One principal stretch is ; the squares of the other two are the roots of . The reference-volume energy per height is . Virtual work gives end torque and inner pressure at fixed reference radii and height.