Averaging formulas for the Reidemeister trace, Lefschetz and Nielsen numbers of nn-valued maps

This paper establishes averaging formulas for the Reidemeister trace, Lefschetz, and Nielsen numbers of nn-valued maps on closed manifolds by expressing them through single-valued maps on finite orientable covering spaces, with explicit results derived for infra-nilmanifolds.

Karel Dekimpe, Lore De Weerdt

Published 2026-03-05
📖 5 min read🧠 Deep dive

Imagine you are standing in a room with a magical, multi-headed mirror. When you look into it, you don't just see one reflection of yourself; you see nn different reflections scattered around the room. In mathematics, this is called an nn-valued map. Instead of pointing to a single spot, the map points to a set of spots.

The big question mathematicians ask about these mirrors is: "Do any of these reflections actually land on top of the real you?" In other words, is there a point xx such that xx is one of the nn spots the map points to?

This paper by Karel Dekimpe and Lore De Weerdt is a guidebook on how to count these "self-touching" points (fixed points) and understand the geometry of these multi-headed mirrors, specifically for complex shapes like donuts, Klein bottles, and higher-dimensional versions of them.

Here is the breakdown of their discovery using simple analogies.

1. The Problem: The "Too Complicated" Mirror

In the old days, mathematicians studied mirrors that showed only one reflection (single-valued maps). They had a perfect toolkit to count how many times the reflection touched the real person. They used something called the Lefschetz number (a quick count) and the Nielsen number (a more precise count of distinct groups of touches).

But when you have nn reflections, the old tools break.

  • The Issue: You can't just look at the whole mirror and say, "Okay, let's lift this up to a bigger room to see it clearly." In the single-reflection world, you could always zoom out to a "universal cover" (a bigger, simpler version of the room) to do the math.
  • The Failure: With nn reflections, the reflections might get tangled up in a way that prevents you from zooming out cleanly. The "lift" doesn't work anymore. It's like trying to untangle a knot of nn strings by pulling on just one end; the whole thing just gets messier.

2. The Solution: The "Split" Strategy

The authors' brilliant idea is to stop trying to handle the nn reflections as one giant, messy blob. Instead, they split the problem.

Imagine your multi-headed mirror is actually just nn separate, single-headed mirrors glued together, but they are dancing in a synchronized routine.

  • The Trick: They prove that even though the nn reflections are linked, you can analyze them by looking at coincidences between single reflections and the "floor" of the room.
  • The Analogy: Instead of asking, "Does the multi-headed monster touch me?", they ask, "Does reflection #1 touch me? Does reflection #2 touch me? Does reflection #3 touch me?"
  • They then use a technique called Averaging. Imagine you have a blurry photo of a crowd. Instead of trying to count everyone in the blur, you take many clear, zoomed-in snapshots of small groups, count them, and then average the results to get the total.

3. The "Averaging Formula"

This is the core of the paper. They derived a formula that says:

The total number of fixed points for the nn-valued map = The average of the fixed points of all the "lifted" single maps.

Think of it like this:

  • You have a complex machine with nn gears turning.
  • You can't easily count the total rotations of the whole machine.
  • But, if you take the machine apart, look at each gear individually while it's spinning on a different, simpler track (a "covering space"), count the rotations there, and then take the average of all those counts... you get the exact answer for the whole machine.

This formula works for three different types of "counts":

  1. The Lefschetz Number: A quick algebraic sum (like a rough estimate).
  2. The Nielsen Number: A precise count of distinct groups of fixed points (the "real" answer).
  3. The Reidemeister Trace: A detailed map showing exactly where and how these points are connected (the "blueprint").

4. The Special Case: The "Infra-Nilmanifold"

The paper gets even more practical when applied to a specific type of shape called an infra-nilmanifold.

  • What is it? Think of a flat torus (a donut) or a Klein bottle (a bottle with no inside or outside). These are shapes that are "flat" but loop back on themselves.
  • Why is it special? For these shapes, the "splitting" trick works perfectly every time. The authors show that for these shapes, you don't just get a vague estimate; you get an exact, calculable formula.
  • The Result: You can plug in some numbers (matrices representing how the map stretches and twists the space) and immediately calculate the exact number of fixed points without having to do any complex geometry.

5. Why Does This Matter?

Before this paper, if you had a map with 3 or 4 reflections on a complex shape, you were stuck. You couldn't use the old formulas, and you couldn't easily compute the answer.

This paper provides a universal translator. It translates the hard problem of "multi-valued maps" into the easy problem of "single-valued coincidences."

  • For Mathematicians: It opens the door to solving fixed-point problems for complex systems (like fluid dynamics or network flows) where multiple outcomes are possible at once.
  • For the Rest of Us: It's a reminder that when a problem seems too tangled to solve as a whole, sometimes the best way forward is to break it into smaller, simpler pieces, solve those, and then average the results.

In a nutshell: The authors found a way to count the "ghosts" in a multi-reflection mirror by breaking the mirror into pieces, counting the ghosts in each piece on a simpler stage, and then averaging the counts to get the truth.