🔢 mathematics

Compositions of $n$ -homomorphisms

This paper generalizes Khudaverdian–Voronov $n$ -homomorphisms to maps between arbitrary rings and commutative rings, proving via combinatorial methods that the sum of an $n$ -homomorphism and an $m$ -homomorphism yields an $(n+m)$ -homomorphism, while their composition results in an $nm$-homomorphism.

Original authors: Darij Grinberg

Published 2026-04-16

📖 6 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 a master chef running a massive kitchen. In this kitchen, rings are like different types of ingredient bins (some are messy, some are organized), and maps are the recipes or rules you use to turn ingredients from one bin into a dish in another.

Usually, a "homomorphism" is a perfect recipe: if you mix ingredients A and B first, then cook them, it tastes exactly the same as if you cooked them separately and then mixed the results. It's a perfect, 1-to-1 translation of flavor.

But sometimes, you don't have a perfect recipe. You have a "good enough" one that works for small batches but gets messy with large ones. This paper introduces a way to measure exactly how messy a recipe is. Let's call this the "Messiness Score" (or mathematically, an n-homomorphism).

Score 1: A perfect recipe (a standard homomorphism).
Score 2: A recipe that works fine for pairs of ingredients but fails when you try three.
Score n: A recipe that works perfectly for groups up to size n, but if you try to cook a group of size n+1, the flavor completely collapses (mathematically, it becomes zero).

The author, Darij Grinberg, is asking two big questions about these "Messy Recipes":

What happens if I add two recipes together?
What happens if I chain two recipes together (cook with Recipe A, then feed the result into Recipe B)?

Here is the simple breakdown of his discoveries, using our kitchen analogy.

1. The "Addition" Rule: Mixing Recipes

The Math: If you have a recipe with a Messiness Score of n and another with a score of m, and you add them together, the new combined recipe has a score of n + m.

The Analogy:
Imagine you have two chefs.

Chef A is great at handling up to 3 ingredients at a time. If you give them 4, they drop the tray. (Score 3).
Chef B is great at handling up to 5 ingredients. If you give them 6, they drop the tray. (Score 5).

If you tell them to work together as a team (adding their efforts), the team is surprisingly robust. They can now handle 8 ingredients! Why? Because the "weakness" of Chef A (failing at 4) and the "weakness" of Chef B (failing at 6) don't happen at the same time. When the group gets too big for Chef A, Chef B is still holding it together, and vice versa. They cover each other's blind spots.

The paper proves that the "failure point" of the sum is simply the sum of the failure points. If you need n+1 ingredients to break Chef A and m+1 to break Chef B, you need n+m+1 ingredients to break the team.

2. The "Chaining" Rule: The Assembly Line

The Math: If you have a recipe with a score of n and you feed its output into a recipe with a score of m, the final result has a score of n × m.

The Analogy:
Imagine an assembly line.

Station A (the first recipe) can process up to 3 items perfectly. If you send 4 items, the station jams. (Score 3).
Station B (the second recipe) can only handle up to 2 items at a time. If you send 3, it jams. (Score 2).

Now, you connect them. Station A feeds into Station B.
How many items can the whole line handle before it crashes?
It turns out the line can handle 3 × 2 = 6 items!

Why?
Think of it like a grid or a puzzle.

