🔢 mathematics

A constructive proof of Orzech's theorem

This paper provides a constructive proof of Orzech's 1971 theorem, which states that any endomorphism of a finitely generated module over a commutative ring with unity that maps a submodule into the module itself must be an isomorphism, by utilizing the Cayley–Hamilton theorem.

Original authors: Darij Grinberg

Published 2026-04-16

📖 5 min read🧠 Deep dive

CC0 1.0

Original authors: Darij Grinberg

Original paper dedicated to the public domain under CC0 1.0 (http://creativecommons.org/publicdomain/zero/1.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are running a factory (the Ring $A$ ) that produces various products. These products are stored in a massive warehouse called Module $M$ . This warehouse is "finitely generated," which is a fancy way of saying it's built from a specific, limited set of blueprints or building blocks. You don't need an infinite library of instructions; just a handful of core designs can create everything in the warehouse.

Now, imagine you have a special machine, let's call it Machine $f$ . This machine takes items from a smaller section of the warehouse (Submodule $N$ ) and processes them, sending the results back into the main warehouse ( $M$ ).

The Big Question

The paper tackles a puzzle posed by a mathematician named Morris Orzech in 1971. The puzzle is this:

If Machine $f$ is surjective (meaning it manages to produce every single item in the main warehouse $M$ using only the parts from the smaller section $N$ ), does that automatically mean the machine is reversible? In other words, is it an isomorphism?

In plain English: If you can make a perfect copy of the whole warehouse using only a subset of the parts, did you accidentally throw anything away? Or did you just rearrange things perfectly?

Orzech proved that yes, you didn't throw anything away. If the machine covers the whole warehouse, it must be a perfect one-to-one match. It's a "perfect shuffle."

The Old Way vs. The New Way

Before this paper, proving this fact was like trying to solve a maze by assuming the maze has a "perfect" structure (Noetherian property) that doesn't always exist. It was a bit like saying, "If we assume the universe is perfectly ordered, then the answer is yes." This is a non-constructive proof; it tells you the answer is "yes," but it doesn't show you how to find the solution or how to reverse the machine step-by-step.

Darij Grinberg, the author of this paper, wanted a constructive proof. He wanted to show exactly how to reverse the machine using only the tools available in the warehouse, without making any magical assumptions about the universe's order.

The Magic Tool: The Cayley-Hamilton Theorem

To do this, Grinberg uses a mathematical "magic wand" called the Cayley-Hamilton Theorem.

Think of any machine (or matrix) as a complex gear system. The Cayley-Hamilton theorem says that every gear system has a secret "self-destruct code" (a specific polynomial equation) that, if you run the machine through it, makes the whole thing stop moving (become zero).

The Analogy:
Imagine you have a robot arm (the map $g$ ) moving parts around. The theorem says there is a specific sequence of commands (like "move forward, turn left, stop") that, if you repeat them in a specific pattern, forces the robot arm to return to its starting position or cancel itself out.

How the Proof Works (The Story)

The Setup: We have a surjective map $f$ from a smaller box $N$ to the big box $M$ . We want to prove $f$ doesn't crush any items (it's injective).
The Trick: Grinberg constructs a "shadow machine" (a linear map $g$ ) that works inside a grid of numbers ( $A^n$ ). This shadow machine is designed to mimic the behavior of our factory machine $f$ .
The "Self-Canceling" Move: Using the Cayley-Hamilton theorem, Grinberg finds a special combination of moves for this shadow machine. He proves that if you apply this combination, the machine essentially says, "I can't create anything new; I can only rearrange what's already there."
The "Trap": He shows that if there were any "lost" items (items in the kernel, meaning things that got crushed into nothingness), this special combination of moves would force those lost items to be zero.
The Conclusion: Since the only way for the machine to satisfy the "self-canceling" rule is if no items were crushed, the machine must be a perfect, one-to-one match.

Why This Matters

The "constructive" part is the key. It's the difference between a chef saying, "This soup is delicious because magic," and a chef saying, "This soup is delicious because I added exactly 3 grams of salt and 2 minutes of heat."

Grinberg's proof doesn't just say "It works." It gives you the recipe. It shows that if you have a surjective map on a finitely generated module, you can algorithmically find the inverse. You don't need to assume the universe is perfect; you just need to follow the steps provided by the Cayley-Hamilton theorem.

The Takeaway

Orzech's Theorem is like a guarantee for your factory: If you can build the entire warehouse using only a subset of your parts, you haven't lost a single part in the process. You've just organized them perfectly.

Grinberg's Paper is the instruction manual that proves this guarantee works in the real world, using a specific, step-by-step method (Cayley-Hamilton) rather than a magical assumption. It turns a mysterious mathematical fact into a practical, solvable puzzle.

Based on the provided paper "A constructive proof of Orzech's theorem" by Darij Grinberg, here is a detailed technical summary.

1. Problem Statement

The paper addresses Orzech's Theorem (1971), a result in commutative algebra concerning finitely generated modules over commutative rings.

Theorem 0.1: Let $A$ be a commutative ring with unity, and $M$ a finitely generated $A$ -module. If $N$ is a submodule of $M$ and $f: N \to M$ is a surjective $A$ -module homomorphism, then $f$ is an isomorphism.
Context: This generalizes the well-known Vasconcelos' Corollary (Corollary 0.2), which states that a surjective endomorphism of a finitely generated module is an isomorphism.
The Gap: Orzech's original proof relied on reducing the problem to the case where the ring $A$ is Noetherian. This reduction is non-constructive (it relies on existence arguments that do not provide an algorithm to find the inverse or verify injectivity directly). The goal of this paper is to provide a constructive proof that works within the framework of constructive mathematics, avoiding non-constructive principles like the Axiom of Choice or the Law of Excluded Middle where possible.

