liveBook · Manning

Cofactor transposition

As explained in Geometry for Programmers

Cofactor transposition is the construction of a transposed cofactor matrix that represents a matrix inverse up to multiplication by the determinant.

Cofactor transposition constructs the transpose of a matrix’s cofactor matrix. It represents the inverse up to scalar multiplication, avoiding explicit determinant division. section 4.3.2

For projective transformations, this is sufficient: homogeneous coordinates treat nonzero scalar multiples as the same point. Divide by the final coordinate only when normalized tuples ending in 1 are required. section 4.3.2

Undoing a composed rectangle transformation

A composed 3×3 transformation moves a rectangle’s corners. SymPy’s ordinary inverse restores the original coordinates; the cofactor-transposed matrix returns their negatives, which are equivalent homogeneous coordinates after rescaling.

How Geometry for Programmers covers it

How deep it goes
Defines the cofactor construction and demonstrates implementation, but does not develop determinant theory.
Examples
Demonstrates a composed 3×3 transformation applied to a rectangle’s four homogeneous corner coordinates.
What it assumes
Assumes matrix transformations and homogeneous coordinates, while treating determinant theory as optional background.
What you can do after
Build it from scratch with minors, cofactors, transposition, and homogeneous-coordinate rescaling.
How it connects
Connects matrix inversion, determinants, projective transformations, homogeneous coordinates, and matrix multiplication.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Geometry for Programmers. The section links point to the parts of the book it draws on.