liveBook · Manning

Inverse

An inverse is a value or operation that reverses the effect of another value or operation under a specified composition rule.

How 2 Manning books explain it

Geometry for Programmers

An inverse transformation is a mapping that reverses another transformation by recovering each original point from its transformed point.

How it is used
Reverses composed projective transformations to recover original geometric points efficiently.
How deep it goes
Works through matrix-based recovery of rectangle corners and notes faster projective alternatives, without deriving a general inverse algorithm.
Examples
Uses a rectangle rotated about its center and restored with a SymPy inverse matrix.
What you can do after
Apply it via SymPy matrix inversion to restore points after a composed projective transformation.

Read how Geometry for Programmers explains inverse →

Elliptic Curve Cryptography for Developers

An inverse is a polynomial that multiplies with another polynomial to produce the multiplicative identity modulo a specified irreducible polynomial.

How it is used
Supports division and elliptic-curve calculations over extension fields.
How deep it goes
Derives the extended-Euclidean invariant and translates initialization, normalization, updates, termination, and cleanup into C.
Examples
Uses clock-style modular arithmetic and the irreducible polynomial x² + x + 3 modulo 43 as concrete finite-field examples.
What you can do after
Build it from scratch as a polynomial-inversion routine and reuse it to implement division modulo a prime polynomial.

Read how Elliptic Curve Cryptography for Developers explains inverse →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.