2. Methodology

Grinberg's approach is entirely algebraic and relies on the Cayley–Hamilton theorem adapted for commutative rings. The proof strategy proceeds through a series of lemmas:

A. Foundational Tools

Cayley–Hamilton Theorem (Theorem 0.3): For any $n \times n$ matrix $M$ over a commutative ring $A$ , the characteristic polynomial $\chi_M(X) = \det(X \cdot I_n - M)$ satisfies $\chi_M(M) = 0$ .
Corollary 0.4: A direct consequence of Cayley–Hamilton. It states that for any matrix $M$ , there exists a monic polynomial relation $c_0 I + c_1 M + \dots + c_n M^n = 0$ where $c_n = 1$ . This provides a specific linear dependence among powers of $M$ .

B. Key Lemma: Invariant Submodules (Lemma 0.5)

Statement: Let $g: A^n \to A^n$ be an $A$ -linear map and $V$ a submodule of $A^n$ such that $g^{-1}(V) \subseteq V$ . Then, $g(V) \subseteq V$ .
Proof Technique: This is the core constructive engine.
1. Represent $g$ by a matrix $M$ .
2. Use the polynomial relation from Corollary 0.4: $\sum_{k=0}^n c_k M^k = 0$ with $c_n=1$ .
3. Perform an induction on the index $u$ to show that specific truncated sums of the polynomial applied to $V$ remain within $V$ .
4. Specifically, the proof manipulates the equation $\sum c_k M^k = 0$ to isolate terms, showing that if $g^{-1}(V) \subseteq V$ , then the action of $g$ on $V$ must also land in $V$ . This avoids non-constructive set-theoretic arguments.

C. Intermediate Result: Finitely Generated Submodules (Lemma 0.6)

Statement: If $N$ is a finitely generated submodule of $M$ and $f: N \to M$ is surjective, then $f$ is an isomorphism.
Proof Technique:
1. Since $N$ is finitely generated, there exists a surjection $p: A^n \to N$ .
2. The composition $f \circ p: A^n \to M$ is surjective.
3. Construct a map $g: A^n \to A^n$ such that $f \circ p \circ g = p$ . This is done by lifting the basis elements of $A^n$ through the surjection $f \circ p$ .
4. Define $V = \ker(f \circ p)$ . The construction ensures $g^{-1}(V) \subseteq V$ .
5. Apply Lemma 0.5 to deduce $g(V) \subseteq V$ .
6. Show that for any $w \in \ker(f)$ , $w$ must be 0 by tracing it through the maps and using the injectivity derived from the kernel properties.

D. Final Proof of Theorem 0.1

Strategy: The theorem assumes $M$ is finitely generated, but $N$ (the domain) is not necessarily finitely generated.
Reduction:
1. Let $v \in \ker(f)$ . The goal is to show $v=0$ .
2. Construct a new submodule $N' = Av + \sum A g_i$ , where $g_i$ are pre-images of the generators of $M$ under $f$ .
3. $N'$ is finitely generated (by $v$ and the $g_i$ 's) and is a submodule of $N$ .
4. The restriction $f|_{N'}: N' \to M$ is surjective because its image contains the generators of $M$ .
5. Apply Lemma 0.6 to $N'$ and $f|_{N'}$ . This implies $f|_{N'}$ is an isomorphism, hence injective.
6. Since $v \in N'$ and $f(v)=0$ , injectivity implies $v=0$ .
7. Thus, $\ker(f) = 0$ , proving $f$ is an isomorphism.

3. Key Contributions

Constructive Validity: The primary contribution is transforming Orzech's theorem from a non-constructive existence proof into a constructive one. The proof explicitly constructs the necessary algebraic relations (via the Cayley–Hamilton polynomial) to prove injectivity without assuming the ring is Noetherian or using non-constructive logic.
Lemma 0.5 (Invariant Submodules): The proof of Lemma 0.5 is a novel technical contribution. It demonstrates how the Cayley–Hamilton theorem can be used to prove that a linear map preserves a submodule if it preserves the "pre-image" of that submodule, a result of independent interest in linear algebra over rings.
Unified Approach: The paper provides a self-contained proof that handles the general case (submodule to module) by reducing it to the finitely generated case, which is then solved using matrix algebra.

4. Results

Theorem 0.1 is Constructively Proven: It is established that any surjective homomorphism from a submodule $N$ to a finitely generated module $M$ is an isomorphism.
Corollary 0.2 (Vasconcelos) is Constructively Proven: As a direct consequence, any surjective endomorphism of a finitely generated module is an isomorphism.
Algorithmic Nature: The proof implies that if one can compute the characteristic polynomial of the relevant matrix (which is constructive), one can algorithmically verify the injectivity of the map.

5. Significance

Foundational Mathematics: In constructive mathematics (e.g., Intuitionistic logic), many classical theorems in commutative algebra fail or require different formulations. This paper demonstrates that a significant structural theorem about modules holds constructively, reinforcing the robustness of the Cayley–Hamilton theorem in this context.
Removal of Noetherian Assumption: By avoiding the reduction to Noetherian rings, the proof applies to a broader class of rings (including non-Noetherian ones) without relying on existence axioms that are invalid in constructive settings.
Future Directions: The paper concludes by posing open questions regarding the constructive validity of the multiplicative version (for algebras) and whether an analogous theorem exists for $A$ -algebras, suggesting a path for further research in constructive commutative algebra.

In summary, Darij Grinberg provides a rigorous, self-contained, and constructive verification of Orzech's theorem, utilizing the Cayley–Hamilton theorem to establish a critical lemma about invariant submodules, thereby resolving a long-standing gap in constructive algebra.