Cayley Transform

A fractional-linear transformation that maps suitable skew-adjoint or Lie-algebra elements to orthogonal/unitary group elements—and, in a scalar form, maps a line or half-plane to a circle—while excluding points where the denominator is singular.

Version

v3 · 2026-09-19 · History

Domain-specific #

1445

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomain

Matrix Analysis and Lie Groups → Mathematics

Aliases

Cayley map, Cayley transformation

Core Idea

For a matrix or operator A where I-A is invertible, one common Cayley transform is C(A)=(I+A)(I-A)^(-1); sign and scale conventions vary. If A is real skew-symmetric, the result is orthogonal and lacks the excluded eigenvalue associated with the denominator convention. Conversely, suitable orthogonal matrices map back to skew-symmetric matrices by the inverse fractional formula.

The same fractional-linear skeleton appears in complex analysis, mapping a line or half-plane to a unit circle or disk, and in operator theory, relating self-adjoint and unitary operators after factors of i. It gives a rational chart between additive infinitesimal/generator data and multiplicative group data.

How would you explain it like I'm…

Line-to-Circle Recipe

The Cayley transform is a math recipe that can bend an endless straight line into a circle. Every spot on the line lands somewhere on the circle, but one spot of the circle is left over that nothing lands on. Mathematicians use the same recipe to turn 'how to start turning' into 'how far you've turned.'

The Fraction That Makes Rotations

The Cayley transform is a math formula that turns one kind of object into another using a fraction: something like (1 + A) divided by (1 − A). In one version, it takes points on a straight line and places them onto a circle, one point on the line for each point on the circle, except that one point of the circle gets left out. In another version, it turns special matrices that describe 'turning a little bit' into matrices that describe complete rotations, and you can go back again. The formula only works when the bottom part isn't zero, so there's always something left out at the edge. Different books write the formula slightly differently, so you have to check which version is being used.

Fractional-Linear Chart

For a matrix A where I − A is invertible, one common Cayley transform is C(A) = (I + A)(I − A)^(−1), though sign and scale conventions vary. If A is real skew-symmetric (Aᵀ = −A), then C(A) is orthogonal, and it avoids one particular eigenvalue tied to the denominator convention. Going backward, suitable orthogonal matrices map back to skew-symmetric ones by the inverse formula. The same fraction-shaped formula shows up in complex analysis, where it maps a line or half-plane to the unit circle or disk, and in operator theory, where (with factors of i) it links self-adjoint and unitary operators. It is not defined everywhere: where the denominator is singular, the transform doesn't exist, so conventions must be stated before comparing formulas.

 

The Cayley transform is a fractional-linear map; one common matrix form is C(A) = (I + A)(I − A)^(−1), requiring I − A invertible, with sign and scale conventions varying by author. For real skew-symmetric A, C(A) is orthogonal and lacks the eigenvalue excluded by the denominator convention; conversely, orthogonal matrices without that eigenvalue map back to skew-symmetric matrices via the inverse fractional formula. The same skeleton appears in complex analysis, sending a line or half-plane to the unit circle or disk, and in operator theory, relating self-adjoint and unitary operators once factors of i are inserted. Conceptually, it provides a rational chart between additive generator data, such as a Lie algebra, and multiplicative group data. It is not global: singular denominators and excluded eigenvalues mark the boundary the chart misses, and identities can only be compared after conventions are fixed.

Scope of Application

The transform is literal in Lie groups, matrix analysis, operator theory, complex analysis, numerical integration, and control.

• Orthogonal/unitary parametrization. Converting skew generators into group elements.
• Lie-group computation. Providing a rational retraction or local chart.
• Complex analysis. Mapping half-planes and disks/circles.
• Operator theory. Relating self-adjoint and unitary spectral problems.
• Structure-preserving integration. Approximating flows while retaining group constraints.
• Control theory. Converting continuous- and discrete-time stability regions under suitable conventions.
• Optimization. Updating constrained matrices through a rational map.

Clarity

Write the exact convention, multiplication order, scalar field, source and target classes, inverse formula, invertibility condition, and excluded spectrum. Verify orthogonality/unitarity algebraically. In numerical use, report conditioning near the singular set and distinguish exact structure preservation from approximation order.

Declare the domain, codomain, sign and scale convention, multiplication order, and excluded spectrum. Matrix formulas that coincide for a matrix and its own polynomials can diverge in broader operator settings, so the chosen left or right fractional form should be explicit.

Manages Complexity

A rational expression converts constraint-heavy group elements into unconstrained or simpler generator coordinates and preserves structure without computing a full exponential. The chart is computationally convenient and invertible locally. It becomes ill-conditioned near its excluded boundary and can hide convention mismatches across fields.

Lie-algebra elements live in a linear tangent space while Lie-group elements satisfy nonlinear orthogonality or unitarity constraints.

Abstract Reasoning

1. Choose source/target structures and convention.
2. Check the denominator's spectrum and invertibility.
3. Form the affine numerator and denominator.
4. Apply the fractional transformation in the correct order.
5. Prove membership in the target class.
6. Use the inverse away from the excluded set.
7. Analyze conditioning and approximation error if numerical.
8. Switch charts or methods near singularity.
9. Verification proceeds by treating the numerator and denominator as linked polynomials in the same operator.

Knowledge Transfer

The Cayley transform specializes transformation and remapping: a fractional-linear chart trades one representation for another while preserving structure. Transformation is the strict parent; skew matrices, group constraints, and spectral exclusions keep the identity mathematical.

Transformation is the strict parent because the Cayley map converts objects between domains while preserving a specified structural relationship and provides an inverse off excluded loci. The transferable pattern is fractional-linear map + excluded pole → convert a linear or unbounded model into a constrained or bounded one.

Relationships to Other Abstractions

Current abstraction Cayley Transform Domain-specific

Parents (1) — outgoing typed relations

• Cayley Transform is a kind of Transformation Prime

  Transformation is the strict parent because the Cayley map converts an object between representations through an invertible rule on a declared domain.

Hierarchy path (1) — routes to 1 parentless root

• Cayley Transform → is a kind of Transformation → is a kind of, typical Function (Mapping)

Neighborhood in Abstraction Space

Cayley Transform sits in a sparse region of the domain-specific corpus (94^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

• Functional Calculus — 0.78
• Semilinear map — 0.77
• Von Neumann's Closed-Operator Theorem — 0.77
• Kernel — 0.77
• Determinant — 0.77

Computed from structural-signature embeddings · 2026-10-25