Station B can only digest 2 "batches" at a time.
Station A can only produce 3 "batches" at a time before it breaks.
To break the whole system, you need to overwhelm Station B and force Station A to break at the same time.
If you send 6 items, Station A might be struggling (it's at its limit of 3), but Station B is only seeing 2 batches of 3. It's fine.
But if you send 7 items, the math gets tricky. The paper uses a clever combinatorial trick (like shuffling a deck of cards) to show that the "chaos" multiplies. The complexity of the first step multiplies the complexity of the second step.

The Secret Weapon: "The Partition Puzzle"

The paper gets really technical in the middle, but the core idea is a puzzle about grouping.

To prove the "Chaining Rule," the author had to figure out how to break a big group of ingredients into smaller sub-groups. He used a concept called Set Partitions.

Imagine you have a bag of 10 marbles.
You can split them into 1 big group, or 2 groups, or 5 groups, etc.
The paper shows that when you chain two recipes, the "messiness" of the final result is determined by looking at every possible way you could split the ingredients into groups, applying the second recipe to the groups, and then the first recipe to the results.

It's like saying: "To see if the whole machine breaks, we have to check every possible way the parts could be arranged. If any arrangement causes a breakdown, the whole thing fails."

Why Does This Matter?

In the real world of math (and physics), we often deal with things that aren't perfect.

Pseudo-representations: In number theory, we sometimes have "fake" symmetries that look real for small numbers but fail for big ones.
Trace Identities: In matrix math (used in quantum physics and computer graphics), there are rules about how many times you can multiply matrices before the result becomes zero.

This paper gives us a universal rulebook. It tells us exactly how these "imperfect" rules behave when we combine them. It says:

Adding imperfect rules makes them more robust (you can handle bigger groups).
Chaining imperfect rules makes them more fragile (the complexity multiplies).

The "GPT" Twist

The author mentions something funny in the intro: he used an AI (GPT-5.4) to help find the specific formula for the "Chaining Rule" (Theorem 0.11).

The Analogy: The author was like a detective who knew what the answer looked like but couldn't find the specific clue. He asked the AI, "Hey, if I chain these two, what does the formula look like?" The AI guessed the formula correctly, and then the author spent the rest of the paper proving why that guess was right using pure logic and combinatorics.

Summary

n-homomorphism: A rule that works for groups up to size n but fails at n+1.
Sum Rule: Adding two rules adds their limits ( $n + m$ ).
Product Rule: Chaining two rules multiplies their limits ( $n \times m$ ).
The Method: The author uses a massive amount of "counting" (combinatorics) to prove these rules work for any type of ring, even the messy, non-commutative ones.

It's a beautiful piece of math that takes a very abstract, high-level concept and proves that even in a chaotic universe of numbers, there are strict, predictable laws for how "imperfect" things combine.

1. Problem Statement and Context

The paper addresses the algebraic properties of $n$ -homomorphisms, a generalization of ring homomorphisms and pseudocharacters (pseudo-representations).

Background: The concept was originally introduced by Buchstaber and Rees for commutative rings and later studied by Khudaverdian and Voronov. It is closely related to pseudocharacters (introduced by Taylor based on Wiles' work), which generalize the trace of a matrix representation.
The Gap: Previous literature often restricted these definitions to commutative rings or required that $n!$ be invertible (working over $\mathbb{Q}$ -algebras).
The Goal: Grinberg aims to generalize the theory to maps from an arbitrary (possibly non-commutative) ring $A$ to a commutative ring $B$ , without assuming $n!$ $n!$ is invertible. The specific objectives are to prove two fundamental properties:
1. The sum of an $n$ -homomorphism and an $m$ -homomorphism is an $(n+m)$ -homomorphism.
2. The composition of an $n$ -homomorphism and an $m$ -homomorphism is an $nm$-homomorphism.

2. Definitions and Preliminaries

The paper establishes a rigorous combinatorial framework:

Central Maps: A $\mathbb{Z}$ -linear map $f: A \to B$ is central if $f(ab) = f(ba)$ for all $a, b \in A$ .
$n$ -Frobenius Map ( $f_n$ ): For a central map $f$ , the $n$ -Frobenius map $f_n: A^n \to B$ is defined explicitly via a sum over the symmetric group $S_n$ :
$f_n(a_1, \dots, a_n) = \sum_{\sigma \in S_n} (-1)^\sigma \prod_{c \in \text{cycles}(\sigma)} f(\text{product of elements in cycle } c)$
The centrality of $f$ ensures the product within a cycle is well-defined regardless of the starting element.
$n$ -Homomorphism: A central map $f$ $f$ is an $n$ $n$ -homomorphism if $f_{n+1} \equiv 0$ $f_{n + 1} \equiv 0$ (identically zero).
- Examples: $0$-homomorphisms are the zero map; $1$-homomorphisms are non-unital ring homomorphisms; the trace map on $n \times n$ matrices is an $n$ -homomorphism.

3. Methodology

The proofs are entirely combinatorial, avoiding the algebraic geometry or representation theory techniques often used in related fields. Key methodological tools include:

Recursive Definitions: The paper proves the equivalence between the explicit sum-over-permutations definition and a recursive definition involving $f_n$ and $f_{n-1}$ .
Symmetry Arguments: Utilizing the fact that $f_n$ is symmetric in its arguments (Proposition 0.7) and generalizing this to arbitrary finite sets of indices (Proposition 0.8).
Partition Combinatorics: The core of the composition proof relies on the set of partitions $\Pi_J$ of a finite set $J$ .
Induction: The proof of the composition formula uses strong induction on the number of inputs.
AI Assistance: The author notes that a crucial formula for the composition of central maps (Theorem 0.11) was discovered with the help of the LLM GPT-5.4, though the verification and write-up were done manually.

4. Key Contributions and Results

A. The Sum Theorem (Theorem 0.3)

Statement: If $f: A \to B$ is an $n$ -homomorphism and $g: A \to B$ is an $m$ -homomorphism, then $f+g$ is an $(n+m)$ -homomorphism.
Mechanism: The proof utilizes Lemma 0.10, which provides a formula for the $p$ -th Frobenius map of a sum:
$(f+g)_p(a_1, \dots, a_p) = \sum_{U \sqcup V = [p]} f_U(a) \cdot g_V(a)$
where the sum runs over all disjoint decompositions of the index set.
Logic: If $p = n+m+1$ , any partition of the index set into $U$ and $V$ must satisfy $|U| > n$ or $|V| > m$ . Since $f_{n+1}=0$ and $g_{m+1}=0$ , it follows that $f_U=0$ or $g_V=0$ for all terms, making the total sum zero.

B. The Composition Formula (Theorem 0.11)

Statement: For central maps $g: A \to B$ and $f: B \to C$ , let $h = f \circ g$ . The $n$ -Frobenius map of the composition is given by a sum over set partitions:
$h_n(a_1, \dots, a_n) = \sum_{\pi = \{P_1, \dots, P_k\} \in \Pi_{[n]}} f_k(b_{P_1}, \dots, b_{P_k})$
where $b_P = g_{|P|}(\{a_i\}_{i \in P})$ .
Significance: This formula is the technical engine required to prove the composition theorem. It expresses the Frobenius map of a composite function in terms of the Frobenius maps of the components and the partitions of the input indices.

C. The Composition Theorem (Theorem 0.4)

Statement: If $g: A \to B$ is an $m$ -homomorphism and $f: B \to C$ is an $n$ -homomorphism, then $f \circ g$ is an $nm$-homomorphism.
Proof Logic:
1. Apply Theorem 0.11 to $h = f \circ g$ with $N = nm + 1$.
2. Consider any partition $\pi = \{P_1, \dots, P_k\}$ of $[N]$ .
3. Case 1: If the number of blocks $k \ge n+1$ , then $f_k = 0$ (since $f$ is an $n$ -homomorphism).
4. Case 2: If $k \le n$ , then by the Pigeonhole Principle, at least one block $P_j$ must have size $|P_j| > m$ (since $N = nm+1$ and $k \le n$ ).
5. Since $|P_j| > m$ , the term $b_{P_j} = g_{|P_j|}(\dots)$ vanishes because $g$ is an $m$ -homomorphism ( $g_{m+1}=0$ ).
6. Since $f_k$ is multilinear, if any input is zero, the result is zero.
7. Thus, every term in the sum vanishes, proving $h_{nm+1} = 0$ .

5. Significance and Impact

Generality: The results hold for non-commutative domains and do not require the invertibility of factorials, removing a significant barrier in previous literature (e.g., restricting to $\mathbb{Q}$ -algebras).
Unification: The paper clarifies the relationship between $n$ -homomorphisms and pseudocharacters, showing they are essentially the same concept under different names, provided one ignores the invertibility constraints.
Combinatorial Rigor: By relying on pure combinatorics (permutations, partitions, and induction) rather than heavy algebraic machinery, the proofs are self-contained and accessible to researchers in algebra and combinatorics.
Foundation: These theorems provide the necessary algebraic structure to treat $n$ -homomorphisms as a robust class of maps, potentially aiding in the study of non-commutative geometry, representation theory, and the arithmetic of pseudocharacters.

In summary, Grinberg provides a complete, elementary, and general proof that the class of $n$ -homomorphisms is closed under addition (with degree addition) and composition (with degree multiplication), resolving a long-standing question in the field using novel combinatorial arguments.