KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesOperations on Subspaces and ModulesEngineering · Engineering MathematicsLesson 736/884← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Joginsubspace operationsmodulequotientsum
On this page

Ask about this page

KEVOS AIOperations on Subspaces and Modules

KEVOS knowledge first · trusted web sources when needed

Linear Algebra Algorithms

Operations on Subspaces and Modules

Sum, intersection and quotient of subspaces, and how the analogous operations on modules over the integers require normal forms.

Engineering / MathematicsLinear Algebra Algorithms2 min readKV-MATH-0535

Sums, intersections and quotients are the everyday operations on subspaces. Over a field they are elimination problems. Over the integers the same operations describe modules, and the answers require normal forms rather than echelon forms.

Over a field

Subspace operations over a field
OperationMethodCost
SumConcatenate bases and reduceOne elimination
IntersectionKernel of the stacked systemOne elimination
QuotientSupplement the subspace; quotient coordinates are the supplement coordinatesOne elimination
MembershipSolve a linear systemOne elimination

Over the integers

A finitely generated subgroup of a free abelian group is again free, but a spanning set is not a basis and the distinction matters. The Hermite normal form provides a canonical basis, which is what makes the operations well defined.

Sum of modules
Concatenate generating sets and compute the Hermite normal form. The result is a canonical basis of the sum.
Intersection
Computed as a kernel, then normalised. More expensive than the sum because it needs a kernel computation over the integers.
Quotient
The Smith normal form of the inclusion matrix gives the invariant factors, hence the structure of the quotient group.
Index
The determinant of the transition matrix, when both modules have the same rank.

Key point

The quotient of two free modules of the same rank is finite, and its structure is exactly the invariant factor decomposition from the Smith normal form. This single fact underlies class group structure computation — see recovering group structure.

Modules with denominators

Ideals of a number field are frequently represented as an integer matrix divided by a common denominator. Operations then proceed on the numerator matrices with denominators tracked separately and cleared to a common value before combining.

Pitfall

Failing to reduce the denominator to lowest terms after each operation causes it to grow without bound. The reduction requires a content computation across the whole matrix, which is cheap but easy to forget.

Canonical forms matter

Note

Equality testing for modules requires a canonical form. Two different generating sets of the same module are not comparable entrywise; reducing both to Hermite normal form makes them identical. Any code that tests module equality without normalising is wrong.

The representation used throughout the number field streams is described in module representation by Hermite normal form.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 2.3.3-2.3.4. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.

Related pages

  • Z-Modules and Integer Matrix Problems
  • Module Representation by Hermite Normal Form
  • Inverse Image and Supplementation of Subspaces

Continue learning

Inverse Image and Supplementation of SubspacesArticle · Engineering MathematicsNEXT LESSON →Z-Modules and Integer Matrix ProblemsArticle · Engineering MathematicsKernel and Image of a General MatrixArticle · Engineering MathematicsThe Hermite Normal Form AlgorithmArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®